X频段在地面警戒雷达中的应用特性

针对X频段在地面警戒雷达中的应用问题,在频段优势、对抗能力、机动能力方面,对X频段地面警戒雷达作了详细分析,同时论述了它在噪声背景和杂波背景下的性能、探测能力、系统特性,并提出了应采取的技术措施.通过实例表明该频段雷达具有一定的探测能力和抗干扰能力.     

Hopfield神经网络的防空火力最优分配问题

火力的最优分配是作战计划的重要内容,它包含火力单位特性、目标单位特性、最优准则、射击条件四个方面的内容。简要介绍了Hopfield神经网络的基础知识,建立了防空自动化指挥系统中火力分配的Hopfield神经网络算法一般模型,在此基础上,阐述了利用该算法在火力分配中的一般应用,并通过在计算机上借助C语言编程实现了这一模型,得出了一种比较合理可行的火力分配方案。     

Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Analysis of a machine repair problem with an unreliable server and phase type repairs and services

In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003     

Network reliability assessment in a random environment

In this paper we consider networks that consist of components operating under a randomly changing common environment. Our work is motivated by power system networks that are subject to fluctuating weather conditions over time that affect the performance of the network. We develop a general setup for any network that is subject to such environment and present results for network reliability assessment under two repair scenarios. We also present Bayesian analysis of network failure data and illustrate how reliability predictions can be obtained for the network. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 574–591, 2003     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Threshold optimization for weighted voting classifiers

Weighted voting classifiers considered in this paper consist of N units each providing individual classification decisions. The entire system output is based on tallying the weighted votes for each decision and choosing the one which has total support weight exceeding a certain threshold. Each individual unit may abstain from voting. The entire system may also abstain from voting if no decision support weight exceeds the threshold. Existing methods of evaluating the reliability of weighted voting systems can be applied to limited special cases of these systems and impose some restrictions on their parameters. In this paper a universal generating function method is suggested which allows the reliability of weighted voting classifiers to be exactly evaluated without imposing constraints on unit weights. Based on this method, the classifier reliability is determined as a function of a threshold factor, and a procedure is suggested for finding the threshold which minimizes the cost of damage caused by classifier failures (misclassification and abstention may have different price.) Dynamic and static threshold voting rules are considered and compared. A method of analyzing the influence of units' availability on the entire classifier reliability is suggested, and illustrative examples are presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 322–344, 2003.     

被掩护地面固定目标不受空中打击分析

重点分析了被掩护地面固定目标不受空中打击的相关因素,并定量地分析了敌空袭兵器攻击地面被掩护目标时所需的数量,从而为地面防空建立最佳的防空部署提供依据。因为防空兵群对空袭兵器的射击次数与防空兵群的杀伤区面积成线性关系,所以在探讨如何部署防空兵力时,以防空兵群的杀伤区面积为准则来建立线性规划模型。     

多站多目标雷达数据融合

多站多目标跟踪是雷达数据融合的主要问题。提出了一种对测量数据聚类,在类间进行数据融合,之后基于目标的融合状态,采用强跟踪滤波器(STF)对多目标进行跟踪。利用上述方法,进行了各种态势下的仿真实验。     

舰炮弹道估计的卡尔曼滤波算法

针对舰炮弹道观测校正中的弹道最佳估计问题,提出了转换卡尔曼滤波算法,在三维空间里对观测弹丸飞行轨迹进行滤波,估计最佳弹道。给出了具体的算法并用某型海军舰炮进行了仿真,取得了较好效果。