Jean E. Sammet
Page 651
Page 652
This year the whole world celebrates the five-hundredth birthday of Nicolaus Copernicus, the famous Polish astronomer and mathematician. In 1543, Copernicus published his book,
Concerning the Revolutions of Celestial Spheres, …
Charles W. Bachman
Pages 653-658
Dynamic verification of a decision implies that every time the decision is made there is a consistency check performed on the decision using independent hardware and software. The dynamic verification of operating system decisions …
R. S. Fabry
Pages 659-668
This paper describes a parser-generating system (PGS) currently in use on the CDC-6500 computer at Purdue University. The PGS is a Fortran-coded program that accepts a translation grammar as input and constructs from it a compact …
M. D. Mickunas, V. B. Schneider
Pages 669-676
Most graphics systems using a raster scan output device (CRT or hardcopy) maintain a display file in the XY or random scan format. Scan converters, hardware or software, must be provided to translate the picture description from …
B. W. Jordan, R. C. Barrett
Pages 676-682
Automatic theorem-provers need to be made much more efficient. With this in mind, Slagle has shown how the axioms for partial ordering can be replaced by built-in inference rules when using a particular theorem-proving algorithm …
James R. Slagle, Lewis M. Norton
Pages 682-688
This algorithm uses a rational variant of the QR transformation with explicit shift for the computation of all of the eigenvalues of a real, symmetric, and tridiagonal matrix. Details are described in [1]. Procedures
tred1 or …
Christian H. Reinsch
Page 689
G. W. Hill
Page 690
Gideon Ehrlich
Pages 690-691
N. Brenner
Pages 692-694
Norman Brenner
Pages 692-694
T. N. L. Patterson
Pages 694-699
C. Lam, J. McKay
Page 699
A counterexample to the supposed optimality of an algorithm for generating schedules for trees of tasks with unequal execution times is presented. A comparison with the “critical path” heuristic is discussed.
Peter J. Denning, G. Scott Graham
Pages 700-702
R.P. Brent in his presentation of a modification to the linear quotient algorithm [1] shares the common misconception that dynamic chaining requires larger table entries because of the space required for link fields.
Jerome A. Feldman, James R. Low
Page 703
With this note I hope to bridge the gap between the adherents of structured programming and the devotees of the unrestricted
goto. I describe a style of programming which combines the advantages of structured programming with …
Eberhard Wegner
Pages 704-705
A generalization of a scheme of Hamming for converting a polynomial P
n(x) into a Chebyshev series is combined with a recurrence scheme of Clenshaw for summing any finite series whose terms satisfy a three-term recurrence formula …
Herbert E. Salzer
Pages 705-707
An explicit approximate solution ƒ
(h)&agr; is given for the equation ƒ(
t) = ∫
∞0 k(
t -
&tgr;)ƒ(
&tgr;)
d&tgr; +
g(
t),
t > 0, (*) where
k, g ∈
L1(- ∞, ∞) ∩
L2(-∞, ∞), and where it is assumed that the classical Wiener-Hopf technique may be applied …
Frank Stenger
Pages 708-710
Two methods for solving the biharmonic equation are compared. One method is direct, using eigenvalue-eigenvector decomposition. The other method is iterative, solving a Poisson equation directly at each iteration.
L. W. Ehrlich
Pages 711-714
Ellis Horowitz
Page 715
