关于ADC法评估C~4ISR系统效能中的可靠性

针对运用ADC法评估防空C4ISR系统效能中,可靠性是影响系统效能的重要因素,对C4ISR系统的可靠性进行研究,重点分析了软件及通信网可靠性的估算公式,并在此基础上建立可用性A和可信性D数学模型.最后,通过实例分析证明了可靠性对系统效能评估的重要影响.     

拦截高速机动目标的捕获区及微分对策导引律

针对高速机动目标拦截场景,研究末制导段捕获区存在条件及微分对策导引律问题.建立弹目相对运动模型并引入控制动力学模型,采用终端投影方法对相对运动模型进行降阶处理;基于微分对策理论推导一种解析形式捕获区,并具体到直/气复合控制导弹对机动目标的拦截中,该捕获区的存在能够保证对任意机动目标进行准确捕获;重新选取性能指标,将目标...     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

集群搜索对策理论在搜索-规避对抗中的应用

使用对策论的观点和方法 ,结合搜索论的知识 ,建立了一类搜索 -规避对抗对策模型 .对模型的结论做了系统分析 ,考虑了对策双方的最优策略及使用 .     

动态网络安全的框架模型

针对现有的静态网络安全模型存在的问题,提出了一种动态网络安全框架模型。该安全模型利用各种安全组件构建了立体的五层防御体系,并实现了防御能力的动态升级。     

沙漠之狐军事行动特点及其思考

通过沙漠之狐行动过程综述,总结了此次军事行动呈现的特点。加强战区导弹攻防对抗深入研究,高度重视防御体系建设已成为当务之急。     

98海湾危机回顾及几点启示

比较全面地叙述了９８海湾危机的成因,英美两国兵力集结情况,重点分析了兵力集结过程中所出现的特点,最后给出了所带来的启示。     

What is the global landpower network and what value might it provide?

US national security guidance, as well as the US Army’s operational experiences since 2001, emphasizes the importance of working closely with partner countries to achieve US strategic objectives. The US Army has introduced the global landpower network (GLN) concept as a means to integrate, sustain and advance the Army’s considerable ongoing efforts to meet US national security guidance. This study develops the GLN concept further, and addresses three questions. What benefits can the GLN provide the Army? What are the essential components of the GLN? What options exist for implementing the GLN concept? By developing the GLN concept, the Army has the opportunity to transition the GLN from an often ad hoc and reactive set of relationships to one that the Army more self-consciously prioritizes and leverages as a resource to meet US strategic objectives.     

Dynamic pricing under first order Markovian competition

We evaluate the effect of competition on prices, profits, and consumers' surplus in multiperiod, finite horizon, dynamic pricing settings. In our base model, a single myopic consumer visits two competing retailers, who offer identical goods, in a (first order Markovian) probabilistic fashion—if the posted price exceeds the consumer's valuation for the good, he returns to the same store in the following period with a certain probability. We find that even a small reduction in the return probability from one—which corresponds to the monopoly case at which prices decline linearly—is sufficient to revert the price decline from a linear into an exponential shape. Each retailer's profit is particularly sensitive to changes in his return probability when it is relatively high, and is maximized under complete loyalty behavior (i.e., return probability is one). On the other hand, consumer surplus is maximized under complete switching behavior (i.e., return probability is zero). In the presence of many similar consumers, the insights remain valid. We further focus on the extreme scenario where all consumers follow a complete switching behavior, to derive sharp bounds, and also consider the instance where, in this setting, myopic consumers are replaced with strategic consumers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011