Fund Transfers – African Terrorists Blend Old and New: Hawala and Satellite Telecommunications

Attempts to disrupt the flow of funds through Africa used to finance terrorism have been hindered by terrorists utilizing satellite telecommunications in conjunction with hawala, an ancient system of fund transfers based on trust. This arrangement leaves few records for tracing transactions, a task made even more difficult by the general paucity of investigators trained in the languages commonly used for hawala. Acquiring personnel with the appropriate linguistic skills is one of the steps agencies can take to reduce the terrorist financing that occurs through this unique blend of an ancient system with modern technology.     

An informal framework to aid the analysis and design of military posture

The design of military posture is an exercise in confronting potential enemies’ capabilities within the context of geographic, technological, temporal, political and economic constraints. No formal model is capable of encapsulating the essentials of so complex an environment for closed or simulated analysis, but it is useful to have an informal framework within which to reason interactively within these dimensions.

This paper presents such a scaffolding, patterned on the notion of a military posture as the output of an economic process whose structure reflects important determinants of the characteristics and extents of weaponry and expenditures that are appropriate to the environment within the feasibility set determined by the constraints. The analysis remains at an abstract level, but it does highlight the important shifts toward preparation for littoral warfare, greater reliance on reserve rather than active forces, and necessary changes in missions among military departments.     

COMPREHENSIVE NUCLEAR-TEST-BAN TREATY

President Barack Obama has pledged to secure the ratification of the Comprehensive Nuclear-Test-Ban Treaty (CTBT), which was previously rejected by the U.S. Senate in 1999. This article attempts to predict the potential implications of Washington's ratification for the treaty's future by analyzing the positions and options of the eight other essential holdouts. The authors conclude that without the United States to hide behind, facing domestic and international constraints, and lacking substantial strategic reasons to remain outside the treaty, most holdouts will move toward ratification. Nonetheless, the process is likely to be time consuming, and several of the key actors remain unpredictable.     

ZERO NUCLEAR WEAPONS

The current nuclear nonproliferation order is no longer sustainable. The Treaty on the Non-Proliferation of Nuclear Weapons (NPT) has weakened considerably over the years, with nuclear have-nots displaying increased dissatisfaction with the status quo. Meanwhile, demands for civilian nuclear technology have led to increased proliferation risks in the form of dual-use technologies. Arms control as we currently understand it—piecemeal treaties and agreements—is no longer sufficient to address the growing threat of proliferation and the frailty of the NPT. This article calls for a bolder nonproliferation agenda pursuing multilateral nuclear disarmament. Disarmament is, in fact, technologically achievable; a lack of political will stands as the only remaining roadblock to a world free of nuclear weapons. A better understanding of the technological feasibility of disarmament, as well as recognition of the diminishing strategic value of nuclear weapons, will help to erode this political reluctance.     

Dynamic programming approaches to the multiple criteria knapsack problem

We study the integer multiple criteria knapsack problem and propose dynamic‐programming‐based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and multiperiod as well as time‐dependent models. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 57–76, 2000     

On the busy period of the M/G/1 retrial queue

The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of the M/G/1$ retrial queue. The structure of the busy period and its analysis in terms of Laplace transforms have been discussed by several authors. However, this solution has serious limitations in practice. For instance, we cannot compute the first moments of L by direct differentiation. This paper complements the existing work and provides a direct method of calculation for the second moment of L. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 115–127, 2000     

Makespan minimization in the two‐machine flowshop batch scheduling problem

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000