The Relative Efficacy of the Biological and Chemical Weapon Regimes

The biological and chemical weapon nonproliferation and disarmament regimes are often put forward as models of what the nuclear nonproliferation regime could (or should) be. But are these regimes effective? If so, is one stronger and/or more effective than the other? What is it that makes them relatively stronger than the nuclear nonproliferation regime? In this article, we return to and expand upon a framework for assessing regime health and effectiveness. We utilize this framework to engage in a comparative analysis of the chemical weapon (CW) and biological weapon (BW) nonproliferation regimes, respectively. Our analysis reveals that these two regimes are comparatively healthier than their nuclear counterpart. While some of their behavioral features might be troubling—such as the disputes over stockpile destruction of CW—these tend to be mitigated by the presence of a strong norm against possession and proliferation of both CW and BW. This norm is adequately embedded into the existing institutional features of the regimes in ways that do not exist in the nuclear nonproliferation regime.     

Mandated defence offsets: can they ever deliver?

Defence offsets are elements of defence procurement deals additional to the primary content. Offsets are usually expected to yield technological or industrial benefits to the purchasing country (e.g. countertrade, technology transfers, or additional jobs) and military buyers often require suppliers to make offsets available “cost-free.” The authors argued previously that such strategies achieve little of value to buyers that lack market power and are unnecessary otherwise, since purchasers with the market power to extract more value for money from foreign suppliers can do so anyway. This article also focuses on the supply side of offset deals. The USA is the world's largest defence offsets supplier but the US government opposes offsets demands as economically inefficient and trade distorting. Even if offsets are inefficient and trade distorting, they may still benefit a materiel-exporting country such as the USA as they may induce exports and create associated benefits for the offsets provider.     

A fluid queueing model for link travel time moments

We analyze the moments of the random time required for a vehicle to traverse a transportation network link of arbitrary length when its speed is governed by a random environment. The problem is motivated by stochastic transportation network applications in which the estimation of travel time moments is of great importance. We analyze this random time in a transient and asymptotic sense by employing results from the field of fluid queues. The results are demonstrated on two example problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Applying Lanchester's linear law to model the Ardennes campaign

In modern warfare, many believe the decisive factor in winning a battle is seizing the right moment to shift from defense to attack, or vice versa. This paper attempts to bring that perspective to Lanchester's differential equations of warfare, and continues the application of Lanchester's linear law to the analysis of the World War II battle of Ardennes, as reported in earlier issues of Naval Research Logistics by Bracken and by Fricker. A new variable, shift time, accounting for the timing of the shift between defense and attack is explicitly included in our version of the model, and it helps obtain improved goodness of fit to historical data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:653–661, 2001     

Real-time task scheduling with overheads considered

n periodic tasks are to be processed by a single machine, where each task i has a maximum request rate or periodicity F_i, a processing time E_i, a deadline D_i, relative to each request of task i, a task-request interrupt overhead I_i, and a task-independent scheduling overhead S. Two scheduling strategies are considered for sequencing the execution of an arbitrary arrangement of task requests in time: the preemptive and the nonpreemptive earliest-deadline algorithms. Necessary and sufficient conditions are derived for establishing whether a given set of tasks can be scheduled by each scheduling strategy. The conditions are given in the form of limited simulations of a small number of well-defined task-request arrangements. If all simulations succeed, the schedule is feasible for the given set of tasks. If any simulation fails, the schedule is infeasible. While interrupt handling and scheduling overheads can be handled by such simulations, context switching overhead resulting from preemption cannot. A counterexample illustrates how the simulations fail to uncover unschedulable task sets when context switching overhead is considered.     

The Imperfect Peace: Explaining Paramilitary Violence in Northern Ireland

This article examines why paramilitary campaigns in Northern Ireland have continued despite the current peace process. In advancing three instrumental explanations of paramilitary violence, the author provides a useful analytical framework which shows that while organizational interpretations are dominating the public discourse, republicans and loyalists continue to use paramilitary violence as a strategic means of threat and coercion. Furthermore, even though policy implications are not discussed in detail, it will be demonstrated that the dominance of organizational imperatives has resulted in excessive leniency by the state, which - in turn - has contributed to the fragility of the peace process.     

Technical note: Traffic intensity estimation

This note examines estimation of the traffic intensity in an M/G/1 queue. We show that the ratio of sample mean service times to the sample mean interarrival times has undesirable sampling properties. To remedy this, two alternative estimators are introduced. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009