基于组成要素的作战体系构建方法研究

针对当前作战体系构建理论研究中的若干问题,提出了基于组成要素的作战体系构建方法,对作战体系进行了模块分解和功能要求分析,得出了基于组成要素构建一般作战体系的框架图,可为同类作战体系构建提供参考。     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

大容量储能发电机并联运行励磁控制算法

大容量储能发电机作为脉冲电源，整流后通过逆变器向大功率脉冲负载供电。采用储能发电机直流侧并联方式工作，可以有效提高系统带载能力与可靠性。当并联运行的储能发电机转速不同时，根据转速合理分配电机释放功率可以有效提高系统工作效能，因此需要设计一种具有功率调节功能的励磁控制算法。在电压、电流双闭环控制的基础上，引入功率前馈控制，推导并求解了前馈功率与励磁电流关系以及控制参数，并根据电机初始转速设计了功率分配算法。仿真试验结果表明，功率前馈控制在励磁控制过程中起主导作用，有效分配储能电机释放功率大小，提高了励磁电流响应速度，抑制了负载功率扰动对励磁控制系统的影响。     

Mean residual life of coherent systems consisting of multiple types of dependent components

Mean residual life is a useful dynamic characteristic to study reliability of a system. It has been widely considered in the literature not only for single unit systems but also for coherent systems. This article is concerned with the study of mean residual life for a coherent system that consists of multiple types of dependent components. In particular, the survival signature based generalized mixture representation is obtained for the survival function of a coherent system and it is used to evaluate the mean residual life function. Furthermore, two mean residual life functions under different conditional events on components’ lifetimes are also defined and studied.     

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     

无线认知网络中一种分布式最大频谱分配算法

无线认知网络被认为是下一代无线网络的核心架构之一。该网络能解决日益增长的频谱使用需求和低下的频谱使用率之间的矛盾。通过伺机接入临时可用频谱资源,其频谱利用率能得到大幅的提高。由于频谱资源分配是影响频谱资源利用率的关键,因此如何对频谱资源进行高效的分配一直是无线认知网络的重要研究领域之一。我们证明了在异构频谱使用概率条件下的最优频谱分配是NP难的问题。为了有效解决该问题,本文提出了一种基于分布式最大加权独立集的频谱分配算法——DMWIS。该算法的时间复杂度为O(V2/2)。通过大量的仿真实验,验证了在90%以上的不同随机网络环境下算法能在3轮内收敛,并且该算法一般能获得最优解90%的性能。     

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     

基于声诱饵对抗的火箭助飞鱼雷命中概率仿真

针对舰艇使用火箭助飞鱼雷与潜艇对抗的典型样式,分别建立了潜艇自航式声诱饵对抗声自导鱼雷模型、火箭助飞鱼雷对目标提前位置射击参数解算模型、鱼雷运动模型、潜艇机动模型和命中概率计算模型,采用模拟法计算了火箭助飞鱼雷单雷射击和双雷齐射的命中概率,总结了射击距离和潜艇航速对火箭助飞鱼雷命中概率的影响,研究结论可为火箭助飞鱼雷作战使用提供理论指导。