系统生存性概念在指挥控制系统中的应用

系统生存性是指一个系统在受到攻击、出现错误或发生紧急事件时完成其任务的能力。指挥控制系统是现代战争中部队实施高效指挥与协调控制的主要手段。通过分析指挥控制系统的特点和存在的问题 ,在定义和分析生存性基础上 ,提出了从生存性角度设计指挥控制系统的观点。     

液化石油气火灾的预防及扑救

在分析液化石油气的组成成份及其理化性质的基础上,针对液化石油气的火灾危险性及火灾特点,提出了防火防爆及火灾扑救措施.     

论化工企业的防火设计

通过分析现行化工企业防火设计的基本做法和趋势,提出化工企业防火设计的要点及应注意的问题.     

美军武装直升机电子战设备的现状与发展趋势

介绍了武装直升机在现代战场上面临的种种威胁,重点介绍了美军武装直升机目前装备的电子战设备和尚处于研制中的新一代综合性电子战设备,分析了美军武装直升机电子战设备的发展趋势。     

大学生武术运动员赛前心理训练法运用初探

在赛前武术训练过程中 ,根据大学生运动员的特点和体育心理学原理 ,科学地运用心理训练方法 ,结合技术训练改善训练质量、提高武术表现能力是非常有效的。本文对此进行了有益的探索     

对光的半波损失的探讨

本文根据光的电磁波理论 ,对光的半波损失产生的条件及本质进行了深入的探讨 ,并对几个光学实验进行了分析。证明了光只有在特定的角度入射时才会发生半波损失 ,在一般斜入射时 ,反射光并没有半波损失 ,但有相位的突变     

教考结合 教学相长——公关文秘专业考核方式改革初探

本文论述了公关文秘专业深化改革考核方法的指导思想、具体做法、配套措施和实施效果。结合具体课程重点阐述了案例讨论、情景模拟、实地调查、卷面考试等多种方式结合的考核方法     

试论屈原的人生观

屈原的人生观是以立志成名、追求理想、进德修业、乐观向上为主要特征的 ,表现出了胸襟宽阔、锐意进取、昂扬奋发的气概。它能够使人从中获得极大的精神鼓舞和深刻的人生启迪     

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