地面防空战斗部署方案评估模型

对地面防空战斗部署方案进行评估是防空作战中非常关键的一环,防空战斗部署主要包括防空兵器战斗部署和情报预警雷达组网部署两部分。首先分析了地面防空兵器战斗部署的评估指标体系,用数学规划的方法对其作战能力进行评估。然后运用开马尔可夫排队网络对情报预警雷达组网部署的空情预警能力进行评估。     

区域地面防空网络化作战传感器系统

区域防空需要三种信息:预警信息、战术指挥信息和制导控制信息,因此应相应的建立三层信息网络系统:联合规划网络、联合数据网络及联合跟踪网络来满足网络化防空作战的需要。对多传感器信息融合的作用进行了分析,并提出了一种适应地面防空网络化作战需要的传感器系统信息融合体系结构。     

校园网Linux环境下入侵诱骗系统的研究与实现

当今的网络环境变得越来越复杂,网络安全管理员的工作不断加重,不经意的 疏忽便有可能遗留下安全的重大隐患,同时网上黑客教程和千余种入侵工具随手可得,因此 网络安全问题防不胜防,网络的防卫必须采用一种纵深的、多样的手段。入侵诱骗技术是网 络安全中的一个新兴的领域,是对现有的网络安全体系的一次重要扩充。结合校园网络平 台,将入侵检测和入侵诱骗有机地结合起来,对入侵诱骗系统进行了研究和具体实现,并详 细阐述了入侵诱骗系统的中心管理端和网络代理端的构成和功能。     

舰空导弹防空体系分析

从舰空导弹武器作战任务的需求出发,分析了舰空导弹体系的组成,给出了评估体系优劣的指标。简要回顾了国外舰空导弹武器的发展,阐述了美、俄、英等国家舰空导弹体系的构成,并展望了舰空导弹发展趋势。     

防空、反潜作战中舰载设备生存能力的定量评估算法

防空、反潜作战是当前海上编队面临的最重要的作战样式之一,研究舰载设备在海战中的生存能力,对于提高水面舰艇可持续作战能力具有重要作用。采用定量评估方法来研究舰载设备的生存能力问题,基于水面舰艇编队典型防空、反潜作战防线模型,给出了详细的数学计算模型。     

基于排队论的防空导弹群作战效能研究

结合防空导弹群防空战斗的特点,利用可列状态生灭过程的排队论方法,研究了防空导弹群作战效能,建立了数学模型,分析了导弹群防空武器系统对目标平均击毁概率的计算方法,并通过引入拦截适宜性因子对理想条件下的排队模型进行了修正,为类似问题的研究提供了一种参考。     

Efficient distributions of arms‐control inspection effort

A rule that constrains decision‐makers is enforced by an inspector who is supplied with a fixed level of inspection resources—inspection personnel, equipment, or time. How should the inspector distribute its inspection resources over several independent inspectees? What minimum level of resources is required to deter all violations? Optimal enforcement problems occur in many contexts; the motivating application for this study is the role of the International Atomic Energy Agency in support of the Treaty on the Non‐Proliferation of Nuclear Weapons. Using game‐theoretic models, the resource level adequate for deterrence is characterized in a two‐inspectee problem with inspections that are imperfect in the sense that violations can be missed. Detection functions, or probabilities of detecting a violation, are assumed to be increasing in inspection resources, permitting optimal allocations over inspectees to be described both in general and in special cases. When detection functions are convex, inspection effort should be concentrated on one inspectee chosen at random, but when they are concave it should be spread deterministicly over the inspectees. Our analysis provides guidance for the design of arms‐control verification operations, and implies that a priori constraints on the distribution of inspection effort can result in significant inefficiencies. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility

In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Waypoint analysis for command and control

Command and Control (C2) in a military setting can be epitomized in battles‐of‐old when commanders would seek high ground to gain superior spatial‐temporal information; from this vantage point, decisions were made and relayed to units in the field. Although the fundamentals remain, technology has changed the practice of C2; for example, enemy units may be observed remotely, with instruments of varying positional accuracy. A basic problem in C2 is the ability to track an enemy object in the battlespace and to forecast its future position; the (extended) Kalman filter provides a straightforward solution. The problem changes fundamentally if one assumes that the moving object is headed for an (unknown) location, or waypoint. This article is concerned with the new problem of estimation of such a waypoint, for which we use Bayesian statistical prediction. The computational burden is greater than an ad hoc regression‐based estimate, which we also develop, but the Bayesian approach has a big advantage in that it yields both a predictor and a measure of its variability. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

网络游戏赌博性质分析

网络游戏产业快速发展的同时,赌博现象混迹其中。网络游戏赌博与传统赌博只是形式上的不同,其实质就是一种赌博行为。只有从教育、法制、监督、自律四方面综合治理,才能使这个行业健康发展。