Layers of Experiments with Adaptive Combined Design

In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015     

Bush path to self-destruction: Charles Taylor and the Revolutionary United Front

This article explains the demise of Sierra Leone's Revolutionary United Front (RUF) rebellion. It argues that the main cause of this fate was the group's relationship with its primary sponsor, Charles Taylor. The RUF's dependency on Taylor's patronage, coupled with the rebellion's weak organisational endowments harmed the group's prospects of success. Based on original research, the article shows how Taylor used the RUF as a strategic instrument for his own regional interests, which led to the group's unravelling. More broadly, the article speaks about proxy warfare in Africa and how the relationship between resource flows and rebellion are not always beneficial to rebels as one might expect.     

An American Trojan horse? Eisenhower,Latin America,and the development of us internal security policy 1954–1960

Perceptions of Third World nations as susceptible to communist subversion and revolutionary warfare led the Eisenhower administration to formulate a coordinated internal security strategy known simply as ‘1290d’. Later renamed the Overseas Internal Security Program (OISP), this policy initiative sought to strengthen host‐nation security forces, judicial systems, and public information media in an effort to combat indirect communist intervention strategies. Implementing OISP policy in Latin America proved difficult. In Congress, the administration was criticised for colluding with dictatorial regimes, while Latin Americans feared that the new program would be used as a ‘Trojan Horse’ to penetrate their security structures. After the Cuban Revolution, however, OISP policies developed under Eisenhower came to dominate US‐Latin American security relations for the remainder of the Cold War.     

Analysis of aircraft sortie generation with the use of a fork-join queueing network model

This article presents an approximate analytical method for evaluating an aircraft sortie generation process. The process is modeled as a closed network of multiserver queues and fork-join nodes that allow concurrent service activities. The model uses a variation of mean value analysis (MVA) to capture the effect of mean service times, resource levels, and network topology on performance measures including resource utilizations and the overall sortie generation rate. The quality of the analytical approximation is demonstrated through comparison with simulation results. © 1997 John Wiley & Sons, Inc.

1 This article is a US Government work and, as such, is in the public domain in the United States of America.

Naval Research Logistics 44: 153–164, 1997     

An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions

This paper presents an algorithm for solving the integer programming problem possessing a separable nonlinear objective function subject to linear constraints. The method is based on a generalization of the Balas implicit enumeration scheme. Computational experience is given for a set of seventeen linear and seventeen nonlinear test problems. The results indicate that the algorithm can solve the nonlinear integer programming problem in roughly the equivalent time required to solve the linear integer programming problem of similar size with existing algorithms. Although the algorithm is specifically designed to solve the nonlinear problem, the results indicate that the algorithm compares favorably with the Branch and Bound algorithm in the solution of linear integer programming problems.     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

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.     

A Note on the Economics of Stolen Valor

Abstract

The economics of stolen valor concerns the act of trading on false claims of being awarded valorous military service medals. The U.S. Supreme Court overturned the 2005 Stolen Valor Act, largely on First Amendment grounds. Misrepresentation that devalues the reputation of medals for valor may not violate the revised statute despite decreasing the wage premium and discouraging investment in military effort.