A note on the extension of a result on scheduling with secondary criteria

A result of Smith previously published in this journal [3], on the use of secondary criterion in scheduling problems is extended, and an example presented.     

Extra-Systemic Conflict as a System Steering Solution: A Habermasian Analysis of State Sponsorship for Insurgency Movements

This article attempts to forward an alternative theoretical explanation of insurgency sponsorship to standard realist and neo-realist explanations for international violence. While not discounting issues of security and power, this study points out that ‘extra-rational’ motivations often lead states to sponsor violent movements in target states, even if this decision has no or negative effects on the sponsor state's security. Furthermore, extra-rational explanations, such as revenge, prestige or ideology typically lead to conflicts of greater violence and duration.     

The search for an intelligent evader: Strategies for searcher and evader in the two-region problem

This paper considers the search for an evader concealed in one of two regions, each of which is characterized by its detection probability. The single-sided problem, in which the searcher is told the probability of the evader being located in a particular region, has been examined previously. We shall be concerned with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move: his optimal strategy consists of that probability distribution which maximizes the expected time to detection, while the searcher's optimal strategy is the sequence of searches which limits the evader to this expected time. It transpires for this problem that optimal strategies for both searcher and evader may generally be obtained to a surprisingly good degree of approximation by using the optimal strategies for the closely related (but far more easily solved) problem in which the evader is completely free to move between searches.     

Efficient sequential decision‐making algorithms for container inspection operations

Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

THE PROLIFERATION SECURITY INITIATIVE

The Asia-Pacific is emerging as a critical region in the fight against the proliferation of weapons of mass destruction. The Proliferation Security Initiative (PSI) is an aggressive global strategy designed to interdict the transport of these weapons and associated technologies. However, some observers have suggested that the Asia-Pacific has given the PSI a less than enthusiastic reception. The authors posit a more sanguine view. They caution against taking such a holistic approach to the region. Asia does not speak with one voice when it comes to security, and opposition to the PSI is not as widespread nor deep-rooted as may have been anticipated. In addition, the PSI's informal structure encourages flexibility, enabling states to participate in certain activities while eschewing others that may be technically or politically untenable.     

The search for an intelligent evader concealed in one of an arbitrary number of regions

This paper considers the search for an evader concealed in one of an arbitrary number of regions, each of which is characterized by its detection probability. We shall be concerned here with the double-sided problem in which the evader chooses this probability secretly, although he may not subsequently move; his aim is to maximize the expected time to detection, while the searcher attempts to minimize it. The situation where two regions are involved has been studied previously and reported on recently. This paper represents a continuation of this analysis. It is normally true that as the number of regions increases, optimal strategies for both searcher and evader are progressively more difficult to determine precisely. However it will be shown that, generally, satisfactory approximations to each are almost as easily derived as in the two region problem, and that the accuracy of such approximations is essentially independent of the number of regions. This means that so far as the evader is concerned, characteristics of the two-region problem may be used to assess the accuracy of such approximate strategies for problems of more than two regions.