On the performance of peeling algorithms

The peeling of a d-dimensional set of points is usually performed with successive calls to a convex hull algorithm; the optimal worst-case convex hull algorithm, known to have an O(n^˙ Log (n)) execution time, may give an O(n^˙n^˙ Log (n)) to peel all the set; an O(n^˙n) convex hull algorithm, m being the number of extremal points, is shown to peel every set with an O(n-n) time, and proved to be optimal; an implementation of this algorithm is given for planar sets and spatial sets, but the latter give only an approximate O(n^˙n) performance.     

空间有理参数多项式曲线的整数级绘制算法

讨论了空间有理曲线中心投影后导数上界的估计，基于曲线各阶差分的递推计算，给出了空间有理参数多项式曲线的快速绘制算法．算法只用到整数的加减法，效率高．     

On affine scaling algorithms for nonconvex quadratic programming

We investigate the use of interior algorithms, especially the affine-scaling algorithm, to solve nonconvex — indefinite or negative definite — quadratic programming (QP) problems. Although the nonconvex QP with a polytope constraint is a hard problem, we show that the problem with an ellipsoidal constraint is easy. When the hard QP is solved by successively solving the easy QP, the sequence of points monotonically converge to a feasible point satisfying both the first and the second order optimality conditions.Research supported in part by NSF Grant DDM-8922636 and the College Summer Grant, College of Business Administration, The University of Iowa.     

Primal-dual proximal point algorithm for linearly constrained convex programming problems

A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs.     

A kind of distortion of mean velocity profile in pipe Poiseuille flow and its stability behaviour

This paper presents a kind of distortion of Hagen-Poiseuille velocity profile in pipe Poiseuille flow. This distortion can be regarded as a general expression of the influence on the mean flow by nonlinear interaction of various components of axisymmetric perturbations. Through the investigation of the stability behaviour of this velocity profile, this paper obtains unstable result induced by axisymmetric perturbations for the first time, and thus presents a new possible approach which leads to instability of Hagen-Poiseuille flow.     

Monitoring of the ducting by a ground-based GPS receiver

In this paper, we describe the estimation of low-altitude refractivity structure from simulation and real ground-based GPS delays. The vertical structure of the refractive environment is modeled using three parameters, i.e., duct height, duct thickness, and duct slope. The refractivity model is implemented with a priori constraints on the duct height, thickness, and strength, which might be derived from soundings or numerical weather-prediction models. A ray propagation model maps the refractivity structure into a replica field. Replica fields are compared with the simulation observed data using a squared-error objective function. A global search for the three environmental parameters is performed using genetic algorithm. The inversion is assessed by comparing the refractivity profiles from the radiosondes to those estimated. This technique could provide near-real-time estimation of ducting effect. The results suggest that ground-based GPS provides significant atmospheric refractivity information, despite certain fundamental limitations of ground-based measurements. Radiosondes typically are launched just a few times daily. Consequently, estimates of temporally and spatially varying refractivity that assimilate GPS delays could substantially improve over-estimates using radiosonde data alone.     

利用数值再现实现彩虹全息色差评价

为了在计算机制彩色彩虹全息图输出之前定量得到再现像的色彩保真度,提出了一种采用数值再现进行色差评价的方法.首先对彩虹全息图进行了频谱分析,得到再现参量与频谱分布之间的关系;然后采用频域滤波算法实现彩色彩虹全息图数值再现,得到再现像的相对功率谱分布;最后采用CIE1976UCS均匀颜色空间对再现像色差情况进行了计算.设计了7个色块并制作了计算机制真彩色彩虹全息图,以金卤射灯作为照明光源进行了光学再现实验,给出实验结果及分析.研究证明了采用数值再现方法实现对计算彩虹全息再现像光谱分布和色差进行计算分析是一种快速经济的方法.     

基于0-1稀疏循环矩阵的测量矩阵分离研究

当前压缩感知中测量矩阵的优化是测量阶段和重构阶段采用同一矩阵的事前优化。采用了以行变换为主的测量矩阵优化算法和过渡矩阵将压缩感知的测量矩阵和重构矩阵相分离,在测量阶段采用单像素相机的0-1稀疏矩阵,在重构阶段采用近似矩阵,这是区别于传统思路的测量数据和测量矩阵的事后优化方法。理论分析和实验结果表明,优化矩阵的性能好于稀疏循环矩阵,近似矩阵和优化矩阵具有相近的性能。研究成果降低了测量矩阵工程设计和实现的难度。     

场景轮廓的动态规划立体匹配算法

立体匹配算法是三维重建的关键步骤。由于实际场景中经常存在大片灰度相近的区域,稠密三维重建存在计算时间长、实时性差的问题。采用了场景的轮廓来重建场景的方法。基于场景中相邻点之间的视差应当是连续的假设,解决了轮廓在匹配时存在的"噪点"的问题,利用动态规划法对轮廓上各个点的视差进行约束以及求解最优解。由于提取轮廓后需要匹配的点数大为减少,用时可减少为原来的10%,得到与场景一致的轮廓视差图。     

多群辐射扩散方程组的分裂迭代算法收敛分析

分析了多群辐射扩散方程组的分裂迭代算法的收敛速度,证明其收敛特性,给出迭代矩阵谱半径的解析公式.对谱半径进行数值计算与分析,揭示算法的收敛速度与辐射系数之间的依赖关系,数值算例验证了理论结果,给出了该算法的适用条件.