Deferred verification: verifiable declarations of fissile-material stocks for disarmament purposes

ABSTRACT

Nuclear disarmament is often seen as eventually requiring access to nuclear warheads or to the warhead-dismantlement process to verify that a state has not hidden weapons or weapon-materials despite promising to disarm. This article suggests this view is misplaced, and that what is needed is a verification mechanism able to provide reliable assurances of the absence of fissile materials available for use in weapons after a state has disarmed. Such a mechanism will need an initial declaration of the amount of fissile materials held by a state for all purposes, military and civilian. In a state with a nuclear arsenal awaiting elimination, this declaration would have to include materials that may not be available for verification because they are in nuclear weapons or are in other classified or proliferation-sensitive forms. This article describes a verification arrangement that does not require access to materials in weapons and in sensitive forms while still allowing checks on the overall accuracy of the declaration. Verification of the completeness and correctness of the declaration is deferred to the time when the weapons-relevant material enters the disposition process, at which point it no longer has any sensitive attributes. By removing the focus on monitoring warheads and dismantlement, this new approach could provide a more manageable path to nuclear disarmament.     

MIDDLE EAST NONPROLIFERATION

The Middle East is a crucial region for the global nonproliferation regime. In 2010, the state parties to the Treaty on the Non-Proliferation of Nuclear Weapons proposed a conference on a Middle East Weapons of Mass Destruction-Free Zone. The nuclear weapon-free zone model, on which this idea builds, has achieved important results in other regions, but faces especially stark challenges in the Middle East. However, the attempt to apply the boldly imaginative zone approach to the Middle East holds promise for building a more inclusive dialogue on nonproliferation and regional security.     

CIVIL CONTROL OF THE ZAMBIAN MILITARY SINCE INDEPENDENCE

Democratic rule requires, amongst other things, orderly civil-military relations. Zambia's military, with some exceptions, have generally remained under firm civilian control, unlike many forces in the region. Initially the military was based on the British colonial model but during the struggle for independence the force was indigenised. Instead of representing a colonial power, the military came to represent a specific political viewpoint: one party participatory democracy. President Kaunda, the leader of UNIP, was chiefly responsible for the politicisation of the military and ensuring its loyalty to the ruling party. Quasi-military institutions such as the Combined Cadet Force and the Home Guard Unit were useful links between civilian and military personnel. When Frederick Chiluba, leader of the MMD, took over in 1991 he tried to make the military more professional and curb its power over civilian affairs. A defence council and parliamentary regulation were instituted to avoid further military coups.     

THE EXERCISE OF NATIONAL SOVEREIGNTY

Skeptics of the Bush administration have castigated its strong aversion to formal international agreements in responding to the threat of the proliferation of weapons of mass destruction (WMD), citing unilateral actions as the default alternative. Yet this critique misses the growing emergence of a conscious framework guiding the administration's actions: an emphasis on the exercise of national sovereignty and the corollary principle of sovereign responsibility. Rejecting the paradigm of arms control as the answer to WMD proliferation, the current administration instead advocates a toolkit of alternative mechanisms based on the full exercise by individual nation, states of their domestic authorities and rights under international law, acting in their capacities as responsible citizens of the global community. This paper will examine that philosophical approach and its concrete application through the following policies: (1) the Proliferation Security Initiative; (2) enforcement of national laws and regulations as exemplified by United Nations Security Council Resolution 1540 and the U.S. proposals for consideration by Biological Weapons Convention signatories; and (3) preemptive warfare to disarm the WMD programs of a threatening state.     

Command and Control of India's Nuclear Forces

The Indian government has not made a public comment about the status of its nuclear weapon program since approving a nuclear doctrine in 2003. However, there is now enough information in the public domain to determine that the command-and-control system for the nuclear program has steadily matured in accordance with the intent of the approved nuclear doctrine. The Indian government has successfully mitigated many of the issues that plague the conventional military. The result is a basic command-and-control system that is focused only on the delivery, if ordered by the prime minister, of nuclear weapons. The system is not as robust as those of the United States and Russia, but is in place and ready as new Indian nuclear weapons enter into operation. The command-and-control system is developing to meet India's needs and political compulsions, but not necessarily as part of a more assertive nuclear policy.     

An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem

We address the problem of dispatching a vehicle with different product classes. There is a common dispatch cost, but holding costs that vary by product class. The problem exhibits multidimensional state, outcome and action spaces, and as a result is computationally intractable using either discrete dynamic programming methods, or even as a deterministic integer program. We prove a key structural property for the decision function, and exploit this property in the development of continuous value function approximations that form the basis of an approximate dispatch rule. Comparisons on single product‐class problems, where optimal solutions are available, demonstrate solutions that are within a few percent of optimal. The algorithm is then applied to a problem with 100 product classes, and comparisons against a carefully tuned myopic heuristic demonstrate significant improvements. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 742–769, 2003.     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

Estimating the accuracy of the coverages of outer β-content tolerance intervals,which control both tails of the normal distribution

Tolerance limits which control both tails of the normal distribution so that there is no more than a proportion β₁ in one tail and no more than β₂ in the other tail with probability γ may be computed for any size sample. They are computed from X? - k₁S and X? - k₂S, where X? and S are the usual sample mean and standard deviation and k₁ and k₂ are constants previously tabulated in Odeh and Owen [3]. The question addressed is, “Just how accurate are the coverages of these intervals (– Infin;, X? – k₁S) and (X? + k₂S, ∞) for various size samples?” The question is answered in terms of how widely the coverage of each tail interval differs from the corresponding required content with a given confidence γ′.