Walter Gautschi
Page 143
Walter Gautschi
Page 143
Peter Naur
Pages 144-145
Stephen P. Barton, John F. Wagner
Pages 145-148
Peter Naur
Page 148
M. Wells
Page 148
Two compiling generators for arithmetic expressions are discussed: one presently in use in an experimental compiler, and an improvement suggested by K. Speierman of Burroughs.
James P. Anderson
Pages 149-150
Data communications was the subject of a two-week meeting held 24 September through 4 October 1963, in Geneva, Switzerland, by the International Telegraph and Telephone Consultative Committee (CCITT) Special Study Group A. Previous …
S. Gorn, R. W. Bemer, J. Green, E. Lohse
Page 152
For several years the author has been concerned with time series data reduction of guided missile data derived from tracking, telemetry and static test instrumentation. The data, which is acquired from many sources and comes …
Roger A. MacGowan
Pages 153-157
A variation of the polyphase merge technique of sorting is described which permits one tape at a time to be rewound while the merge is continued on the remaining tapes. The result is the overlapping of a major portion of the
…
R. L. McAllester
Pages 158-159
A previously proposed computer method for constructing timetables, based on an iteration involving Boolean matrices, is described. In limited tests the method has successfully produced timetables on every trial. References are …
J. Csima, C. C. Gotlieb
Pages 160-163
A more efficient method of using tree structures is proposed, which utilizes both plus and minus branches in the search path. Very significant gains result when the search key includes alphabetic characters.
Harry A. Clampett
Pages 163-165
Computer programs for generating a minimum-redundancy exhaustive prefix encoding are described. One program generates a Huffman frequency tree, another determines the structure functions of an encoding, and a third program assigns …
Eugene S. Schwartz, Bruce Kallick
Pages 166-169
It is easy to program the basic transformation required for a perspective drawing. This fact plus the advent of high speed microfilm printers such as the General Dynamics Electronics S-C 4020 makes possible perspective movies …
E. E. Zajac
Pages 169-170
The method described assumes that a word which cannot be found in a dictionary has at most one error, which might be a wrong, missing or extra letter or a single transposition. The unidentified input word is compared to the dictionary …
Fred J. Damerau
Pages 171-176
A method of iteration is developed in terms of a function of somewhat arbitrary character. Sufficient conditions are given for convergence of the process, yielding factors of arbitrary degree for polynomials in one variable.
…
H. A. Luther
Pages 177-179
A Fourier series method is described which, when applied to a certain class of parabolic partial differential equations, reduces the problem to a system of ordinary differential equations. An application is given for which the …
C. V. D. Forrington
Pages 179-181
Even slowly convergent power series can be rearranged as series in Chebyshev polynomials if appropriate sequence transformations are used in evaluating the coefficients. The method is illustrated by computing the coefficients …
Henry C. Thacher
Pages 181-182
A study of lunar tracking techniques and fabrication of a breadboard to assess the feasibility of the best technique selected was conducted to define a tracking system for observation of the sightline to the center of a partially …
H. James Wilcox
Pages 183-188
E. W. Dijkstra
Page 190
This note is intended to clarify and correct several points in a recent paper describing some notations for symbol manipulation by M. P. Barnett [Comm. ACM 6(August, 1963)].
M. P. Barnett, J. M. Gerard, A. W. Sambles
Pages 150-152
John H. Matthewman
Page 165
