Showing papers by "Bell Labs published in 1984"

A new polynomial-time algorithm for linear programming

Abstract: We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n 3.5 L) arithmetic operations onO(L) bit numbers, wheren is the number of variables andL is the number of bits in the input. The running-time of this algorithm is better than the ellipsoid algorithm by a factor ofO(n 2.5). We prove that given a polytopeP and a strictly interior point a eP, there is a projective transformation of the space that mapsP, a toP′, a′ having the following property. The ratio of the radius of the smallest sphere with center a′, containingP′ to the radius of the largest sphere with center a′ contained inP′ isO(n). The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in polynomial time.

Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms

Abstract: In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in 0(log n) amortized time and all other standard heap operations in 0(1) amortized time. Using F-heaps we are able to obtain improved running times for several network optimization algorithms.

Band-Edge Electroabsorption in Quantum Well Structures: The Quantum-Confined Stark Effect

Abstract: We present theory and extended experimental results for the large shift in optical absorption in GaAs-AlGaAs quantum well structures with electric field perpendicular to the layers. In contrast to the Stark effect on atoms or on excitons in bulk semiconductors, the exciton resonances remain resolved even for shifts much larger than the zero-field binding energy and fields g 50 times the classical ionization field. The model explains these results as a consequence of the quantum confinement of carriers.

A new polynomial-time algorithm for linear programming

Abstract: We present a new polynomial-time algorithm for linear programming. The running-time of this algorithm is O(n3-5L2), as compared to O(n6L2) for the ellipsoid algorithm. We prove that given a polytope P and a strictly interior point a e P, there is a projective transformation of the space that maps P, a to P', a' having the following property. The ratio of the radius of the smallest sphere with center a', containing P' to the radius of the largest sphere with center a' contained in P' is O (n). The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in polynomial-time.

Graphical Perception: Theory, Experimentation, and Application to the Development of Graphical Methods

Abstract: The subject of graphical methods for data analysis and for data presentation needs a scientific foundation. In this article we take a few steps in the direction of establishing such a foundation. Our approach is based on graphical perception—the visual decoding of information encoded on graphs—and it includes both theory and experimentation to test the theory. The theory deals with a small but important piece of the whole process of graphical perception. The first part is an identification of a set of elementary perceptual tasks that are carried out when people extract quantitative information from graphs. The second part is an ordering of the tasks on the basis of how accurately people perform them. Elements of the theory are tested by experimentation in which subjects record their judgments of the quantitative information on graphs. The experiments validate these elements but also suggest that the set of elementary tasks should be expanded. The theory provides a guideline for graph construction...

Compositing digital images

Abstract: Most computer graphics pictures have been computed all at once, so that the rendering program takes care of all computations relating to the overlap of objects. There are several applications, however, where elements must be rendered separately, relying on compositing techniques for the anti-aliased accumulation of the full image. This paper presents the case for four-channel pictures, demonstrating that a matte component can be computed similarly to the color channels. The paper discusses guidelines for the generation of elements and the arithmetic for their arbitrary compositing.

Fast algorithms for finding nearest common ancestors

Abstract: We consider the following problem: Given a collection of rooted trees, answer on-line queries of the form, “What is the nearest common ancester of vertices x and y?” We show that any pointer machine that solves this problem requires $\Omega (\log \log n)$ time per query in the worst case, where n is the total number of vertices in the trees. On the other hand, we present an algorithm for a random access machine with uniform cost measure (and a bound of $\Omega (\log n)$ on the number of bits per word) that requires $O(1)$ time per query and $O(n)$ preprocessing time, assuming that the collection of trees is static. For a version of the problem in which the trees can change between queries, we obtain an almost-linear-time (and linear-space) algorithm.

Schottky Barrier Heights and the Continuum of Gap States

Abstract: Simple physical considerations of local charge neutrality suggest that near a metal-semiconductor interface, the Fermi level in the semiconductor is pinned near an effective gap center, which is simply related to the bulk semiconductor band structure. In this way “canonical” Schottky barrier heights are calculated for several semiconductors. These are in excellent agreement with experiment for interfaces with a variety of metals.

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

Abstract: Chordal graphs arise naturally in the study of Gaussian elimination on sparse symmetric matrices; acyclic hypergraphs arise in the study of relational data bases. Rose, Tarjan and Lueker [SIAM J. C...

Negative dispersion using pairs of prisms.

Abstract: We show that pairs of prisms can have negative group-velocity dispersion in the absence of any negative material dispersion. A prism arrangement is described that limits losses to Brewster-surface reflections, avoids transverse displacement of the temporally dispersed rays, permits continuous adjustment of the dispersion through zero, and yields a transmitted beam collinear with the incident beam.

Electron microscopy of a cholesteric liquid crystal and its blue phase

Abstract: We report the successful application of the freeze fracture technique for obtaining transmission-electron-microscope pictures of a thermotropic cholesteric material and its blue phase. It is shown that under rapid quenching these phases supercool and conserve their structure at liquid-${\mathrm{N}}_{2}$ temperature. The micrographs obtained confirm the body-centered-cubic symmetry of the blue phase I.

Packing Structures and Transitions in Liquids and Solids

Abstract: Classification of potential energy minima-mechanically stable molecular packings-offers a unifying principle for understanding condensed phase properties. This approach permits identification of an inherent structure in liquids that is normally obscured by thermal motions. Melting and freezing occur through characteristic sequences of molecular packings, and a defect-softening phenomenon underlies the fact that they are thermodynamically first order. The topological distribution of feasible transitions between contiguous potential minima explains glass transitions and associated relaxation behavior.

A quick method for finding shortest pairs of disjoint paths

Abstract: Let G be a directed graph containing n vertices, one of which is a distinguished source s, and m edges, each with a non-negative cost. We consider the problem of finding, for each possible sink vertex v, a pair of edge-disjoint paths from s to v of minimum total edge cost. Suurballe has given an O(n2 logn)-time algorithm for this problem. We give an implementation of Suurballe's algorithm that runs in O(m log(1+ m/n)n) time and O(m) space. Our algorithm builds an implicit representation of the n pairs of paths; given this representation, the time necessary to explicitly construct the pair of paths for any given sink is O(1) per edge on the paths.

Reliable broadcast protocols

Abstract: A reliable broadcast protocol for an unreliable broadcast network is described. The protocol operates between the application programs and the broadcast network. It isolates the application programs from the unreliable characteristics of the communication network. The protocol guarantees that all of the broadcast messages are received at all of the operational receivers in a broadcast group. In addition, the sequence of messages is the same at each of the receivers and a total ordering exists among all broadcast messages. This unique message sequencing can be used to simplify distributed database systems and distributed processing algorithms. The protocol can operate with as few as one acknowledgment message per broadcast message, instead of one acknowledgment from each receiver per broadcast message. The protocol continues to operate when sites in the broadcast group fail.

Theory of semiconductor heterojunctions: The role of quantum dipoles

Abstract: At any semiconductor heterojunction there is an interface dipole associated with quantum-mechanical tunneling, which depends on the band “lineup” between the two semiconductors. When the interface dipolar response dominates, the actual band discontinuity must be close to that unique value which would give a zero interface dipole. A simple criterion is proposed for this zero-dipole lineup, which gives excellent agreement with experimental band lineups. The close connection between heterojunction band lineups and Schottky barrier formation is emphasized.

Room temperature excitonic nonlinear absorption and refraction in GaAs/AlGaAs multiple quantum well structures

Abstract: We present detailed experimental studies and modeling of the nonlinear absorption and refraction of GaAs/AlGaAs multiple quantum well structures (MQWS) in the small signal regime. Nonlinear absorption and degenerate four-wave mixing in the vicinity of the room temperature exciton resonances are observed and analyzed. Spectra of the real and imaginary parts of the nonlinear cross section as a function of wavelength are obtained, and these are in excellent agreement with experimental data. A simple model for excitonic absorption saturation is proposed; it accounts qualitatively for the very low saturation intensities of room temperature excitons in MQWS.

Optimum combining in digital mobile radio with cochannel interference

Abstract: This paper studies optimum signal combining for space diversity reception in cellular mobile radio systems. With optimum combining, the signals received by the antennas are weighted and combined to maximize the output signal-to-interference-plus-noise ratio. Thus, with cochannel interference, space diversity is used not only to combat Rayleigh fading of the desired signal (as with maximal ratio combining) but also to reduce the power of interfering signals at the receiver. We use analytical and computer simulation techniques to determine the performance of optimum combining when the received desired and interfering signals are subject to Rayleigh fading. Results show that optimum combining is significantly better than maximal ratio combining even when the number of interferers is greater than the number of antennas. Results for typical cellular mobile radio systems show that optimum combining increases the output signal-to-interference ratio at the receiver by several decibels. Thus, systems can require fewer base station antennas and/or achieve increased channel capacity through greater frequency reuse. We also describe techniques for implementing optimum combining with least mean square (LMS) adaptive arrays.

Discrete Resistance Switching in Submicrometer Silicon Inversion Layers: Individual Interface Traps and Low-Frequency ( 1 f ?) Noise

Abstract: Resistance fluctations in submicrometer narrow Si inversion layers are studied over a wide range of temperatures and electron concentrations. Thermally activated switching on and off of discrete resistance increments is observed, caused by the capture and emission of individual electrons at strategically located scatterers (interface traps). The traps have a broad distribution of activation energies, as assumed in accounting for $\frac{1}{f}$ noise in larger devices.

Cherenkov Radiation from Femtosecond Optical Pulses in Electro-Optic Media

Abstract: It was recently suggested that under suitable conditions the propagation of femtosecond optical pulses in electro-optic materials should be accompanied by the radiation of an extremely fast electromagnetic transient [1,2]. This phenomenon, which arises from the inverse electro-optic effect [3], produces a Cerenkov cone of pulsed radiation having a duration of approximately one cycle and a frequency in the THz range.

Compression of optical pulses chirped by self-phase modulation in fibers

Abstract: The use of self-phase modulation in a single-mode fiber to chirp an optical pulse, which is then compressed with a grating-pair compressor, has been shown to be a practical technique for the production of optical pulses at least as short as 30 fsec. We report the results of a theoretical analysis of this process. Numerical results are presented for the achievable compression and compressed pulse quality as functions of fiber length and input pulse intensity. These results are given in normalized units such that they can be scaled to describe a wide variety of experimental situations and can be used to determine the optimum fiber length and compressor parameters for any given input pulse. Specific numerical examples are presented that suggest that the technique will generally be useful for input pulses shorter than about 100 psec. For energies of a few nanojoules per pulse, the compressed pulse widths will typically be in the femtosecond regime.

The UNIX programming environment

Abstract: From the Publisher: Designed for first-time and experienced users, this book describes the UNIX® programming environment and philosophy in detail. Readers will gain an understanding not only of how to use the system, its components, and the programs, but also how these fit into the total environment.

Melting temperature and explosive crystallization of amorphous silicon during pulsed laser irradiation

Abstract: Measurements during pulsed laser irradiation indicate that amorphous Si melts at a temperature 200 \ifmmode\pm\else\textpm\fi{} 50 K below the crystalline value. Below energy densities required to melt the amorphous layer fully, the data are interpreted in terms of an explosive crystallization. The initial liquid layer solidifies to form coarse-grained polycrystalline Si. A thin, self-propagating liquid layer travels through the remaining amorphous Si at a velocity of 10-20 m/s, producing fine-grained polycrystalline Si.

Wire-tap channel II

Abstract: Consider the following situation. K data bits are to be encoded into N> K bits and transmitted over a noiseless channel. An intruder can observe a subset of his choice of size μ < N. The encoder is to be designed to maximize the intruder's uncertainty about the data given his μ intercepted channel bits, subject to the condition that the intended receiver can recover the K data bits perfectly from the N channel bits. The optimal trade-offs among the parameters K, N, and μ and the intruder's uncertainty H (H is the "conditional entropy" of the data given the μ intercepted channel bits) were found. In particular, it was shown that for μ = N − K, a system exists with H ≈ K − l. Thus, for example, when N = 2K and μ = K, it is possible to encode the K data bits into 2K channel bits, so that by looking at any K channel bits, the intruder obtains no more than one bit of the data.

Line spectrum pair (LSP) and speech data compression

Abstract: Line Spectrum Pair (LSP) was first introduced by Itakura [1,2] as an alternative LPC spectral representations. It was found that this new representation has such interesting properties as (1) all zeros of LSP polynomials are on the unit circle, (2) the corresponding zeros of the symmetric and anti-symmetric LSP polynomials are interlaced, and (3) the reconstructed LPC all-pole filter preserves its minimum phase property if (1) and (2) are kept intact through a quantization procedure. In this paper we prove all these properties via a "phase function." The statistical characteristics of LSP frequencies are investigated by analyzing a speech data base. In addition, we derive an expression for spectral sensitivity with respect to single LSP frequency deviation such that some insight on their quantization effects can be obtained. Results on multi-pulse LPC using LSP for spectral information compression are finally presented.

Approximations for Standard Errors of Estimators of Fixed and Random Effects in Mixed Linear Models

Abstract: Best linear unbiased estimators of the fixed and random effects of mixed linear models are available when the true values of the variance ratios are known. If the true values are replaced by estimated values, the mean squared errors of the estimators of the fixed and random effects increase in size. The magnitude of this increase is investigated, and a general approximation is proposed. The performance of this approximation is investigated in the context of (a) the estimation of the effects of the balanced one-way random model and (b) the estimation of treatment contrasts for balanced incomplete block designs.

Reflections on trusting trust

Abstract: To what extent should one trust a statement that a program is free of Trojan horses? Perhaps it is more important to trust the people who wrote the software.

Worst-case Analysis of Set Union Algorithms

Abstract: This paper analyzes the asymptotic worst-case running time of a number of variants of the well-known method of path compression for maintaining a collection of disjoint sets under union. We show that two one-pass methods proposed by van Leeuwen and van der Weide are asymptotically optimal, whereas several other methods, including one proposed by Rein and advocated by Dijkstra, are slower than the best methods.

Dispersion in GeO2-SiO2 glasses.

Abstract: Germania glass was prepared from high purity GeO2 powder. Refractive-index dispersion was used to calculate material dispersion and to provide a model for representing the dispersion of GeO2–SiO2 glasses. The wavelength of zero material dispersion is found to be in agreement with theoretical calculations. Modal propagation is modeled for a GeO2 core–silica clad fiber. Results support compositional dependence of profile dispersion in GeO2–SiO2 fibers.