The New Global Security Landscape: The Road Ahead

If one could look through the familiar artificial political lines and colors of a current world map into the twenty-first century strategic reality, one could see a complex new security arena. A deeper look into that picture would provide magical snapshots that show several types of ambiguous and asymmetric conflicts, and state failure - and their causes and consequences. Then, with some additional adjustments of focus, one can discern a number of issues that cannot be shown in two-dimensional space. They are briefly discussed as follows. First and importantly, one can get a better idea of the complex threat situation and the ultimate threat - state failure. Second, an even deeper examination of the vision of contemporary wars reveals the shadows of things that have been and of those that will be on the road ahead. Third, a closer look at the familiar and troubling world map exposes some signposts on the road ahead that indicate the most significant changes in the landscape. Finally, our magical microscope reveals a short list of the basic challenges and tasks that can help discerning civilian and military leaders negotiate the road through the new global security environment.     

Age replacement policies in two time scales

We develop and estimate optimal age replacement policies for devices whose age is measured in two time scales. For example, the age of a jet engine can be measured in the number of flight hours and the number of landings. Under a single‐scale age replacement policy, a device is replaced at age τ or upon failure, whichever occurs first. We show that a natural generalization to two scales is to replace nonfailed devices when their usage path crosses the boundary of a two‐dimensional region M, where M is a lower set with respect to the matrix partial order. For lifetimes measured in two scales, we consider devices that age along linear usage paths. We generalize the single‐scale long‐run average cost, estimate optimal two‐scale policies, and give an example. We note that these policies are strongly consistent estimators of the true optimal policies under mild conditions, and study small‐sample behavior using simulation. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 592–613, 2003.     

Nonparametric estimation of some quantities of interest from renewal theory

In this paper, confidence intervals are given for two quantities of importance related to renewal processes. For each quantity, two confidence intervals are discussed. One confidence interval is given for general, all‐purpose use. Another confidence interval is given which is easier to compute, but not of general use. The case where data are subject to right censorship is also considered. Some numerical comparisons are made. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 638–649, 2003.     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

On a Markov‐modulated shock and wear process

We present transient and asymptotic reliability indices for a single‐unit system that is subject to Markov‐modulated shocks and wear. The transient results are derived from the (transform) solution of an integro‐differential equation describing the joint distribution of the cumulative degradation process and the state of the modulating process. Additionally, we prove the asymptotic normality of a properly centered and time‐scaled version of the cumulative degradation at time t. This asymptotic result leads to a simple normal approximation for a properly centered and space‐scaled version of the systes lifetime distribution. Two numerical examples illustrate the quality of the normal approximation. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

US–China military relations: competition and cooperation

ABSTRACT

China’s efforts to build a ‘new type of great power relations’ and a ‘new type of military-to-military relations’ do not constitute a major turning point in relations with the United States. Political relations set limits on military cooperation, and the two sides have been unable to construct a sustainable strategic basis for relations. This has contributed to an ‘on-again, off-again’ pattern in military ties. Trends show a pattern of frequent disruptions in military-to-military relations from 2000 to 2010, followed by an increase in interactions beginning in 2012. Nevertheless, obstacles on both sides are likely to limit mutual trust and constrain future development of military-to-military relations.     

An exact method for finding shortest routes on a sphere,avoiding obstacles

On the surface of a sphere, we take as inputs two points, neither of them contained in any of a number of spherical polygon obstacles, and quickly find the shortest route connecting these two points while avoiding any obstacle. The WetRoute method presented here has been adopted by the US Navy for several applications. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 374–385, 2016     

Route optimization for multiple searchers

We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A general strategic capacity planning model under demand uncertainty

Capacity planning decisions affect a significant portion of future revenue. In equipment intensive industries, these decisions usually need to be made in the presence of both highly volatile demand and long capacity installation lead times. For a multiple product case, we present a continuous‐time capacity planning model that addresses problems of realistic size and complexity found in current practice. Each product requires specific operations that can be performed by one or more tool groups. We consider a number of capacity allocation policies. We allow tool retirements in addition to purchases because the stochastic demand forecast for each product can be decreasing. We present a cluster‐based heuristic algorithm that can incorporate both variance reduction techniques from the simulation literature and the principles of a generalized maximum flow algorithm from the network optimization literature. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006