The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

A decision support system for the procurement of military equipment

The use of life-cycle costs in procurement is limited by the accuracy of cost estimates and assessments of availability risks under the conditions generating costs. Critical to these problems are the needs and responses of equipment to maintenance and repair. Using transition probabilities to define the relationships between serviceability and maintenance and repairs, this article develops a comprehensive decision support system for military procurement. It uses a dynamic programming model to determine the least-cost set of maintenance and repair decisions, where adjustments are included for warranty conditions, time value of money, the opportunity costs of equipment failure, and the end-of-cycle salvage values or disposal costs. The system allows users to define working and failed states, create their own rules or indicators of availability from estimates of state probabilities and establish thresholds of risk acceptability.     

一种MIMO雷达动目标检测的快速算法

通过对MIMO雷达动目标检测器的结构进行分析,提出了一种针对MIMO雷达动目标检测的快速算法.该算法通过借助快速傅里叶变换实现每个通道的动目标检测,从而缩小搜索范围,显著地减少了运算量,很好地解决了原算法因运算量过大而难以实时实现的问题.理论分析和仿真实验证实了快速算法的可行性.     

有源诱饵弹对抗毫米波制导武器仿真分析

有源诱饵弹是对抗毫米波制导武器的一种重要手段。根据毫米波雷达制导导弹波束窄的特点,采用投放多枚诱饵弹以组成诱饵阵的对抗方法。初步建立了对抗过程仿真的数学模型,并通过该模型对对抗过程进行了仿真分析。分析表明,如果依据形势合理布放诱饵,将会对目标起到很好的保护作用。     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

刍议GJB 1371与GJB 3837的关系

在新装备的研制过程中,需要有效地开展保障性分析工作,同时会产生大量的信息,GJB 3837便是为有效地存储这些信息而制定的标准。为明确GJB 3837与保障性分析工作之间的对应关系,本文对GJB 1371与GJB 3837进行了简要介绍,并对二者之间的对应关系展开研究,以期为GJB 1371和GJB 3837的工程化应用奠定基础。     

关于建立我国民用爆破器材安全标准体系的探讨

文章针对民用爆破器材行业的发展状况和特点,综述了我国民用爆破器材行业安全标准的发展趋势。     

反舰导弹两种射击方式下捕捉概率及仿真

超视距攻击下,不同的射击方式对捕捉概率可能产生不同的影响.在不同射击方式误差机理分析的基础上,给出了超视距打击情况下两种不同射击方式的捕捉概率模型,在一定的数据设置情况下,进行了仿真分析,给出了两种不同射击方式下的对比分析.     

废气涡轮增压柴油机动态模型研究

研究了废气涡轮增压柴油机作为转速控制对象时的动态数学模型 ,并在此基础上建立了数字式电子调速器仿真系统 .