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     

镶嵌式径向滑动轴承静特性分析

分析计算了镶嵌式径向滑动轴承中油膜的压力分布、承载量、摩擦系数和流量,得出镶嵌式径向滑动轴承具有不同于普通径向滑动轴承的静特性.     

铁磁材料裂纹漏磁信号的定量检测

针对无损探伤难于实现定量检测的问题,探讨了基于模式识别进行铁磁材料裂纹漏磁信号定量分析的原理和方法,通过在标准试件上的大量实验及在具有自然裂纹的工件上实际检测,取得了满意效果。     

一种利用声处理技术的计数方法

分析了坦克队列行进时声音的变化规律,提出了一种新的计数方法,利用声探测器和一定的算法来模拟人耳的功能,实现了对行军坦克的计数.     

水声传感器信息处理技术

水声传感器信息融合是为潜艇、水面舰艇提供完整、准确、清晰战术态势的关键技术。结合各类声纳的特点,研究数据互联,水下被动定位与跟踪算法,纯方位系统的可观测性,跟踪坐标系的选择以及机动目标跟踪,是解决水声传感器信息处理的关键。首先对前人在这些方面的工作进行了总结和评述,然后根据现代海战的战术背景分析了水声传感器信息处理存在的一些技术难点和值得进一步研究的问题。     

一种有效的常规雷达目标识别方法

基于小波变换和进化网络提出一种有效的常规雷达目标识别方法。即首先利用 Mallat算法对雷达目标一维距离像进行特征提取和压缩 ,然后在进化规划的基础上提出一种混合进化算法来优化设计由多层前向网络构成的分类器。实验结果表明 ,整个目标识别系统的结构简单 ,同时具有较好的推广能力     

高频雷达射频干扰抑制研究

分析了高频雷达射频干扰抑制方案中对目标信号相干积累的影响,在此基础上提出了一种新型的天线方向图综合算法,并进一步将其应用到改进的干扰抑制新方案中。新方案兼顾了射频干扰的抑制和目标信号的相干积累。计算机仿真结果表明新方案较大地改善了高频雷达抑制射频干扰的性能。     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000