坦克射击三维视景实时立体显示研究

通过对人体生理学和计算机图形学的分析,阐述了三维视景实时立体显示的原理,提出了实现方法,并基于 AGC—ProV三维图形卡,对三维视景实时立体显示开发进行了论述.     

分布式操作系统MTA－OS的设计研究

介绍了一个用于空－空多目标攻击数字仿真的分布式操作系统ＭＴＡ－ＯＳ的设计思想、系统结构、组成及主要功能。     

战场损伤评估与修复分析及应用

本文根据我国国情和我军实践,论述了武器装备战场损伤评估与修复(BDAR)的基本概念、原理、分析程序及方法,提出了进行BDAR分析、制定HDAR大纲等一系列实际应用问题。     

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

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

Killing Your Own: Confronting Desertion and Cowardice in the British Army During the Two World Wars

Military units can become to some extent self-governing in war-time battle. At times, they may take the discipline of their soldiers into their own hands and such discipline may be severe. This paper examines incidents in the British military, in both World Wars, where British soldiers were killed by their comrades because they would not fight in the heat of battle. The judicial execution by the military authorities of deserters in the First World War led to much controversy in Britain. It may be much less well-known that in both World Wars there was, on occasion, an extra-judicial practice within the British military of executing soldiers who would not fight in the heat of battle. In such situations ethical dilemmas become very difficult indeed and some of the relevant issues are examined here.     

结合兰彻斯特方程分析战场地形因素对战争的影响

针对现代战争中地形对作战制约因素增多的问题,在兰彻斯特作战模型基础上,加入战场地形因素,分析对战争的影响。本文介绍了兰彻斯特方程的改进与发展,通过地形对通行和隐蔽的影响分类,构建一种反映地形因素的作战模型,并运用Matlab软件编写模型算法进行仿真计算。仿真结果表明:该模型可在一定程度上反映地形因素对战争的影响,同时说明了合理有效发挥地形优势可以达到以少胜多、以弱胜强的军事目的。     

对美国“忠诚僚机”的思考及对策建议

用无人机担任僚机已成为战斗机编组作战领域技战术研究的新热点。本文通过跟踪美国“忠诚僚机”项目的试验进展,了解所用无人僚机和战斗机平台的性能及特点,把握长僚机编组作战对无人僚机的基本指标需求。在此基础上,结合美军分布式作战概念的演变、智能空战技术研究和现有装备改装趋势等因素,分析了“忠诚僚机”项目在推进空中分布式作战概念实用化、提高长僚机编组作战效能以及形成规模化无人僚机装备方面可能产生的影响。基于上述分析,得出无人僚机与有人战斗机编组作战是军队需要面对的新型作战样式这一结论,并结合国内空战理论研究、军用无人机制造能力以及反无人机装备的发展情况,给出整合资源发展优势无人机、以硬杀伤和软杀伤多种形式构建有效反制体系的对策建议。     

虚拟现实技术在消防训练中的应用

在对虚拟现实训练系统分类论述的基础上,探讨了虚拟现实技术在消防训练中的应用及优势,阐述了该领域在国内外的研究现状和发展前景,并指出了有待进一步研究的问题。     

Network reliability assessment in a random environment

In this paper we consider networks that consist of components operating under a randomly changing common environment. Our work is motivated by power system networks that are subject to fluctuating weather conditions over time that affect the performance of the network. We develop a general setup for any network that is subject to such environment and present results for network reliability assessment under two repair scenarios. We also present Bayesian analysis of network failure data and illustrate how reliability predictions can be obtained for the network. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 574–591, 2003     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003