November 1968 Table of Contents | Communications of the ACM

advertisement

Home → Magazine Archive → November 1968 (Vol. 11, No. 11)

Table of Contents

President's letter to the ACM membership: The ACM Council

Bernard A. Galler

Page 729

Automata, formal languages abstract switching, and computability in a Ph.D. computer science program

A number of courses are listed in the area described as automata, formal languages, abstract switching, and computability, that might be available to a Ph.D. student in computer science. A brief catalog description of each course …

Robert McNaughton

Pages 738-740

Storage organization in programming systems

The system of program and data representation that has been in use on the Rice University computer for five years is described. Each logical entity in storage occupies a block of consecutive memory locations. Each block is labeled …

Jane G. Jodeit

Pages 741-746

The LRLTRAN compiler

Extensive software problems confront an organization which possesses a number of different computers and which frequently acquire new ones. To maintain cohesion, a system must be developed, written in a high level language, which …

Sam F. Mendicino, Robert A. Hughes, Jeanne T. Martin, Frank H. McMahon, John E. Ranelletti, Richard G. Zwakenberg

Pages 747-755

A note on a relevance estimate and its improvement

In this paper the effect of iterating the improvement procedure is examined. It is shown that applications of the improvement factor beyond the first time are ineffectual, and that the factor is but a scale factor.

Robert R. Korfhage

Page 756

One-line random number generators and their use in combinations

Some one-line random number generators, i.e. generators requiring a single FORTRAN instruction are discussed, and some short FORTRAN programs which mix several such generators are described. The aim is to provide methods for …

George Marsaglia, T. A. Bray

Pages 757-759

Approximate solution of initial-boundary wave equation problems by boundary-value techniques

A new boundary-value technique is proposed for the treatment of initial-boundary-value problems for linear and mildly non-linear wave equations. Several illustrative examples are offered to demonstrate the ease with which the …

Donald Greenspan

Pages 760-763

Practical error coefficients in the integration of periodic analytic functions by the trapezoidal rule

Theoretical and practical values of error coefficients useful in bounding the error in integrating periodic analytic functions with the trapezoidal rule are tabulated for various ranges of the parameters.

Philip Rabinowitz

Pages 764-765

A phonological rule tester

Theoretical and practical values of error coefficients useful in bounding the error in integrating periodic analytic functions with the trapezoidal rule are tabulated for various ranges of the parameters.

Daniel G. Bobrow, J. Bruce Fraser

Pages 766-772

Algorithms: Algorithm 338: algol procedures for the fast Fourier transform

The following procedures are based on the Cooley-Tukey algorithm [1] for computing the finite Fourier transform of a complex data vector; the dimension of the data vector is assumed here to be a power of two. Procedure COMPLEXTRANSFORM …

Richard C. Singleton

Pages 773-776

Algorithms: Algorithm 339: an algol procedure for the fast Fourier transform with arbitrary factors

Richard C. Singleton

Pages 776-779

Algorithms: Algorithm 340: roots of polynomials by a root-squaring and resultant routine

Albert Noltemeier

Pages 779-782

Algorithms: Algorithm 341: solution of linear programs in 0-1 variables by implicit enumeration

J. L. Byrne, L. G. Proll

Page 782

Correspondences of 8-bit and Hollerith codes for computer environments—a USASI tutorial

The correspondence tables in the document reflect USASCII standard code assignments as well as other codes. Comments that refer to the assignments of characters or character sets in columns 8 through 15 of Table 1 as a basis …

E. Lohse

Pages 783-789