基于随机网络的平均维修保障服务时间分析

利用随机网络建模方法在随机工程项目分析中的优越性,建立了不同保障方式下的维修保障过程模型。重点对网络活动中的维修等待时间和维修等待概率进行了分析,利用随机网络的解析算法,确定了维修力量的平均维修保障服务时间分析模型。最后将该方法应用于伴随修理过程,对其平均维修保障服务时间进行了案例分析。     

基于Petri网的装备维修过程建模与AnyLogic仿真

针对装备维修重修复质量、轻过程质量,导致效率不高、浪费较重、缺乏过程管控等问题,建立了装备维修过程库所/变迁网模型和着色时间Petri网模型,给出了装备维修过程动态性、随机性、时间性描述,提出了不同修理技能人员工序完成时间的计算方法,运用AnyLogic软件进行了装备维修过程仿真,得出了不同人员组合所对应的不同维修时间和工序返工情况,为维修过程优化与验证提供了一种思路。     

面向装备论证的作战任务描述方法研究

为了有效、正确地进行武器装备作战需求论证,需要提出规范化的作战任务描述方法.针对武器装备作战需求论证的特点,研究提出作战任务描述产品,确定了详细的开发过程.以联合火力打击战役为背景,应用该方法进行作战任务描述并给出部分描述产品,验证了该方法的有效性.     

Chord算法及其改进策略

Chord算法因为查找效率高、查找时延可预测、负载均衡及可扩展性强等特点,成为基于分布式哈希表的一种典型的结构化P2P查找算法,并得到了广泛的应用。文章首先介绍了Chord算法的基本原理并对其优缺点进行了分析;然后对Chord算法的不同改进策略进行了对比分类,分析比较了改进后的性能,最后围绕进一步研究和使用Chord算法进行了讨论。     

防空监视网络传感器任务优先级的模糊评价方法

传感器任务优先级是传感器管理的重要依据。应用模糊推理技术的传感器任务优先级评价方法,基于所有融合航迹和识别数据,通过符号推理确定决策循环过程中执行的每个监视任务的优先级。首先确定了管理系统结构,建立了优先级决策树,给出了模糊推理规则,最后进行了仿真试验。试验结果说明了模糊评价方法在传感器管理应用中的有效性。     

沉浸式虚拟维修仿真中的穿越处理问题研究

沉浸式虚拟维修环境下,物体间发生穿越的碰撞问题可以分为3类:1点接触,2点接触和3点及3点以上接触。采用改变碰撞物体的运动方向和距离的方式来避免物体间穿越现象的发生。并以实例的方式对其有效性进行了验证。     

装备使用阶段维修保障能力评估指标体系研究

装备使用阶段的维修保障能力评估对于发挥现有装备的作战能力具有很强的现实意义,而建立有效的指标体系是分析评估的基础.文章首先给出了指标体系的建立原则,然后从维修保障系统、装备、作战单元3方面给出了装备使用阶段维修保障能力评估指标体系.     

油料装备战场应急维修技术体系研究

从信息化战争对油料装备战场抢修快捷、有效和适时的要求出发,建立了油料装备战场应急维修技术体系,该体系由智能自修复维修技术、战场原位应急维修技术、伴随应急维修技术、定点应急维修技术和远程可视化应急维修技术五个层次组成,其关键技术是智能自修复技术和原位应急维修技术。采用新材料、新工艺、新技术实现维修敏捷化、精确化、信息化是油料装备战场应急维修技术的发展方向。     

Outsourcing warranty repairs: Dynamic allocation

In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items are dynamically routed to one of several service vendors. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while an item is awaiting and undergoing repair. For a large manufacturer with annual warranty costs in the tens of millions of dollars, even a small relative cost reduction from the use of dynamic (rather than static) allocation may be practically significant. However, due to the size of the state space, the resulting dynamic programming problem is not exactly solvable in practice. Furthermore, standard routing heuristics, such as join‐the‐shortest‐queue, are simply not good enough to identify potential cost savings of any significance. We use two different approaches to develop effective, simply structured index policies for the dynamic allocation problem. The first uses dynamic programming policy improvement while the second deploys Whittle's proposal for restless bandits. The closed form indices concerned are new and the policies sufficiently close to optimal to provide cost savings over static allocation. All results of this paper are demonstrated using a simulation study. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Optimal power control in a wireless network using a model with stochastic link coefficients

This paper addresses optimal power allocation in a wireless communication network under uncertainty. The paper introduces a framework for optimal transmit power allocation in a wireless network where both the useful and interference coefficients are random. The new approach to power control is based on a stochastic programming formulation with probabilistic SIR constraints. This allows to state the power allocation problem as a convex optimization problem assuming normally or log‐normally distributed communication link coefficients. Numerical examples illustrate the performance of the optimal stochastic power allocation. A distributed algorithm for the decentralized solution of the stochastic power allocation problem is discussed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005