An interactive program with a graphical display has been developed for the approximation of data by means of a linear combination of functions (including splines) selected by the user. The coffiecients of the approximation are …
P. Lafata, J. B. Rosen
Pages 651-659
In this paper a file organization scheme designed to replace the use of the popular secondary index filing scheme (or inverted files on secondary key fields) is described. Through the use of redundancy and storing keys (or access …
V. Y. Lum
Pages 660-665
A generalized division algorithm for use with positive integral operands is presented. Depending upon the algebraic relationship of the first two ciphers of the divisor, one or at most two adjustments to the original divisor
…
Charles J. Mifsud
Pages 666-668
NEATER2 accepts a PL/I source program and operates on it to produce a reformatted version. When in the LOGICAL mode, NEATER2 indicates the logical structure of the source program in the indentation pattern of its output. Logic …
Kenneth Conrow, Ronald G. Smith
Pages 669-675
A new method of hash coding is presented and is shown to possess desirable attributes. Specifically, the algorithm is simple, efficient, and exhaustive, while needing little time per probe and using few probes per lookup. Performance …
James R. Bell, Charles H. Kaman
Pages 675-676
A simple nonrecursive list structure compacting scheme or garbage collector suitable for both compact and LISP-like list structures is presented. The algorithm avoids the need for recursion by using the partial structure as it …
C. J. Cheney
Pages 677-678
This proposed American National Standard has been accepted for publication by American National Standards Committee X3, Computers and Information Processing. In order that the final version of the proposed standard reflect the …
C. Kerpelman
Pages 679-685
M. H. van Emden
Pages 693-694
Paul Bratley
Page 693
William Knight
Pages 694-695
Paul Bratley
Page 695
For any finite set of argument/function pairs, an algorithm can be automatically constructed which, on presentation of any argument, will generate its proper function value. Arguments are necessarily unique although functions …
William J. Wilson
Pages 696-697
In the paper “The Working Set Model for Program Behavior” by Peter Denning [
Comm. ACM 11, 5 (May 1968), 323-333], an algorithm is described for the management of a paged memory under demand paging. In the process of analyzing …
Arthur Bernstein
Pages 698-699
Jon Rokne
Page 699
Walter M. Carlson
Page 649
This proposed American National Standard has been accepted for publication by American National Standards Committee X3, Computers and Information Processing. In order that the final version of the proposed standard reflect the …
M. Stuart Lynn
Pages 686-692
In reference [1] algorithms for performing arithmetic with unsigned two's complement operands were described. The scheme for division was implemented in a set of multiple-precision floating-point arithmetic routines [2]. User …
John R. Ehrman
Pages 697-698
