Counterinsurgency and the limits of state-building: An analysis of Colombia's policy of territorial consolidation, 2006–2012

Since 2002 the Colombian government has been implementing a series of policy initiatives that have sought to coordinate state resources in a neo-classical counterinsurgency approach to fight the country's main insurgent group, the Fuerzas Armadas Revolucionarias de Colombia (FARC), and recover and consolidate the territory. Despite impressive operational successes against the insurgency and other illegal groups, the government has been unable to reassert its control and build legitimacy via the state-building effort known as ‘Consolidación’, in some of the most recalcitrant areas of the country. This article examines two areas where government efforts at consolidation appear to be failing to discuss the limits of COIN theory and practice.     

Virtual War in the Ice Jungle: ‘We don't know how to do this’

The Cold War at sea expanded in many realms, including the frigid and treacherous waters of the Arctic Ocean. The US Navy pioneered these efforts with the visit of USS Nautilus to the North Pole in 1958. During the latter stages of the Cold War, however, Soviet naval strategists began to conceptualize the polar ice cap as a strategic asset for cloaking the operations of its nuclear missile submarines. As under-ice operations afforded the Soviet submarine fleet advantages of stealth, proximity to target and tighter lines of communications, both navies were forced to try to develop tactics for combat under these extremely complex and arduous conditions.     

科学发展观指导大学生思想政治教育质量提升研究

科学发展观不仅为大学生思想政治教育提出了新的理论指导,同时也为其提出了新的更高要求和新的思想方法。加强和改进大学生思想政治教育是事关中华民族前途命运的根本问题,要提升大学生的思想政治教育质量,必须坚持以科学发展观为指导,用科学发展观统领高校思想政治教育,理清工作思路,创新工作模式,促进大学生思想政治素质、科学文化素质和身体素质的全面发展。     

运用动态规划的智能卫星集群星间通信路由算法

通过建立智能卫星集群网络模型,把智能卫星集群星间通信路由问题转换为时延最短路径问题,进而提出一种求解此问题的智能卫星集群星间通信路由算法.该路由算法采用动态规划策略分阶段规划智能卫星集群两个成员之间的星间通信路由,在每个规划阶段,负责发送数据的智能卫星自主调用一种星间通信路由静态规划算法,以求出其在当前时刻的后继卫星来...     

Waypoint analysis for command and control

Command and Control (C2) in a military setting can be epitomized in battles‐of‐old when commanders would seek high ground to gain superior spatial‐temporal information; from this vantage point, decisions were made and relayed to units in the field. Although the fundamentals remain, technology has changed the practice of C2; for example, enemy units may be observed remotely, with instruments of varying positional accuracy. A basic problem in C2 is the ability to track an enemy object in the battlespace and to forecast its future position; the (extended) Kalman filter provides a straightforward solution. The problem changes fundamentally if one assumes that the moving object is headed for an (unknown) location, or waypoint. This article is concerned with the new problem of estimation of such a waypoint, for which we use Bayesian statistical prediction. The computational burden is greater than an ad hoc regression‐based estimate, which we also develop, but the Bayesian approach has a big advantage in that it yields both a predictor and a measure of its variability. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

对高校招生宣传工作的思考

本文根据我国西部高校招生宣传的实践,对招生宣传工作的规律和西部学校宣传工作的特色进行了阐述。     

调频连续波ISAR目标微多普勒特征分析

分析了调频连续波逆合成孔径雷达(FMCW-ISAR)的回波信号特性,讨论了脉冲持续时间内目标连续运动引起的多普勒频移对成像的影响,推导出导致一维距离像主瓣展宽和走动的相位因子,并进一步研究了该相位因子对基于调频连续波逆合成孔径雷达的目标微多普勒特征的影响,在此基础上讨论了调频连续波逆合成孔径雷达目标微多普勒特征与脉冲式逆合成孔径雷达目标微多普勒特征的主要区别.最后的仿真试验验证了理论分析的正确性.     

On the median residual lifetime and its aging properties: A characterization theorem and applications

This paper is devoted to study several aspects of the median residual life function (MERLF). In reliability studies, it is well known that, although the MERLF have several advantages over the mean residual life function (MRLF), the MRLF has the good property of uniquely determine a life distribution whereas either the median residual life function (MERLF) or an α‐percentile residual life do not have such good property. We shall give a characterization result where knowledge of both the MERLF and the survival function on an interval does uniquely determine the distribution. Moreover, in order to apply this characterization in practical situations, we propose a method to estimate the necessary information of the survival function. Relationships between analytical properties of the survival function and its associated MERLF are also obtained. Bryson and Siddiqui [J Am Statist Assoc 64 (1969), 1472–1483] proved relationships among seven criteria for aging, out of which two contained the MRLF (decreasing MRLF and net decreasing MRLF). In this paper, we prove that the same pattern of relationships holds if the MRLF is replaced by the MERLF. We also examine the aging criteria corresponding to an increasing MERLF and show that there is no relation between the behavior (increasing or decreasing) of the MERLF and of the MRLF. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005