Buchbesprechungen

Ohne Zusammenfassung

---

Book reviews

     

The complexity of cutting complexes

This paper investigates the combinatorial and computational aspects of certain extremal geometric problems in two and three dimensions. Specifically, we examine the problem of intersecting a convex subdivision with a line in order to maximize the number of intersections. A similar problem is to maximize the number of intersected facets in a cross-section of a three-dimensional convex polytope. Related problems concern maximum chains in certain families of posets defined over the regions of a convex subdivision. In most cases we are able to prove sharp bounds on the asymptotic behavior of the corresponding extremal functions. We also describe polynomial algorithms for all the problems discussed.Bernard Chazelle wishes to acknowledge the National Science Foundation for supporting this research in part under Grant No. MCS83-03925. Herbert Edelsbrunner is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862.     

Truncated Newton method for sparse unconstrained optimization using automatic differentiation

When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986.     

OPTIMAL INVESTMENT IN THE PROTECTION OF A VULNERABLE BIOLOGICAL RESOURCE

It is assumed that the probability of destruction of a biological asset by natural hazards can be reduced through investment in protection. Specifically a model, in which the hazard rate depends on both the age of the asset and the accumulated invested protection capital, is assumed. The protection capital depreciates through time and its effectiveness in reducing the hazard rate is subject to diminishing returns. It is shown how the investment schedule to maximize the expected net present value of the asset can be determined using the methods of deterministic optimal control, with the survival probability regarded as a state variable. The optimal investment pattern involves “bang-bang-singular” control. A numerical scheme for determining jointly the optimal investment policy and the optimal harvest (or replacement) age is outlined and a numerical example involving forest fire protection is given.     

The Third-Order Singular-Perturbation Expansion of the Planar Cold-Fluid Magnetron Equations

The singular-perturbation expansion of the plasma cold-fluid equations for crossed fields in a planar geometry is presented. The general expansion is carried out to third order. Various instabilities that occur in the first, second, and third orders are discussed.     

Extended Rees algebras and mixed multiplicities

Partially supported by the general research fund at the University of Kansas     

Exact soliton solutions of spinor Bose-Einstein condensates

We study matter-wave solitons in Bose-Einstein condensates of ultracold gaseous atoms with spin degrees of freedom and present a class of exact solutions based on the inverse scattering method. The one-soliton solutions are classified with respect to the spin states. We analyze collisional effects between solitons in the same or different spin state(s), which reveals a very interesting possibility: we can manipulate the spin dynamics by controlling the parameters of colliding solitons.     

Global fit analysis including the ν9 + ν4 − ν4 hot band of ethane: Evidence of an interaction with the ν12 fundamental

The ν₉ fundamental band of ethane occurs in the 12 μm region. It is the strongest band of ethane in a terrestrial window and is commonly used for the identification of ethane in the Jovian planets. The ν₉ + ν₄ − ν₄ band occurs in the same region; neither can be analysed as an isolated band, since both are embedded in the torsional bath of the ground vibrational state. We report here two global fit models including data from both of these bands as well as the ν₃ fundamental and the ν₄, 2ν₄ − ν₄, and 3ν₄ torsional transitions. The first is restricted to −5 ? KΔK ? 15 in the hot band and gives an excellent fit to the included data. Three resonant interactions are identified in this fit—a Coriolis interaction with two resonant cases between the ν₉ torsional stack and that of the ground vibrational state (gs) and a resonant Fermi interaction between the ν₃ fundamental and the gs. Hot band lines with KΔK < −5 are influenced by a fourth perturbation, with a crossing at −11 < KΔK < −10, which has been attributed to an interaction with the ν₁₂ fundamental. A second fit, demonstrating a promising treatment of this interaction, is also presented.     

Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

3D-TOFSIMS characterization of black spots in polymer light emitting diodes

The occurrence and formation of black spots areas in PolyLED devices has been studied by time-of-flight SIMS (TOFSIMS). The composition, shape and position of the black spots is visualised by three-dimensional (3D)-TOFSIMS depth-profiling. It has been established that the formation of non-emissive spots is due to the growth of aluminium oxide clusters at the AlBa/polymer interface. Electron injection in the black spots is lost by the resulting local increase of the resistivity of the cathode.