*George H. Mealy*

Pages 374-375

*Peter Wegner*

Pages 376-381

It is often desired to solve eigenvalue problems of the type (A - &lgr;1)C = 0 or (A - &lgr;B)C = 0 repeatedly for similar values of the matrix elements

Aij, where A and B are Hermitean or real symmetric matrices. Among the various methods …

*Klaus Appel*

Page 381

This paper describes a new algorithm for the selection of the pivot row in matrix inversion when using the product form of the inverse. This algorithm has been developed for linear programming codes; however, it would be valuable …

*L. J. Larsen*

Pages 382-383

*Roger H. Simonsen*

Pages 383-384

A program which translates an algorithmic language such as ALGOL into the machine language of an electronic computer performs the following functions:

Analysis. From the program in algorithmic language are determined the operations …

*H. H. Bottenbruch, A. A. Grau*

Pages 384-386

*H. Rutishauser*

Page 387

*F. L. Bauer, J. Stoer*

Pages 387-388

*Yuri A. Kruglyak, Donald R. Whitman*

Pages 388-389

*Yuri A. Kruglyak, Donald R. Whitman*

Page 388

*Margaret L. Johnson, Ward Sangren*

Page 388

*Jay W. Counts*

Page 388

*Yuri A. Kruglyak, Donald R. Whitman*

Pages 389-390

*Yuri A. Kruglyak, Donald R. Whitman*

Pages 390-391

*Margaret L. Johnson, Ward Sangren*

Page 391

*Margaret L. Johnson, Ward Sangreen*

Page 391

*Richard George*

Page 391

*A. P. Relph*

Page 392

*A. P. Relph*

Page 392

*A. P. Relph*

Page 392

*A. P. Relph*

Page 392

*Yuri A. Kruglyak, Donald R. Whitman*

Page 393

*Yuri A. Kruglyak, Donald R. Whitman*

Page 393

*Yuri A. Kruglyak, Donald R. Whitman*

Page 393

The programming of a proof procedure is discussed in connection with trial runs and possible improvements.
*Martin Davis, George Logemann, Donald Loveland*

Pages 394-397

If one has a set of observables (

z1, ··· ,

zm) which are bound in a relation with certain parameters (

a1, ··· ,

an) by an equation

&zgr;(

z1, ··· ,

a1, ···) = 0, one frequently has the problem of determining a set of values of the …

*Robert M. Baer*

Pages 397-398

The down-hill method by Ward is a numerical method for determining a complex root of ƒ(

z) = 0 and suitable for machine computation [1]. It is based on a theorem that

W(

z) = |Re(ƒ)| + |Im(ƒ)| (1) has minimum value, actually zero …

*Morio Onoe*

Page 398

The logic of English grammar is being investigated by a process of approximative logical synthesis. Beginning with a kernel language which is an alphabetically spelled form of symbolic logic with English-like vocabulary, English …

*Herbert G. Bohnert*

Page 398

*Herbert E. Salzer*

Page 399

In this note we propose a method of generating stationary noise with a prescribed auto-covariance function by digital methods. The need for such a technique often arises in testing the performance of data processing and engineering …

*P. R. Peabody, D. S. Adorno*

Pages 400-401

*W. Fraser, J. F. Hart*

Pages 401-403

Record linkage in the updating of files is accomplished in many establishments through the use of a preassigned number, such as payroll number, customer number, or social security number. In vital and health records, however, …

*William Phillips, Anita K. Bahn, Mabel Miyasaki*

Pages 404-407

Automatic computation methods were first developed and applied to the problem of radiation therapy treatment planning by the Physics staff at Memorial Hospital and Sloan-Kettering Institute in 1954 and reported in 1955 [1]. The …

*William Siler, John S. Laughlin*

Pages 407-408

*D. E. Robison, L. A. Aroian*

Pages 409-411

*D. K. Robbins*

Pages 412-414