Moving the techno-science gap in Security Force Assistance

This paper looks at the impact of military technology diffusion on military assistance operations (MAO), in the United States known as Security Force Assistance or SFA. The discussion looks conceptually at the role of technological change and how it interacts with martial cultures in military assistant operations. I argue that growing trends in science and technology suggest potential conflicts between culture and technology. Relying on a culture-technology model drawn from anthropology, the paper contends that new technologies will present increasing challenges for the emerging MAO landscape. The paper will illustrate that the techno-science gap will continue to grow as innovations such as robotics, sensors, and networks continue to develop. Finally, the paper will look at ways to overcome this conflict between culture and technology.     

Some new results on the preservation of the NBUE and NWUE aging classes under the formation of coherent systems

We consider the classical problem of whether certain classes of lifetime distributions are preserved under the formation of coherent systems. Under the assumption of independent and identically distributed (i.i.d.) component lifetimes, we consider the NBUE (new better than used in expectation) and NWUE (new worse than used in expectation) classes. First, a necessary condition for a coherent system to preserve the NBUE class is given. Sufficient conditions are then obtained for systems satisfying this necessary condition. The sufficient conditions are satisfied for a collection of systems which includes all parallel systems, but the collection is shown to be strictly larger. We also prove that no coherent system preserves the NWUE class. As byproducts of our study, we obtain the following results for the case of i.i.d. component lifetimes: (a) the DFR (decreasing failure rate) class is preserved by no coherent systems other than series systems, and (b) the IMRL (increasing mean residual life) class is not preserved by any coherent systems. Generalizations to the case of dependent component lifetimes are briefly discussed.     

Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem

The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restrictions, which are subsequently linearized. For special problem forms, the structure of these linearized constraints tends to suggest that certain classes may be more beneficial than others. We examine the usefulness of subsets of constraints for a family of 0–1 quadratic multidimensional knapsack programs and perform extensive computational tests on a classical special case known as the 0–1 quadratic knapsack problem. We consider RLT forms both with and without these inequalities, and their comparisons with linearizations derived from published methods. Interestingly, the computational results depend in part upon the commercial software used. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Estimating the probability that a simulated system will be the best

Consider a stochastic simulation experiment consisting of v independent vector replications consisting of an observation from each of k independent systems. Typical system comparisons are based on mean (long‐run) performance. However, the probability that a system will actually be the best is sometimes more relevant, and can provide a very different perspective than the systems' means. Empirically, we select one system as the best performer (i.e., it wins) on each replication. Each system has an unknown constant probability of winning on any replication and the numbers of wins for the individual systems follow a multinomial distribution. Procedures exist for selecting the system with the largest probability of being the best. This paper addresses the companion problem of estimating the probability that each system will be the best. The maximum likelihood estimators (MLEs) of the multinomial cell probabilities for a set of v vector replications across k systems are well known. We use these same v vector replications to form v^k unique vectors (termed pseudo‐replications) that contain one observation from each system and develop estimators based on AVC (All Vector Comparisons). In other words, we compare every observation from each system with every combination of observations from the remaining systems and note the best performer in each pseudo‐replication. AVC provides lower variance estimators of the probability that each system will be the best than the MLEs. We also derive confidence intervals for the AVC point estimators, present a portion of an extensive empirical evaluation and provide a realistic example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 341–358, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10019     

Controlling rates in a double queue

A double-ended queue with a Poisson arrival pattern is examined in a situation where the rates depend (in a restricted sense) on both the time and the state of the system. Under some circumstances, the rates can be controlled. This article studies the distribution of the difference in queue sizes for each member of a large class of control strategies and introduces the problem of determining the optimal times at which the control should be in effect in order to maximize certain objective functions.     

Replacing nonidentical vital components to extend system life

We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Security,structural factors and sovereignty: Analysing reactions to Kenya’s decision to close the Dadaab refugee camp complex

Kenya’s decision to close the Dadaab refugee camp complex highlights structural flaws in the international refugee regime. While much attention has been paid to Kenya’s reasoning, less has been given to the reactions of organisations and states. Given the state’s primacy in the international system and uncertainty about refugees, Kenya’s decision is perhaps unsurprising. It is contended that the stakeholders were unprepared because of path dependence and disbelief that Kenya would repatriate the refugees. While stakeholder reactions arguably demonstrate concern for refugees, the international refugee regime remains unquestioned, sustaining revenue streams that may fuel corruption, encourage lengthy encampment and prolong conflict.     

Optimizing submarine berthing with a persistence incentive

Submarine berthing plans reserve mooring locations for inbound U.S. Navy nuclear submarines prior to their port entrance. Once in port, submarines may be shifted to different berthing locations to allow them to better receive services they require or to make way for other shifted vessels. However, submarine berth shifting is expensive, labor intensive, and potentially hazardous. This article presents an optimization model for submarine berth planning and demonstrates it with Naval Submarine Base, San Diego. After a berthing plan has been approved and published, changed requests for services, delays, and early arrival of inbound submarines are routine events, requiring frequent revisions. To encourage trust in the planning process, the effect on the solution of revisions in the input is kept small by incorporating a persistence incentive in the optimization model. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 301–318, 1997.