Applying Order-of-Battle to Al Qaeda Operations

Since the global war on terror began, the pursuit of Al Qaeda is widely considered as warfare and not the pursuit of criminals. In light of counter-terrorism being redefined as war, the criteria applied for tracking militaries of conventional enemies may also be applicable to Al Qaeda. Intelligence analysts have long used the nine order-of-battle (OB) criteria as part of the estimative process for conventional, or nation-state, enemies. Applying OB criteria to Al Qaeda may assist intelligence analysts in knowing the enemy and identifying changes that will allow for predictive analysis. Many elements of Al Qaeda's OB prior to the events of 11 September were viewed as clutter and not significant changes that might have otherwise alerted intelligence analysts to the impending attack. This essay suggests how one might go about applying the nine OB criteria to analysis of Al Qaeda. Although more difficult and requiring modification, using an analytical procedure that has been tested successfully over many years is a logical step in the war on Al Qaeda. If all OB changes are tracked and analyzed using a systematic approach as outlined in this essay, Al Qaeda attacks may be predicted and/or curtailed in the future.     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Optimal maintenance policies for a safety‐critical system and its deteriorating sensor

We consider the integrated problem of optimally maintaining an imperfect, deteriorating sensor and the safety‐critical system it monitors. The sensor's costless observations of the binary state of the system become less informative over time. A costly full inspection may be conducted to perfectly discern the state of the system, after which the system is replaced if it is in the out‐of‐control state. In addition, a full inspection provides the opportunity to replace the sensor. We formulate the problem of adaptively scheduling full inspections and sensor replacements using a partially observable Markov decision process (POMDP) model. The objective is to minimize the total expected discounted costs associated with system operation, full inspection, system replacement, and sensor replacement. We show that the optimal policy has a threshold structure and demonstrate the value of coordinating system and sensor maintenance via numerical examples. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 399–417, 2017     

Optimal maintenance policies for serial,multi‐machine systems with non‐instantaneous repairs

We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

The economic effects of international trade in armaments in the major western industrialized and developing countries†

We have used the Michigan Model of World Production and Trade to assess the impact of exports and imports of armaments (based on 1980 data) on sectoral trade and employment and other economic variables in the major Western trading countries. If the United States were to place a unilateral embargo on its arms exports and imports, we calculate that it would experience a comparatively small amount of employment displacement in the aggregate and that most of this displacement would occur in the transport equipment and electric machinery sectors. If all the major Western countries were to place a multilateral embargo on their arms trade, the sectoral effects on the United States would be similarly small. But the sectoral effects in several other industrialized and developing countries measured as a percentage of sectoral employment, would be larger, indicating potential short‐run adjustment problems in labor markets in some cases.     

Book reviews

Managing International Conflict, From Theory to Practice: a Teaching Tool Using CASCON by Lincoln P. Bloomfield and Allen Moulton, New York: St Martin's Press, 1997, ISBN 0-312-13675-7 (pbk), £18.99.

The American Century: the Rise and Decline of the United States as a World Power by Donald W. White, London: Yale University Press, 1997, ISBN 0-300-05721-0 (hbk), £25.

Humanitarian Intervention in Contemporary Conflict by Oliver Ramsbotham and Tom Woodhouse, Cambridge: Blackwell, 1996.

The US Military/NGO Relationship in Humanitarian Interventions by Chris Seiple, Peacekeeping Institute, Center for Strategic Leadership, US Army War College, 1996.

Uncivil Wars: International Security and the New Internal Conflicts by Donald M. Snow, London: Lynne Rienner Publishers, 1996, ISBN 1-55587-655-2 (pbk), £15.50, ISBN 1-55587-648-X (hbk), £33.50.

Intelligence Power in Peace and War by Michael Herman, Royal Institute for International Affairs, Cambridge: Cambridge University Press, 1996, ISBN 0-521-56231-7 (hbk), £50, ISBN 0-521-56636 (pbk), £16.95.

UK Eyes Alpha: Inside British Intelligence by Mark Urban, London: Faber and Faber, 1996, ISBN 0-571-17689-5 (hbk), £16.99.

New Cloak, Old Dagger by Michael Smith, London: Victor Gollancz, 1996, ISBN 0-575-06150-2 (hbk), £20.

Conversion Survey 1997: Global Disarmament and Disposal of Surplus Weapons by Bonn International Center for Conversion, Oxford: Oxford University Press, 1997.

Plutonium and Highly Enriched Uranium 1996: World Inventories, Capabilities and Policies by David Albright, Frans Berkhout and William Walker, Oxford: SIPRI and Oxford University Press, 1997.

The Wars of Eduard Shevardnadze by Carolyn McGiffert Ekedahl and Melvin A. Goodman, University Park, PA: Penn State University Press, 1997.     

Minimax resource allocation problems with ordering constraints

Resource allocation problems consider the allocation of limited resources among numerous competing activities. We address an allocation problem with multiple knapsack resource constraints. The activities are grouped into disjoint sets. Ordering constraints are imposed on the activities within each set, so that the level of one activity cannot exceed the level of another activity in the same set. The objective function is of the minimax type and each performance function is a nonlinear, strictly decreasing and continuous function of a single variable. Applications for such resource allocation problems are found, for example, in high-tech industries confronted with large-scale and complex production planning problems. We present two algorithms to solve the allocation problem with ordering constraints. The first one uses characterization of the optimal decision variables to apply a search method. The second algorithm solves a sequence of problems, each in the format of the original problem without ordering constraints. Whereas the computational effort of the first algorithm depends on the desired degree of accuracy even for linear performance functions, the effort of the latter algorithm is polynomial for certain classes of performance functions. © 1994 John Wiley & Sons, Inc.     

Local search techniques for the generalized resource constrained project scheduling problem

In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource infeasibility. We use the 110-problem data set of Patterson to test our procedure. Our results indicate a significant improvement over the best heuristic results reported to date for these problems (Bell and Han [1]). Two major advantages of the local search algorithm are its ability to handle arbitrary objective functions and constraints and its effectiveness over a wide range of problem sizes. We present a problem example with an objective function and resource constraints which include nonlinear and non-continuous components, which are easily considered by the procedure. The results of our algorithm are significantly better than random solutions to the problem. © 1993 John Wiley & Sons, Inc.