基于定位原理的雷达与ESM航迹关联算法

雷达与ESM传感器的数据关联是典型的异类传感器数据关联。将交叉定位原理引入到航迹关联算法研究中,将定位原理与统计双门限航迹关联思想结合起来,提高了正确关联率。最后,对该算法进行仿真实验,证明了该算法的正确性和有效性。     

激光武器复合轴跟踪瞄准的稳定性分析

复合轴跟踪技术是激光武器精确跟踪瞄准目标的关键技术之一,掌握这门关键技术至关重要。对复合轴跟踪切换的视场匹配和系统设计时的粗、精跟踪系统的带宽比进行分析,从仿真结果得出在设计激光武器复合轴跟踪系统时要对粗、精跟踪系统的带宽和跟踪视场合理分配,选择合适的带宽比以达到跟踪切换的平滑性,实现对目标的精确跟踪。为复合轴跟踪控制系统的设计提供了一些参考思路,也对实现激光武器对目标的精确瞄准有一定的科学参考价值。     

核化环境空间建模及核武器综合毁伤效应分析算法

针对核化环境以及核武器毁伤效应的特点,提出了一种多分辨率渐进柱状树模型实现核化环境的三维空间数据的建模。为了节省存储空间,提出了线性编码方法对多分辨率渐进柱状树模型进行存储,并且基于M orton码技术实现了核武器综合毁伤效应的空间分析算法。     

一种改进的跳频信号信道化检测方法

在通信对抗中,对目标跳频信号进行有效检测是对该信号进行后续处理及实施干扰的前提,利用信道化检测方法实现对跳频信号的盲检测。侦察方作为通信非协作接收者,无法与目标信号发送端实现时间同步,导致信道化检测方法性能不佳,针对此问题,提出一种简单高效的判决门限改进算法。仿真结果表明:采用改进算法,虚警概率显著降低,在信噪比大于-2 dB时检测概率有一定的提高。最后给出了关于进一步提高信道化检测方法性能的几点策略。     

基于XML的指挥控制信息交互模型

针对传统指挥控制信息交互的有歧义、不同系统之间无法共享等缺陷,提出了基于XML的指挥控制信息交互方式,建立了基于XML的指挥控制信息交互模型结构,阐述了信息交互的内容、模式和交互机制,重点探讨了指挥控制信息交互的模式.根据指挥控制信息的分类和具体内容,定义了信息交互的C2IE-XML模式,并详细定义了该模式中的头元素和内容元素,内容要素中详细阐述了命令要素.该模型为指挥控制信息交互建立了基本的规范,也为信息共享创造了条件.     

Covariance of weibull order statistics

Let X₁ < X₂ <… < X_n denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?x^p), x > 0. Formulae for computing Cov (X_i, X_j) are well known, but they are difficult to use in practice. A simple approximation to Cov(X_i, X_j) is presented here, and its accuracy is discussed.     

Computerized scheduling of seagoing tankers

Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone.     

Generalized programming by linear approximation of the dual gradient: Equality constraints

A modified generalized programming procedure is presented for solving concave programming problems with equality constraints. The procedure constructs convenient linear approximations of the gradient of the dual and finds points where the approximating functions vanish. In the quadratic programming case, the procedure is finitely convergent. Global convergence is established for the non-quadratic case. Illustrative numerical examples are included.     

An n-step, 2-variable search algorithm for the component placement problem

The component placement problem is a specialization of the quadratic assignment problem that has been extensively studied for a decade and which is of considerable practical value. Recently, interest in component placement algorithms has risen primarily as a result of increased activity in the field of computer-aided design automation. This paper deals with the methodology of component placement and is based on the results of considerable operational experience. A tutorial presentation of tree search placement algorithms is provided, and an improved placement procedure is described which is demonstrated to be effective in generating near optimal solutions to the component placement problem. These solutions are completely reproducible and are obtained at an acceptable expenditure of computational resources. An additional objective is an assessment of performance of the class of near optimal algorithms. In particular, the question- how close to optimal are the near optimal solutions- is examined.