CREATING SUNS ON EARTH

Concerns about climate change and energy security have prompted some countries to revive dormant nuclear fission power programs to meet growing energy demands and reduce carbon dioxide emissions. However, this so-called nuclear renaissance based on fission would have major drawbacks in the areas of safety, security, and nonproliferation. Nuclear fusion, however, is portrayed by its proponents as mitigating these drawbacks, and scientists continue to pursue fusion's promise with two large-scale projects: the International Thermonuclear Experimental Reactor (ITER), and the Laser Inertial Fusion Engine (LIFE) reactor. Although supporters often hail fusion as proliferation resistant, the technology could be used to create weapons-usable fissile material. This article explains how fissile material could be created in ITER or LIFE and analyzes other nonproliferation implications of fusion; the authors discuss the various challenges faced by ITER and LIFE.     

HOW WAS THE COLD WAR WON?

Reagan's Secret War: The Untold Story of His Fight to Save the World from Nuclear Disaster, by Martin Anderson and Annelise Anderson. Crown Publishers, 2009. 464 pages, $32.50.

The Rebellion of Ronald Reagan: A History of the End of the Cold War, by James Mann. Viking, 2009. 410 pages, $27.95.     

Analyzing the Cambodian insurgency as a social field

This article investigates power practices in the Cambodian insurgency after 1979 as being part of a social field. There are various types of power practice being exercised by commanders aiming at making soldiers disciplined inside the insurgency. The hypothesis explaining these variations being proposed here is that the type of power being exercised depends on the habitus of the respective commander. Power practices are shaped by the incorporated classificatory discourse of commanders on good soldierhood and leadership. Thereby, armed groups can be analyzed as a social field in which practices are always relational and part of symbolic struggles between different commanders.     

Algorithms for the constrained maximum-weight connected graph problem

Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph (MCG) problem is to find a connected subgraph with R vertices that maximizes the sum of the weights. The MCG problem is strongly NP-complete, and we study a special case of it: the constrained MCG (CMCG) problem, which is the MCG problem with a constraint of having a predetermined vertex included in the solution. We first show that the Steiner tree problem is a special case of the CMCG problem. Then we present three optimization algorithms for the CMCG problem. The first two algorithms deal with special graphs (tree and layered graphs) and employ different dynamic programming techniques, solving the CMCG problem in polynomial times. The third one deals with a general graph and uses a variant of the Balas additive method with an imbedded connectivity test and a pruning method. We also present a heuristic algorithm for the CMCG problem with a general graph and its bound analysis. We combine the two algorithms, heuristic and optimization, and present a practical solution method to the CMCG problem. Computational results are reported and future research issues are discussed. © 1996 John Wiley & Sons, Inc.     

Decomposition algorithms for the maximum-weight connected graph problem

Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph problem (MCG) is to find a connected subgraph with R vertices that maximizes the sum of their weights. MCG has applications to communication network design and facility expansion. The constrained MCG (CMCG) is MCG with a constraint that one predetermined vertex must be included in the solution. In this paper, we introduce a class of decomposition algorithms for MCG. These algorithms decompose MCG into a number of small CMCGs by adding vertices one at a time and building a partial graph. They differ in the ordering of adding vertices. Proving that finding an ordering that gives the minimum number of CMCGs is NP-complete, we present three heuristic algorithms. Experimental results show that these heuristics are very effective in reducing computation and that different orderings can significantly affect the number of CMCGs to be solved. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 817–837, 1998     

In Defense of Mercy

ABSTRACT

Though it is legally permissible to kill combatants in war, unless they are rendered hors de combat, the existence of “Naked Soldiers” raises an important moral question: should combatants kill vulnerable enemy combatants or show mercy towards them? Most philosophers who address this question argue that it is morally permissible to kill the Naked Soldier given the extended notion of self-defense during war. They ground their arguments in a form of collectivism. In this article, I use Larry May’s argument. He offers an approach that extends the principle of discrimination that would apply also to combatants. Instead of assuming all combatants are de facto dangerous, this approach would allow for nuance in targeting the enemy and showing mercy when enemy combatants clearly pose no danger, in other words, when they are Naked Soldiers. I defend this view against two criticisms: Noam Zohar’s view of armies as complex collectives and Stephen Deakin’s view that a policy that spares Naked Soldiers would be open to abuse. I argue that it is not only morally suspect to kill Naked Soldiers, but also it is within the spirit of both international laws governing war and the just war tradition to offer mercy whenever possible.