Counterinsurgency American style: Considering David Petraeus and twenty-first century irregular war

This article examines the complex legacy of David Petraeus who was a key figure in the emergence of the US military shift towards counterinsurgency doctrine in the years after 2006. Although Petraeus has been perceived by critics as a publicity seeker, he can be credited with laying the foundations for a more serious commitment to COIN involving in particular in integrating conventional and Special Forces in arenas like village stability operations. The article looks a Petraeus's role in both Iraq and Afghanistan: it concludes that, in the case of Afghanistan, it is too early to assess whether counterinsurgency has had a decisive impact of the outcome of the war against the Taliban.     

MFC环境下GLStudio组件交互方法

针对MFC环境下GLStudio组件交互困难的问题,从GLStudio使用环境和开发基本流程人手,提出了一种MFC环境下GLStudio组件绘制和交互方法,阐述了虚拟组件操作和MFC环境下GLStudioAPI的对应关系,并给出了连续旋钮人机交互的具体算法．     

全电坦克炮控系统升压电源偏磁抑制方法

基于推挽拓扑结构设计,研究了一种全电坦克炮控系统用升压电源,但推挽电路存在着难以消除的偏磁现象,使得升压电源的可靠性降低。详细阐述了推挽电路中偏磁现象产生的原因,针对性地提出了串入箝位电容、采用电流内环控制、优化电路布局等偏磁抑制方法。实验结果表明：所采用的推挽电路偏磁抑制方法具有结构简单、抑制效果好的优点,提高了全电坦克炮控系统升压电源的可靠性。     

目标定位和跟踪的卡尔曼滤波加 BP 神经网络的方法

首先分析了卡尔曼滤波应用于单目标定位与跟踪时需要校正的因素,接着用具有反向传播（ＢＰ）学习算法的前向网络,建立校正原理和校正网络体系结构,最后分别给出了它对第１类和第２类火控系统应用的数学模型。     

Optimization of strategic defenses to provide specified post-attack production capacities

This paper presents a model for choosing a minimum-cost mix of strategic defenses to assure that specified production capacities for several economic sectors survive after a nuclear attack. The defender selects a mix of strategic defenses for each of several geographic regions. The attacker chooses an allocation of attacking weapons to geographic regions, within specified weapon inventories. The attack is optimized against any economic sector. This formulation allows the defense planner the capability to assess the results of the optimal defense structure for a “worst case” attack. The model is a mathematical program with nonlinear programming problems in the constraints; an example of its application is given and is solved using recently developed optimization techniques.     

Lanchester-type models of warfare and optimal control

The optimization of the dynamics of combat (optimal distribution of fire over enemy target types) is studied through a sequence of idealized models by use of the mathematical theory of optimal control. The models are for combat over a period of time described by Lanchester-type equations with a choice of tactics available to one side and subject to change with time. The structure of optimal fire distribution policies is discussed with reference to the influence of combatant objectives, termination conditions of the conflict, type of attrition process, and variable attrition-rate coefficients. Implications for intelligence, command and control systems, and human decision making are pointed out. The use of such optimal control models for guiding extensions to differential games is discussed.     

An experimental comparison of solution algorithms for the single-machine tardiness problem

A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study.     

A computation procedure for the exact solution of location-allocation problems with rectangular distances

A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem.     

On the treatment of force-level constraints in times-equential combat problems

The treatment of force-level constraints in time-sequential combat optimization problems is illustrated by further studying the fire-programming problem of Isbell and Marlow. By using the theory of state variable inequality constraints from modern optimal control theory, sharper results are obtained on necessary conditions of optimality for an optimal fire-distribution policy (in several cases justifying conjectures made in previous analysis). This leads to simplification of the determination of the domains of controllability for extremals leading to the various terminal states of combat. (Additionally, some new results for the determination of boundary conditions for the adjoint variables in optimal control problems with state variable inequality constraints have arisen from this work.) Some further extensions of previous analysis of the fire-programming problem are also given. These clarify some key points in the solution synthesis. Some important military principles for target selection and the valuation of combat resources are deduced from the solution. As a result of this work, more general time-sequential combat optimization problems can be handled, and a more systematic solution procedure is developed.     

软件维护性度量和评价研究

分析了软件维护性度量的若干定性定量方法 ,介绍了用于软件维护性评价的技术和工具 ,指出了软件维护性度量和评价的进一步研究方向 ,对于提高软件的维护性具有一定的理论和工程意义。