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     

进气道角度对含硼推进剂固冲发动机性能的影响

为了提高含硼推进剂固体火箭冲压发动机内硼颗粒的燃烧效率,采用颗粒轨道模型进行了补燃室两相流的数值模拟,其中硼颗粒的点火和燃烧模型采用的是King模型,建立了发动机补燃室内简单反应流模型,在该模型下研究了进气道的位置对非壅塞固体火箭冲压发动机燃烧效率的影响,并在此基础上进行直连式试验研究.结果表明,后进气道角度为60°时的燃烧效率比90°时高.     

H2O2/HTPB固液混合发动机点火试验研究

利用H2O2催化分解原理,设计了烃类燃料在催化分解的90%H2O2中能燃烧的点火器,然后采用该点火器进行H2O2/HTPB固液混合发动机点火试验研究.试验结果表明,该点火器能够成功启动H2O2/HTPB固液混合发动机,且当混合比偏离最佳混合比后,发动机的燃烧效率降低.     

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.     

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

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

结合全局与局部信息的主动轮廓分割模型

针对传统的基于区域的主动轮廓模型在分割灰度不均匀图像和噪声图像存在效果不佳的问题,提出结合全局项与局部项的主动轮廓分割模型。全局项由CV(Chan-Vese)模型的保真项构成,局部项的构建考虑局部区域信息的同时引入反映图像灰度特性的局部熵信息。依据图像灰度的特点,选择合理的全局项和局部项参数,并加入正则项保证曲线在演化过程中保持平滑,保障分割结果的可靠性。通过变分水平集方法最小化能量泛函,依据梯度下降流迭代更新水平集,完成曲线演化。采用模拟图像和实际图像进行实验分析,结果表明,所提出的结合全局项和局部项的主动轮廓模型可以高效地分割噪声严重以及灰度分布不均匀的图像。