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     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 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     

一种改进的事件驱动系统框架

在给出事件驱动系统安全漏洞的基础上,指出了产生漏洞的根本原因是:系统忽视了输入系统的事件序列之间存在的相关性;系统无条件信任任何事件源产生的事件.针对这两个原因,相应提出了事件序列形式安全分析模型及基于事件源的可信度评估模型,依据这两个模型,构建了一种改进的事件驱动系统框架.     

冲压增程弹进气道设计方法与性能分析

以冲压增程弹为应用背景进行了进气道设计.结合增程弹的特点,讨论了轴对称进气道中心锥参数、喉道参数、外罩参数的选择.特别对进气道唇口处参数、扩张段角度设计方法进行了分析.设计了单锥混压式、单锥外压式以及双锥混压式三种进气道,并进行了数值模拟.分析了进气道主要设计参数对其性能的影响.数值结果表明,就增程弹的性能要求而言,双锥混压式进气道的性能较高.     

捷联惯导系统快速自对准误差模型的建立

通过对惯性制导系统两个基本方程的研究,求出了各状态矢量在各坐标系下的微分方程,然后以ψ角法所确立的平台为基准,分别推导得出惯性制导系统各主要状态的微分方程,从而建立了捷联惯性制导系统的误差模型.最后根据静基座捷联惯导系统初始对准的特点对其进行简化,得到了静基座捷联惯导系统快速自对准的误差模型.     

滑翔增程炮弹弹道仿真与优化设计

根据滑翔增程炮弹的空气动力特性和飞行弹道特性,通过对滑翔弹道的理论分析,采用控制鸭舵技术,实现炮弹的增程。经过仿真优化可以得到最佳初始射角、助推发动机的最佳点火时间及作用时间、鸭舵的最佳展开时间以及控制系统进行飞行姿态控制所需的最佳摆动角曲线,理想情况下最优滑翔控制模型可使射程达到不进行滑翔控制时射程的1.5-2倍,所得结果对滑翔弹丸的气动力设计及控制系统设计具有一定的参考价值。     

基于可能度的军品供应商选择方法研究

建立军品供应商的选择方法,是当前军事订货与采购制度改革亟需解决的一个重要问题。本文利用Fuzzy AHP制定了军品供应商的选择方法,并提出了一种新的基于中值点的可能度指标作为三角模糊数互补判断矩阵排序的依据。     

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.