Communications of the ACM

On the feasibility of voice input to an on-line computer processing system

An on-line digital computer processing system is considered in which an ordinary telephone is the complete terminal device, input to the computer being provided as a sequence of spoken words, and output to the user being audio … Howard A. Elder
Pages 339-346

---

On the conversion of decision tables to computer programs

The use of execution time diagnostics in pinpointing ambiguities in decision tables is discussed. It is pointed out that any attempt at resolving ambiguities at compile time will, in general, be impossible. It is shown that,  … C. R. Muthukrishnan, V. Rajaraman
Pages 347-351

---

Scheduling to reduce conflict in meetings

Conflicts in scheduling can be treated as defining an undirected linear graph independently of the relation of the activities in conflict to additional constraints of time and space. Each connected component of such a graph,  … Joseph E. Grimes
Pages 351-352

---

A PL/1 program to assist the comparative linguist

A practical PL/1 program is described which can assist comparative linguists to determine the regular sound correspondences between genetically related languages. The investigator must arrange data for input by aligning pairs … Donald G. Frantz
Pages 353-356

---

Automatic parsing for content analysis

Although automatic syntactic and semantic analysis is not yet possible for all of an unrestricted natural language text, some applications, of which content analysis is one, do not have such a stringent coverage requirement.  … Frederick J. Damerau
Pages 356-360

---

Accurate floating-point summation

This paper describes an alternate method for summing a set of floating-point numbers. Comparison of the error bound for this method with that of the standard summation method shows that it is considerably less sensitive to propagation … Peter Linz
Pages 361-362

---

Comparison of several adaptive Newton-Cotes quadrature routines in evaluating definite integrals with peaked integrands

This report compares the performance of five different adaptive quadrature schemes, based on Newton-Cotes (2N + 1) point rules (N = 1, 2, 3, 4, 5), in approximating the set of definite integrals ∫1-1 (x2 + p2)-1 dx with relative … K. E. Hillstrom
Pages 362-365

---

Incorporating origin shifts into the QR algorithm for symmetric tridiagonal matrices

The QR iteration for the eigenvalues of a symmetric tridiagonal matrix can be accelerated by incorporating a sequence of origin shifts. The origin shift may be either subtracted directly from the diagonal elements of the matrix … G. W. Stewart
Pages 365-367

---

Algorithm 383: permutations of a set with repetitions [G6]

Phillip J. Chase
Pages 368-369

---

Algorithm 382: combinations of M out of N objects [G6]

Phillip J. Chase
Page 368

---

Algorithm 384: eigenvalues and eigenvectors of a real symmetric matrix

G. W. Stewart
Pages 369-371

---

Remark on algorithm 201 [M1]: shellsort

J. P. Chandler, W. C. Harrison
Pages 373-374

---

Remark on algorithm 351 [D1]: modified Romberg quadrature

George C. Wallick
Pages 374-376

---

Remark on algorithm 361 [G6]: permanent function of a square matrix I and II

Bruce Shriver, P. J. Eberlein, R. D. Dixon
Page 376

---

A relational model of data for large shared data banks

Future users of large data banks must be protected from having to know how the data is organized in the machine (the internal representation). A prompting service which supplies such information is not a satisfactory solution … E. F. Codd
Pages 377-387

---

Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certification

Ralph L. London
Pages 371-373

---