War and rumours of war,do improvements in space technologies bring space conflict closer?

Combat in near-Earth orbit is emerging as a more realistic possibility. The argument here is that changes in space technologies combined with a sea change in political rhetoric is bringing the possibility of military conflict in space technologies. This movement reflects a generational shift as the original decisions regarding military conflict in space are now being reassessed by a generation who did not experience World War II or the Cold War. For these, the sanctuary approach to space activities is not as persuasive and new enhanced space technologies bring the possibility of victory or at least survival possible during a conflict in space.     

Everyday Social Practices and Boundary-Making in Deeply Divided Societies

Based on empirical evidence and conceptual scoping, this article builds a typology of everyday social practices in a deeply divided society. The typology distinguishes between moderating and non-moderating practices relating to boundaries. Based on a case study of contemporary Lebanon, it describes how boundary making and maintaining are the stuff of everyday life in deeply divided societies. But it also describes how the society under study also contains much evidence of fluidity and permeability in relation to boundaries. Many of these instances of boundary crossing do not threaten the meta politico-religious boundary, but they do compel us to re-evaluate views of deeply divided societies as comprised of homogenous and uncompromising blocs.     

The view from above: how the Royal Air Force provided a strategic vision for operational intelligence during the Malayan Emergency

It has long been held that the Federation of Malaya’s counter-insurgency campaign during the First Malayan Emergency (1948–60) was determined by the use of intelligence. Special Branch — the Federation’s primary intelligence agency — dominates the prevailing paradigm of how the insurgent threat was tackled. Conversely, the role of the Royal Air Force (RAF) within this paradigm is very limited. Most observers simply dismiss the role of photoreconnaissance or airstrikes as being largely inconsequential to the counter-insurgency effort. This is perhaps understandable: the Emergency was after all a ‘policing action’ and the insurgents were largely hidden under Malaya’s jungle canopy and amongst the Chinese community. However, further scrutiny reveals that the RAF made a much more significant contribution to the intelligence element of the counter-insurgency campaign than previously realised. First, the RAF decided to locate their Advanced Headquarters with the Army’s General Headquarters. This led to the creation of the Land/Air Operations Room, through which intelligence, tasking and resources were coordinated. Moreover, the RAF put its intelligence teams into the field to provide a practical link between local units and theatre-level assets. Second, with the support of the Army, the RAF established at the beginning of the Emergency the Joint Air Photographic Intelligence Board (Far East). This coordinated all photographic intelligence requirements throughout the Emergency, which was then delivered via the Joint Air Photographic Centre (Far East). Hence, via Joint Operations Centre and JAPIB (FE), the RAF provided both the practical means for effective joint intelligence operations at theatre level throughout the Emergency.     

Note: Dynamic lot sizing for a finite rate input process

The basic single-product dynamic lot-sizing problem involves determining the optimal batch production schedule to meet a deterministic, discrete-in-time, varying demand pattern subject to linear setup and stockholding costs. The most widely known procedure for deriving the optimal solution is the Wagner-Whitin algorithm, although many other approaches have subsequently been developed for tackling the same problem. The objective of this note is to show how these procedures can readily be adapted when the input is a finite rate production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 221–228, 1997     

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