基于使命和方法框架的武器装备体系结构建模

针对武器装备体系的特点,提出一种基于使命和方法框架(M iss ions and M eans F ram ew ork,MM F)的武器装备体系结构建模方法。MM F模型包含使命的确定、方法的分配和使命完成的评价。采用使命-方法框架对武器装备体系进行组织和描述。在自上而下的规划和决策过程中,实现了使命的确定和方法的分配,以数据要素的形式完成对武器装备体系结构模型的构建。并以"超地平线登陆"作战装备体系为例,验证了该方法的可行性。     

改进的基于迭代算法的Weibull分布杂波模拟方法

杂波在雷达环境模拟中具有非常重要的地位.基于ZMNL(无记忆非线性变换法)的Weibull分布雷达杂波模型,可以很好地描述海杂波.但这种模型,因其非线性变换前后相关系数之间的关系公式复杂,很难用直观的方法求解.针对这一问题,提出了用迭代算法来求解该非线性公式的过程,并给出了应用该方法进行杂波仿真的具体步骤及仿真结果,证明了该方法的准确、可行性.     

系统动力学装甲兵进攻战斗中机降行动效果分析

围绕装甲机械化部队机降行动的作战特点,着眼于充分发挥机降行动击敌要害的战术优长,在新一代战斗条令的理论指导下,运用系统动力学方法和兰彻斯特战斗理论,建立装甲兵部队进攻战斗中机降行动的系统动力学模型,探索装甲兵部队在使用机降力量快速达成战术目的新方法,为指挥员科学使用这一战术手段提供了定量依据和有效的辅助决策支持.     

Technical note: Finite-time regret analysis of Kiefer-Wolfowitz stochastic approximation algorithm and nonparametric multi-product dynamic pricing with unknown demand

We consider the problem of nonparametric multi-product dynamic pricing with unknown demand and show that the problem may be formulated as an online model-free stochastic program, which can be solved by the classical Kiefer-Wolfowitz stochastic approximation (KWSA) algorithm. We prove that the expected cumulative regret of the KWSA algorithm is bounded above by where κ₁, κ₂ are positive constants and T is the number of periods for any T = 1, 2, … . Therefore, the regret of the KWSA algorithm grows in the order of , which achieves the lower bounds known for parametric dynamic pricing problems and shows that the nonparametric problems are not necessarily more difficult to solve than the parametric ones. Numerical experiments further demonstrate the effectiveness and efficiency of our proposed KW pricing policy by comparing with some pricing policies in the literature.     

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.     

试论经济力量向军事力量的转化

国家经济力量是军事力量的唯一源泉,军队的战斗力大小是军事力量强弱的重要标志,提高战斗力是军队一切工作的核心。但是,经济力量并不等于就是军事力量和战斗力,要把经济力量变为军队的战斗力还要经过一系列的转化过程。其整个转化过程可分为三个步骤,即经济力量向保障力量要素的转化;保障力量要素向保障能力的转化;保障能力向战斗力的转化。认真研究这些转化过程和转化环节,掌握其转化途径、方法和转化机制,对于促进和加快转化速度,提高转化效率和军队战斗力,具有十分重要的现实意义,是加强质量建军,实现两个根本转变和做好军事斗争准备的关键。     

An algorithm for the solution of a location problem with metric constraints

In many location problems, the solution is constrained to lie within a closed set. In this paper, optimal solutions to a special type of constrained location problem are characterized. In particular, the location problem with the solution constrained to be within a maximum distance of each demand point is considered, and an algorithm for its solution is developed and discussed.     

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.     

Covariance of weibull order statistics

Let X₁ < X₂ <… < X_n denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?x^p), x > 0. Formulae for computing Cov (X_i, X_j) are well known, but they are difficult to use in practice. A simple approximation to Cov(X_i, X_j) is presented here, and its accuracy is discussed.     

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.