GERMANY'S CURRENT AND FUTURE PLUTONIUM INVENTORY

In the past, Germany reprocessed a significant amount of its spent nuclear fuel, partly on its own territory but mostly as a customer of British and French reprocessing plants. In mid-2005, Germany stopped this practice, banning new transports of spent fuel for reprocessing—although the already-exported material would be allowed to be reprocessed and recycled in German reactors as mixed-oxide (MOX) fuel. In total, about 6,500 tonnes of heavy metal have been contracted for reprocessing, but a significant portion of this material has neither been reprocessed nor recycled as MOX fuel in German reactors. Due to the complex import-export history and the partly nontransparent information policy of the German government and utilities, a comprehensive and up-to-date plutonium balance for Germany is not publicly available. This report provides an assessment of Germany's plutonium inventory (stored domestically or abroad) based on open-source information. Special attention is paid to the issue of whether the entire inventory of separated plutonium can be completely irradiated in German nuclear reactors before the last of them are shut down in 2022. The authors conclude that Germany's stock of plutonium waiting to be recycled was about 12.2 tonnes as of 2010; this plutonium should be completely re-imported from the United Kingdom and France by 2017. Germany's MOX-consumption capacities should be sufficient to irradiate the remaining plutonium, although further delays are expected that could leave Germany with an inventory of separated (unirradiated) plutonium.     

The Odyssey of the Comprehensive Nuclear-Test-Ban Treaty

This study examines the failures of the William J. Clinton and Barack Obama administrations to secure ratification of the Comprehensive Nuclear-Test-Ban Treaty (CTBT). It applies an integrated analytical framework for assessing treaty ratification that builds upon previous research in order to understand why the Clinton administration failed to achieve CTBT ratification in 1999 and why the Obama administration has so far failed to advance the treaty in the Senate. The study concludes that CTBT ratification, despite Obama administration pledges of support, remains highly unlikely. Finally, the study analyzes the common domestic political factors present in both cases and suggests areas for further research.     

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     

Efficient algorithms for flexible job shop scheduling with parallel machines

Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two-center job shop. The first center consists of one machine and the second has k parallel machines. An easy-to-perform approximate algorithm for minimizing the makespan with one-unit-time operations in the first center and k-unit-time operations in the second center is proposed. The algorithm has the absolute worst-case error bound of k − 1 , and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2 .     

Optimal replacement of continuously degrading systems in partially observed environments

Motivated by wind energy applications, we consider the problem of optimally replacing a stochastically degrading component that resides and operates in a partially observable environment. The component's rate of degradation is modulated by the stochastic environment process, and the component fails when it is accumulated degradation first reaches a fixed threshold. Assuming periodic inspection of the component, the objective is to minimize the long‐run average cost per unit time of performing preventive and reactive replacements for two distinct cases. The first case examines instantaneous replacements and fixed costs, while the second considers time‐consuming replacements and revenue losses accrued during periods of unavailability. Formulated and solved are mixed state space, partially observable Markov decision process models, both of which reveal the optimality of environment‐dependent threshold policies with respect to the component's cumulative degradation level. Additionally, it is shown that for each degradation value, a threshold policy with respect to the environment belief state is optimal if the environment alternates between two states. The threshold policies are illustrated by way of numerical examples using both synthetic and real wind turbine data. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 395–415, 2015     

Predicting older-donor kidneys' post-transplant renal function using pre-transplant data

This paper provides a methodology for predicting post-transplant kidney function, that is, the 1-year post-transplant estimated Glomerular Filtration Rate (eGFR-1) for each donor-candidate pair. We apply customized machine-learning algorithms to pre-transplant donor and recipient data to determine the probability of achieving an eGFR-1 of at least 30 ml/min. This threshold was chosen because there is insufficient survival benefit if the kidney fails to generate an eGFR-1 ≥ 30 ml/min. For some donor-candidate pairs, the developed algorithm provides highly accurate predictions. For others, limitations of previous transplants' data results in noisier predictions. However, because the same kidney is offered to many candidates, we identify those pairs for whom the predictions are highly accurate. Out of 6977 discarded older-donor kidneys that were a match with at least one transplanted kidney, 5282 had one or more identified candidate, who were offered that kidney, did not accept any other offer, and would have had ≥80% chance of achieving eGFR-1 ≥ 30 ml/min, had the kidney been transplanted. We also show that transplants with ≥80% chance of achieving eGFR-1 ≥ 30 ml/min and that survive 1 year have higher 10-year death-censored graft survival probabilities than all older-donor transplants that survive 1 year (73.61% vs. 70.48%, respectively).