One of the problems facing managers of computer installations is the problem of configuring the computer system to meet the demands made by the mix of jobs that the computer center must service, This paper presents a management …
Norman R. Lyons
Pages 889-895
SEMBEGS is a complete batch environment graphical system containing components for handling graphical data files, for displaying the contents of these files on a variety of graphical hardware, and for performing graphical batch …
J. W. Wendorf
Pages 897-904
Simulation is presented as a practical technique for performance evaluation of alternative configurations of highly concurrent computers. A technique is described for constructing a detailed deterministic simulation model of
…
B. Kumar, E. S. Davidson
Pages 904-913
A number of image analysis tasks can benefit from registration of the image with a model of the surface being imaged. Automatic navigation using visible light or radar images requires exact alignment of such images with digital …
Berthold K. P. Horn, Brett L. Bachman
Pages 914-924
A simple method is described enabling simple precedence parsers to recover from syntax errors. No attempt to repair errors is made, yet parsing and most semantic processing can continue. The result is a good “first approximation” …
G. David Ripley
Pages 928-930
Evaluation of a conditional expression may succeed even when the “deciding predicate” diverges and the alternatives are records (or nodes) whose fields have different content.
Daniel P. Friedman, David S. Wise
Pages 931-933
A language concept for concurrent processes without common variables is introduced. These processes communicate and synchronize by means of procedure calls and guarded regions. This concept is proposed for real-time applications …
Per Brinch Hansen
Pages 934-941
The new class of Pk trees is presented, where height balance is maintained for the nodes lying on particular paths. The number of nodes of a Pk tree asympotically grows as a power of the height, in the worst case. A procedure …
Fabrizio Luccio, Linda Pagli
Pages 941-947
Split trees are a new technique for searching sets of keys with highly skewed frequency distributions. A split tree is a binary search tree each node of which contains two key values—a
node value which is a maximally frequent …
B. A. Sheil
Pages 947-958
A constraint network representation is presented for a combinatorial search problem: finding values for a set of variables subject to a set of constraints. A theory of consistency levels in such networks is formulated, which
…
Eugene C. Freuder
Pages 958-966
As an example of cooperation between sequential processes with very little mutual interference despite frequent manipulations of a large shared data space, a technique is developed which allows nearly all of the activity needed …
Edsger W. Dijkstra, Leslie Lamport, A. J. Martin, C. S. Scholten, E. F. M. Steffens
Pages 966-975
Robert L. Ashenhurst
Pages 982-984
A rejection method is proposed for generating gamma variates with nonintegral shape parameter
&agr;,
&agr; > 1. This method is similar to other methods given by Fishman, Wallace, and Tadikamalla and is faster than these methods for
&agr;&agr; …
Pandu R. Tadikamalla
Pages 925-928
