空中进攻作战出动计划禁忌搜索优化分析方法

空中进攻作战出动计划涉及多种复杂因素,大规模空中进攻作战出动计划不仅计算量大、出动强度高、架次多,而且当战场形势发生变化时,必须及时对飞机出动计划做出调整,采用手工方式制定和修改作战计划已难以适应未来空中进攻作战的要求。从分析制定空中进攻作战航空兵出动计划所涉及的诸要素出发,提出了一个较为合理的作战出动计划模型,并采用禁忌搜索求解模型的优良解,为实现计算机制定和及时修正空中进攻作战出动计划提出了一种有效的解决方法。     

基于灰熵方法的综合评估

以灰色系统理论中的灰靶技术为基础,在对原靶心度求解公式加以改进,给出了了一种系统效能的评定方法。首先用灰靶理论建立评定方法的数学模型,以能反映武器系统效能的战技性能指标构造各比较方案或模式的指标序列,进而求得各指标序列的标准模式。通过求各比较模式对标准模式的靶心度,并按大小排序,最终确定各比较方案效能的优劣。方法的计算过程为简单的代数运算,且不涉及传统方法中类似人工打分等带有一定主观性因素,所以,就同时满足可操作性和客观性而言,本方法较传统方法为优。     

变结构控制器的仿真模型研究

变结构控制器集中了非线性控制与线性控制的优点,既保证了系统的快速性,又具有良好的跟踪精度。运用控制理论及牛顿运动规律,阐述了变结构控制器的建模机理,重点研究在MATLAB/SIMULINK动态系统仿真环境下,利用已有模块搭建变结构控制器的仿真模型。该仿真模型已被成功地应用于某型自行高炮随动系统的仿真研究中。     

LFM脉冲雷达距离维快速搜索处理算法

针对脉冲雷达近距离目标遮挡问题,从理论上分析了雷达最小作用距离不受限于脉冲宽度.在此基础上,以Chirp脉冲为例,提出了一种适合远近距离全程目标的快速搜索处理算法.该算法只需发射一种宽脉冲波形,而不必根据距离的变化改变脉宽,从而有效缩短了搜索时间,大大提高了搜索效率.仿真结果表明了理论分析的正确性和算法的有效性.     

二维连续型随机变量函数的分布的线积分算法

本文给出用线积分计算二维连续型随机变量(X,Y)函数的概率密度的一般公式。与通常方法相比,具有方法简单、计算量少的优点。     

阶梯形变截面弹性支座连续梁的弯曲计算

本文利用折算载荷法,推导出了阶梯形变截面弹性支座连续梁弯曲计算的基本方程,编写了通用计算机解题程序。     

实时仿真计算机系统的若干问题

本文比较了实时仿真计算机系统中配备A/D、D/A变换器的两种方案。分析了几种检索算法,并且提出了一种新的全并行检索方法——映象检索。文中论述了仿真计算任务的特点及其并行性的开发。本文在分析了AD-10的缺点之后指出,纯异构型仿真专用多处理机的局限性较大,不能充分开发仿真计算任务的并行性。较好的结构形式应是以同构型多处理机为核心。     

Exponential size neighborhoods for makespan minimization scheduling

We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles

Given a number of patrollers that are required to detect an intruder in a channel, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximized the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' sensors are imperfect and that their motions are subject to turn‐rate constraints, and that the intruder travels straight down a channel with constant speed. Using discretization of time and space, we approximate the optimal control problem with a large‐scale nonlinear programming problem which we solve to obtain an approximately stationary solution and a corresponding optimized trajectory for each patroller. In numerical tests for one, two, and three underwater patrollers, an underwater intruder, different trajectory constraints, several intruder speeds and other specific parameter choices, we obtain new insight—not easily obtained using simply geometric calculations—into efficient patrol trajectory design under certain conditions for multiple patrollers in a narrow channel where interaction between the patrollers is unavoidable due to their limited turn rate.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

双变因子LMS自适应滤波算法

为提高最小均方(LMS)自适应滤波算法的性能,在步长因子与误差信号满足一种改进的Sigmoid函数关系式的基础上,提出了一种双变因子控制下的变步长LMS自适应滤波算法。该算法具有初始状态收敛速度快、稳定状态均方误差小、抗噪声性能好、适应系统跃变能力强的优点。计算机仿真结果验证了该算法的优越性。