A Cryptographic Escrow for Treaty Declarations and Step-by-Step Verification

The verification of arms-control and disarmament agreements requires states to provide declarations, including information on sensitive military sites and assets. There are important cases, however, in which negotiations of these agreements are impeded because states are reluctant to provide any such data, because of concerns about prematurely handing over militarily significant information. To address this challenge, we present a cryptographic escrow that allows a state to make a complete declaration of sites and assets at the outset and commit to its content, but only reveal the sensitive information therein sequentially. Combined with an inspection regime, our escrow allows for step-by-step verification of the correctness and completeness of the initial declaration so that the information release and inspections keep pace with parallel diplomatic and political processes. We apply this approach to the possible denuclearization of North Korea. Such approach can be applied, however, to any agreement requiring the sharing of sensitive information.     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.     

Quantification of contractor risk

This paper presents a quantitative index of the level of risk assumed by a contractor in various contract type situations. The definition includes expression of real world uncertainty and contractor's utility for money. Examples are given for the major contract types and special applications are discussed.     

Preserving defense technologies: A strategy for economic conversion†

This paper presents a model for converting legacy defense production facilities into private‐sector economic resources. Specifically, this paper will examine as a case study the first successful conversion of a former U.S. Department of Energy nuclear weapons production installation, including reasons for its success, its costs and benefits, and lessons for public policy. It is envisioned that this model may be useful for mitigating local economic hardship resulting from defense “downsizing” and for privatizing production capacities critical for national defense.     

Countering Insurgent-terrorism: Why Nato Chose The Wrong Historical Foundation For Cimic

History teaches that counterinsurgency and counterterrorism campaigns have never been won through purely military action. Defeating an opponent who avoids open battle, but who uses force to reach his goals, including terrorist action, requires a combination of police, administrative, economic and military measures. As a counterinsurgency campaign should pursue a comprehensive political objective, it requires high levels of civil–military cooperation. However, current NATO doctrine for Civil–Military Cooperation (CIMIC) as it emerged from the 1990s is founded in conventional war-fighting and outdated peacekeeping doctrine. CIMIC's focus is on supporting military objectives rather than enabling the military to make a coherent contribution to political objectives. This makes CIMIC unfit for the Alliance's main operational challenges that have expanded from peace operations on the Balkans to countering insurgent terrorism in Afghanistan. When developing CIMIC, the Alliance obviously neglected the historical lessons from counterinsurgency campaigns.     

Texas Ranger Auxiliaries: Double-Edged Sword of the Campaign for Northern Mexico, 1846–1848

This essay explores how federalized Texas Rangers, in the form of scout companies and larger mounted rifle regiments, provided controversial, and ultimately cost-effective, versatility to the US Army during its campaign in Northern Mexico between 1846 and 1848. It argues that their contributions centered on three tactical tasks that enhanced the invading army's maneuvers: reconnaissance, direct assault, and counterguerrilla patrolling. Each of these actions reflected a distinctive skill-set at which the auxiliaries excelled, marking them as exceptionally multifunctional assets. The Texans' augmentation coincided with, and was necessitated by, the evolving stages of the war in Northern Mexico, beginning with the American army's initial invasion, then transitioning to the assault on Monterrey, and finally ending with a troubled occupation where the rangers' brutality both enabled and undermined American pacification efforts.     

Cyclic preference scheduling for nurses using branch and price

This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

Scheduling jobs,with exponentially distributed processing times,on two machines of a flow shop

This paper treats the problem of sequencing n jobs on two machines in a “flow shop.” (That is, each job in the shop is required to flow through the same sequence of the machines.) The processing time of a given job on a given machine is assumed to be distributed exponentially, with a known mean. The objective is to minimize the expected job completion time. This paper proves an optimal ordering rule, previously conjectured by Talwar [10]. A formula is also derived through Markov Chain analysis, which evaluates the expected job completion time for any given sequence of the jobs. In addition, the performance of a heuristic rule is discussed in the light of the optimal solution.