Research on design and firing performance of Si-based detonator

For the chip integration of MEMS (micro-electromechanical system) safety and arming device, a miniature detonator needs to be developed to reduce the weight and volume of explosive train. A Si-based micro-detonator is designed and fabricated, which meets the requirement of MEMS safety and arming device. The firing sensitivity of micro-detonator is tested according to GJB/z377A-94 sensitivity test methods: Langlie. The function time of micro-detonator is measured using wire probe and photoelectric transducer. The result shows the average firing voltage is 6.4 V when the discharge capacitance of firing electro-circuit is 33 μF. And the average function time is 5.48 μs. The firing energy actually utilized by Si-based micro-detonator is explored.     

非标准气象条件弹道自动修正的研究

针对某强击机瞄准具轰炸性能改进装置,介绍非标准气象条件下弹道修正原理工作式的建立、修正电路的设计及其与瞄准具的交联关系     

Java语言在军用软件中的应用及实现方法

简要地分析了军用软件的现状和需求、Java语言的体系结构和系统特性、Java语言实时性的实现方法等。实时军用软件对开发语言的实时性要求很高,但是标准规范的Java语言本身不满足实时性能,因此,要想把Java语言应用到实时军用软件中必须首先解决Java语言的实时性的问题。     

武器系统仿真试验中的时空一致性处理方法

随着仿真技术在军事领域中应用的不断深入,武器仿真试验中的时空一致性处理问题尤为重要。阐述了由于时钟不同步导致对时间和空间理解的不一致及对仿真精度的影响;详细分析了时空不一致产生的因素;并以某型武器模拟试验系统为例,提出了武器系统半实物仿真试验中处理时空一致性几种实用且可行的方法。     

元任务插入的多星成像侦察任务聚类启发式算法

在多颗卫星协同执行侦察任务时,多星成像侦察任务聚类能够提高多颗卫星的整体侦察效率。根据卫星成像侦察元任务之间的聚类关系及约束条件,建立了数学规划模型,并提出了模型求解的基于元任务插入的启发式聚类算法,最后结合实例验证了算法的有效性。     

利用时间窗权重进行航迹关联

提出一种利用传感器测量数据的时间窗权重进行航迹关联的方法,将目标运动状态的多维向量(如距离、方位角、俯仰角等)分解为多个一维状态标量;根据每个状态标量与时间的关系,提取两条航迹的共同测量时间区间,将其划分为若干个时间窗,计算对应时间窗内的权重;根据时间窗权重差计算每一个状态标量的航迹相似度;应用DS理论或Bayes理论进行航迹关联决策。     

集热罩对喷头启动时间影响的数值模拟研究

通过分析大空间场所的特点,并选择FDS软件作为研究工具分别对集热罩边长为200、400、600、800mm;边缘厚度为40、50、60mm;喷头距火源的垂直高度为6、7、8、9m;喷头在火源正上方以及与火源的水平间距为2.2m时喷水灭火系统喷头启动时间进行模拟,通过对比分析集热罩对大空间场所中喷头的作用效果,为集热罩的设计提供指导。     

Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N

Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003.     

无源探测定位网

介绍了无源探测定位网的特点和分类,对无源探测定位网的关键技术进行了研究,并对无源探测定位网的发展前景进行了预测.     

Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1

A queueing system characterized by the discrete batch Markovian arrival process (D-BMAP) and a probability of phase type distribution for the service time is one that arises frequently in the area of telecommunications. Under this arrival process and service time distribution we derive the waiting time distribution for three queue disciplines: first in first out (FIFO), last in first out (LIFO), and service in random order (SIRO). We also outline efficient algorithmic procedures for computing the waiting time distributions under each discipline. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 559–576, 1997