A nuclear-armed North Korea without ICBMs: the best achievable objective

This article analyzes the North Korean nuclear crisis from a balance-of-power perspective. It is in the long-term interests of international peace for a secure and independent North Korea to serve as a buffer between US and Chinese ground forces. However, the conventional military advantage of the South Korean-American alliance over North Korea has grown drastically since the end of the Cold War, threatening North Korea’s survival. Since North Korea lacks any reliable ally, nuclear weapons represent its most cost-effective way to restore a balance of power and thus secure itself. Accepting security guarantees in exchange for its nuclear arsenal is rhetorically appealing but not a viable approach. North Korea’s development of intercontinental ballistic missiles (ICBMs), however, has overcompensated for the post-Cold War imbalance, inviting talk in Washington of waging a preventive war. Persuading North Korea to give up its ICBM capability, not its nuclear arsenal, should therefore be the primary objective of US diplomacy.     

美国军人荣辱观形成的社会文化机制

军人群体的荣辱观作为一种对外在环境和事物的价值判断,对军人的行为产生持久、有效的支配性影响。军人荣辱观的形成主要受社会文化环境、军队亚文化以及大众传媒、民间组织、国家战略、家庭等因素的影响。本文主要从经济因素、宗教因素、教育因素、阶级因素、种族因素等五个方面探讨了美国社会、文化对美军人荣辱观的影响。     

切实发挥旅团抓基层建设的作用

旅团是抓基层的“一线指挥部”。推进基层建设又好又快发展,要发挥好旅团机关的指导和服务职能。要强化责任意识,端正态度;要学会科学指导,提高领导水平;要求真务实,改进作风。     

向量巨型机高效程序设计技术

本文着重研究适应向量巨型机体系结构的高效程序设计技术。围绕减少指令流水线阻塞,提高多功能部件并行度,数据调度与局部化技术三个方面进行了深入的讨论,给出了一系列设计高效程序的方法和技巧。     

Coordinated pricing and inventory control problems with capacity constraints and fixed ordering cost

This article addresses a single‐item, finite‐horizon, periodic‐review coordinated decision model on pricing and inventory control with capacity constraints and fixed ordering cost. Demands in different periods are random and independent of each other, and their distributions depend on the price in the current period. Each period's stochastic demand function is the additive demand model. Pricing and ordering decisions are made at the beginning of each period, and all shortages are backlogged. The objective is to find an optimal policy that maximizes the total expected discounted profit. We show that the profit‐to‐go function is strongly CK‐concave, and the optimal policy has an (s,S,P) ‐like structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于最优打击序列的弹道导弹火力分配模型研究

针对弹道导弹火力计划的拟制过程进行研究。围绕效费比最大化目标,对目标打击序列的影响因素进行了分析,设计了打击目标排序算法;采用层次分析法对弹道导弹打击能力进行了分析,并对打击目标所使用的作战单位排序值进行了计算,建立了最优火力分配模型。该模型不仅可最大发挥作战单位的作战能力,而且满足以最小代价获取最佳打击效果。     

Clustered coverage orienteering problem of unmanned surface vehicles for water sampling

This study investigates a clustered coverage orienteering problem (CCOP), which is a generalization of the classical orienteering problem. The problem is widely motivated by the emerging unmanned techniques (eg, unmanned surface vehicles and drones) applied to environmental monitoring. Specifically, the unmanned surface vehicles (USVs) are used to monitor reservoir water quality by collecting samples. In the CCOP, the water sampling sites (ie, the nodes) are grouped into clusters, and a minimum number of nodes must be visited in each cluster. With each node representing a certain coverage area of the water, the objective of the CCOP is to monitor as much as possible the total coverage area in one tour of the USV, considering that overlapping areas provide no additional information. An integer programming model is first formulated through a linearization procedure that captures the overlapping feature. A two-stage exact algorithm is proposed to obtain an optimal solution to the problem. The efficiency and effectiveness of the two-stage exact algorithm are demonstrated through experiments on randomly generated instances. The algorithm can effectively solve instances with up to 60 sampling sites.     

翼伞系统线目标归航方法

针对运载火箭助推器或子级无控坠落地面落点散布较大的情况,提出一种翼伞系统的线目标归航方法。建立了矩形边界下的归航计算模型,对点目标归航和线目标归航两种方法进行了收缩区域分析;对翼伞归航能力、落区散布边界特征对归航性能的影响进行对比分析,得到了相应的归航策略,并提出在较大散布区域下设置多个着陆区域的工程解决方案;建立动力学和操纵控制模型,对线目标归航过程进行了仿真。结果表明,所提方法对工程有一定的参考价值。     

A bivariate optimal replacement policy for a cold standby repairable system with repair priority

In this article, an optimal replacement policy for a cold standby repairable system consisting of two dissimilar components with repair priority is studied. Assume that both Components 1 and 2, after repair, are not as good as new, and the main component (Component 1) has repair priority. Both the sequence of working times and that of the components'repair times are generated by geometric processes. We consider a bivariate replacement policy (T,N) in which the system is replaced when either cumulative working time of Component 1 reaches T, or the number of failures of Component 1 reaches N, whichever occurs first. The problem is to determine the optimal replacement policy (T,N)* such that the long run average loss per unit time (or simply the average loss rate) of the system is minimized. An explicit expression of this rate is derived, and then optimal policy (T,N)* can be numerically determined through a two‐dimensional‐search procedure. A numerical example is given to illustrate the model's applicability and procedure, and to illustrate some properties of the optimal solution. We also show that if replacements are made solely on the basis of the number of failures N, or solely on the basis of the cumulative working time T, the former class of policies performs better than the latter, albeit only under some mild conditions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010