针对旋转和平移的一种电子稳像算法

提出了一种新的基于Fourier-Mellin的电子稳像算法,用于消除由于推扫平台系统姿态不稳所造成的图像抖动。采用Fourier-Mellin算法和相位相关算法求取待稳定图像帧与参考图像帧之间的旋转角度和缩放及平移参数,并通过校正一组抖动的图像帧来验证所提出的算法。实验结果表明算法很好地估计并补偿了旋转和平移运动,能够满足一般要求。     

流编程模型下的存储一致性模型

在流编程模型下建立了一个新的存储一致性模型--流一致性模型,它比传统的释放一致性模型更加松弛.讨论了流一致性模型对程序设计和系统设计的要求,给出了一个正确的系统实现,并且指出流一致性模型的编程和实现并不比现有的一致性模型复杂.     

Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

On the hierarchy of γ‐valid cuts in global optimization

Concavity Cuts play an important role in concave minimization. In Porembski, J Global Optim 15 ( 17 ), 371–404 we extended the concept underlying concavity cuts which led to the development of decomposition cuts. In numerical experiments with pure cutting plane algorithms for concave minimization, decomposition cuts have been shown to be superior to concavity cuts. However, three points remained open. First, how to derive decomposition cuts in the degenerate case. Second, how to ensure dominance of decomposition cuts over concavity cuts. Third, how to ensure the finite convergence of a pure cutting plane algorithm solely by decomposition cuts. These points will be addressed in this paper. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于遗传算法的大型降落伞气动力参数辨识

建立了降落伞回收系统的六自由度动力学及运动模型,针对大型降落伞可观测数据少的特点,设计遗传算法辨识其气动力参数,利用仿真验证了辨识方法的可行性和辨识模型的正确性。结合空投试验录像分析数据,辨识了某型号飞船所采用大型环帆伞的气动力参数,并利用辨识结果对其稳定性进行分析,其结论可作为回收系统设计的理论参考依据。     

An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

A single server is faced with a collection of jobs of varying duration and urgency. Each job has a random lifetime during which it is available for nonpreemptive service. Should a job's lifetime expire before its service begins then it is lost from the system unserved. The goal is to schedule the jobs for service to maximize the expected number served to completion. Two heuristics have been proposed in the literature. One (labeled π^S) operates a static priority among the job classes and works well in a “no premature job loss” limit, whereas the second (π^M) is a myopic heuristic which works well when lifetimes are short. Both can exhibit poor performance for problems at some distance from the regimes for which they were designed. We develop a robustly good heuristic by an approximative approach to the application of a policy improvement step to the asymptotically optimal heuristic π^S, in which we use a fluid model to obtain an approximation for the value function of π^S. The performance of the proposed heuristic is investigated in an extensive numerical study. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

射频发射模块非线性效应的消除方法

射频模块存在相位特性的非线性效应,群延迟随频率的变化不再是一个常数,并可能造成输出射频信号的波形失真,而影响精密射频信号源的输出精度。基于递归最小二乘算法的自适应滤波器,提出了消除其非线性效应的新方法。并以GPS模拟源为例,利用其自校模块,采用软件无线电和数字信号处理技术,精确估计出射频模块的模型参数。将基带合成信号通过一个数字逆滤波器,以消除相位的非线性和群延迟随频率的变化。利用自编的仿真程序包,在Matlab中进行了相应的模拟计算。仿真结果表明,该方法可有效地消除相位非线性效应对射频信号的影响,输出信号的波形失真在理论上可控制在0.01%以内。     

巡航导弹航迹规划中雷达探测盲区的快速构造算法

现代防空系统对巡航导弹的低空飞行和突防造成极大的威胁,利用防空系统中预警雷达的探测盲区进行隐蔽飞行是提高巡航导弹生存能力的重要手段,在此雷达探测盲区的快速构造算法是关键。说明了什么是雷达探测盲区,分析了影响雷达探测盲区的三个主要因素,并就对巡航导弹影响最大的雷达地形遮蔽盲区构造了基于极坐标的快速算法,并用一个地形实例验证了该方法的有效性。     

基于蚁群算法的图像边缘检测研究

将蚁群算法应用于图像分割领域,提出了一种新的基于蚁群算法的图像边缘检测方法。详细阐述了蚁群算法与该方法的基本原理和具体实现过程。为了提高算法效率,进行两处改进,第一将蚂蚁初始位置由随机放置修改为放置在图像边缘附近,可取一图像灰度梯度阈值来实现,第二将信息激素强度和启发式引导函数值均定义为像素点灰度梯度值的函数。大量实验结果证明了该算法能有效地检测出图像边缘,而且具有适应性强、效率高等特点。