寿命周期费用分析中的数据采集问题探讨

寿命周期费用数据采集是寿命周期费用分析的关键问题之一。简要介绍了寿命周期费用的概念,探讨了寿命周期费用数据采集的目的与要求、费用数据的来源、内容、采集形式,以及对费用数据的处理等与寿命周期费用数据采集有关的问题。目的在于为寿命周期费用的数据采集提供一般性指导方法。     

地震灾害生命救援的对策与行动要求

四川汶川特大地震,震撼了国人,震惊了世界。全国人民万众一心,众志成城,不畏艰险,百折不挠,以人为本,尊重科学的伟大抗震救灾精神,鼓舞着1．38万名消防救援官兵在震区创造了一个又一个生命救援的奇迹。结合汶川大地震消防救援的实践,谈谈震后生命救援的对策与行动要求,旨在探求地震灾害救援方法,提高生命救援能力。     

从德育的人文关怀角度谈高校生命道德教育的建构

道德教育的出发点,应建立在对个体生命的理解与尊重的基础上,这是以人为本的教育价值观的体现。但是我国的德育缺乏了对生命主题的关注。本文试图从德育的人文关怀角度来反思高校的生命道德教育,并提出了相应的对策和建议。     

基于随机Petri网的装备抢救抢修保障模型

通过建立一个基本的装备抢救抢修Petri网模型,把Petri网建模思想引入战时装备抢救抢修保障模型中,将实际系统中的实体和活动映射为模型系统中的库所和变迁,将装备抢救抢修保障排队论模型用随机Petri网进行描述。构建了一个完整的装甲团装备抢救抢修随机Petri网模型,利用软件包SPNP6.0对其进行模拟运行,通过对模型仿真数据的分析为装备保障的方案制定提供决策依据。     

对装备生命周期的再认识

针对当前对于装备生命周期起始阶段、终止阶段、主要活动划分等方面存在的认识不统一问题,研究指出装备生命周期概念具有层次性,每层内涵对应的生命周期的起始阶段与终止阶段虽然都可以统一到论证和淘汰2项活动中,但其起始和终止的具体环节却各不相同,建立了装备生命周期的双螺旋式立体模型,提出将装备生命周期过程分为研制和服役2个阶段,以及论证、生产、采购、使用和淘汰5种主要活动的划分方法。     

概率条件下雷区范围估计研究

为更正现有雷区范围估计算法因搜扫率处置不当而存在的矛盾与不足,研究了搜扫率条件下的雷区范围估计问题。分不规则雷区和规则雷线两种情况,依据极大似然估计的原理,推导出搜扫率条件下的雷区范围估计算法,并对改进算法与现有算法进行了分析比较和仿真示例验证。分析和示例表明新算法克服了现有算法的缺陷,能够更符合实际地解决雷区范围估计问题。     

利用软件生命周期模型改进对软件系统的维护

软件维护一直被认为是软件产品交付后的过程,但实际上它贯穿于生命周期中每个阶段并不是一个独立阶段。文章针对软件维护对软件生命周期模型进行了重新定义;从模型的实现和可行性进行了详细地分析;并且强调了软件维护阶段是一个微型的开发周期,它开始于产品的某个维护请求,终于软件产品的退役;最后讨论了目前常用的维护方法(如再工程和逆向工程)在这个生命周期模型中的应用。     

复合材料层合板疲劳寿命形状参数与门槛值分析方法

复合材料性能具有较大的分散性,在表征复合材料疲劳寿命时,必须考虑分散性的影响.以M21C复合材料开孔层合板为研究对象,采用Sendeckyj等效静强度模型和随机变量函数的概率分布方法推导了复合材料层合板疲劳寿命形状参数和剩余强度形状参数的关系,通过试验和统计的方法获得了M21 C复合材料开孔层合板的疲劳寿命形状参数和疲...     

Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems

This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Models of sensor operations for border surveillance

This article is motivated by the diverse array of border threats, ranging from terrorists to arms dealers and human traffickers. We consider a moving sensor that patrols a certain section of a border with the objective to detect infiltrators who attempt to penetrate that section. Infiltrators arrive according to a Poisson process along the border with a specified distribution of arrival location, and disappear a random amount of time after their arrival. The measures of effectiveness are the target (infiltrator) detection rate and the time elapsed from target arrival to target detection. We study two types of sensor trajectories that have constant endpoints, are periodic, and maintain constant speed: (1) a sensor that jumps instantaneously from the endpoint back to the starting‐point, and (2) a sensor that moves continuously back and forth. The controlled parameters (decision variables) are the starting and end points of the patrolled sector and the velocity of the sensor. General properties of these trajectories are investigated. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008