W. I. Givens
Page 396
R. W. Bemer
Page 396
K. Wright
Page 396
The development of new large scale time-sharing systems has raised a number of problems for computation center management. Not only is it necessary to develop an appropriate hardware configuration for these systems, but appropriate …
Norman R. Nielsen
Pages 397-412
An existing system and planned additions within the Data Processing Laboratory of the Brain Research Institute at UCLA is described. The system represents an attempt to provide research workers of the Institute with the ability …
Laszlo Betyar
Pages 413-419
The internal organization of string processing systems is discussed. Six techniques for data structures are presented and evaluated on the basis of: (1) creation of strings; (2) examination of strings; and (3) alteration of strings …
Stuart E. Madnick
Pages 420-424
A method is described for implementing the productions of a context-free phrase structure grammar in a PL/I procedure whose structure and statements parallel the structure and notation of the grammar.
Larry Irwin
Page 424
A method is developed for constructing an approximate plot of a function of three independent variables. The plot is similar to a conventional contour map except that there are three scales to represent the independent variables …
Russell W. Stineman
Pages 425-428
Relations are given between certain symmetric polynomials in the light of the theory of the symmetric group. Such an approach unifies earlier work and lends insight to previously published work by Aaron Booker. A generalization …
J. K. S. McKay
Pages 428-429
The problem of obtaining starting values for the Newton-Raphson calculation of √
x on a digital computer is considered. It is shown that the conventionally used best uniform approximations to √
x do not provide optimal starting …
David G. Moursund
Pages 430-432
The problem of obtaining starting values for the Newton-Raphson calculation of √
x on a digital computer is considered. It is shown that the conventionally used best uniform approximations to √
x do not provide optimal starting …
William M. Waite
Pages 433-440
The basic algorithm for the conversion of decision tables into COBOL code is contained in the generator portion of the DETAB/65 preprocessor. The generator analyzes a decision table and produces simple COBOL conditional statements …
Michael D. Callahan, Anson E. Chapman
Pages 441-446
The use of Warnsdorff's rule for finding a knight's tour is generalized and applied to the problem of finding a Hamilton path in a graph. A graph-theoretic justification for the method is given.
Ira Pohl
Pages 446-449
P. Bratley
Pages 450-451
P. Bratley, J. K. S. McKay
Page 450
J. K. S. McKay
Pages 451-452
R. J. Ord-Smith
Page 452
R. J. Ord-Smith
Pages 452-453
H. Späth
Page 453
M. L. V. Pitteway
Page 453
Lee S. Sims
Page 453
Several years ago there was an attempt in Washington to place the selection of government computers in a central, highly placed office. Individual government agencies, led by the Department of Defense, successfully beat back
…
James P. Titus
Pages 454-455
