Insurgency online: Elements for a theory of anti‐government Internet communications

The article takes the cases of Peru's Tupac Amaru Revolutionary Movement (MRTA) as the pont of departure to discuss how a insurgent political movement uses the Internet and World Wide Web (WWW). During the 1996–97 Japanese Embassy hostage incident in Lima, Peru, MRTA supporters in Japan, Europe and North America used online technology to relay the group's message to a global public. The resulting direct media access provided the MRTA with an unprecendented level of global publicity. Through referring to the ‘MRTA Solidarity Page’, the types of message transmitted, the forms of transmission (text, video, audio, e‐mail or other), and target publics (national, global, political elites, media), the article outlines the issues and theoretical challenges raised by electronic anti‐government information provision. The Internet and WWW do not alone constitute the threat to state power as some analysts suggest but does in some sense dramatically alter political communication. New media will probably co‐exist with other forms of political communication for some time.     

Investigating the Desirability of Navy Aircraft Service Life Extension Programs

Building on prior work on optimal replacement of aging aircraft, this paper presents three methodologies to evaluate prospective aviation Service Life Extension Programs (SLEPs) and applies these methodologies to US Navy F/A-18E/F data. While considerable uncertainty remains as to the values of key parameters (e.g. the cost of F/A-18E/F SLEPs), the preponderance of the evidence available at this juncture favors undertaking SLEPs on F/A-18E/Fs rather than replacing them with new Joint Strike Fighters.     

Optimal selection with alternative information

This article examines the problem of optimally selecting from several unknown rewards when there are given alternative, costly sources of information. The optimal rule, indicating the information to be purchased and the reward to be selected, is specified as a function of the decision maker's prior probabilities regarding the value of each alternative. The rule is surprisingly complex, balancing prior beliefs, the “informativeness” of the relevant information system, and the cost of acquiring information.     

Book Reviews

The Mini-Nuke Conspiracy by Peter Hounam and Steve McQuillan, London: Faber and Faber, (1995)

The Amateur Strategist: Intuitive Deterrence Theories and the Politics of the Nuclear Arms Race By James DeNardo, Cambridge: Cambridge University Press (1995), (pbk) ISBN 0-521-48446-4

After Empire: The Emerging Geopolitics of Central Asia By Jed C. Snyder (ed.), Washington DC: National Defense University Press, (1995), 235 pp., ISBN 0-16-051682-x.     

A bounded dual (all-integer) integer programming algorithm with an objective cut

In this article, we describe a new algorithm for solving all-integer, integer programming problems. We generate upper bounds on the decision variables, and use these bounds to create an advanced starting point for a dual all-integer cutting plane algorithm. In addition, we use a constraint derived from the objective function to speed progress toward the optimal solution. Our basic vehicle is the dual all-integer algorithm of Gomory, but we incorporate certain row- and column-selection criteria which partially avoid the problem of dual-degenerate iterations. We present the results of computational testing.     

A note on allocating jobs to two machines

A recent article in this journal by Mehta, Chandrasekaran, and Emmons [1] described a dynamic programming algorithm for assigning jobs to two identical parallel processors in a way that minimizes the average delay of these jobs. Their problem has a constraint on the sequence of the jobs such that any group of jobs assigned to a processor must be processed in the order of the sequence. This note has two purposes. First, we wish to point out a relationship between this work and some prior work [2]. Second, we wish to point out that Mehta, Chandrasekaran, and Emmons formulation, slightly generalized, can be used to find the optimum assignment of jobs to two machines in a more general class of problems than they considered including a subclass in which the jobs are not constrained to be processed in a given sequence.