Institutionalizing supreme command: explaining political–military integration in the Vietnam War, 1964–1968

Under what conditions can leaders achieve wartime political–military integration? In the Vietnam War, political–military integration exhibited dramatic variation: in the air war, the US was able to tightly integrate its political objectives and military conduct, but in the ground war, the American military prosecuted a strategy that was both divorced from broader political objectives and was immune from Washington's influence. I argue that the nature of information management between the military and civilian leadership explains the pattern of political–military integration in the Vietnam War more completely than do explanations that focus on the organizational cultures of professional militaries.     

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.     

Why did Sudan Lose a small war in Southern Sudan?

ABSTRACT

When on the wrong end of an asymmetry in the projection of hard power, weaker sides countenance the grim arithmetic of avoiding direct and massed confrontations. Invariably, insurgents have over the ages tended to employ indirect tactical methods to render their stronger opponents ineffective. Ultimately – interest asymmetry, regime type, asymmetries of strategy, and external intervention – combine in a complex interplay and pattern, to militate against a strong side. In Sudan, these factors interacted throughout the civil wars to produce regional autonomy and finally an independent South Sudan in 2011. Similar strategic logic had confronted many large African states battling insurgencies in Ethiopia, Angola, Nigeria, Zaire, and apartheid-era South Africa. Oftentimes, weakening public resolve has caused these governments to accommodate, capitulate or withdraw even if they try not to blink. Notwithstanding the regime type, it can be concluded that the majority of strong actors are prone to fail in a protracted, asymmetric conflict. Hence, the notion of linking victory in counterinsurgency to the degree of openness (democratic polyarchies); or closeness (totalitarianism) – is still valid but highly contestable in the case of Africa’s large dysfunctional states.     

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.     

Bounding methods for facilities location algorithms

Single- and multi-facility location problems are often solved with iterative computational procedures. Although these procedures have proven to converage, in practice it is desirable to be able to compute a lower bound on the objective function at each iteration. This enables the user to stop the iterative process when the objective function is within a prespecified tolerance of the optimum value. In this article we generalize a new bounding method to include multi-facility problems with l_p distances. A proof is given that for Euclidean distance problems the new bounding procedure is superior to two other known methods. Numerical results are given for the three methods.     

Estimating the accuracy of the coverages of outer β-content tolerance intervals,which control both tails of the normal distribution

Tolerance limits which control both tails of the normal distribution so that there is no more than a proportion β₁ in one tail and no more than β₂ in the other tail with probability γ may be computed for any size sample. They are computed from X? - k₁S and X? - k₂S, where X? and S are the usual sample mean and standard deviation and k₁ and k₂ are constants previously tabulated in Odeh and Owen [3]. The question addressed is, “Just how accurate are the coverages of these intervals (– Infin;, X? – k₁S) and (X? + k₂S, ∞) for various size samples?” The question is answered in terms of how widely the coverage of each tail interval differs from the corresponding required content with a given confidence γ′.     

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.