Sandwich approximation of univariate convex functions with an application to separable convex programming

In this article an algorithm for computing upper and lower ? approximations of a (implicitly or explicitly) given convex function h defined on an interval of length T is developed. The approximations can be obtained under weak assumptions on h (in particular, no differentiability), and the error decreases quadratically with the number of iterations. To reach an absolute accuracy of ? the number of iterations is bounded by

     

Fitting Lanchester equations to the battles of Kursk and Ardennes

Lanchester equations and their extensions are widely used to calculate attrition in models of warfare. This paper examines how Lanchester models fit detailed daily data on the battles of Kursk and Ardennes. The data on Kursk, often called the greatest tank battle in history, was only recently made available. A new approach is used to find the optimal parameter values and gain an understanding of how well various parameter combinations explain the battles. It turns out that a variety of Lanchester models fit the data about as well. This explains why previous studies on Ardennes, using different minimization techniques and data formulations, have found disparate optimal fits. We also find that none of the basic Lanchester laws (i.e., square, linear, and logarithmic) fit the data particularly well or consistently perform better than the others. This means that it does not matter which of these laws you use, for with the right coefficients you will get about the same result. Furthermore, no constant attrition coefficient Lanchester law fits very well. The failure to find a good‐fitting Lanchester model suggests that it may be beneficial to look for new ways to model highly aggregated attrition. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

潜在故障状态可测的一种故障检查模型

从系统的功能故障状态和潜在故障状态两方面讨论了故障检查模型,基于延迟时间模型推导了系统的期望可用度模型并对其适用性进行了讨论与验证。     

Experimental and numerical investigations of interface properties of Ti6Al4V/CP-Ti/Copper composite plate prepared by explosive welding

Explosive welding technique is widely used in many industries. This technique is useful to weld different kinds of metal alloys that are not easily welded by any other welding methods. Interlayer plays an important role to improve the welding quality and control energy loss during the collision process. In this paper, the Ti6Al4V plate was welded with a copper plate in the presence of a commercially pure titanium interlayer. Microstructure details of welded composite plate were observed through optical and scanning electron microscope. Interlayer-base plate interface morphology showed a wavy structure with solid melted regions inside the vortices. Moreover, the energy dispersive spectroscopy analysis in the interlayer-base interface reveals that there are some identified regions of different kinds of chemical equilibrium phases of Cu–Ti, i.e. CuTi, Cu₂Ti, CuTi₂, Cu₄Ti, etc. To study the mechanical properties of composite plates, mechanical tests were conducted, including the tensile test, bending test, shear test and Vickers hardness test. Numerical simulation of explosive welding process was performed with coupled Smooth Particle Hydrodynamic method, Euler and Arbitrary Lagrangian-Eulerian method. The multi-physics process of explosive welding, including detonation, jetting and interface morphology, was observed with simulation. Moreover, simulated plastic strain, temperature and pressure profiles were analysed to understand the welding conditions. Simulated results show that the interlayer base plate interface was created due to the high plastic deformation and localized melting of the parent plates. At the collision point, both alloys behave like fluids, resulting in the formation of a wavy morphology with vortices, which is in good agreement with the experimental results.     

Averaging frameworks for simulation optimization with applications to simulated annealing

We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints

This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

‘A Better War?’ – The View from the Nixon White House

This article examines the relationship between the White House and the US Military Assistance Command, Vietnam (MACV) during President Richard M. Nixon's administration. It argues that dysfunctional civil-military relations between 1969 and 1972 undermined the implementation of a sound military strategy during the United States' withdrawal from South Vietnam as Nixon attempted to achieve ‘peace with honor’ during the Vietnam War's final campaigns. By 1972, the relationship between the White House and MACV headquarters had reached the nadir of civil-military relations during the Southeast Asian conflict and had served to undercut the United States' ability to effectively disengage from a long and bitterly contested war.     

Four new takes on Wilson,World War I,and the making of the post-war order

The books under review here, by Robert F. Hannigan, John A. Thompson, Trygve Throntveit, and Adam Tooze, offer an interpretation of Wilsonian internationalism and what happened to it in the 1920s. For Tooze and Hannigan, Wilsonianism was primarily a project to attain American predominance in the world. For Throntveit, Wilsonian internationalism constituted a pragmatic yet radical effort to end competitive power politics. Thompson disagrees with these arguments and asserts that the key to understanding US policy lay in how US leaders conceptualized American power. Thompson’s interpretation is especially compelling in explaining why the United States failed to engage itself more assertively in international affairs in the 1920s – a failure Tooze suggests undermined the viability of the postwar international system.