Radar pulse interleaving for multi‐target tracking

In a multifunction radar, the maximum number of targets that can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead‐times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the capacity of the system. The problem of interleaving N targets involves a search among N! possibilities, and suboptimal solutions are usually employed to satisfy the real‐time constraints of the radar system. In this paper, we present new tight 0–1 integer programming models for the radar pulse interleaving problem and develop effective solution methods based on Lagrangian relaxation techniques. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Dynamic proximity calculations for situation awareness

We apply dynamic proximity calculations (density and clustering) from dynamic computational geometry to a military application. The derived proximity information serves as an abstract view of a current situation in the battlefield that can help a military commander achieve situation awareness. We employ Delaunay triangulation as a computational tool in our framework, and study its dynamic update in depth. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Preservation of stochastic orders for random minima and maxima,with applications

It is shown, in this note, that the right spread order and the increasing convex order are both preserved under the taking of random maxima, and the total time on test transform order and the increasing concave order are preserved under the taking of random minima. Some inequalities and preservation properties in reliability and economics are given as applications. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Unpacking the various meanings of redundancy: from refining the concept to military planning

The authors engage in the debate over waste in military force structure planning by rigorously deconstructing the concept of “redundancy.” First, a typology of redundancy is constructed that provides a common framework for identifying variety among redundant structures. These are labeled “true redundancy,” “expanded capacity,” “portfolio diversification,” and “mission overlap.” Further, a number of mechanisms are identified that produce these types of structures, and show the conditions under which planners may utilize redundant structure in the search for optimization. In sum, the article provides refined concepts for analysts and planners to identify when redundancy is deleterious or beneficial.     

Small world,big guns: globalization,interstate security networks and conventional weapons imports

With the burgeoning influence of emerging markets in Asia, a tectonic shift is taking place in the global security landscape. Asian states are concomitantly arming as their economic clout grows. In light of these developments, security analysts would benefit from a formal means of placing these arms acquisitions in a structural context. Are arms acquisitions on par with the expectations of Asian states, given their structural dispositions, or are recent acquisitions beyond anticipated levels? By using a dynamic panel regression of 187 states from 1950 to 2011, this research predicts arms import volume using the degree of interstate arms linkages, the size of a state's military, and its level of economic development. The technique offers analysts a formal means of distinguishing orthodox behavior in importing conventional weapons from extraneous security motivations. The article concludes by generating near-term forecasts of Asian arms imports and discussing the implications of the technique.     

Appointment scheduling at a multidisciplinary outpatient clinic using stochastic programming

The purpose of this paper is to investigate the problem of constructing an appointment template for scheduling patients at a specific type of multidisciplinary outpatient clinic called an integrated practice unit (IPU). The focus is on developing and solving a stochastic optimization model for a back pain IPU in the face of random arrivals, an uncertain patient mix, and variable service times. The deterministic version of the problem is modeled as a mixed integer program with the objective of minimizing a weighted combination of clinic closing time (duration) and total patient waiting time (length of stay). A two‐stage stochastic program is then derived to account for the randomness and the sequential nature of the decisions. Although it was not possible to solve the two‐stage problem for even a limited number of scenarios, the wait‐and‐see (WS) problem was sufficiently tractable to provide a lower bound on the stochastic solution. The introduction of valid inequalities, limiting indices, and the use of special ordered sets helped to speed up the computations. A greedy heuristic was also developed to obtain solutions much more quickly. Out of practical considerations, it was necessary to develop appointment templates with time slots at fixed intervals, which are not available from the WS solution. The first to be derived was the expected value (EV) template that is used to find the expected value of the EV solution (EEV). This solution provides an upper bound on the objective function value of the two‐stage stochastic program. The average gap between the EEV and WS solutions was 18%. Results from extensive computational testing are presented for the EV template and for our adaptation of three other templates found in the literature. Depending on the relative importance of the two objective function metrics, the results demonstrate the trade‐off that exists between them. For the templates investigated, the “closing time” ranged from an average of 235 to 275 minutes for a 300‐minute session, while the corresponding “total patient time in clinic” ranged from 80 to 71 minutes.     

Meeting the growing safeguards burden

ABSTRACT

The International Atomic Energy Agency (IAEA) faces challenges in fulfilling its safeguards mandate as a result of an expanding safeguards burden and a relatively static budget. This dilemma has been exacerbated by the additional burdens of implementing the Joint Comprehensive Plan of Action (JCPOA) in Iran, but would not go away if implementation of the JCPOA were to end. There are three main areas of opportunity for the Agency: (1) budgetary expansion tied to changes in staffing policies, (2) changes in safeguards approaches, and (3) technological innovation. Barriers and limitations are associated with each approach, and advancing any of them will face a difficult political environment in Vienna.     

The Ethics of Cyber Attack: Pursuing Legitimate Security and the Common Good in Contemporary Conflict Scenarios

ABSTRACT

Cyber attack against Critical National Infrastructure is a developing capability in state arsenals. The onset of this new instrument in national security has implications for conflict thresholds and military ethics. To serve as a legitimate tool of policy, cyber attack must operate in accordance with moral concerns. To test the viability of cyber attack, this paper provides a new perspective on cyber ethics. Cyber attack is tested against the criteria of the common good. This involves identifying the four core components of the common good from a conflict perspective: respect for the person; social wellbeing; peace and security; and solidarity. The fate of these components is assessed in relation to the six key characteristics of cyber attack from a moral standpoint: security; the role or absence of violence; discrimination; proportionality; cyberharm; and the threshold of conflict. It is concluded that the common good must be incorporated into developing state cyber strategies.