Violence in context: Mapping the strategies and operational art of irregular warfare

The malaise that the United States, and the West, have experienced in recent campaigns stems in large part from unclear thinking about war, its political essence, and the strategies needed to join the two. Instead, analysis and response are predicated on entrenched theoretical concepts with limited practical utility. The inadequacy of understanding has spawned new, and not so new, terms to capture unanticipated trends, starting with the re-discovery of “insurgency” and “counterinsurgency” and leading to discussion of “hybrid threats” and “gray-zone” operations. New terminology can help, but the change must go deeper. Challenging analytical orthodoxy, this article sets out a unifying approach for the study of political violence, or more accurately: violent politics. It provides a conceptual foundation that helps to make sense of recent shifts in warfare. In effect, it offers sorely needed theoretical insights into the nature of strategy and guides the process of responding to nontraditional threats.     

基于MAS的战时装备机动保障模型研究*

建立了一个基于多agent系统的战时装备机动保障模型,定义了划分层次和各agent模块的功能,并重点介绍了机动保障过程中机动过程和抢修作业过程模型的构建,为战时装备机动保障指挥提供辅助决策。     

浅谈型号研制的几种质量管理方法

本文针对目前型号研制过程质量管理的现状,从科学组建质量师系统、实施量化的质量目标管理、坚持关键评审的的预审制度、开展质量督察与监理等方面详细介绍了型号研制中加强质量管理的方法及在设计、制造总装、试验等阶段过程中的质量管理。     

基于A~*算法的虚拟士兵城市作战路径规划

针对虚拟士兵在城市作战仿真领域的需求,重点研究了虚拟士兵在城市环境中路径规划问题。通过对三维城市虚拟环境空间进行分层信息处理,生成虚拟士兵能够感知的虚拟信息层。用A*算法求出虚拟士兵从初始位置到达目标位置的最佳路径,并给出算法的具体设计与实现。     

在解放思想中推进政治机关干部能力建设

推进政治机关干部队伍能力建设,要贯彻科学发展观的要求,进一步解放思想,牢固确立创建"四型政治机关",不断加强理论学习,抓好能力培训,改善梯次配备,以更高的标准,强自身促部队.     

Free riding in a multi‐channel supply chain

Free riding in a multichannel supply chain occurs when one retail channel engages in the customer service activities necessary to sell a product, while another channel benefits from those activities by making the final sale. Although free riding is, in general, considered to have a negative impact on supply chain performance, certain recent industry practices suggest an opposite view: a manufacturer may purposely induce free riding by setting up a high‐cost, customer service‐oriented direct store to allow consumers to experience the product, anticipating their purchase at a retail store. This article examines how the free riding phenomenon affects a manufacturer's supply chain structure decision when there are fixed plus incremental variable costs for operating the direct store. We consider factors such as the effort required to find and buy the product at a retail store after visiting the direct store, the existence of competing products in the market, and the extent of consumer need to obtain direct‐store service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

A two‐echelon inventory‐location problem with service considerations

We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Interpreting the Ribchester Helmet

In 1796 a 13-year-old boy playing on wasteland behind his father’s house in Ribchester, Lancashire discovered an assemblage of over 30 Roman artefacts, including a decorated brass helmet. Although partially corroded the Ribchester helmet is a fine example of a first-century AD cavalry sports helmet. This article considers how the interpretation of the helmet has evolved since its discovery. The multi-faceted iconography of the helmet with its mural crown diadem is that of an elite soldier and is paralleled in other examples of cavalry sports helmets of the Ribchester type. The long-neglected imagery on the helmet bowl is reinterpreted and seen not as a haphazard collection of randomly placed combatants but as a highly structured, symmetrical composition specifically designed to be viewed from different directions.