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.     

正反向量子斯特林循环有限时间热力学性能界限和优化准则

研究了正反向量子斯特林循环的最优性能.在经典极限下,导出了循环的有限时间热力学性能界限和优化准则.得到了斯特林热机、制冷机和热泵特性参数之间的优化关系.     

基于旋量方法的高超声速飞行器三维非线性伪最优制导律设计

针对高超声速飞行器制导过程中的通道耦合问题,设计一种基于旋量方法的三维非线性伪最优制导律。引入角度矢量、视线旋量、视线旋量速度等概念,通过等价性证明,得出视线旋量、视线旋量速度控制分别与视线方位、视线角速度控制具有一致性的结论,从而将制导问题转化为视线旋量和旋量速度的控制问题;基于旋量方法构建弹目视线旋量、视线旋量速度模型,构建得到飞行器制导的三维非线性模型;为避免直接求解Riccati微分方程过程的复杂性,引入伪控制变量,将三维非线性制导模型转化为线性制导模型;分别针对无终端约束和有终端约束情况,基于二次型最优方法得到三维非线性伪最优制导律。该制导律避免了通道解耦,其制导参数又满足一定物理意义下的最优性。仿真结果验证了所设计制导律的有效性。     

考虑弹体动态特性的机动效率约束导引律

针对考虑交会角和过载约束导引律在大机动时能量损失大的问题,提出一种考虑导弹机动效率的多约束制导律。应用最优二次型原理推导出考虑一阶弹体延迟的时变导引系数闭环次优制导形式,将导弹机动时刻阻力系数引入时变权系数,并通过迭代确定机动效率约束边界。将时变约束表示成剩余时间与弹体延迟时间的函数,代入制导指令,进行弹道仿真。结果表明,对于常值与机动目标,文中制导律与过载约束导引律同只考虑交会角约束的导引律相比,对目标均能实现末端弹道成型要求,而考虑机动效率的制导指令分配更为合理,在避免指令加速度饱和的同时有效降低了拦截末端速度损耗,提高制导精度与毁伤效果。且该制导律中时变权系数无须配平求解,在保证精度的同时极大地提高了迭代速度。     

时间序列分析中的模型定阶策略

模型的定阶问题是时间序列分析(包括参数谱估计、系统辨识,回归分析)研究领域中的一个重要问题。本文对现有的数种模型定阶方法,进行了分析、讨论和归纳,指出了它们所适用的场合及优劣。     

连续求解样本协方差矩阵迹的快速递推算法

为解决当样本数据不断增加时,利用传统方法反复计算样本协方差迹耗时多的缺点,提出了一种快速递推算法。理论分析和仿真试验都表明,算法的时间复杂度比传统的方法降低了一个数量级,从而大大减少了计算时间。     

Bivariate models from univariate life distributions: A characterization cum modeling approach

Bivariate life distribution models are of importance for studying interdependent components. We present a generic approach by introducing a new concept of characterized model in stead of a characterized distribution. It strikes a balance between characterization and modeling approaches to eliminate their individual limitations and incorporate their respective strengths. The proposed model, being a characterized one, admits many important properties irrespective of the choice of marginal distributions. The retention of univariate IFR, DFR, IFRA, DFRA, NBU, and NWU class properties in the bivariate setup has been ensured along with some results on series combinations and convolution. No other models, available in the literature, can ensure simultaneous retention of these fundamental and extremely important class properties. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

灾害应急反应建模与仿真

为了满足多智能体应急反应仿真的需求,首先对构建多智能体应急反应仿真模拟框架的复杂性进行了分析,在此基础上提出并设计了组件式仿真模拟框架.采用本体(Ontology)建模、语义网模型及产生式规则推理等理论方法构建了仿真模拟框架的场景建模模块、人员Agent建模模块等组件.最后对依照上述研究内容所开发的原型系统进行了测试,对测试结果进行了分析,结果表明该框架能够有效满足多智能体应急反应仿真的建模需求.