线导加尾流自导鱼雷保持距离导引法

依据线导加尾流自导鱼雷捕获和跟踪目标尾流的特殊要求,分析了现有导引方法的不足。利用鱼雷位置点与目标方位线之间的几何关系,提出了"保持距离导引法"的概念、建立了线导加尾流自导鱼雷的导引模型,从根本上消除了通过估计目标距离而确定目标方位修正量的困难,并通过仿真计算分析了这种方法的特点及作战应用的可行性。     

城市防空作战中空中目标威胁度估计模型

定性和定量结合,运用层次—效用方法建立城市防空作战中空中目标威胁度估计模型,先用层次分析的方法建立影响目标威胁度的诸指标因素的层次结构模型,然后导出指标因素的效用函数,最后计算出目标威胁度,使复杂的问题条理化,为防空作战指挥员对空情威胁作出正确判断提供科学依据,从而指导我防空部队的作战训练。     

多目标攻击导弹捷联惯导的传递对准

在分析中距复合制导空空导弹捷联惯导传递对准的基础上,提出由机载火控系统根据导弹发射包线计算发出开始捷联惯导传递对准精对准的时刻,导弹惯导提前进行传递精对准的方法。利用此方法可以解决机载武器系统多目标攻击空空导弹传递对准满足连续发射多枚导弹实时性要求的问题。最后,在单目标情况下就开始传递对准时刻包线给出了算例。     

建模仿真主计划及其关键技术

综述了建模仿真主计划 (MSMP)的目的和内容 ,着重阐述该计划中的公共技术框架 ,分析该计划对军事领域内建模仿真活动的影响 ,并对其中某些关键技术问题提出了解决思路或方法     

某型军用飞机外挂物管理系统应用潜力分析

通过对某型军用飞机外挂物管理系统典型部位的分析 ,指出了该系统具有的可以增挂更多数量和种类外挂武器的可能性和可行性。这对于该型飞机的国产化、军械设备加改装及外挂物管理系统在其它飞机上的移植 ,具有重要的意义     

计算机人机交互界面的变化与计算机的发展

讨论人机交互界面性质设定变化对计算机发展的影响问题.认为人与计算机是通过一定界面进行信息交流的,而界面是否友好直接关系到计算机的应用及发展.及时改变人机交互界面的性质是计算机发展的关键.     

BTT控制系统半实物仿真方案 设计及试验结果分析

BTT控制系统半实物仿真试验以BTT试验器为背景,配合BTT控制技术研究可全面验证导弹控制系统设计。给出了半实物仿真试验方案、方法及试验结果分析,试验结果表明BTT控制系统设计满足最小侧滑(近似零侧滑角)倾斜转弯的技术指标要求,半实物仿真试验方法正确。     

火力运用对策空间模型

根据空 -地作战的特点 ,提出了软、硬火力单位的概念 ,根据模型提出了作战指数、生存指数 ,为双方的实力与“保卫目标”的安全度分析提供了数量依据 ;根据微分对策和战术原则提出了规范作战模式等概念 ,为构造火力运用、兵力数量需求等算法搭起一个框架。     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998