Performance and properties of Q‐Statistic monitoring schemes

In this article, we study the Shewhart chart of Q statistics proposed for the detection of process mean shifts in start‐up processes and short runs. Exact expressions for the run‐length distribution of this chart are derived and evaluated using an efficient computational procedure. The procedure can be considerably faster than using direct simulation. We extend our work to analyze the practice of requiring multiple signals from the chart before responding, a practice sometimes followed with Shewhart charts. The results show that waiting to receive multiple signals severely reduces the probability of quickly detecting shifts in certain cases, and therefore may be considered a risky practice. Operational guidelines for practitioners implementing the chart are discussed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

基于粗糙集的空袭目标威胁评估排序

通过对影响空袭目标威胁排序因素的分析,针对定性与定量因素并存的情况,提出利用粗糙集理论进行威胁排序的方法.将已有决策表转化为成对比较表,利用优势属性集来推理决策规则,从而确定各目标的排序.案例表明此方法有效地解决了空袭目标威胁排序中的如何处理不确定信息的问题,大大提高了决策的准确性和客观性.     

基于粗糙集理论的防空C~3I系统目标威胁度综合评判

目标威胁度的估计是防空C3I系统中辅助决策的基础,各个威胁因素权系数的确定历来缺乏严格的数学基础。针对此问题,提出应用粗糙集理论,对空防对抗中各种威胁因素的原始数据进行挖掘,利用其求得各项威胁因素的属性的重要度,进行权值化处理,使得各项威胁因素权系数的确定有效克服了传统方法的主观性,使得各项权系数的确定更具客观性,提高威胁度估计的准确性。     

基于IJOTISPP的席位通信系统的设计与实现

一体化联合作战训练系统公共平台IJOTISPP（Integrated Joint Operation Training Information Systemic Public Platform）是军事训练信息系统建设的基础支撑平台。作为联合作战训练信息系统中的重要组成部分席位通信系统,也需在该平台上进行搭建与开发。介绍了IJOTISPP的基本原理,采用IJOTISPP提供的通信服务和Visual C＋＋.Net 2003开发工具进行系统开发,设计了该系统的基本架构,实现了各操作席位之间短信、文件的交互。现场运行表明：该系统具有操作简单、人机界面友好、性能稳定等特点,符合模拟训练中异地通信的要求。     

基于集对分析的后勤补给路线决策问题研究

由于现代战争后勤补给的快速性、安全性、决策者的主观性及获取情报信息的相关特性,使后勤补给路线的决策问题具有不确定性.利用集对分析对确定不确定信息的良好处理能力,对后勤补给路线的决策问题进行了研究.在选择路线时摒弃了传统的只考虑时间效益的思路,综合分析影响后勤补给路线选择的诸多因素,在遵循目的性、实用性、关联性、客观性和定量化原则基础之上,构建了后勤补给路线选择的指标体系;给出一种基于集对分析的决策定量化数学模型,对后勤补给路线的决策问题进行分析,为指挥员能够科学、合理地选择路线提供参考.     

非致命微波武器综合效能评估

针对非致命微波武器效能评估问题,通过分析影响非致命微波武器效能的关键因素,建立了非致命微波武器评价指标体系,提出了非致命微波武器效能的评估方法。采用一致性排序法确定各个指标的分配权重,并将Vague集应用到效能评估中,利用加权贴近度表征非致命微波武器效能的评估值。得到评估结果与实际情况相符,为国内非致命微波武器发展提供了理论依据。     

坦克搭乘输送平台海上射击目标决策方法

通过粗糙集方法分析影响坦克对岸滩目标射击效果的各种因素,建立坦克搭乘输送平台海上射击的知识表达系统,将射击效果作为决策属性,将已有数据或作战经验作为条件属性,依粗糙集理论方法挖掘射击决策规则,最后约简得到一些简单的射击决策规则,为单坦克射击决策提供依据。     

信息化战争呼唤训练方法创新

加强信息化战争条件下联合训练,是战争形态和作战方式变革的必然要求。本文从完善内容体系、探索组训模式、配套训练保障三个方面创新联合作战训练方法,打破传统训练方式的桎梏,坚持任务牵引,坚持扬弃并举,通过转变训练思维,提升训练方法的质量和层次。     

The solution to an open problem for a caching game

In a caching game introduced by Alpern et al. (Alpern et al., Lecture notes in computer science (2010) 220–233) a Hider who can dig to a total fixed depth normalized to 1 buries a fixed number of objects among n discrete locations. A Searcher who can dig to a total depth of h searches the locations with the aim of finding all of the hidden objects. If he does so, he wins, otherwise the Hider wins. This zero‐sum game is complicated to analyze even for small values of its parameters, and for the case of 2 hidden objects has been completely solved only when the game is played in up to 3 locations. For some values of h the solution of the game with 2 objects hidden in 4 locations is known, but the solution in the remaining cases was an open question recently highlighted by Fokkink et al. (Fokkink et al., Search theory: A game theoretic perspective (2014) 85–104). Here we solve the remaining cases of the game with 2 objects hidden in 4 locations. We also give some more general results for the game, in particular using a geometrical argument to show that when there are 2 objects hidden in n locations and n→∞, the value of the game is asymptotically equal to h/n for h≥n/2. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 23–31, 2016     

A characterization of optimal base‐stock levels for a multistage serial supply chain

In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016