The inherent propensity toward peace or war embodied in weaponry

Thomas Schelling argues that armed adversaries face an inherent propensity toward peace or war embodied in their weaponry, geography and military organizations. Inherent propensity is the idea that there are characteristics embodied in the weapons that push adversaries toward peace or war, independent of the goals of the decision‐makers, the political disagreement between adversaries, and misperceptions about mutual resolve and hostility. We theoretically illustrate inherent propensity in conventional and nuclear arms settings using Lanchester and Intriligator war models. Our work extends the Intriligator‐Brito model, identifies when the competing Richardson and Intriligator‐Brito views of the relationship between arms races and war are correct, illustrates the stabilizing/destabilizing effects of alliances, and highlights the importance of arms quality control in the US‐USSR relationship.     

War and punishment the implication of arms purchases in maritime Southeast Asia

While there is no arms race currently underway in Southeast Asia, there should still be concern for the effects of a regional arms buildup. No state currently possesses, or is seeking to possess, the capabilities necessary to dominate the core territory of its potential adversaries. However, the types of weapons being procured favour punishment based strategies that are highly unstable and war‐prone. Geographic vulnerability to blockade and interdiction make Southeast Asia's security dilemma particularly acute.     

Interdiction models for delaying adversarial attacks against critical information technology infrastructure

Information technology (IT) infrastructure relies on a globalized supply chain that is vulnerable to numerous risks from adversarial attacks. It is important to protect IT infrastructure from these dynamic, persistent risks by delaying adversarial exploits. In this paper, we propose max‐min interdiction models for critical infrastructure protection that prioritizes cost‐effective security mitigations to maximally delay adversarial attacks. We consider attacks originating from multiple adversaries, each of which aims to find a “critical path” through the attack surface to complete the corresponding attack as soon as possible. Decision‐makers can deploy mitigations to delay attack exploits, however, mitigation effectiveness is sometimes uncertain. We propose a stochastic model variant to address this uncertainty by incorporating random delay times. The proposed models can be reformulated as a nested max‐max problem using dualization. We propose a Lagrangian heuristic approach that decomposes the max‐max problem into a number of smaller subproblems, and updates upper and lower bounds to the original problem via subgradient optimization. We evaluate the perfect information solution value as an alternative method for updating the upper bound. Computational results demonstrate that the Lagrangian heuristic identifies near‐optimal solutions efficiently, which outperforms a general purpose mixed‐integer programming solver on medium and large instances.     

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

Efficient distributions of arms‐control inspection effort

A rule that constrains decision‐makers is enforced by an inspector who is supplied with a fixed level of inspection resources—inspection personnel, equipment, or time. How should the inspector distribute its inspection resources over several independent inspectees? What minimum level of resources is required to deter all violations? Optimal enforcement problems occur in many contexts; the motivating application for this study is the role of the International Atomic Energy Agency in support of the Treaty on the Non‐Proliferation of Nuclear Weapons. Using game‐theoretic models, the resource level adequate for deterrence is characterized in a two‐inspectee problem with inspections that are imperfect in the sense that violations can be missed. Detection functions, or probabilities of detecting a violation, are assumed to be increasing in inspection resources, permitting optimal allocations over inspectees to be described both in general and in special cases. When detection functions are convex, inspection effort should be concentrated on one inspectee chosen at random, but when they are concave it should be spread deterministicly over the inspectees. Our analysis provides guidance for the design of arms‐control verification operations, and implies that a priori constraints on the distribution of inspection effort can result in significant inefficiencies. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

谈侦检车在处置核泄漏灾害事故中的应用

因海啸而引起的日本福岛核电站核泄漏危机,充分警示人类必须做好有效应对核泄漏事故的准备工作。核生化侦检车具有快速标定核辐射物质、确定辐射边界的功能,消防部队应研究、掌握和应用核生化侦检技术,积极做好应对今后有可能发生的核生化灾害事故的准备工作。     

To catch an intruder: Part A—uncluttered scenario

We analyze an interdiction scenario where an interceptor attempts to catch an intruder as the intruder moves through the area of interest. A motivating example is the detection and interdiction of drug smuggling vessels in the Eastern Pacific and Caribbean. We study two models in this article. The first considers a nonstrategic target that moves through the area without taking evasive action to avoid the interdictor. We determine the optimal location the interceptor should position itself to best respond when a target arrives. The second model analyzes the strategic interaction between the interceptor and intruder using a Blotto approach. The intruder chooses a route to travel on and the interceptor chooses a route to patrol. We model the interaction as a two‐player game with a bilinear payoff function. We compute the optimal strategy for both players and examine several extensions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 29–40, 2017     

Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017     

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

Directional change‐point detection for process control with multivariate categorical data

Most modern processes involve multiple quality characteristics that are all measured on attribute levels, and their overall quality is determined by these characteristics simultaneously. The characteristic factors usually correlate with each other, making multivariate categorical control techniques a must. We study Phase I analysis of multivariate categorical processes (MCPs) to identify the presence of change‐points in the reference dataset. A directional change‐point detection method based on log‐linear models is proposed. The method exploits directional shift information and integrates MCPs into the unified framework of multivariate binomial and multivariate multinomial distributions. A diagnostic scheme for identifying the change‐point location and the shift direction is also suggested. Numerical simulations are conducted to demonstrate the detection effectiveness and the diagnostic accuracy.© 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Reconsidering minimum deterrence in South Asia: Indian responses to Pakistan’s tactical nuclear weapons

India’s nuclear doctrine and posture has traditionally been shaped by minimum deterrence logic. This logic includes assumptions that possession of only a small retaliatory nuclear force generates sufficient deterrent effect against adversaries, and accordingly that development of limited nuclear warfighting concepts and platforms are unnecessary for national security. The recent emergence of Pakistan’s Nasr tactical nuclear missile platform has generated pressures on Indian minimum deterrence. This article analyzes Indian official and strategic elite responses to the Nasr challenge, including policy recommendations and attendant implications. It argues that India should continue to adhere to minimum deterrence, which serves as the most appropriate concept for Indian nuclear policy and best supports broader foreign and security policy objectives. However, the form through which Indian minimum deterrence is delivered must be rethought in light of this new stage of regional nuclear competition.     

Efficient sequential decision‐making algorithms for container inspection operations

Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Securing a border under asymmetric information

We study a stochastic interdiction model of Morton et al. IIE Transactions, 39 (2007):3–14 that locates radiation sensors at border crossings to detect and prevent the smuggling of nuclear material. In this model, an interdictor places sensors at customs checkpoints to minimize a potential smuggler's maximum probability of crossing a border undetected. We focus on a model variant in which the interdictor has different, and likely more accurate, perceptions of the system's parameters than the smuggler does. We introduce a model that is tighter and uses fewer constraints than that of Morton et al. We also develop a class of valid inequalities along with a corresponding separation procedure that can be used within a cutting‐plane approach to reduce computational effort. Computational results demonstrate the effectiveness of our approach.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 91–100, 2014     

Optimal maintenance policies for a safety‐critical system and its deteriorating sensor

We consider the integrated problem of optimally maintaining an imperfect, deteriorating sensor and the safety‐critical system it monitors. The sensor's costless observations of the binary state of the system become less informative over time. A costly full inspection may be conducted to perfectly discern the state of the system, after which the system is replaced if it is in the out‐of‐control state. In addition, a full inspection provides the opportunity to replace the sensor. We formulate the problem of adaptively scheduling full inspections and sensor replacements using a partially observable Markov decision process (POMDP) model. The objective is to minimize the total expected discounted costs associated with system operation, full inspection, system replacement, and sensor replacement. We show that the optimal policy has a threshold structure and demonstrate the value of coordinating system and sensor maintenance via numerical examples. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 399–417, 2017     

大数据在信息作战指挥决策中的运用

针对信息作战指挥决策中大数据的运用问题，通过对大数据的海量信息检索能力、交叉复现的分析能力、“全信息”运算能力、智能决策执行能力的研究，提出了大数据为其提供按需订制的情报信息、多元多维的决策视角、动态实时的决策支持、智能自主的决策方式的观点，初步探索了大数据在信息作战指挥决策中的运用，对将大数据引入信息作战指挥决策具有十分重要的指导意义。     

Syria and the perils of proxy warfare

The ongoing civil war in Syria is evolving into a ‘proxy war’, in which both the Baathist regime and its insurgent adversaries are becoming increasingly reliant upon support from external powers. Proxy warfare has a superficial appeal for sponsoring states, as it appears to offer a convenient and risk-free means of fulfilling foreign policy goals, which will not incur the financial and human costs of direct military intervention. Using Syria as a case study, this article shows that the conduct of proxy warfare has several potential political, strategic, and ethical consequences, which any democratic government in particular is obliged to consider before it resorts to this indirect means of foreign intervention.     

Timely exposure of a secret project: Which activities to monitor?

A defender wants to detect as quickly as possible whether some attacker is secretly conducting a project that could harm the defender. Security services, for example, need to expose a terrorist plot in time to prevent it. The attacker, in turn, schedules his activities so as to remain undiscovered as long as possible. One pressing question for the defender is: which of the project's activities to focus intelligence efforts on? We model the situation as a zero‐sum game, establish that a late‐start schedule defines a dominant attacker strategy, and describe a dynamic program that yields a Nash equilibrium for the zero‐sum game. Through an innovative use of cooperative game theory, we measure the harm reduction thanks to each activity's intelligence effort, obtain insight into what makes intelligence effort more effective, and show how to identify opportunities for further harm reduction. We use a detailed example of a nuclear weapons development project to demonstrate how a careful trade‐off between time and ease of detection can reduce the harm significantly.     

Israel’s Security Nexus as Strategic Restraint: The Case of Iran 2009–2013

This article examines the debates in Israel between 2009 and 2013 over Iran’s nuclear programme as a reflection of a particular type of civil–military or civil–security relationship. It analyses how key actors within that relationship – particularly those with an intelligence background – engaged with media outlets in Israel and further afield to influence domestic and international opinion over how best to contain Iran’s nuclear ambitions. In so doing, it seeks to address one fundamental question: are governments in Jerusalem any longer the final arbiters over deciding what is in the national security interests of the State of Israel?     

Nuclear Subsidies and Proliferation: Clarifying the Link

ABSTRACT

In March 2015, the South Australian state government established a royal commission to investigate the financial, social, technical, diplomatic, and nonproliferation benefits and risks of expanding its nuclear industry, including activities related to uranium mining; enriching, reprocessing, and fabricating nuclear fuels for both domestic use and export; producing nuclear power; and storing radiological waste, including foreign spent reactor fuel. Given its enormous uranium reserves and current mining activities, some Australians have argued that Australia could benefit financially by expanding the mining sector and by adding value to its uranium exports by enriching the material and fabricating it into reactor fuel assemblies. Others have maintained that Australia can realize significant economic benefits by recycling and storing foreign spent fuel and producing carbon-free nuclear power. In the end, the commission recommended that Australia consider opening up a high-level waste repository to take in foreign spent fuel. It did not recommend any other nuclear activities at this time. The following viewpoint is based on testimony I delivered to the commission on the nuclear weapon proliferation implications of the proposed activities. If Australia wants to avoid the temptation of selling nuclear goods to states that might use these goods to make bombs, it should only consider new nuclear activities that can be entirely financed by the private sector and turn a profit without having to resort to foreign sales. This policy would also enable Australia to set an important, new international nonproliferation standard.