Population-centric counterinsurgency and the movement of peoples

The theory of population-centric counterinsurgency rests upon the untenable premise that the population within a theater of operations is fixed in place. By showing that people tend to move away from contested rural areas towards the relative safety and prosperity of counterinsurgent-controlled areas, this article demonstrates that this crucial premise is empirically false. Furthermore, a theory of counterinsurgent resource deployment, population movement, and incumbent strategic ineffectiveness is presented. Ultimately, the application of counterinsurgency resources actually dislocates the population from their place of residence and causes them to move into cities. When the urban areas' ability to absorb newcomers is overwhelmed, localized negative externalities emerge and can give rise to crime and insecurity. Such increased insecurity then creates an incentive for the counterinsurgency to retrench its resource use into the cities. As more physical territory is conceded to the insurgency, the relative strategic effectiveness of the counterinsurgency declines.     

Optimal versus required defence expenditure: The case of the Greek-Turkish arms race

The aim of this paper is to indicate the extent to which the arms race against Turkey, in which Greece and Cyprus have been entangled, imposes a defence expenditure burden that is tough for the two allies to bear. To do so we have resorted to evaluating the optimal military expenditure for the two countries, allied in the context of the Integrated Defence Doctrine, which is compatible with the constraints imposed by the resources of their economies. All experiments and scenarios examined lead to the conclusion that the current defence burden of the two allies seems to be driving their economies beyond capacity limits. The fact remains, however, that under the circumstances, a one-sided disarmament policy like the one currently followed by Greece, is a risky choice given that the long-term armament programmes pursued by Turkey, whose role in this arms race has been proven as leading, leave very small room to the Greek and Cypriot sides to reduce their own defence expenditure.     

SYMBIOTIC SPIES

Spying on the Nuclear Bear: Anglo-American Intelligence and the Soviet Bomb, by Michael S. Goodman. Stanford University Press, 2007. 295 pages, $50.     

Graph distance‐dependent labeling related to code assignment in computer networks

For nonnegative integers d₁, d₂, and L(d₁, d₂)‐labeling of a graph G, is a function f : V(G) → {0, 1, 2, …} such that |f(u) − f(v)| ≥ d_i whenever the distance between u and v is i in G, for i = 1, 2. The L(d₁, d₂)‐number of G, λ(G) is the smallest k such that there exists an L(d₁, d₂)‐labeling with the largest label k. These labelings have an application to a computer code assignment problem. The task is to assign integer “control codes” to a network of computer stations with distance restrictions, which allow d₁ ≤ d₂. In this article, we will study the labelings with (d₁, d₂) ∈ {(0, 1), (1, 1), (1, 2)}. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

A two-phase procedure for allotting geostationary orbital locations to communications satellites

We consider the problem of allotting locations in the geostationary orbit to communication satellites, subject to angle of elevation and electromagnetic interference constraints. An optimization framework is used as a means of finding feasible allotment plans. Specifically, we present a two-phase solution procedure for the satellite location problem (SLP). The objective in SLP is to allot geostationary orbital locations to satellites so as to minimize the sum of the absolute differences between the locations prescribed for the satellites and corresponding specified desired locations. We describe two heuristics, an ordering procedure and a k-permutation algorithm, that are used in tandem to find solutions to SLP. Solutions to a worldwide example problem with 183 satellites serving 208 service areas are summarized.     

Optimal stopping problems for differential equations perturbed by a poisson process

We investigate a class of optimal stopping problems for dynamical systems described by one-dimensional differential equations with an additive Poisson disturbance. The rate of the disturbance may depend upon the current state of the system. A dynamic programming equation for the optimal stopping cost is derived along with conditions which must be met at the boundary of the optimal stopping set. These boundary conditions depend upon whether or not the stopping set may be entered by smooth motion.