古建筑火灾风险评估

我国古建筑众多,而其又具有自身独特的建筑特点和消防安全特性,结合当前古建筑消防安全形势,探讨火灾风险评估技术在古建筑安全保护工作中的应用问题,从而为管理和改进古建筑火灾防治工作提供参考和依据。     

关于对“城市火灾风险与灭火救援力量”评估的探讨

加强政府对消防工作的科学决策,编制“城市火灾风险与灭火救援力量”方案是落实科学发展观的具体举措。围绕进一步规范“城市火灾风险与灭火救援力量”的评估工作,从火灾形势、消防力量、公共消防设施建设、消防工作社会化、公民消防素质教育等方面提出开展评估的具体办法,并从机构设定、评估定位、工作原则和程序等方面就公共消防安全评估机制建设提出建议。     

武器装备体系建设风险分析及评估模型研究

分析了武器装备体系建设风险的内涵及特点,在此基础上构建了武器装备体系建设风险模型,并运用风险矩阵和网络层次分析法对武器装备体系建设风险模型进行分析,通过算例验证了模型的可行性,为制定科学合理的武器装备体系建设风险管理提供了依据。     

The multiplicative representation for multiple objectives optimization with an application for arms procurement

Multiple Objectives Optimization is much seen in combination with linear functions and even with linear programming, together with an adding of the objectives by using weights. With distance functions, normalization instead of weights is used. It is also possible that together with an additive direct influence of the objectives on the utility function a mutual utility of the objectives exists under the form of a multiplicative representation. A critical comment is brought on some representations of this kind. A full‐multiplicative form may offer other opportunities, which will be discussed at length in an effort to exclude weights and normalization. This theoretical approach is followed by an application for arms procurement. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 327–340, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10014     

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     

Determination of burn‐in parameters and residual life for highly reliable products

Today, many products are designed and manufactured to function for a long period of time before they fail. Determining product reliability is a great challenge to manufacturers of highly reliable products with only a relatively short period of time available for internal life testing. In particular, it may be difficult to determine optimal burn‐in parameters and characterize the residual life distribution. A promising alternative is to use data on a quality characteristic (QC) whose degradation over time can be related to product failure. Typically, product failure corresponds to the first passage time of the degradation path beyond a critical value. If degradation paths can be modeled properly, one can predict failure time and determine the life distribution without actually observing failures. In this paper, we first use a Wiener process to describe the continuous degradation path of the quality characteristic of the product. A Wiener process allows nonconstant variance and nonzero correlation among data collected at different time points. We propose a decision rule for classifying a unit as normal or weak, and give an economic model for determining the optimal termination time and other parameters of a burn‐in test. Next, we propose a method for assessing the product's lifetime distribution of the passed units. The proposed methodologies are all based only on the product's initial observed degradation data. Finally, an example of an electronic product, namely contact image scanner (CIS), is used to illustrate the proposed procedure. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

A general model of heterogeneous system lifetimes and conditions for system burn‐in

Burn‐in is a technique to enhance reliability by eliminating weak items from a population of items having heterogeneous lifetimes. System burn‐in can improve system reliability, but the conditions for system burn‐in to be performed after component burn‐in remain a little understood mathematical challenge. To derive such conditions, we first introduce a general model of heterogeneous system lifetimes, in which the component burn‐in information and assembly problems are related to the prediction of system burn‐in. Many existing system burn‐in models become special cases and two important results are identified. First, heterogeneous system lifetimes can be understood naturally as a consequence of heterogeneous component lifetimes and heterogeneous assembly quality. Second, system burn‐in is effective if assembly quality variation in the components and connections which are arranged in series is greater than a threshold, where the threshold depends on the system structure and component failure rates. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 364–380, 2003.     

基于地理信息系统的城市火灾危险评价

选用单位面积火灾损失、人口密度、建筑密度、路网密度和消防力量建立城市火灾危险预测与评估的统计模型。结合数字城市的基本思想 ,论述基于地理信息系统识别和定量评价火灾危险的技术方法。在ARCVIEW空间分析技术支持下 ,建立城市火灾危险区域划分的技术流程     

Resequencing with parallel queues to minimize the maximum number of items in the overflow area

This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016