Journal of the ACM (JACM)


Search Issue
enter search term and/or author name


Journal of the ACM (JACM), Volume 12 Issue 3, July 1965

A Survey of Methods of Computing Minimax and Near-Minimax Polynomial Approximations for Functions of a Single Independent Variable
W. Fraser
Pages: 295-314
DOI: 10.1145/321281.321282
Methods are described for the derivation of minimax and near-minimax polynomial approximations. For minimax approximations techniques are considered for both analytically defined functions and functions defined by a table of values. For...

One View of Man-Machine Interaction
A. P. Yershóv
Pages: 315-325
DOI: 10.1145/321281.321283
For the computer to be a tool of the general scientist rather than of the computer specialist it will have to conform to the characteristics of interpersonal communications, since these are rooted in the characteristics of human intelligence. It...

An Online Display for the Study of Approximating Functions
Richard W. Conn, Richard E. von Holdt
Pages: 326-349
DOI: 10.1145/321281.321284
The method of least squares is often used to determine the arbitrary constants in an empirical formula or approximating function. If such a function is not linear in its unknowns, approximate values must first be obtained. Typically they are...

On a Problem Concerning a Central Storage Device Served by Multiple Terminals
M. V. Menon
Pages: 350-355
DOI: 10.1145/321281.321285
A storage or processing device with a fixed number of cells in considered. If a chance-mechanism selects which of M persons is to transmit an element of message to the device, the probability is found that the device will be...

A Modified Method of Latent Class Analysis for File Organization in Information Retrieval
William K. Winters
Pages: 356-363
DOI: 10.1145/321281.321286
The latent class structure is modified by requiring the number of latent classes to be equal to the number of keywords. This modification changes the latent structure to one that consists of matrices that are both symmetric and positive...

Statistical Complexity of Algorithms for Boolean Function Minimization
Franco Mileto, Gianfranco Putzolu
Pages: 364-375
DOI: 10.1145/321281.321287
The first problem in a two level Boolean minimization is the determination of the prime k-cubes. This paper is concerned with the estimation of the statistical complexity of some well-known algorithms which solve this problem....

On the Boolean Matrix Equation M=∨i=1Mi
J. M. S. Simões Pereira
Pages: 376-382
DOI: 10.1145/321281.321288
The equation M′ = Vdi-1 Mi where M′ is supposed to be given is discussed. First it is...

Chebyshev Solution of n+1 Linear Equations in n + 1nUnknowns
David Moursund
Pages: 383-387
DOI: 10.1145/321281.321289
An algorithm is presented for finding a solution, and the value of a solution, to n + 1 linear equations in n unknowns. The arrangement of the computation makes it convenient for use in computing Chebyshev-type...

Generation of Primes by a One-Dimensional Real-Time Iterative Array
Patrick C. Fischer
Pages: 388-394
DOI: 10.1145/321281.321290
A construction is given of a one-dimensional iterative of finite-state sequential machines, which can generate in real time the binary sequence representing the set of prime numbers.

Location of the Maximum on Unimodal Surfaces
D. J. Newman
Pages: 395-398
DOI: 10.1145/321281.321291
Pinning down the maximum of a function in one or more variable is a basic computing problem. Without further a priori information regarding the nature of the function, of course, the problem is not feasible for computation. Thus if the function...

Ultimate-Definite and Symmetric-Definite Events and Automata
A. Paz, B. Peleg
Pages: 399-410
DOI: 10.1145/321281.321292
New classes of events and finite automata which generalize the noninitial definite class are introduced. These events, called “ultimate definite” (u.d.), “reverse u.d.” and “symmetric definite,” are...

Generalized Cascade Decompositions of Automata
Michael Yoeli
Pages: 411-422
DOI: 10.1145/321281.321293
Incompletely specified (Mealy type) sequential machines and their generalizations to infinite machines are discussed. Convenient algebraic techniques for the study of such machines are introduced. These techniques are based on binary relations...

Mappings of languages by two-tape devices
Seymour Ginsburg, Edwin H. Spanier
Pages: 423-434
DOI: 10.1145/321281.321294
Several devices with two input lines and one output line are introduced. These devices are viewed as transformations which operate on pairs of (ALGOL-like) languages. Among the results proved are the following: (i) a pair consisting of a...

C. L. Sheng
Page: 435
DOI: 10.1145/321281.321295