一种用于 C~3I 系统的异类传感器数据融合算法

在文献〔８〕和〔９〕基础上研究了在不等样本情况下的异类传感器——雷达与ＥＳＭ——的航迹相关问题。首先,基于模糊综合函数找出两个最可能的雷达与ＥＳＭ航迹相关对,然后,利用统计理论并采用多门限决策方法进行雷达与ＥＳＭ航迹相关判决。仿真结果表明,与文献〔８〕的方法相比,在雷达航迹比较多的情况下,本文所提出的在不等样本情况下的雷达与ＥＳＭ相关算法具有与其很相近的性能,但计算量明显减少;而与文献〔９〕的方法相比,这里采用多门限决策方法又可同时减小两类错误概率。     

THE SUPPLY PRICE OF COMMITMENT: EVIDENCE FROM THE AIR FORCE ENLISTMENT BONUS PROGRAM

In fiscal year 1999, the US Air Force introduced a bonus program designed to encourage longer enlistment terms. This regime shift provides a unique opportunity to estimate the elasticity of labor supply at a new margin: the length of the employment contract. A $5000 bonus differential is estimated to increase the probability that a recruit will choose a 6‐year enlistment over a 4‐year enlistment by 30 percentage points. The program is found to be cost‐effective relative to other policies to increase man‐years.     

An exact analysis of a joint production‐inventory problem in two‐echelon inventory systems

We consider a two‐echelon inventory system with a manufacturer operating from a warehouse supplying multiple distribution centers (DCs) that satisfy the demand originating from multiple sources. The manufacturer has a finite production capacity and production times are stochastic. Demand from each source follows an independent Poisson process. We assume that the transportation times between the warehouse and DCs may be positive which may require keeping inventory at both the warehouse and DCs. Inventory in both echelons is managed using the base‐stock policy. Each demand source can procure the product from one or more DCs, each incurring a different fulfilment cost. The objective is to determine the optimal base‐stock levels at the warehouse and DCs as well as the assignment of the demand sources to the DCs so that the sum of inventory holding, backlog, and transportation costs is minimized. We obtain a simple equation for finding the optimal base‐stock level at each DC and an upper bound for the optimal base‐stock level at the warehouse. We demonstrate several managerial insights including that the demand from each source is optimally fulfilled entirely from a single distribution center, and as the system's utilization approaches 1, the optimal base‐stock level increases in the transportation time at a rate equal to the demand rate arriving at the DC. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于熵权的导弹型号论证方案评价模型

针对导弹型号论证决策中的部分属性信息具有模糊性,给出了一种基于熵权的模糊信息多目标决策方案评估方法。该方法在只有模糊判断矩阵而没有专家权重的情况下,通过多指标的模糊评价矩阵的熵权计算,得到各属性信息提供的有用信息量的程度;再通过各方案与理想点的距离,得出了可信度较高的优选方案。     

弹药供应站配置地域选定辅助决策模型

建立了用于评估弹药供应站配置地域的指标体系, 利用层次分析法对各个指标进行了权重分配, 得到了弹药供应站配置方案的择优方法, 并运用模型进行了模拟决策。本模型已经在计算机上编程实现。     

ABDARDSS中基于候选消除学习算法的知识推理

飞机战伤评估和修理的知识表示与推理机制,是建立飞机战伤评估与修理决策支持系统(ABDARDSS)需要解决的一个关键问题.采用一种候选消除算法来提取战伤评估与修理样本数据的变型空间,以变型空间实现战伤评估与修理决策支持系统中的知识表示和推理.对于ABDARDSS来说,候选消除学习算法是一种新的有效的知识推理方法.     

军事目标打击的辅助决策系统设计研究

现代战争中“目标”已经成为现代指挥作战的“核心”。文章从研究“目标”出发,根据目标选择与打击的特点和辅助决策任务,提出了军事目标打击辅助决策系统设计的初步设想,阐述了该系统的系统结构、系统实现的流程和系统功能,并做了可行性分析。该系统在信息化条件下,较好地为指挥员进行军事目标打击提供了有效的决策工具,更好地加快了军队指挥自动化的步伐。     

一种新的导弹发射技术辅助决策系统架构

导弹武器系统特有的作战特点,以及专家知识的不完备性,使得传统的辅助决策系统难以在短时间内作出准确、有效的决策。因此,提出一种新的导弹发射技术辅助决策系统的总体结构及实现相应功能的模型,即采用BP神经网络-遗传算法(GA)实现辅助决策,基于有向图实现故障诊断,通过决策融合生成图形决策方案,缩短了决策时间,提高了决策的有效性。     

Optimal power control in a wireless network using a model with stochastic link coefficients

This paper addresses optimal power allocation in a wireless communication network under uncertainty. The paper introduces a framework for optimal transmit power allocation in a wireless network where both the useful and interference coefficients are random. The new approach to power control is based on a stochastic programming formulation with probabilistic SIR constraints. This allows to state the power allocation problem as a convex optimization problem assuming normally or log‐normally distributed communication link coefficients. Numerical examples illustrate the performance of the optimal stochastic power allocation. A distributed algorithm for the decentralized solution of the stochastic power allocation problem is discussed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Aggregating courier deliveries

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.