The cardinality of manifold atlases

It is shown that any finite dimensionalC ⁰ manifold (connected and Hausdorff but otherwise unrestricted) has an atlas of cardinality not greater than that of the continuum; while if it has a Hölder continuous pseudo-Riemannian metric then there is a countable atlas.     

Lateral interactions in the thermal desorption of H2 from clean Cu/Ni(110) alloy surfaces

The adsorption of hydrogen on a clean Cu10%/Ni90% (110) alloy single crystal was studied using flash desorption spectroscopy (FDS), Auger electron spectroscopy (AES), and work function measurements. Surface compositions were varied from 100% Ni to 35% Ni. The hydrogen chemisorption on a-surface of 100% nickel revealed strong attractive interactions between the hydrogen atoms in accordance with previous work on Ni(100). Three desorption states (β₁, β₂ and α) appeared in the desorption spectra. The highest temperature (α) state was occupied only after the initial population of the β₂-state. As the amount of copper was increased in the nickel substrate, desorption from the higher energy binding α-state was reduced, indicating a decrease in the attractive interactions among hydrogen atoms. The hydrogen coverage at saturation was not affected by the addition of copper to the nickel substrate until the copper concentration was greater than 25% at which a sharp reduction in saturation coverage occurred. This phenomenon was apparently due to the adsorption of hydrogen on Ni atoms followed by occupation of NiNi and CuNi bridged adsorption sites, while occupation of CuCu sites was restricted due to an energy barrier to migration.     

Rb saturation spectroscopy with an optically narrowed FM diode laser

A fast-frequency modulated (FM) diode laser has been optically narrowed using the technique of resonant optical feedback, to provide linewidths in each FM mode of ≈ 200 kHz peak-to-peak. With a drive frequency of 50 MHz and modulation index of 0.2, the FM laser has been used for the first time to obtain Doppler-free FM spectra of the Rb D₁ line at 795 nm. The potential use of this system for laser frequency stabilisation is discussed.     

Comparisons between model equations for long waves

Summary Considered here are model equations for weakly nonlinear and dispersive long waves, which feature general forms of dispersion and pure power nonlinearity. Two variants of such equations are introduced, one of Korteweg-de Vries type and one of regularized long-wave type. It is proven that solutions of the pure initial-value problem for these two types of model equations are the same, to within the order of accuracy attributable to either, on the long time scale during which nonlinear and dispersive effects may accumulate to make an order-one relative difference to the wave profiles.This research was supported in part by the National Science Foundation. A considerable portion of the project was completed while the first author was resident at the Institute for Mathematics and Its Applications, University of Minnesota.     

The determination of the past and the future of a physical system in quantum mechanics

The determination of the past and the future of a physical system are complementary aims of measurements. An optimal determination of the past of a system can be achieved by an informationally complete set of physical quantities. Such a set is always strongly noncommutative. An optimal determination of the future of a physical system can be obtained by a Boolean complete set of quantities. The two aims can be reconciled to a reasonable degree with using unsharp measurements.This work was partly supported by the Bundesministerium für Forschung und Technologie, Bonn, the Research Institute for Theoretical Physics, Helsinki, and the University of Turku Foundation, Turku.     

Large fault-tolerant interconnection networks

This paper deals with reliability and fault-tolerant properties of networks. We first survey general reliability properties of networks, in particular those concerning diameter vulnerability. Then we study in details reliability properties of some families of networks in particular de Bruijn and Kautz networks and their generalizations which appear as very good fault-tolerant networks.     

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.