Information age,terrorism and warfare

This essay will discuss two of the key pillars of asymmetry: notably Information Operations and terrorism, including the links between the two. While a great deal changed on 11 September 2001, one thing that has not changed in substance is the challenge of protecting the Information Society, notably from cyber-threats. Although the immediate threat to Western societies is from the physical and possibly bio-weapons favoured by Al Qaeda and its associates, it is time now to prepare for future threats to the information society, including cyber-threats.     

Conflict and third-party intervention

The paper looks at various scenarios of possible concern for intervening third parties when two factions are engaged in a conflict and act strategically against one another. A standard conflict model is used to determine appropriate intervention strategies in order to lower the overall level of conflict. Choosing a suitable strategy in such a setting, the third party must not only take into account the direct impact of its efforts but also the indirect impacts that result from the strategic interaction among the parties involved.     

“Leading from behind”: neoclassical realism and operation Odyssey Dawn

In March 2011, President Barack Obama ordered US air and naval forces to commence Operation Odyssey Dawn in Libya to impose a no-fly zone. The decision by the Obama Administration to intervene in a limited and supporting role in Libya is an important development in US foreign policy. Operation Odyssey Dawn presents scholars with a valuable opportunity to analyze and explore how US foreign policy is made and what roles domestic politics and elite perceptions play in decisions to use force. The author argues that neoclassical realism is a useful and compelling theoretic framework with which to analyze Operation Odyssey Dawn. While the Administration intervened in response to perceived external-level threats to US national interests, salient intervening domestic-level variables and elite perceptions shaped and guided the tenor and scope of the operation.     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014     

An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

A single server is faced with a collection of jobs of varying duration and urgency. Each job has a random lifetime during which it is available for nonpreemptive service. Should a job's lifetime expire before its service begins then it is lost from the system unserved. The goal is to schedule the jobs for service to maximize the expected number served to completion. Two heuristics have been proposed in the literature. One (labeled π^S) operates a static priority among the job classes and works well in a “no premature job loss” limit, whereas the second (π^M) is a myopic heuristic which works well when lifetimes are short. Both can exhibit poor performance for problems at some distance from the regimes for which they were designed. We develop a robustly good heuristic by an approximative approach to the application of a policy improvement step to the asymptotically optimal heuristic π^S, in which we use a fluid model to obtain an approximation for the value function of π^S. The performance of the proposed heuristic is investigated in an extensive numerical study. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

A suboptimality bound for permutation policies in single machine stochastic scheduling

A general class of single machine stochastic scheduling problems incorporating precedence constraints is modelled as a family of competing Markov decision processes. A bound on the optimal return yields a suboptimality bound for permutation policies. This in turn leads to a generalised “used better than new” principle as a (highly intuitive) sufficient condition for the optimality of a permutation policy in the class of all (preemptive) policies. © 1995 John Wiley & Sons, Inc.     

Modeling and analysis of uncertain time‐critical tasking problems

This paper describes modeling and operational analysis of a generic asymmetric service‐system situation in which (a) Red agents, potentially threatening, but in another but important interpretation, are isolated friendlies, such as downed pilots, that require assistance and “arrive” according to some partially known and potentially changing pattern in time and space; and (b) Reds have effectively limited unknown deadlines or times of availability for Blue service, i.e., detection, classification, and attack in a military setting or emergency assistance in others. We discuss various service options by Blue service agents and devise several approximations allowing one to compute efficiently those proportions of tasks of different classes that are successfully served or, more generally, if different rewards are associated with different classes of tasks, the percentage of the possible reward gained. We suggest heuristic policies for a Blue server to select the next task to perform and to decide how much time to allocate to that service. We discuss this for a number of specific examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

The Odyssey of the Comprehensive Nuclear-Test-Ban Treaty

This study examines the failures of the William J. Clinton and Barack Obama administrations to secure ratification of the Comprehensive Nuclear-Test-Ban Treaty (CTBT). It applies an integrated analytical framework for assessing treaty ratification that builds upon previous research in order to understand why the Clinton administration failed to achieve CTBT ratification in 1999 and why the Obama administration has so far failed to advance the treaty in the Senate. The study concludes that CTBT ratification, despite Obama administration pledges of support, remains highly unlikely. Finally, the study analyzes the common domestic political factors present in both cases and suggests areas for further research.     

A blunted spear: the failure of the African National Congress/South African Communist Party revolutionary war strategy 1961–1990

Following a classic Maoist revolutionary war strategy, with both Guevarian and Giapist elements, the African National Congress (ANC) attempted to overthrow, through revolutionary violence, the apartheid government of South Africa. This struggle, which began in 1961 and was eventually suspended in mid-1990, witnessed the general failure of the ANC strategy: for all intents and purposes – and despite all claims to the contrary – the ANC and its armed wing Umkhonto we Sizwe (‘Spear of the Nation’) failed to overthrow of the South African state by force, the purpose for which it was intended. The strongest indication of this was that the ANC was never able to establish (Phase One of revolutionary war) effective internal underground structures of any duration within South Africa. This much was clear when the ANC was unbanned in 1990, but was recognised long before: in October 1986, the ANC stated that ‘despite all our efforts, we have not come anywhere near the achievement of the objectives we set for ourselves’. The ANC's ‘use’ of the UDF structures inside South Africa, in this sense, was not the same thing as establishing effective internal ANC/MK structures in the way that they intended. The ANC/South African Communist Parry (SACP) also underestimated continuously the ability of the government to react strongly and viciously to the ‘Revolutionary Onslaught’: at least part of the blame for this underestimation lay with the promotion of the armed struggle over all other activities. In eidle, the ANC/SACP were unable to reach back effectively into the country to lead a revolution. In the end, the apartheid regime was defeated not by guerrilla action or by revolutionary overthrow, but through the mass action of millions of South Africans.     

A class of Bayes-optimal two-stage screens

Items are characterized by a set of attributes (T) and a collection of covariates (X) associated with those attributes. We wish to screen for acceptable items (T ∈ C_T), but T is expensive to measure. We envisage a two-stage screen in which observation of X_ is used as a filter at the first stage to sentence most items. The second stage involves the observation of T for those items for which the first stage is indecisive. We adopt a Bayes decision-theoretic approach to the development of optimal two-stage screens within a general framework for costs and stochastic structure. We also consider the important question of how much screens need to be modified in the light of resource limitations that bound the proportion of items that can be passed to the second stage. © 1996 John Wiley & Sons, Inc.