灰色预测模型在非致命武器经济寿命预测中的应用

针对目前非致命武器经济寿命方面的研究相当缺乏的现状,结合非致命武器的自身特点,在全面分析装备全寿命周期费用的基础上,引入灰色理论,运用GM（1,1）模型对非致命武器的经济寿命周期费用进行估算和预测。通过分析,灰色预测模型具有较高的建模精度,预测方法和结果对非致命武器的经济寿命预测具有很强的实用性。     

最大面积避障矩形问题的解法

建立了在一个含有若干障碍点的矩形母域内求一个最大面积避障矩形问题的数学模型.通过分析避障矩形的几何特性,找到了求解这一含有0-1变量的非线性规划数学模型的一种特殊解法.     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Bounded flexibility in days‐on and days‐off scheduling

This article presents a flexible days‐on and days‐off scheduling problem and develops an exact branch and price (B&P) algorithm to find solutions. The main objective is to minimize the size of the total workforce required to cover time‐varying demand over a planning horizon that may extend up to 12 weeks. A new aspect of the problem is the general restriction that the number of consecutive days on and the number of consecutive days off must each fall within a predefined range. Moreover, the total assignment of working days in the planning horizon cannot exceed some maximum value. In the B&P framework, the master problem is stated as a set covering‐type problem whose columns are generated iteratively by solving one of three different subproblems. The first is an implicit model, the second is a resource constrained shortest path problem, and the third is a dynamic program. Computational experiments using both real‐word and randomly generated data show that workforce reductions up to 66% are possible with highly flexible days‐on and days‐off patterns. When evaluating the performance of the three subproblems, it was found that each yielded equivalent solutions but the dynamic program proved to be significantly more efficient. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 678–701, 2013     

Polaris,East of Suez: British Plans for a Nuclear Force in the Indo-Pacific, 1964–1968

This article investigates the little-known plans formulated by Harold Wilson's Labour government to deploy Polaris submarines in the Indo-Pacific region. The scheme was first proposed in 1965 as a response to several problems faced by British policy-makers, including China's acquisition of a nuclear capability, Britain's wish to maintain a meaningful position ‘East of Suez’ at reduced cost, and German pressure for equal treatment within NATO on nuclear matters. Despite extensive high-level discussion, the plans were finally abandoned in mid-1968, as Labour moved more decisively to forsake the world role.     

A LONG‐RUN ANALYSIS OF DEFENCE SPENDING IN THE NATO COUNTRIES (1960–99)

This paper analyses the long‐run demand for defence output through a homogeneous treatment of 15 NATO member countries between 1960 and 1999. We carry out a progressive study of the interactions between either defence spending or defence burden and their main determinants: income, external threat and allied military spending. To that end, we use time‐series analysis with endogenously determined structural breaks. We further consider individual country functions related to one another through a common correlated effects method, in order to take into account explicitly the connections between members of an alliance.     

半预制破片PELE弹丸对武装直升机毁伤效能

为研究半预制破片PELE弹丸对武装直升机的毁伤效能,选取代表性的阿帕奇武装直升机为研究对象,建立了阿帕奇武装直升机关键部件驾驶舱和发动机舱的等效模型,在此基础上应用ANSYS/LS-DYNA就半预制破片PELE弹丸对阿帕奇武装直升机的毁伤效能进行了数值分析.结果表明:半预制破片PELE弹丸能有效穿透阿帕奇武装直升机的防护装甲,在穿透防护靶后弹丸壳体大面积碎裂,产生大量具有较高轴向剩余速度和一定径向飞散速度的破片,形成一个大面积的破片场,这些破片及弹丸剩余部分可对武装直升机内部人员及仪器设备造成有效毁伤,极大地增强了PELE弹丸的毁伤效能.     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017     

Exact analysis of (R,s, S) inventory control systems with lost sales and zero lead time

We study an (R, s, S) inventory control policy with stochastic demand, lost sales, zero lead‐time and a target service level to be satisfied. The system is modeled as a discrete time Markov chain for which we present a novel approach to derive exact closed‐form solutions for the limiting distribution of the on‐hand inventory level at the end of a review period, given the reorder level (s) and order‐up‐to level (S). We then establish a relationship between the limiting distributions for adjacent values of the reorder point that is used in an efficient recursive algorithm to determine the optimal parameter values of the (R, s, S) replenishment policy. The algorithm is easy to implement and entails less effort than solving the steady‐state equations for the corresponding Markov model. Point‐of‐use hospital inventory systems share the essential characteristics of the inventory system we model, and a case study using real data from such a system shows that with our approach, optimal policies with significant savings in inventory management effort are easily obtained for a large family of items.     

C4ISR/M&S互操作HLA仿真设施

基于仿真互操作标准组织(Simulation Interoperability Standards Organization,SISO)C4ISR/M&S互操作技术参考模型和高层体系结构(High Level Architecture,HLA),C4ISR/M&S互操作HLA仿真设施为架构仿真系统运行体系提出了面向方面框架(Aspect Oriented Framework,AOF)和应用服务平台的技术.AOF能控制C4ISR/M&S互操作所引起的仿真系统结构复杂化,应用服务平台则能丰富仿真系统的运行环境,仿真设施可作为仿真系统通用运行体系的基础组件,支持复杂互操作系统开发.