平行机半在线排序问题研究(Ⅰ)

对半在线平行机排序问题的研究进展作了详细综述和进一步探讨。文章给出半在线排序问题的背景、定义、分类和求解。介绍它们定义和在不同机器环境和目标函数下半在线排序问题分类，以及第一类半在线模型的近似算法的设计及其竞争比分析。     

Urn模型的B网及其应用

Urn模型的离散概率分布被用于构造逼近格式,具有Bernstein多项式的许多特性。本文用B网技术对Urn模型概率分布给出新的解释,指出了Urn模型B网的诸多性质,导出分布函数曲线的导数公式,构造了Urn分布的对偶基及与此相关的拟插值算子。     

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.     

硬X射线光栅微分干涉相衬成像两步相移算法的理论与实验研究

针对硬X射线光栅微分干涉相衬成像在实际应用中对低辐射剂量和快速获取图像的要求, 通过对实验系统的理论分析和参数优化设计, 采用了两步相移算法用于提取物体相位信息. 这种方法可以有效降低X射线对物体的辐射剂量, 大大提高恢复相位信息的速度, 为X射线光栅相衬成像在未来的医疗和工业中的应用奠定基础. 关键词： 光栅干涉 X射线相衬成像 两步相移算法     

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

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