优序法在舰艇编队导弹攻击效能评估中的应用

导弹攻击是舰艇编队海上行动的主要作战样式,其导弹攻击效能的评估十分重要。首先建立了舰艇编队导弹攻击作战效能评价指标体系,然后介绍了评估舰艇编队导弹攻击效能的一种新方法——优序法,该方法应用简单,既可以处理定性问题,又能处理定量问题。最后给出了应用实例,验证了优序法比较适合于对舰艇编队导弹攻击效能进行评估。通过对舰艇编队导弹攻击效能的评估,可以有效地选用合适的舰艇编队样式。     

舰舰导弹攻击样式选择的决策分析

根据舰舰导弹攻击时使用雷达方式的不同,可将舰舰导弹攻击主要归结为三种样式,即其他兵力引导攻击样式、被动雷达攻击样式和主动雷达发波攻击样式。衡量各个攻击样式优劣主要考虑攻击的隐蔽性、命中率和发挥武器最大射程等三个因素。为此建立舰舰导弹攻击样式选择问题的递阶层次结构模型,从衡量各攻击样式优劣的三个主要因素出发,对模型进行了分析。最后得出了以其他兵力引导攻击为最佳攻击样式的结论。     

舰炮防空战法的可视化技术

舰炮防空是水面舰艇自防御的重要手段之一.文章围绕可视化和虚拟现实技术,分析了舰炮防空战法研究的内容,给出了舰炮防空战法可视化的方法,重点探讨了其中的防空弹道仿真、反舰导弹弹道仿真、海浪水文气象环境仿真、战场焰火和爆炸效果仿真及舰炮防空战法仿真中实时碰撞检测的基本方法和优化技术,提出了解决这些问题的主要方法,并在PC机上进行了实现.最后给出了舰炮防空战法的可视化结果.     

基于集对分析的战场态势分析模型

在防空作战中,战场态势的分析非常重要,它是辅助决策的基础.针对战场态势的问题,以集对分析的同异反联系度和距离测度为基础,构造了战场态势的分析模型,进行了深入探讨.最后,通过实例计算表明了分析模型对于评估战场态势的可行性和有效性.     

深弹武器系统效能分析

针对火箭深弹反潜武器系统的组成及其特点,运用可靠性理论和效能评估理论分析系统的作战效能.利用随机过程理论中的马尔可夫过程理论,采用美国工业武器系统效能咨询委员会(WSEIAC)提出的ADC效能模型,建立了系统的效能评估模型.借助Matlab工具对该效能模型进行了仿真研究,经对仿真结果分析后表明,该模型能较符合实际地反映系统各组成要素性能对系统总体效能的影响,较好地满足系统效能评价的需求,有助于系统装备的研制和战术使用决策.     

空中目标战术意图层次推理框架及实现

以提高对空态势感知能力为目的,着眼于构建以专家系统为特征的目标意图推理决策支持系统,首先根据目标意图的含义从意图、行动和状态三个层次进行了层次表示,并简要分析了实现意图推理的六种途径.根据空中目标的作战使用等领域知识将其意图从属性类型、战术类型、威胁类型和任务类型四个层次进行了分解.基于意图推理输入信息的分布性特征以及意图的层次分解建立了基于判定树的意图层次推理框架以及数据驱动的推理控制机制.该框架为建立空中目标战术意图的推理实现方法提供了重要的依据.     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

Minimizing total completion time in two-processor task systems with prespecified processor allocations

We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998     

Matrix-geometric solution of discrete time MAP/PH/1 priority queue

We use the matrix-geometric method to study the discrete time MAP/PH/1 priority queue with two types of jobs. Both preemptive and non-preemptive cases are considered. We show that the structure of the R matrix obtained by Miller for the Birth-Death system can be extended to our Quasi-Birth-Death case. For both preemptive and non-preemptive cases the distributions of the number of jobs of each type in the system are obtained and their waiting times are obtained for the non-preemptive. For the preemptive case we obtain the waiting time distribution for the high priority job and the distribution of the lower priority job's wait before it becomes the leading job of its priority class. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 23–50, 1998