基于最大保障时间的战时装备维修任务调度模型

战时维修机构承担的维修任务比较繁重,合理、科学地安排维修任务可以有效地提高作战部队的战斗力.对此,分析了战时维修任务调度的特点,建立了基于最大保障时间的维修任务静态、动态调度模型,并提出了相应的模型求解方法.利用本方法在满足作战单元最大保障时间前提下,可使得装备维修效益最大,并可以实现实时动态维修任务调度,有效地解决了一种战时维修任务调度问题.     

双机合作下的远程空空导弹攻击技术

探讨了双机合作条件下远程空空导弹的攻击技术.首先描述了双机合作下时间对准的方法和数据延时的处理,然后给出了空间对准的具体坐标转换公式,最后以基准制导坐标系为基础建立了无线电修正指令的矢量图,用矢量方程法推导了无线电修正指令的形成过程.     

具有射击门体制的武器系统射击延时分析

针对具有射击门体制的武器系统,研究其因加入射击门而产生的射击延时.藉助于概率转移阵的概念,定义了超速、欠速概率转移阵,导出了概率转移阵的估计式,给出了误差可小于期望值的射击延时分布函数,证明了该射击延时分布函数以及其可任意趋近的上界与下界均服从PH分布.最后,以试验数据验证了结论的可信性.     

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

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

国外消防中介组织运作模式及启示

介绍了美国、加拿大、俄罗斯、德国、日本等国消防中介组织运作模式概况及特点,提出了其对我国消防中介组织发展的启示。     

一类半线性抛物型方程组解的爆破速率估计

研究了一类具有不同类型反应项的半非线性抛物型方程组初边值问题,这类模型主要描述两种物质燃烧过程中的热传递规律。通过运用古典计算技巧和偏微分方程的定性分析手法,得到了这类半非线性抛物型方程组初边值问题解的爆破速率估计。     

面向服务的遗留系统再工程过程

将遗留系统再工程为面向服务系统是软件技术发展的趋势,但现有软件过程不能很好地解决面向服务的再工程所面临的问题.比如如何协调遗留系统共利益者的交流并快速有效地处理需求变更;如何实现服务以满足目标系统体系结构灵活性;如何降低重用遗留系统带来的风险以及如何减少交付期的软件错误等.针对这些问题,设计了面向服务的遗留系统再工程过程(SORP).SORP融合了传统软件过程的计划性和灵活性,并根据面向服务再工程项目的特点进行了特殊配置,在生命周期上将再工程过程划分为四个阶段,在内容上包含了六个工作流.为与实践相结合,详细规划了SORP的角色、活动、工作产品以及评估方法.应用实践表明,SORP在一定程度上增加了目标系统体系结构的灵活性,降低了重用遗留系统带来的风险.     

基于0-1规划的弹种决策与发射时序优化

对于身管发射武器系统,同一发射单元使用不同弹种完成作战任务时,需要确立合适的弹种决策与最佳的发射时机.提出用O-1变量来描述弹种决策变量.通过时弹种发射机制及武器系统控制特点进行分析,构造多种0-1变量用以描述武器系统作战时序之间的约束关系,建立了弹种发射时序的0-1规划模型,并用LINGO软件实现了0-1规划的求解.给出了典型应用实例,进行了仿真计算,结果表明,该方法简单可行.     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Bayesian enhanced decision making for deteriorating repairable systems with preventive maintenance

Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008