任意三角域上 C1 有理插值的一种新算法

本文描述了任意三角域上C~1有理插值的一种组合算法,其特点是构造简单,计算方便,插值函数与文[3][4]比较,有着较高的逼近精度。最后给出了插值式的代数精度集和计算实例。     

低分辨雷达的目标特征提取方法

基于现役低分辨警戒雷达 ,研究了进行目标分类和识别的途径 ,提出了基于波形特征和时间谱信息的目标分类和识别方法 ,试验分析了基于目标波形信息的特征 ,得出目标波形信息可用于目标识别的结论。现场试验表明 ,该方法对目标大小分类和架次识别有好的效果。     

Disruption management in production planning

We study the problem of recovering a production plan after a disruption, where the disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no‐show, and others. The new recovery plan we seek after has to not only suit the changed environment brought about by the disruption, but also be close to the initial plan so as not to cause too much customer unsatisfaction or inconvenience for current‐stage and downstream operations. For the general‐cost case, we propose a dynamic programming method for the problem. For the convex‐cost case, a general problem which involves both cost and demand disruptions can be solved by considering the cost disruption first and then the demand disruption. We find that a pure demand disruption is easy to handle; and for a pure cost disruption, we propose a greedy method which is provably efficient. Our computational studies also reveal insights that will be helpful to managing disruptions in production planning. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

On the asymptotic optimality of algorithms for the flow shop problem with release dates

We consider the nonpermutation flow shop problem with release dates, with the objective of minimizing the sum of the weighted completion times on the final machine. Since the problem is NP‐hard, we focus on the analysis of the performance of several approximation algorithms, all of which are related to the classical Weighted Shortest Processing Time Among Available Jobs heuristic. In particular, we perform a probabilistic analysis and prove that two online heuristics and one offline heuristic are asymptotically optimal. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

未来中远距协同空战多目标攻击决策研究

根据先进战斗机的技术特点和未来中远距协同空战发展方向,提出一种基于先敌发现、先敌发射、先敌摧毁能力的空战态势分析模型。同时,采用一种将并行遗传算法与分布估计算法相结合的并行分布遗传算法并将其用于多目标攻击决策。最后利用具体算例进行仿真。结果表明空战态势分析模型能够较为准确地描述未来中远距多机协同空战,采用的算法具有较好的可行性和实时性,为中远距多机协同空战的多目标攻击决策提供了新的思路和方法。     

航迹关联算法仿真中的几个假定

航迹关联是多传感器信息融合的前提和基础,来自不同传感器的航迹数据只有在确定相互关联之后,才能进行目标运动状态信息和属性信息的融合处理。航迹关联仿真分析时往往人为地设定一些假定条件,导致算法的仿真结果出现比较大的偏差。对航迹关联算法仿真分析中的一些常见假定进行分析,结合实际应用情景,探讨航迹关联率的定义,明确了关联正确率、关联错误率和漏关联率的计算方法。     

低信噪比条件下改进ESPRIT方法

在低信噪比时,针对估计信源DOA实时性的问题,提出了一种新的适合于ESPRIT算法的多级维纳滤波器(MSWF)结构,找到了一种能判别信号子空间的方法。首先将多级维纳滤波器(MSWF)与ESPRIT算法相结合,采用多级维纳滤波器(MSWF)的前向递推,得到子空间,不需要通过特征值分解。低信噪比时,针对噪声子空间泄漏到信号子空间的现象,提出一种判别方法,找到了更精确的信号子空间,结合ESPRIT方法实现信号的DOA估计。由于该算法实现了真实的信号子空间的判断,因此,比传统基于MSWF算法具有更高地估计精度。特别是在低信噪比时,增强了算法的实用性,仿真结果证明了算法的有效性。     

基于遗传BP神经网络的装甲装备器材需求预测

装甲装备器材保障具有规模大、时间紧、消耗大、不确定因素多、决策难度大等特点。准确的需求预测是实施主动的、精细化的器材保障的重要前提条件。利用BP神经网络较强自学习能力和自适应能力对器材需求规律进行学习,并借助遗传算法提高BP神经网络的收敛速度,设计了一种基于遗传算法改进的BP神经网络模型预测方法,对装甲装备器材进行需求预测。通过实例计算表明,该方法比单纯BP神经网络方法具有预测精度高、收敛速度快的优点。     

基于静止标量磁强计的运动舰船定位问题的研究

建立了静止标量磁强计对运动舰船定位的模型,并给出了用遗传算法求全局较优解、然后用单纯形法进行精确局部搜索的求解参数的方法.仿真实验表明这种方法有效、可行.     

Averaging frameworks for simulation optimization with applications to simulated annealing

We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012