目标起伏特性对雷达威力性能的影响分析

介绍了典型雷达目标RCS起伏模型,阐述了起伏目标在实际中的应用,建立了目标损耗和雷达作用距离之间的关系,为不同目标的等效替代推算提供了理论依据.验证了雷达目标满足卡平方分布时发现概率和起伏因子之间的关系.并针对不同类型的起伏目标,建立了雷达探测距离和发现概率之间的关系,为雷达的威力检测和飞行目标的航线设计提供依据.     

基于多假设跟踪弹道导弹主动段跟踪算法

针对弹道导弹主动段防御中多枚弹道导弹同时跟踪问题,提出了基于多假设思想的主动段跟踪算法.重点阐述了该算法中假设生成、假设概率计算、假设约简以及假设剪枝等环节.从工程实用的角度出发,采用求解一个线性分配问题(LAP)方法得到M个最优假设,大大减少了假设数量,并运用N-scan回溯剪枝方法对假设进行剪枝,确定要输出的航迹,提高了算法的效率和实用性.仿真实验表明,该算法能够对主动段多枚弹道导弹目标准确关联跟踪.     

大型舰艇系统破损失效概率计算

对于大型舰船,多次命中和结构防护成为破损失效概率计算的主要问题,该文通过对各种算法的比较和研究,综合了逻辑代数法、网格积分法和蒙特卡罗随机模拟法的优点,较好地解决了这些问题,得到了满意的计算结果。     

基于装备损伤概率的舰艇动力系统安全性分析

考虑舰艇损害管制过程中人员因素对系统的影响,运用马尔科夫链对人员操作引起的舰艇动力系统损伤概率进行修正,根据修正后的毁伤概率,建立概率危险性评估模型,引入危险度指标,对动力系统在遭受武器攻击情况下的危险度进行了计算,并依据计算结果对系统安全度进行评定。     

舰船拖带安全评估的故障树方法

提出了一种从故障树分析的角度进行舰船拖带安全评估的方法。采用专家评估和模糊集理论相结合的原理得到故障树中基本事件发生的模糊概率,然后进行故障树定性和定量分析。该方法能合理和有效地预测作业系统的安全性及其薄弱环节。以断缆事件分析为例,对该安全评估方法做了概要阐述。     

驱护舰编队防空火力分配决策模型研究

驱护舰编队防空火力分配的确定和优化是最大限度地发挥驱护舰编队的整体作战能力的关键。为了高效地发挥驱护舰编队火力优势,用运筹学理论建立了驱护舰编队防空火力分配决策问题的优化模型,分析了各种解决此模型的方法的优缺点,并尝试运用粒子群优化理论(PSO)求解该模型。实例计算分析表明,所提出的方法较好地解决了驱护舰防空火力分配决策问题,为舰艇编队指挥员进行防空火力分配决策提供了一种有效的参考处理方法。     

基础课虚拟实验教学改革与实践

针对基础课实验室规模较小与教学任务繁重的突出矛盾,以建立虚拟实验室为突破口对基础课实验教学改革进行了尝试,并分析了虚拟实验的功能特点。实践证明,在电工与电子技术实验教学中开设虚拟实验,同时发挥传统实验教学的优势,加强了对学生虚拟实验能力和动手操作能力的培养。     

Waiting time analysis of the M/G/1 queue with finite retrial group

We consider an M/G/1 retrial queue with finite capacity of the retrial group. First, we obtain equations governing the dynamic of the waiting time. Then, we focus on the numerical inversion of the density function and the computation of moments. These results are used to approximate the waiting time of the M/G/1 queue with infinite retrial group for which direct analysis seems intractable. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Some probability functions in reliability and their applications

There has been much research on the general failure model recently. In the general failure model, when the unit fails at its age t, Type I failure (minor failure) occurs with probability 1 ? p(t) and Type II failure (catastrophic failure) occurs with probability p(t). In the previous research, some specific shapes (constant, non‐decreasing, or bathtub‐shape) on the probability function p(t) are assumed. In this article, general results on some probability functions are obtained and applied to study the shapes of p(t). The results are also applied to determining the optimal inspection and allocation policies in maintenance problems. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015