Affine-scaling for linear programs with free variables

The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual.     

Geometrical method for determining the surface damage threshold for femtosecond laser pulses

A new geometrical method to determine the surface damage threshold for ultrashort pulses is presented. It consists in the formation of a surface damage profile by a movement of the sample across the laser beam focus. A single measurement of the maximum transversal dimension of this damage profile, which depends solely on the laser beam power, is used to calculate the local damage threshold intensity. It is also theoretically shown that the damage in the transverse dimension can be controlled under the diffraction-limited spot.     

Germanium growth on Br-terminated Si(1 0 0)

The consequences of Ge deposition on Br-terminated Si(1 0 0) were studied with scanning tunneling microscopy at ambient temperature after annealing at 650 K. One monolayer of Br was sufficient to prevent the formation of Ge huts beyond the critical thickness of 3 ML. This is possible because Br acts as a surfactant whose presence lowered the diffusivity of Ge adatoms. Hindered mobility was manifest at low coverage through the formation of short Ge chains. Further deposition resulted in the extension and connection of the Ge chains and gave rise to the buildup of incomplete layers. The deposition of 7 ML of Ge resulted in a rough surface characterized by irregularly shaped clusters. A short 800 K anneal desorbed the Br and allowed Ge atoms to reorganize into the more energetically favorable “hut” structures produced by conventional Ge overlayer growth on Si(1 0 0).     

Dependence of the H2-H2 Interaction on the Monomer Bond Lengths: Steps Toward an Accurate ab initio Estimate

We compute the vibrational coupling between two H₂ molecules from ab initio quantum chemical calculations of the H₂-H₂ potential carried out at the full configuration interaction level of theory using the atom-centered aug-cc-pVTZ basis set for hydrogen. We compare the full configuration interaction results with those obtained using two variants of coupled cluster theory and find that a fully iterative treatment of connected triples may be required to estimate the H₂-H₂ vibrational coupling accurately using coupled cluster theory.     

Interplay between four conjectures on certain zero-sum problems

In this paper, we explore the interplay of four different conjectures on certain zero-sum problems in Z_p Z_p. This study of the inter-relations between these conjectures leads to the conclusion that determining the structure of minimal zero sequences (see below for the precise definition) is crucial. Also, we study the analogous situation in Z_n.     

Effect of trapping centers of luminescent properties of bismuth orthogermanate

Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 54, No. 6, pp. 970–975, June, 1991.     

A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps.