ON THE CHOICE OF MULTI-TASK R&D DEFENSE PROJECTS: A CASE STUDY OF The ISRAELI MISSILE DEFENSE SYSTEM

Investments in R&D constitute a major share of the expenditures of the hi-tech industry since, generally, they enable firms to successfully compete in the rapidly and constantly changing markets for hi-tech products and services. The role of R&D projects is particularly important in the areas of defense and homeland security due to the nature of warfare and the continuous threats posed by arms races and by terror organizations. This study analyzes the choice of the R&D projects designed to counter multiple related military threats. It develops the methodology required to assess whether it is preferable to develop one project to thwart several related threats, or several distinct projects, each of which provides an answer to one specific threat or a partial set of the threats. An analytic solution is provided and assessed for two simple models with two related threats. A solution of the model is then provided for any number of related threats, using a dynamic programming methodology. Finally, we demonstrate the usefulness of our model and methodology to Israel’s missile defense problem; that is, we show how to optimally develop systems aimed at thwarting the multiple threats of short-, medium-, and long-range missiles.     

THE ‘EXPANDING TORRENT’: BRITISH MILITARY ASSISTANCE TO THE SOUTHERN AFRICAN REGION

In May 2012, Zambia's Inspector-General of Police announced a crackdown on sex workers. This commentary discusses the rationale behind this proposed crackdown and the problems associated with such a policy response.     

一类具有时滞的生态一流行病系统的稳定性和Hopf分支

讨论一类食饵染病的时滞捕食一被捕食者模型,通过分析特征方程,得到正平衡点局部稳定和Hopf分支存在的条件．同时,应用中一tl,流形定理和规范型理论研究正平衡点处Hopf分支方向和分支周期解的稳定性．最后,通过数值模拟对理论结果进行了说明．     

复杂环境下多雷达点迹融合

针对系统误差、杂波干扰等对点迹融合处理系统的影响,结合工程实践,提出了一种处理复杂环境下多雷达点迹融合结构框架,给出了存在系统误差情形下的多雷达航迹起始、虚假目标抑制、雷达误差配准等模型和算法。仿真结果表明,提出的框架、模型和算法能够有效处理多雷达点迹融合问题。     

基于复杂网络的作战体系网络模型分析

运用复杂网络方法,构建了作战体系网络模型,分析了作战体系网络的基本特征,揭示了作战网络主要参数与作战体系真实特性之间的关系,得到了基于信息系统体系作战战法运用的一些启示。     

防空预警监视雷达系统的发展与对策

文章以美“空海一体战”理论的提出为背景,深刻分析了新战略背景下我防空预警监视雷达系统所面临的现实威胁和挑战,结合我军防空预警监视雷达系统现状,对该系统的建设发展问题进行了多方位分析和研究,指出朝着基于系统构成优化、作战运用优化以及信息高效融合的一体化方向发展是我防空预警监视雷达系统在新战略背景下的必然选择.     

基于效果的炮兵行动C2系统动力学建模与仿真

一体化联合作战参战军兵种多、指挥控制(C2)与协调复杂。围绕炮兵行动特点要求,运用系统动力学理论建立联合作战炮兵行动指挥控制的系统动力学模型,研究常规打击和基于效果作战两种指挥控制模式下炮兵行动所产生的不同结果及其原因,并给合作战想定仿真验证,得出较为可靠的结论,为解决联合作战炮兵行动精确指挥控制与协调提供一种有效途径     

Asymptotic analysis of periodic policies for the inventory routing problem

In this article, a distribution system is studied where the sum of transportation and inventory costs is to be minimized. The inventory holding cost is assumed to be the same for all retailers. A fixed partition (FP) periodic policy is proposed with tight asymptotic worst‐case performance of 3/2 with respect to the best possible policy. This bound cannot be improved in the class of FP periodic policies. In partition‐based PB policies, the retailers are first partitioned into sets and then the sets are grouped in such a way that sets of retailers within a group are served together at selected times. A PB periodic, policy is presented with tight worst‐case asymptotic performance of with respect to the best possible policy. This latter performance improves the worst‐case asymptotic performance of of the previously best known policy for this problem. We also show that the proposed PB periodic policy has the best worst‐case asymptotic performance within the class of PB policies. Finally, practical heuristics inspired by the analyzed policies are designed and tested. The asymptotic worst–case performances of the heuristics are shown to be the same of those of the analyzed policies. Computational results show that the heuristics suggested are less than 6.4% on average from a lower bound on the optimal cost when 50 or more retailers are involved. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013     

The graph association problem: Mathematical models and a lagrangian heuristic

Graph association is the problem of merging many graphs that collectively describe a set of possibly repetitive entities and relationships into a single graph that contains unique entities and relationships. As a form of data association, graph association can be used to identify when two sensors are observing the same object so information from both sensors can be combined and analyzed in a meaningful and consistent way. Graph association between two graphs is related to the problem of graph matching, and between multiple graphs it is related to the common labeling of a graph set (also known as multiple graph matching) problem. This article contribution is to formulate graph association as a binary linear program and introduce a heuristic for solving multiple graph association using a Lagrangian relaxation approach to address issues with between‐graph transitivity requirements. The algorithms are tested on a representative dataset. The developed model formulation was found to accurately solve the graph association problem. Furthermore, the Lagrangian heuristic was found to solve the developed model within 3% of optimal on many problem instances, and found better solutions to large problems than is possible by directly using CPLEX. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Inequality‐based reliability estimates for complex systems

Full‐system testing for large‐scale systems is often infeasible or very costly. Thus, when estimating system reliability, it is desirable to use a method that uses subsystem tests, which are often less expensive and more feasible. This article presents a method for bounding full‐system reliabilities based on subsystem tests and, if available, full‐system tests. The method does not require that subsystems be independent. It accounts for dependencies through the use of certain probability inequalities. The inequalities provide the basis for valid reliability calculations while not requiring independent subsystems or full‐system tests. The inequalities allow for test information on pairwise subsystem failure modes to be incorporated, thereby improving the bound on system reliability. We illustrate some of the properties of the estimates via an example application. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013