基于面积比矩阵的加权特征向量点匹配算法

提出一种在仿射变换下点集关系描述算子--面积比矩阵,证明了其在仿射变换群下的不变性质;并由该性质推导得出特征向量(EA)匹配算法抗噪性能差的原因,在此基础上给出了基于面积比矩阵的加权特征向量算法.算法构造不同图像的面积比矩阵,对矩阵进行分解得到其特征值和特征向量,通过特征值进行加权获得图像中点的特征向量,比较图像点的特征向量获取匹配关系.因面积比矩阵的仿射不变性质,算法能实现仿射变换下点集精确匹配;采用的加权特征向量法改进了EA匹配法,具有更好的抗噪性能.实验表明算法切实可行.     

公共场所人员安全疏散评价方法探讨

公共场所安全疏散评价对于确保火灾中人员的生命安全具有重要意义。基于“性能化”防火设计的思想，对影响公共场所安全疏散的因素进行了分析，并对安全疏散的必要性能和评价程序进行了较为全面的探讨，其中包括烟气的评价、人员疏散能力的评价、疏散路线合理性的评价、疏散对策的评价等，目的在于通过合理的评价方法得出合理的疏散性能，为减少公共场所火灾造成的人员伤亡和财产损失提供帮助。     

关于奥运临时用房消防设计问题的技术探讨

由于奥运临时用房项目建设的临时性、特殊性、紧迫性，导致了部分项目的消防设计存在难以满足现行规范的问题。笔者作为消防设计审核人员，以“为建筑内人员提供安全保障；为消防人员提供消防条件，保障其生命安全；尽量减少财产损失；保护结构安全；尽量减少对正常营运的干扰。”为安全目标，利用消防性能化设计，完善了消防设计中的火灾防控技术措施。     

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     

满足大动压模拟要求的试验弹道优化设计

为了解决弹道导弹在高海拔发射场进行飞行试验时的大动压检验问题,提出一种模拟大动压条件的试验弹道设计方法。针对发射场的实际特点,建立残骸再入的动力学模型与落区边界模型;将大动压模拟条件转化为过程约束,提出一种主动段联合优化策略。基于自适应模拟退火算法,分别设计了三组满足不同大动压模拟条件和各项约束的试验弹道,并给出了对应的落区调整方案,验证了该方法的可行性。设计结果表明,最大动压主要出现在一级,一级最大负攻角增加,则最大动压也明显提高;同时调整发射方位角和二、三级程序角可以保证试验弹道满足弹头落点约束条件。     

船舶静态电场跟踪的渐进更新扩展卡尔曼滤波器

为了实现利用船舶静态电场对船舶进行跟踪的目的,针对传统卡尔曼滤波算法中存在的问题,设计一种新的非线性滤波器。建立船舶的状态空间模型,分析传统卡尔曼滤波算法在船舶跟踪中存在的问题;依据渐进贝叶斯思想,利用连续白噪声与离散白噪声序列噪声协方差之间的关系,设计一种新的渐进更新扩展卡尔曼滤波器。仿真结果表明,该滤波器能有效地抑制由于初始误差较大而造成的滤波性能下降和滤波发散,能够有效地跟踪船舶,具有较高的实用价值。     

Optimal switchover times between two activities utilizing the same resource

The “gold‐mining” decision problem is concerned with the efficient utilization of a delicate mining equipment working in a number of different mines. Richard Bellman was the first to consider this type of a problem. The solution found by Bellman for the finite‐horizon, continuous‐time version of the problem with two mines is not overly realistic since he assumed that fractional parts of the same mining equipment could be used in different mines and this fraction could change instantaneously. In this paper, we provide some extensions to this model in order to produce more operational and realistic solutions. Our first model is concerned with developing an operational policy where the equipment may be switched from one mine to the other at most once during a finite horizon. In the next extension we incorporate a cost component in the objective function and assume that the horizon length is not fixed but it is the second decision variable. Structural properties of the optimal solutions are obtained using nonlinear programming. Each model and its solution is illustrated with a numerical example. The models developed here may have potential applications in other areas including production of items requiring the same machine or choosing a sequence of activities requiring the same resource. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 186–203, 2002; DOI 10.1002/nav.10008     

中庭防排烟系统性能化设计探析

阐述中庭防排烟性能化设计的具体过程 ,并对防排烟系统设计的运用进行举例。     

概念层次网络中对偶性设计

首先对概念层次网络（ＨＮＣ）理论作简要说明，然后根据ＨＮＣ中层符号个性化设计理论给出对偶性设计方案，和偶性的具体表现，并给出对偶性概念具体表现的注解。     

A facility reliability problem: Formulation,properties, and algorithm

Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010