Stage life testing

In progressive censoring, items are removed at certain times during the life test. Commonly, it is assumed that the removed items are used for further testing. In order to take into account information about these additional testing in inferential procedures, we propose a two‐step model of stage life testing with one fixed stage‐change time which incorporates information about both the removed items (further tested under different conditions) and those remaining in the current life test. We show that some marginal distributions in our model correspond either to progressive censoring with a fixed censoring time or to a simple‐step stress model. Furthermore, assuming a cumulative exposure model, we establish exact inferential results for the distribution parameters when the lifetimes are exponentially distributed. An extension to Weibull distributed lifetimes is also discussed.     

指数型产品可靠性验收试验的一种贝叶斯方法

采用贝叶斯方法 ,利用大量的历史数据和工程技术人员的丰富经验确定先验分布 ,制定出验收试验的一种新方案 .按照这一方案 ,在确保产品质量的前提下 ,可大大节省试验时间 ,从而得到十分可观的经济效益 .     

Shor-Preskill方法不能直接证明B92量子密钥分配协议

密钥分配协议安全性的证明是确保密钥分配绝对安全的要求 ,经典密码方案的安全性大多难以证明 ,而利用量子力学的基本原理 ,可以证明量子密码方案是无条件安全的。介绍了Shor Preskill对BB84量子密钥分配协议无条件安全性的证明方法 ,归纳了其技巧和特点 ,揭示了对称化方法和量子纠缠提纯技术在该方法中的作用。证明了Shor Preskill方法不能直接用来证明B92协议的无条件安全性。提出了利用Shor Preskill方法间接证明B92的可能途径。     

The multivariate Polya distribution in combat modeling

This paper investigates the multivariate Polya distribution (MPD) for application in combat models for which enemy targets must be randomly assigned to fighting units. Six sets of actual combat data motivate the allocation model. Scenarios include air‐to‐air combat, tank, and submarine warfare. Goodness of fit tests are derived which verify the validity of the MPD, and reinforce the notion that multinomial allocation is too simplistic for such combat models. Simulations to determine optimal allocations for minimal combat cost are applied in order to illustrate the role of the MPD in combat modeling. © 2001 John Wiley & Sons,Inc. Naval Research Logistics 48: 1–17, 2001     

A nonparametric Bayes approach to decide system burn-in time

Burn-in is the preconditioning of assemblies and the accelerated power-on tests performed on equipment subject to temperature, vibration, voltage, radiation, load, corrosion, and humidity. Burn-in techniques are widely applied to integrated circuits (IC) to enhance the component and system reliability. However, reliability prediction by burn-in at the component level, such as the one using the military (e.g., MIL-STD-280A, 756B, 217E [23–25]) and the industrial standards (e.g., the JEDEC standards), is usually not consistent with the field observations. Here, we propose system burn-in, which can remove many of the residual defects left from component and subsystem burn-in (Chien and Kuo [6]). A nonparametric model is considered because 1) the system configuration is usually very complicated, 2) the components in the system have different failure mechanisms, and 3) there is no good model for modeling incompatibility among components and subsystems (Chien and Kuo [5]; Kuo [16]). Since the cost of testing a system is high and, thus, only small samples are available, a Bayesian nonparametric approach is proposed to determine the system burn-in time. A case study using the proposed approach on MCM ASIC's shows that our model can be applied in the cases where 1) the tests and the samples are expensive, and 2) the records of previous generation of the products can provide information on the failure rate of the system under investigation. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 655–671, 1997     

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     

基于贝叶斯模型的装备剩余寿命预测研究

为了解决武器装备日益复杂及维修工作日趋繁重的问题,运用贝叶斯模型预测装备修理后的剩余寿命,为合理安排其修理计划提供依据。替代传统的指数分布,用威布尔分布描述系统寿命特征,并运用极大似然方法和贝叶斯方法估计威布尔分布的两个未知参数,给出其置信区间。在此基础上,对先验样本和后验样本两种不同情况,分别运用贝叶斯模型预测装备修理后的剩余寿命,并给出实例。结果表明了该方法的有效性。     

高寒山地边境反击作战炮兵群火力分配

未来高寒山地边境反击作战,爆发突然,进程极快,必须在被敌发现前高效发挥炮兵群火力,突出作战力量集约,作战体系对抗,实现火力运用最优化、打击效能最大化、弹药消耗和自身损失最小化。把“基于效果”理论运用到指挥决策中,通过研究地理环境、敌情、统计数据分析、优化效能参数,并融入无线传感器网络分簇算法思想,提出一种炮兵群火力运用优化算法,在一定程度上能快速、高效地解决高寒山地边境反击作战炮兵群火力运用的问题,对支持未来作战指挥决策,具有一定的现实意义。     

空域窗射击舰炮火力分布方法

空域窗射击方式是近程防御舰炮武器提高对高速复杂机动反舰导弹射击效力的有效途径,研究论证舰炮射击区域内射弹分布方法是实现舰炮空域窗射击的关键。运用射击效力分析方法,从“软”、“硬”两个途径,研究了射击诸元分布法和炮管预置角法两种空域窗射击火力分布方法,对其火力分布方式、范围及火力密度进行了研究,可为舰炮研制及使用提供参考。     

基于模糊匈牙利算法的炮兵火力单位分配问题

发挥诸火力单位的整体协调优势,寻求在给定约束条件下总的射击效果最好的分配方案,是火力单位最优分配的基本任务.匈牙利算法是求解传统的指派问题的一种较好的方法,运用模糊匈牙利算法在决策过程中将主观因素与客观因素有机地结合起来,解决火力单位分配方案决策中多指标指派问题,从而可以有效地解决炮兵火力单位分配最优化问题.