建筑工程消防验收定量评定方法研究

依据中华人民共和国公安部印发的《建筑工程消防验收评定暂行办法》,建立了建筑工程消防验收系统。依据层次分析法对分级系统中各指标层,利用专家打分法确定其权重,设定不同的等级,确定不同等级下的权重系数,从而计算出建筑工程消防验收定量评定的标准。     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于遗传算法舰船装载码头配置方案优化

两栖输送舰船码头装载过程中,如何科学配置装载码头,使得整个装载任务完成时间最短是部队制定装载方案需要解决的重要难题。依据码头装载配置特点和要求,运用军事运筹学多目标规划理论构建装载码头配置规划模型,并运用遗传算法理论和计算机编程工具实现码头配置规划模型的优化解算。从而提高了部队两栖输送舰船码头装载方案制定的科学性和时效性。     

弹载星敏感器应用方案比较研究

简述了弹载星敏感器几种应用方案的原理,从视场大小、导航星等、观星方式、像元分辨率、三轴姿态精度、动态性能、惯性基准误差分离等方面分析、比较了各种方案的优缺点.除平台方案外,捷联星图方案和单(双)星方案的技术参数相当,动态性能均有待提高.星图方案较单(双)星方案在2个方面占优势:一是星图方案不要求调整星敏感器光轴对准导航星,星跟踪算法等技术能快速识别星图;二是星图方案可同时、连续观测6～8颗星,解算出弹体三轴姿态,可以采用先进的滤波技术准确地分离惯性基准误差.     

Into the black box? Technology sharing in major arms transfers and beyond

From the recipients’ perspective, arms transfers have, through the use of offsets, technology transfers, and industrial participation, become an opportunity to receive not only advanced weapons, but also technologies not otherwise available. How important are friendly relations for securing a military export order? To what extent do buyers demand advanced military or commercial technology and how are these demands accepted by the supplier? How does this influence smaller producers in relation to major producers? These questions are addressed by studying (a) the Joint Strike Fighter/F-35 by Lockheed Martin, USA, and the JAS-39 Gripen aircraft by Saab, Sweden, (b) the Medium Multi-Role Combat Aircraft competition in India for 126 combat aircraft, and (c) the Indian offset policy. In the final section, some long-term consequences are discussed.     

F—K理论在堆积固体自燃火灾调查中的应用

堆积固体自燃火灾是常见多发火灾，由于其规模庞大、着火延迟期长等特点，难以进行全尺寸的模拟实验，为火灾预防和调查工作带来了一定的难度。基于F—K（Frank—Kamenetskii）理论，将小规模实验结果外推，从而预测或判断一定尺寸的堆积固体在一定的环境温度下自燃起火的危险性。     

基于Vague集的装备采购项目组织结构评价方法

在装备采购项目组织评价中引入Vague集理论，在列举现有项目组织结构类型的基础上，构建项目组织结构评价指标体系，建立各项目组织结构和理想组织结构的Vague集，计算各项目组织结构和理想组织结构的相似度量，完成对装备采购项目组织结构的评价，为装备采购项目组织设计奠定基础。     

关于装备使用保障问题的探讨

使用保障作为装备综合保障工作的主要工作内容,是战斗力的重要组成部分.本文探讨了使用保障的基本概念、使用保障要求与使用保障方案以及使用保障分析等与使用保障有关的问题.目的在于介绍使用保障的基本概念,并对如何开展装备的使用保障工作进行了初步的探讨.     

The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998