航天服静电放电点燃能力实验研究

人—航天服系统产生的静电放电能否引燃航天服关系到载人航天飞机的安全性。通过实验研究了在纯氧和普通大气条件下 ,静电放电对各种航天服的引燃能力。实验表明 ,在普通大气条件下 ,静电放电不能引燃航天服材料。在纯氧条件下 ,点燃航天服材料所需的静电能量与静电放电的模型有关 ,机器模型的引燃能力最强。静电放电航天服点燃航天服材料所需的最小能量为 4 8mJ。     

Opportunistic retooling of a flexible machine subject to failure

A set of jobs can be processed without interruption by a flexible machine only if the set of tools required by all jobs can be loaded in the tool magazine. However, in practice the total number of tools required by a job set would exceed the tool magazine capacity. In such situations, the job set has to be carefully partitioned at the start of the production run such that each partition can be processed without interruption. During the production run, if there are unscheduled machine downtimes due to machine failure, this provides an additional opportunity to optimally retool the magazine for a smaller job set consisting of just the unprocessed jobs. In this paper, we study job sequencing rules that allow us to minimize the total expected cost of machine down time due to machine failures and magazine retooling, assuming a dynamic re‐sequencing of the unprocessed jobs after each machine failure. Using these rules, we develop a branch‐and‐bound heuristic that allows us to solve problems of reasonable size. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 79–97, 2001     

Iterative coloring extension of a maximum clique

In this paper we present an improved branch and bound algorithm for the vertex coloring problem. The idea is to try to extend the coloring of a maximum clique to its adjacent vertices. If this succeeds, its successive neighbors are considered; in case of failure (i.e., in the case the initial colors are not sufficient), working on the subgraph induced by the maximum clique and its neighborhood, the lower bound is improved by seeking for an optimal coloring of this subgraph by branch and bound. The process is repeated iteratively until the whole graph is examined. The iterative scheme exploits a further lower bound obtained by integrating a simple algorithm into the maximum clique search, and a new method to compute upper bounds on subgraphs. Furthermore, a new branching rule and a method for the selection of the initial maximum clique are presented. Extensive computational results and comparisons with existing exact coloring algorithms on random graphs and benchmarks are given. © 2001 John Wiley & Sons, Inc. Naval Research Logistic 48: 518–550, 2001     

潜艇纯方位接敌跟踪航路优化方法探讨

潜艇利用纯方位定位跟踪系统对目标进行定位跟踪时 ,目标位置线在优化潜艇的接敌跟踪航路中具有重要的作用。通过研究目标位置点与目标位置线和目标方位之间的关系 ,构造出一个优化潜艇接敌跟踪航路模型     

某区域锅炉房节能改造措施及其效果

针对现有锅炉房供热中存在的诸如能源的大量浪费和不能充分满足热用户需求等问题,以某锅炉房节能改造为例,从区域锅炉房现有的条件下对系统实施三方面的改造:一是加装微机监控系统,二是加装锅炉分层给煤装置,三是风机的变频改造;并从技术和经济方面加以分析论证,改造方案合理,采取的措施得当,节能效果明显。     

城市规划与公众参与

城市的拥有者是公众,城市空间应是吸引大众活动的舞台。现代城市正在以复杂的和变化的方式进行着不断的演化,由于这种演化的不确定性、综合性,需要对其进行面对公众开放性规划与设计。公众参与在城市空间的塑造中,以及在地域文化的延续中起着重要的作用。通过强调城市形象的审美意识认同,宏观上对城市形象的系统把握,进而深入论述如何挖掘、构筑属于市民自己的风格城市。     

Case‐based reasoning and improved adaptive search for project scheduling

Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000     

战场环境下C3I系统效能研究

:C3I系统已成为现代化战争必不可少的重要组成部分 ,其效能分析也越来越受到人们的重视。首先对 C3I系统效能的含义做了分析 ,并在一般效能模型的基础上深入讨论了 C3I系统的作战效能 ,对 C3I系统作战效能的含义和计算进行了研究 ,给出了一种新的评价 C3I系统的方法     

地空导弹与弹道导弹的技术融合正在促使这两类导弹产生突破性的发展

地空导弹采用弹道导弹的抛物弹道技术 ,能够实现应用固体推进剂达到低质量远射程的目标。弹道导弹采用地空导弹末段弹道的寻的制导控制技术 ,可以达到降速、增程并实现末段有效制导控制和弹道机动的目标 ,从而大幅度提高命中精度和突防概率。地空导弹和弹道导弹之间的技术融合 ,已经开始并将很快形成这两类导弹的新一轮突破性的发展     

目标数据关联多因素分布式推理判决系统推理结构

目标数据关联多因素分布式推理判决系统 ,是一基于分布式判决分类系统理论进行目标数据关联分析的大规模推理判决系统 ,在C3I系统中有着广泛的应用前景。本文在分析推理判决系统的推理规则类型和状态类型的基础上 ,给出系统的推理结构图 ,该推理结构是正关联神经推理结构