Precision cyber weapon systems: An important component of a responsible national security strategy?

Given the advances made in conventional weapon capabilities, precision should by now be the accepted and expected norm in cyberspace as well. In this article I argue that developing precision cyber weapon systems, to be used during a lawful conflict, can be an important part of a responsible national security strategy to reduce the amount of violence and physical destruction in conflicts. I first describe a precision cyber weapon system in a military context. I then present three compelling rationales for the development of precision cyber weapon systems based on ethical, operational, and financial considerations. To support the position, I address several arguments that have been levied against their development. Thereafter I present several recommendations for a way ahead.     

Technical note: A computationally efficient algorithm for undiscounted Markov decision processes with restricted observations

We present a computationally efficient procedure to determine control policies for an infinite horizon Markov Decision process with restricted observations. The optimal policy for the system with restricted observations is a function of the observation process and not the unobservable states of the system. Thus, the policy is stationary with respect to the partitioned state space. The algorithm we propose addresses the undiscounted average cost case. The algorithm combines a local search with a modified version of Howard's (Dynamic programming and Markov processes, MIT Press, Cambridge, MA, 1960) policy iteration method. We demonstrate empirically that the algorithm finds the optimal deterministic policy for over 96% of the problem instances generated. For large scale problem instances, we demonstrate that the average cost associated with the local optimal policy is lower than the average cost associated with an integer rounded policy produced by the algorithm of Serin and Kulkarni Math Methods Oper Res 61 (2005) 311–328. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Diffusion approximation to the G/G/R machine repair problem with warm standby spares

The G/G/R machine repair problem with M operating machines, S warm standby spares, and R repairmen is studied as a diffusion process. The steady-state equations are formulated as diffusion equations subject to two reflecting barriers. The approximate diffusion parameters of the diffusion equations are obtained (1) under the assumption that the input characteristics of the problem are defined only by their first two moments rather than their probability distribution function, (2) under the assumption of heavy traffic approximation, that is, when queues of failed machines in the repair stage are almost always nonempty, and (3) using well-known asymptotic results from renewal theory. Expressions for the probability density functions of the number of failed machines in the system are obtained. A study of the derived approximate results, compared to some of the exact results, suggests that the diffusion approach provides a useful method for solving complex machine-repair problems.     

Optimal force mix in heterogeneous combat

This article presents models for determining the optimum number of Red weapons required to win a heterogeneous combat in which m(m> 1) types of Red weapons face a single type of Blue weapon under a newly defined termination policy. Red aims at either minimizing the total cost or maximizing the aggregated remaining force strength. Kuhn-Tucker and simulated annealing techniques are used for obtaining the optimal solution. The methodology is illustrated by analysing heterogeneous combat to determine (i) the feasibility of introducing new types of weapons and (ii) the number of weapons required to win if a specific type of weapon, say infantry, dominates. © 1995 John Wiley & Sons, Inc.     

Note on “An Optimal Recursive Method for Various Inventory Replenishment Models with Increasing Demand and Shortages” by Teng et al.

In a recent paper, Teng, Chern, and Yang consider four possible inventory replenishment models and determine the optimal replenishment policies for them. They compare these models to identify the best alternative on the basis of minimum total relevant inventory costs. The total cost functions for Model 1 and Model 4 as derived by them are not exact for the comparison. As a result, their conclusion on the least expensive replenishment policy is incorrect. The present article provides the actual total costs for Model 1 and Model 4 to make a correct comparison of the four models. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 602–606, 2000     

Analysis of project scheduling strategies in a client-contractor environment

In this article we consider a cost-minimization model to investigate scheduling strategies for multistaged projects in a client-contractor environment. This type of environment is symptomatic of temporal changes in project definition and scope. At prespecified epochs the client conducts an external evaluation of the project and either accepts or rejects the contractor's current work. The resulting uncertainty from the client's review is modeled via monotonically varying acceptance probabilities. The model is designed primarily to address the interaction between earliest-, intermediate-, and latest-start options and project-crashing stragies for a broad range of penalty costs. Theoretical results are introduced, while numerical examples for both exponentially and polynomially based acceptance probabilities are discussed.     

Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems

When solving location problems in practice it is quite common to aggregate demand points into centroids. Solving a location problem with aggregated demand data is computationally easier, but the aggregation process introduces error. We develop theory and algorithms for certain types of centroid aggregations for rectilinear 1‐median problems. The objective is to construct an aggregation that minimizes the maximum aggregation error. We focus on row‐column aggregations, and make use of aggregation results for 1‐median problems on the line to do aggregation for 1‐median problems in the plane. The aggregations developed for the 1‐median problem are then used to construct approximate n‐median problems. We test the theory computationally on n‐median problems (n ≥ 1) using both randomly generated, as well as real, data. Every error measure we consider can be well approximated by some power function in the number of aggregate demand points. Each such function exhibits decreasing returns to scale. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 614–637, 2003.     

RUSSIAN NAVAL NUCLEAR FUEL AND REACTORS

Russian naval nuclear fuel and reactors pose both proliferation and environmental threats, ranging from the possible theft of highly enriched uranium fuel to the radioactive contamination of the environment, whether due to accident, neglect, or sabotage. Current conditions at Russian naval bases, together with a history of accidents and incidents involving Russia's nuclear fleet, make a convincing case for the large-scale assistance that the G8 is now providing to improve the safety and security of Russian naval reactors and fuel. However, virtually no data has been released to allow accurate, reliable, and independent analysis of reactor and fuel properties, risking misguided international efforts to assist in the areas of nuclear cleanup, nonproliferation, and security. This article identifies and assesses relevant properties and developments related to reactor and fuel design, provides a comprehensive presentation of Russian nuclear naval technologies, and examines technological trends in the context of proliferation and environmental security.     

PLAYING GOD WITH HIV

It is generally understood that conflict can contribute to the spread of disease. This paper explains the reverse: how disease, as an accelerating factor, can result in serious conflict. While not a cause of war itself, HIV/AIDS exacerbates existing tensions: social, ethnic and political. Political constituencies concerned about HIV/AIDS will become frustrated if the state's leadership does not meet their demands. The demand for medical treatment of the disease is certain to exceed supply in all Southern African states. Projects to treat the disease are small and access is limited. The criteria for access, both real and perceived, will play a critical role in determining the level of conflict and disruption that HIV/AIDS will cause.     

The Colonial War revisited

The Carnation Revolution on 25 April 1974 toppled the authoritarian regime in Lisbon. It is fallacious to conclude, however, that the 1974 coup d’état signaled Portugal's defeat in the Colonial War. The status of each conflict on the eve of the Carnation Revolution varied, and it was by no means inevitable that Portugal would have been defeated in all three theatres had the coup not occurred. This brief research note therefore advances a novel approach to examining the Colonial War by assessing the outcomes prior to the 1974 coup. In particular, the author proposes that Portugal achieved military victory in Angola and Mozambique, but was defeated in Guinea-Bissau.