Preserving defense technologies: A strategy for economic conversion†

This paper presents a model for converting legacy defense production facilities into private‐sector economic resources. Specifically, this paper will examine as a case study the first successful conversion of a former U.S. Department of Energy nuclear weapons production installation, including reasons for its success, its costs and benefits, and lessons for public policy. It is envisioned that this model may be useful for mitigating local economic hardship resulting from defense “downsizing” and for privatizing production capacities critical for national defense.     

Sequential tests for hypotheses concerning the product of poisson parameters with applications to problems in reliability and biometry

Sequential tests for the product of Poisson parameters based on the generalized incomplete modified Bessel (g.i.m.B.) distributions are given. Applications to reliability and biometry are indicated.     

舰机时间协同对潜检查搜索样式

舰机一体化反潜是反潜作战最有效的形式,而舰机协同反潜搜索是其最重要的组成部分.从实际应用的角度出发,研究了舰机时间协同检查搜索样式,并给出了基于该样式的实际应用例子.     

Unsolved murders and the investigative failures of the Nigerian police force: Security and sociopolitical implications

This article focuses on the systemic failures of the Nigerian police force to unravel the mysteries surrounding homicides in the country, along with the security, social and political implications of the ongoing trend. The article draws on documented pieces of evidence of high-profile murders, along with the causes of the upsurge in murder incidences and the inhibitive factors relating to the investigative procedures of the police. The suitability of the theory of subaltern realism and the concept of third-world security predicaments in explaining the peculiarities of Nigeria’s internal security challenges is examined, along with the problems of the legitimacy of political regimes and weak borders. There is a need for the National Assembly of Nigeria to exercise its constituted powers in reawakening and supervising investigations into dormant cases of murder through its committees on police affairs, public safety and national security. The police should check its organisational failures, which may be related to using the wrong investigative approaches, low levels of information, limited resources, corrupt practices, and pressure to obtain quick results.     

Demand shuffle—A method for multilevel proportional lot sizing and scheduling

This contribution acquaints the reader with a model for multilevel single-machine proportional lot sizing and scheduling problems (PLSPs) that appear in the scope of short-term production planning. It is one of the first articles that deals with dynamic capacitated multilevel lot sizing and scheduling, which is of great practical importance. The PLSP model refines well-known mixed-integer programming formulations for dynamic capacitated lot sizing and scheduling as, for instance, the DLSP or the CSLP. A special emphasis is given on a new method called demand shuffle to solve multilevel PLSP instances efficiently but suboptimally. Although the basic idea is very simple, it becomes clear that in the presence of precedence and capacity constraints many nontrivial details are to be concerned. Computational studies show that the presented approach decidedly improves recent results. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 319–340, 1997     

On the set of (perfect) equilibria of a bimatrix game

This article provides a new approach to the set of (perfect) equilibria. With the help of an equivalence relation on the strategy space of each player. Nash sets and Selten sets are introduced. The number of these sets is finite and each of these sets is a polytope. As a consequence the set of (perfect) equilibria is a finite union of polytopes. © 1994 John Wiley & Sons. Inc.     

Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times

In this article the problem of minimizing the mean absolute deviation (MAD) of job completion times about an unrestricted given common due date with tolerance in the n-job, single-machine scheduling environment is considered. We describe some optimality conditions and show that the unrestricted version of the MAD problem with an arbitrary due date tolerance is polynomial by proposing a polynomial-time algorithm for identifying an optimal schedule. © 1994 John Wiley & Sons, Inc.