Coalitions & the Legitimisation of UK Security Policy

Abstract

David Moore analyses the role of the Treasury in detemining and controlling defence policy and expenditure, and the place of the MoD within this function.     

战术互联网模拟训练系统军事总体问题研究

军事总体设计是技术总体设计的基础,是模拟训练系统设计的首要任务.对于战术互联网模拟训练系统军事总体设计中的有关问题,采用对比和比较法,对系统军事总体需求和框架进行了研究,明确了战术互联网模拟训练系统的训练方式、使用流程、功能体系等内容,为下一步系统的技术总体方案设计以及实现奠定了良好基础.     

影响图建模算法的改进

影响图建模方法是一种规范化的复杂系统建模方法,其实质是将表征复杂系统的参量及参量间的耦合关系进行分类,并以此为基础建立系统的数学模型.影响图建模算法就是将系统的参量及参量间的耦合关系进行分类的算法.目前使用的算法是James R.Burns于1979年提出的.该算法仅考虑了最小的反馈回路,而没有考虑影响图中存在的一般反馈回路,且一些操作造成了不必要的循环.在分析该算法的基础上,考虑了一般的反馈回路,并对原算法的操作步骤进行了优化重组.     

参数化时频分析的匀加速旋转目标ISAR成像

对于机动目标,运动补偿后目标相对于雷达的转动不能近似为匀速转动,而是更接近于匀加速转动,此时传统的距离多普勒成像算法不能得到很好的成像结果.分析总结了几种针对非匀速转动的时频联合分析算法,提出了一种基于参数化时频分析-AGCD快速算法的匀加速旋转目标成像算法,仿真表明了该算法具有精度高、速度快且无交叉项的优点,比原有的一些算法有较大的改进.     

A two product dynamic economic lot size production model with either-or production constraints

This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network.     

An operator theory of parametric programming for the generalized transportation problem: I. Basic theory

This paper gives a new organization of the theoretical results of the Generalized Transportation Problem with capacity constraints. A graph-theoretic approach is utilized to define the basis as a one-forest consisting of one-trees (a tree with an extra edge). Algorithmic development of the pivot-step is presented by the representation of a two-tree (a tree with two extra edges). Constructive procedures and proofs leading to an efficient computer code are provided. The basic definition of an operator theory which leads to the discussion of various operators is also given. In later papers we will present additional results on the operator theory for the generalized transportation problem based on the results in the present paper.     

An operator theory of parametric programming for the transportation problem-I

This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. An operator theory is developed and algorithms provided for applying rim and cost operators that effect the transformation of optimum solution associated with changes in rim conditions and unit costs. Bound operators that effect changes in upper bounds are shown to be equivalent to rim operators. The discussion in this paper is limited to basis preserving operators for which the changes in the data are such that the optimum basis structures are preserved.     

An economic model for planning strategic mobility posture

This paper describes a linear programming model used to perform cost-effectiveness analysis to determine the requirements for military strategic mobility resources. Expenditures for three classes of economic alternatives are considered: purchase of transportation resources; prepositioning of material; and augmentation of port facilities. The mix of economic alternatives that maximizes the effectiveness of the resultant transportation system is determined for a given investment level. By repeating the analysis for several levels of investment, a cost-effectiveness tradeoff curve can be developed.