NUCLEAR ATTRIBUTION AS DETERRENCE

Recently, post-explosion nuclear forensics, or nuclear attribution, has gained a new spotlight within the nuclear weapons scientific and policymaking community. Academics are beginning to ask whether post-explosion forensics might create a replacement for an international nonproliferation regime, or at least offer a fallback option to deter states and individuals from selling nuclear materials. This paper examines current attribution technology from unclassified literature and finds the technology to be well developed but not foolproof, such that nuclear attribution currently provides little deterrent value. If current capabilities were publicized more thoroughly and if the post-explosion process of assessing the evidence were internationalized, states and intermediate actors might be deterred more effectively. Developing a nuclear fingerprint database is also discussed. While useful, its impact on deterrence would be minimal.     

IF YOU WANT IT DONE RIGHT,DO IT YOURSELF

Some have argued that the transatlantic rancor over the Iraq war made cooperation, especially on nonproliferation, unlikely. In contrast, this article, documents post-invasion instances of nonproliferation cooperation, with particular emphasis on the Proliferation Security Initiative and the EU-3 Initiative—the British, French, and German negotiations with Iran over its suspected nuclear activities. In addition to documenting French and British participation in these initiatives, the article analyzes why they have chosen to participate and argues that France and Britain have participated in both efforts because they are committed to avoiding future Iraq-like preventive wars.     

Sequential learning versus no learning in Bayesian regression models

We consider two regression models: linear and logistic. The dependent variable is observed periodically and in each period a Bayesian formulation is used to generate updated forecasts of the dependent variable as new data is observed. One would expect that including new data in the Bayesian updates results in improved forecasts over not including the new data. Our findings indicate that this is not always true. We show there exists a subset of the independent variable space that we call the “region of no learning.” If the independent variable values for a given period in the future are in this region, then the forecast does not change with any new data. Moreover, if the independent variable values are in a neighborhood of the region of no learning, then there may be little benefit to wait for the new data and update the forecast. We propose a statistical approach to characterize this neighborhood which we call the “region of little learning.” Our results provide insights into the trade‐offs that exist in situations when the decision maker has an incentive to make an early decision based on an early forecast versus waiting to make a later decision based on an updated forecast. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 532–548, 2014     

Optimization of steerable sensor network for threat detection

A Markov chain approach to detecting a threat in a given surveillance zone by a network of steerable sensors is presented. The network has a finite number of predetermined states, and transition from one state to another follows a Markov chain. Under the assumption that the threat avoids detection, two game theoretic problems for finding an optimal Markov chain (two surveillance strategies) are formulated: the first maximizes the probability of threat detection for two consecutive detection periods, whereas the second minimizes the average time of detection for the worst‐case threat's trajectory. Both problems are reduced to linear programming, and special techniques are suggested to solve them. For a dynamic environment with moving noise sources, the optimal Markov chain changes at each detection period, and the rate of convergence of the Markov chain to its stationary distribution is analyzed. Both surveillance strategies are tested in numerical experiments and compared one with another. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

On optimal system designs in reliability‐economics frameworks

Reliability Economics is a field that can be defined as the collection of all problems in which there is tension between the performance of systems of interest and their cost. Given such a problem, the aim is to resolve the tension through an optimization process that identifies the system which maximizes some appropriate criterion function (e.g. expected lifetime per unit cost). In this paper, we focus on coherent systems of n independent and identically distributed (iid) components and mixtures thereof, and characterize both a system's performance and cost as functions of the system's signature vector (Samaniego, IEEE Trans Reliabil (1985) 69–72). For a given family of criterion functions, a variety of optimality results are obtained for systems of arbitrary order n. Approximations are developed and justified when the underlying component distribution is unknown. Assuming the availability of an auxiliary sample of N component failure times, the asymptotic theory of L‐estimators is adapted for the purpose of establishing the consistency and asymptotic normality of the proposed estimators of the expected ordered failure times of the n components of the systems under study. These results lead to the identification of ε‐optimal systems relative to the chosen criterion function. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

On the effectiveness of top‐down strategy for forecasting autoregressive demands

We investigate the relative effectiveness of top‐down versus bottom‐up strategies for forecasting the demand of an item that belongs to a product family. The demand for each item in the family is assumed to follow a first‐order univariate autoregressive process. Under the top‐down strategy, the aggregate demand is forecasted by using the historical data of the family demand. The demand forecast for the items is then derived by proportional allocation of the aggregate forecast. Under the bottom‐up strategy, the demand forecast for each item is directly obtained by using the historical demand data of the particular item. In both strategies, the forecasting technique used is exponential smoothing. We analytically evaluate the condition under which one forecasting strategy is preferred over the other when the lag‐1 autocorrelation of the demand time series for all the items is identical. We show that when the lag‐1 autocorrelation is smaller than or equal to 1/3, the maximum difference in the performance of the two forecasting strategies is only 1%. However, if the lag‐1 autocorrelation of the demand for at least one of the items is greater than 1/3, then the bottom‐up strategy consistently outperforms the top‐down strategy, irrespective of the items' proportion in the family and the coefficient of correlation between the item demands. A simulation study reveals that the analytical findings hold even when the lag‐1 autocorrelation of the demand processes is not identical. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Stochastically minimizing the makespan in flow shops

In this article, we are concerned with scheduling stochastic jobs in a flowshop with m machines and zero intermediate storage. We assume that there are n - 2 identically distributed and 2 fast stochastic jobs. Roughly, the main result states that the makespan is stochastically minimized by placing one of the fast jobs first and the other last.