Exposing and exploiting weaknesses in the merger of Al-Qaeda and Al-Shabaab

On 9 February 2012 the Somali terrorist organization al-Shabaab officially merged with al-Qaeda. While the significance of the merger is highly contested, it does expose internal weaknesses within the two organizations along ideological, clan, and sectarian lines. The article identifies three key weaknesses of the merger and concludes with a discussion of al-Qaeda's growing presence in trans-Saharan Africa.     

Gorshkov's Gambit

This article is a portrait of Admiral Sergei Gorshkov, commander of the Soviet Navy for almost three decades, from 1956–85. The author, a retired US Navy admiral with a Harvard PhD in Russian studies who served as both defense and naval attaché in Moscow, draws on numerous face-to-face interactions with Gorshkov. He also explores Gorshkov's memoirs that were published recently in Russia but have not appeared in an English translation. The paper is not only a first-hand account of an important historical figure, but also a window into the world of military-to-military diplomacy and intelligence during the Cold War.     

The day Stalin died: American plans for exploiting the Soviet succession crisis of 1953

One of the effects of Deng Xiaoping's economic reforms is the steady erosion of the ideological integrity of Marxism‐Leninism‐Maoism. To compensate for that erosion, the Chinese Communist Party has turned to patriotic nationalism for a new source of legitimacy. China's new nationalism transcends mere rhetoric but is manifested in the behavior of its armed forces ‐ which makes an understanding of the nationalist ideology of the People's Liberation Army (PLA) important. As revealed in PLA and related military publications, that ideology is a potentially problematic mix of wounded pride, historical resentment, and irredentism.     

Measures for Security in a Counterinsurgency

Quantitative measures to gauge progress in a counterinsurgency in use today include the number of enemy, friendly, and civilian casualties, and the level of violence. While common, each of these has drawbacks. With this and the sparseness of the literature on this topic in mind, we argue for a series of improved measures. These include the ratio of who is initiating incidents, an historical analysis of incidents and related variables, and an analysis of insurgent target sets. These measures are presented using data for Al Anbar province, Iraq, along with a discussion of their advantages over more common metrics.     

Local defence forces and counterinsurgency in Afghanistan: learning from the CIA's Village Defense Program in South Vietnam

Some scholars would have us believe that the distinctions between military and policing roles, methods and objectives have become increasingly blurred by the security demands of a post-Cold War and post-11 September global and domestic order. This article explores the current state of the police–military divide through a conceptual and case study analysis. It concludes that, in this case, there is some conflation occurring at a macro-level as international and domestic affairs have become increasingly indistinct, but the article also demonstrates that the actual ethos and practice of these agencies still differs strongly. Most importantly, the article argues that this distinction is in fact a very useful one in planning for future peace support operations     

Civil Wars,International Conflicts and Other Determinants of Paramilitary Strength in Sub-Saharan Africa

Previous research on African military spending suggests the existence of civil strife as the best predictor of high levels of military spending. However, little is known about why some African nations maintain strong ‘auxiliary’ or paramilitary organizations while others do not. This study finds that the presence of civil or interstate war does not strengthen reserve or irregular forces. Civilian governments promote strong paramilitary organizations to counter any threat the regular military might pose to regime survivability as a form of clientelist politics.     

Algorithms for solving the conditional covering problem on paths

Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Capacity allocation with machine duplication in semiconductor manufacturing

The manufacturing process for a computer chip is complex in that it involves a large number of distinct operations requiring a substantial lead‐time for completion. Our observations of such a manufacturing process at a large plant in the United States led us to identify several tactical and operational problems that were being addressed by the production planners on a recurring basis. This paper focuses on one such problem. At a tactical level, given a demand forecast of wafers to be manufactured, one specific problem deals with specifying which machine or machine groups will process different batches of wafers. We address this problem by recognizing the capacity limitations of the individual machines as well as the requirement for reducing operating and investment costs related to the machines. A mathematical model, which is a variation of the well‐known capacitated facility location problem, is proposed to solve this problem. Given the intractability of the model, we first develop problem specific lower bounding procedures based on Lagrangean relaxation. We also propose a heuristic method to obtain “good” solutions with reasonable computational effort. Computational tests, using hypothetical and industry‐based data, indicate that our heuristic approach provides optimal/near optimal solutions fairly quickly. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005