The overlay capability is described for four of the third generation computer systems: CDC-6000, GE-635, IBM-360, and UNIVAC-1108. A critique of the first three sytems is based on actual experience with a large overlaid trajectory …
Bernadine C. Lanzano
Pages 541-550
An alternative approach to the design and organization of a general purpose interactive multiterminal computing system is presented. The system organization described is a conceptually simple arrangement of a bank of interchangeable …
Herbert B. Baskin, Elsa B. Horowitz, Robert D. Tennison, Larry E. Rittenhouse
Pages 551-559
A digital computer is considered, whose memory words are composed of
N r-state devices plus two sign bits (two state devices). The choice of base
&bgr; for the internal representation of floating-point numbers on such a computer
&bgr; …
W. S. Brown, P. L. Richman
Pages 560-561
J. M. S. Simões Pereira
Page 562
Richard C. Singleton
Pages 563-564
Richard C. Singleton
Page 563
Peter A. Businger, Gene H. Golub
Pages 564-565
Arthur G. Adams
Pages 565-566
The precedence relations of a precedence grammar can be precisely described by a two-dimensional precedence matrix. Often the information in the matrix can be represented more concisely by a pair of vectors, called linear precedence …
James R. Bell
Pages 567-569
The IITRAN language, developed to be used by students, and its important features are described. IITRAN is a procedure-oriented language with a one-level block structure and a variety of data types. Several novel and powerful …
Robert B. K. Dewar, Ronald R. Hochsprung, William S. Worley
Pages 569-575
In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. …
C. A. R. Hoare
Pages 576-580
When Algorithm 355 [
Comm. ACM 12 (Oct. 1969), 562] was originally submitted to the Algorithms Department it contained a construct which pointed up an ambiguity in the description of ALGOL 60 [Revised Report on the Algorithmic …
John G. Herriot
Page 581
In this note we point out how rational approximations which are best with respect to maximum logarithmic error can be computed by existing algorithms. Let
y be a quantity that we wish to approximate and
y be an approximation, …
Charles B. Dunham
Pages 581-582
This note extends the results obtained by Thomas C. Lowe [1] for the case where the list file is stored in packed form. The notation and terminology used were established by Lowe. In addition, we define
F(
j) = ∑
j-1i=1 ƒ(
i) and …
A. J. Bayes
Pages 582-583
In Y.N. Patt's paper “Variable Length Tree Structures Having Minimum Average Search Time” [
Comm.
ACM 12 (Feb. 1969)], the tree structures obtained are not actually optimal with respect to the two-dimensional chaining devised
…
Larry E. Stanfel
Page 582
Walter M. Carlson
Page 537
