Modeling and analyzing multiple station baggage screening security system performance

In the aftermath of the tragic events of 11 September 2001, numerous changes have been made to aviation security policy and operations throughout the nation's airports. The allocation and utilization of checked baggage screening devices is a critical component in aviation security systems. This paper formulates problems that model multiple sets of flights originating from multiple stations (e.g., airports, terminals), where the objective is to optimize a baggage screening performance measure subject to a finite amount of resources. These measures include uncovered flight segments (UFS) and uncovered passenger segments (UPS). Three types of multiple station security problems are identified and their computational complexity is established. The problems are illustrated on two examples that use data extracted from the Official Airline Guide. The examples indicate that the problems can provide widely varying solutions based on the type of performance measure used and the restrictions imposed by the security device allocations. Moreover, the examples suggest that the allocations based on the UFS measure also provide reasonable solutions with respect to the UPS measure; however, the reverse may not be the case. This suggests that the UFS measure may provide more robust screening device allocations. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

New sources of military change – armed forces as normal organizations

The literature on how European states have adapted to the post-cold war security environment ffocuses invariably on different understandings of military transformation, a process which is seen as inherently different from other forms of organizational change. However, as this paper argues, new management practices, going back to the introduction of so-called New Public Management (NPM) reforms throughout Europe in the 1980s, have eventually penetrated also the last bastion of the old state – the defense sector. Taking a critical approach to the idea of military transformation and existing theories of military change, the paper demonstrates how other international developments have pushed towards what may be seen as a “normalization” of Europe’s defense sectors. This has important implications for how we approach and understand change in contemporary defense organizations.     

Towards a new national security policy for Canada

Canada is now at a crossroads unlike any other period in its history and needs to carefully consider which path to take. With the new Trudeau government comfortably ensconced since the defeat of the Harper government in the fall of 2015, a variety of competing interests have emerged in an attempt to turn Canadian policy back to a more nostalgic period of the 1970s that some see as preferable to the institutional lash-up that existed since the rolling out of the Canada First policy in the 2000s. That nostalgic period is, however, misunderstood both willfully for political purposes but also through a lack of historical context. Firmly rooting future actions in a blunt analysis of national interests is preferable to the alternative.     

Optimal nonmyopic gambling strategy for the generalized Kelly criterion

We consider the optimal wagers to be made by a gambler who starts with a given initial wealth. The gambler faces a sequence of two-outcome games, i.e., “win” vs. “lose,” and wishes to maximize the expected value of his terminal utility. It has been shown by Kelly, Bellman, and others that if the terminal utility is of the form log x, where x is the terminal wealth, then the optimal policy is myopic, i.e., the optimal wager is always to bet a constant fraction of the wealth provided that the probability of winning exceeds the probability of losing. In this paper we provide a critique of the simple logarithmic assumption for the utility of terminal wealth and solve the problem with a more general utility function. We show that in the general case, the optimal policy is not myopic, and we provide analytic expressions for optimal wager decisions in terms of the problem parameters. We also provide conditions under which the optimal policy reduces to the simple myopic case. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 639–654, 1997     

Optimal strategies for problems of simultaneous attack against an area defense without impact-point prediction

An area to be defended consists of separated point targets. These targets are subject to an attack in which the offensive weapons are assumed to arrive simultaneously. The defense has area defenders, each of which is capable of intercepting any attacker. The defense has no impact-point prediction; that is, it has no knowledge of any attacker's destination prior to allocation of area interceptors. For a given attack, the defense wishes to allocate its interceptors to maximize the total expected survival value of the targets. For a given attack size, the offense seeks a strategy to minimize total expected surviving value against best defense. We determine an optimal defensive strategy directly and develop an algorithm to determine an optimal attack and the optimal value of the min-max problem. A dynamic programming technique is used to obtain integer solutions, and illustrative computational results are provided.     

Linear search with bounded resources

A point is placed at random on the real line according to some known distribution F, and a search is made for this point, beginning at some starting points s on the line, and moving along the line according to some function x(t). The objective of this article is to maximize the probability of finding the point while traveling at most d units. Characterizations of simple optimal searches are found for arbitrary distributions, for continuous distributions with continuous density everywhere (e.g., normal, Cauchy, triangular), and for continuous distributions with density which is continuous on its support (e.g., exponential, uniform). These optimal searches are also shown to be optimal for maximization of the expected number of points found if the points are placed on the line independently from a known distribution F.     

Rectilinear m-Center problem

In this article we consider the unweighted m-center problem with rectilinear distance. We preent an O(n^m–2 log n) algorithm for the m-center problem where m ≥ 4.     

Bioprotection of facilities

The anthrax attacks of 2001 energized research directed toward reducing health consequences from airborne contaminants by augmenting current heating ventilation and air-conditioning (HVAC) systems. Even during peacetime, interest will continue in improving HVAC components to reduce biocontaminants associated with sick building syndrome. Current HVAC design uses numerical simulation methods of ordinary differential equations to predict approximate performance. The authors show that state-space Laplace Transform calculations actually solve the underlying differential equations and yield algebraic expressions that provide new insight. To sharpen the arguments in favor of this methodology, attention is restricted to improving existing HVAC systems to increase protection from an external release of hazardous particulates. By nearly eliminating the need for dynamical simulation, the resulting methods can be applied to far more complex HVAC designs with little additional computational effort. The new methods reduce the time required for computation by three orders of magnitude. These algebraic methods also can be extended to disparate technical problems including internal particulate release, gas masks, and designing new protective buildings.     

Auctions in the post‐change‐order period

A change order is frequently initiated by either the supplier or the buyer, especially when the contract is long‐term or when the contractual design is complex. In response to a change order, the buyer can enter a bargaining process to negotiate a new price. If the bargaining fails, she pays a cancellation fee (or penalty) and opens an auction. We call this process the sequential bargaining‐auction (BA). At the time of bargaining, the buyer is uncertain as to whether the bargained price is set to her advantage; indeed, she might, or might not, obtain a better price in the new auction. To overcome these difficulties, we propose a new change‐order‐handling mechanism by which the buyer has an option to change the contractual supplier after bargaining ends with a bargained price. We call this the option mechanism. By this mechanism, the privilege of selling products or services is transferred to a new supplier if the buyer exercises the option. To exercise the option, the buyer pays a prespecified cash payment, which we call the switch price, to the original supplier. If the option is not exercised, the bargained price remains in effect. When a switch price is proposed by the buyer, the supplier decides whether or not to accept it. If the supplier accepts it, the buyer opens an auction. The option is exercised when there is a winner in the auction. This article shows how, under the option mechanism, the optimal switch price and the optimal reserve price are determined. Compared to the sequential BA, both the buyer and the supplier benefit. Additionally, the option mechanism coordinates the supply chain consisting of the two parties. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 248–265, 2015