机载光电传感器视轴指向的智能辅助决策方法

机载光电传感器视轴应尽可能接近目标线,以缩小指向偏差而不使目标偏离传感器瞬时视场,飞行员在复杂的战场态势下进行视轴操控具有一定困难。针对该问题,提出了一种机载光电传感器视轴指向的智能辅助决策方法,该方法以传感器视轴指向的数学模型为基础,通过专家知识建立引导规则,完成目标与各传感器的配对;计算配对后的各传感器视轴指向偏差和偏差变化率,采用模糊控制算法得出视轴偏移率,引导各传感器视轴指向与之配对的目标。仿真结果表明了该方法能够合理引导各传感器视轴指向目标,并能将视轴指向偏差缩小在很小的范围。     

红外/雷达传感器协同跟踪算法研究

通常情况下 ,主动传感器在检测到目标之前就暴露了携带它的飞行器 ,因此 ,在作战环境下 ,限制主动检测设备的使用是必要的。被动传感器工作时具有隐蔽性 ,在现代军事跟踪系统中起着重要作用。研究了红外 /雷达的协同跟踪 ,以满足跟踪精度和隐蔽性双重要求     

战场目标声/震侦察与识别

介绍了一个采用被动侦察体制的多传感器侦察系统。在研究了地面战场典型目标的噪声场和地震动场产生机理的基础上 ,对战场目标噪声信号和地震动信号进行功率谱估计 ,分析了各种目标的线谱特性。设计了拓扑结构合适的 BP神经网络分类器 ,可以有效地分类识别战场典型目标     

装备器材库温湿度监控系统的设计与实现

军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计.     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

磁悬挂天平五自由度位置传感器的数学分析

磁悬挂平天的位置传感器具有一定的特殊性,它需要同时获取被悬挂的飞行器模型的多自由度位置分量。本文对这一问题进行了研究,并讨论了其工程实现问题。