Honour,Comradeship and Betrayal: Lord Capel’s Sword

The sword which is the subject of this article and which will be referred to as the Capel sword, is a fine example of what has become known as an Irish basket-hilt. Whilst there are other examples in existence, what makes this sword unique and particularly important is the fact that it is known to have been owned by two important Royalist military leaders, Lord Arthur Capel and Sir John Owen. These two extraordinary men came from different backgrounds but their fate was linked through circumstances beyond their control. The story this sword tells is one of comradeship, loyalty, total belief in a cause, betrayal and ultimate sacrifice.     

Fire truck relocation during major incidents

The effectiveness of a fire department is largely determined by its ability to respond to incidents in a timely manner. To do so, fire departments typically have fire stations spread evenly across the region, and dispatch the closest truck(s) whenever a new incident occurs. However, large gaps in coverage may arise in the case of a major incident that requires many nearby fire trucks over a long period of time, substantially increasing response times for emergencies that occur subsequently. We propose a heuristic for relocating idle trucks during a major incident in order to retain good coverage. This is done by solving a mathematical program that takes into account the location of the available fire trucks and the historic spatial distribution of incidents. This heuristic allows the user to balance the coverage and the number of truck movements. Using extensive simulation experiments we test the heuristic for the operations of the Fire Department of Amsterdam‐Amstelland, and compare it against three other benchmark strategies in a simulation fitted using 10 years of historical data. We demonstrate substantial improvement over the current relocation policy, and show that not relocating during major incidents may lead to a significant decrease in performance.     

Interdiction models for delaying adversarial attacks against critical information technology infrastructure

Information technology (IT) infrastructure relies on a globalized supply chain that is vulnerable to numerous risks from adversarial attacks. It is important to protect IT infrastructure from these dynamic, persistent risks by delaying adversarial exploits. In this paper, we propose max‐min interdiction models for critical infrastructure protection that prioritizes cost‐effective security mitigations to maximally delay adversarial attacks. We consider attacks originating from multiple adversaries, each of which aims to find a “critical path” through the attack surface to complete the corresponding attack as soon as possible. Decision‐makers can deploy mitigations to delay attack exploits, however, mitigation effectiveness is sometimes uncertain. We propose a stochastic model variant to address this uncertainty by incorporating random delay times. The proposed models can be reformulated as a nested max‐max problem using dualization. We propose a Lagrangian heuristic approach that decomposes the max‐max problem into a number of smaller subproblems, and updates upper and lower bounds to the original problem via subgradient optimization. We evaluate the perfect information solution value as an alternative method for updating the upper bound. Computational results demonstrate that the Lagrangian heuristic identifies near‐optimal solutions efficiently, which outperforms a general purpose mixed‐integer programming solver on medium and large instances.     

The long shadow of colonial cartography: Britain and the Sino-Indian war of 1962

ABSTRACT

This article examines British responses to the Sino-Indian border war of 1962. It illustrates how, in the years leading up to the war, Britain’s colonial legacy in the Indian subcontinent saw it drawn reluctantly into a territorial dispute between Asia’s two largest and most powerful nations. It analyses disagreements in Whitehall between the Foreign Office and Commonwealth Relations Office over the relative strength of India and China’s border claims, and assesses how these debates reshaped British regional policy. It argues that the border war was instrumental in transforming Britain’s post-colonial relationship with South Asia. Continuing to filter relations with India through an imperial prism proved unsatisfactory, what followed was a more pragmatic Indo-British association.     

Slow failure: Understanding America’s quagmire in Afghanistan

ABSTRACT

The United States government has no organised way of thinking about war termination other than seeking decisive military victory. This implicit assumption is inducing three major errors. First, the United States tends to select military-centric strategies that have low probabilities of success. Second, the United States is slow to modify losing or ineffective strategies due to cognitive obstacles, internal frictions, and patron-client challenges with the host nation government. Finally, as the U.S. government tires of the war and elects to withdraw, bargaining asymmetries prevent successful transitions (building the host nation to win on its own) or negotiations.     

Regular and irregular forces in conflict: nineteenth century insurgencies in South America

ABSTRACT

In the decades following independence from Spain, ‘civil wars’ ravaged the newly established polities in South America. Former vice-regal capitals inherited a larger portion of the colonial administration and had larger economic resources and a hegemonic project they were able to have permanent and professional armed forces, capable of leading the offensive and giving battle following the European rules of military art. The central hypothesis of this work is that there is a necessary relationship between the shape of these asymmetrical conflicts, their outcome and the political territorial configuration of each country in post-revolutionary Spanish America. When permanent armies took over from local militias, the capital kept the integrity of its territories and there was a tendency towards political centralization. When this did not happen and the militias managed to find a way to defeat their centralizing enemies, the local powers had an opportunity to renegotiate their participation in the political body, and sought to maintain their independence, which was manifest in federal agreements, otherwise a process of territorial fragmentation began. More than a difference between regular and irregular forces there was one between intermittent, and permanent mobilization.     

Equity in genetic newborn screening

State‐level newborn screening allows for early treatment of genetic disorders, which can substantially improve health outcomes for newborns. As the cost of genetic testing decreases, it is becoming an essential part of newborn screening. A genetic disorder can be caused by many mutation variants; therefore, an important decision is to determine which variants to search for (ie, the panel design), under a testing budget. The frequency of variants that cause a disorder and the incidence of the disorder vary by racial/ethnic group. Consequently, it is important to consider equity issues in panel design, so as to reduce disparities among different groups. We study the panel design problem using cystic fibrosis (CF) as a model disorder, considering the trade‐offs between equity and accuracy, under a limited budget. Most states use a genetic test in their CF screening protocol, but panel designs vary, and, due to cost, no state's panel includes all CF‐causing variants. We develop models that design equitable genetic testing panels, and compare them with panels that maximize sensitivity in the general population. Our case study, based on realistic CF data, highlights the value of equitable panels and provides important insight for newborn screening practices.     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

A continuous‐time strategic capacity planning model

Capacity planning decisions affect a significant portion of future revenue. In the semiconductor industry, they need to be made in the presence of both highly volatile demand and long capacity installation lead‐times. In contrast to traditional discrete‐time models, we present a continuous‐time stochastic programming model for multiple resource types and product families. We show how this approach can solve capacity planning problems of reasonable size and complexity with provable efficiency. This is achieved by an application of the divide‐and‐conquer algorithm, convexity, submodularity, and the open‐pit mining problem. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.