More on the search for an infiltrator

We have asymptotically solved a discrete search game on an array of n ordered cells with two players: infiltrator (hider) and searcher, when the probability of survival approaches 1. The infiltrator wishes to reach the last cell in finite time, and the searcher has to defend that cell. When the players occupy the same cell, the searcher captures the infiltrator with probability 1 ? z. The payoff to the hider is the probability that the hider reaches the last cell without getting captured. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 1–14, 2002; DOI 10.1002/nav.1047     

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051     

Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted

In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039     

鱼雷攻击占位相关参数计算

讨论了鱼雷攻击占位机动过程中,最小占位速度和最短占位时间的计算问题,采用数值计算分析方法,得出了各种不同敌我初始态势和相对运动速度下对应最短占位时间的占位点的分布规律,推导出最小占位速度和最短占位时间的计算公式。     

舰载直升机兵力使用方案优化建模与仿真

依据舰载直升机兵力使用计划活动的思维机制,分析了计划活动中所涉及的各种主要因素,采用定量与定性分析相结合的方法,建立了兵力使用方案优化的益损值模型,并以舰载直升机反潜作战样式为例,采用软件编程方式实现了该模型,实例表明该方法可为决策者做出科学、有效的决策提供支持。     

高炮火控外弹道实时解算及其应用

建立了某型高炮火控系统的外弹道解算模型,此模型采用迭代-修正的方式,使用Runge-Kutta-Felhberg自适应步长数值解法,直接解4D外弹道方程组,得到射角和弹丸飞行时间.还对该方法的精度和实时性进行了分析,确定了高炮火控系统应用外弹道方程实时解算模型的可能性.     

双基地雷达测向交叉定位算法的误差模型

利用双基地平面关系将空间三维问题降为平面二维处理;在分析影响定位精度因素前提下,采用合理的假定对定位方程泰勒展开,建立测向交叉定位算法的误差分析模型,并证明了测向交叉定位算法的空间位置最小均方差估计是无偏估计,通过仿真算例,可以看出建立的误差模型符合实际情况.     

基于UML的兵力机动辅助决策软件设计

首先简要介绍了UML的建模体系,然后在使用UML对兵力机动辅助决策软件进行功能需求分析的基础上,进行了问题领域分析,建立了软件的静态和动态模型,并将该软件系统的各种要素、事件和活动,分别在时间和空间上进行了描述,方便开发人员之间的交流,为系统的分析、设计、维护及扩展提供了有利的支持,为兵力机动辅助决策软件系统的研制奠定了基础.     

军品能力建设项目后的一种评价方法

由于军品的特殊性,其后评价标准与其他民品项目有所不同,根据军品技改项目的特点结合一般项目后评价内容,确定了军品技改项目后评价指标体系,共分为项目目标评价、项目实施管理评价、项目生产运营评价、项目生产力评价、项目经营效益评价、项目影响评价和项目持续性评价等7部分25个指标小项,并采用层次灰色法建立了军品技改项目后评价模型,为客观科学地进行军品技改项目的后评价提供了依据.     

BP神经网络在效能评估中的样本训练

根据WSEIAC模型建立了地面防空导弹武器系统效能评估的指标体系,并依此模型建立与之对应的三层BP神经网络.简要分析了BP算法的实现过程,利用专家打分法和模糊层次法相结合的方式取得该神经网络应用于地面防空导弹武器系统效能评估时的训练样本,并对此神经网络进行学习训练,直至达到精度要求.经验证,该网络在评价地面防空导弹武器系统效能时减少了评估中的人因影响,使评估结果更为科学.