March 1969 - Vol. 12 No. 3

Features

Research and Advances Mar 1 1969

Description of FORMAT, a text-processing program

FORMAT is a production program which facilitates the editing and printing of “finished” documents directly on the printer of a relatively small (64k) computer system. It features good performance, totally free-form input, very flexible formatting capabilities including up to eight columns per page, automatic capitalization, aids for index construction, and a minimum of nontext items. It is written entirely in FORTRAN IV.

Gerald M. Berns

Artificial Intelligence and Machine Learning

Research and Advances Mar 1 1969

Concepts of use in contour map processing

Generalized techniques are developed whose use can simplify the solution of problems relating to contour maps. One of these techniques makes use of the topological properties of contour maps. The topology is represented by a graphical structure in which adjacent contour lines appear as connected nodes. Another generalized technique consists of utilizing geometrical properties to determine the characteristics of straight lines drawn on the contour map. Both of these techniques have been applied to the problem of locating the ground track of an aircraft from elevation readings obtained during a flight.

Stephen P. Morse

Computing Applications

Research and Advances Mar 1 1969

Organizing matrices and matrix operations for paged memory systems

Matrix representations and operations are examined for the purpose of minimizing the page faulting occurring in a paged memory system. It is shown that carefully designed matrix algorithms can lead to enormous savings in the number of page faults occurring when only a small part of the total matrix can be in main memory at one time. Examination of addition, multiplication, and inversion algorithms shows that a partitioned matrix representation (i.e. one submatrix or partition per page) in most cases induced fewer page faults than a row-by-row representation. The number of page-pulls required by these matrix manipulation algorithms is also studied as a function of the number of pages of main memory available to the algorithm.

A. C. McKellar and E. G. Coffman

Computing Applications

Research and Advances Mar 1 1969

Data communications control procedures for the USA standard code for information interchange

This proposed American Standard has been accepted for publication by USA Standards Committee X3, Computers and Information Processing. In order that the final version of the proposed standard reflect the largest public consensus, X3 authorized publication of this document to elicit comment and general public reaction, with the understanding that such a working document is an intermediate result in the standardization process and is subject to change, modification, or withdrawal in part or in whole. Comments should be addressed to the X3 Secretary, Business Equipment Manufacturers Association, 235 East 42 Street, New York, NY 10017.—E. L.

E. L. Lohse

Architecture and Hardware

Research and Advances Mar 1 1969

Algorithm 345: an algol convolution procedure based on the fast Fourier transform [C6]

Richard C. Singleton

Theory

Research and Advances Mar 1 1969

Algorithm 346: F-Test Probabilities

J. Morris

Systems and Networking

Research and Advances Mar 1 1969

Algorithm 346: F-test probabilities [S14]

John Morris

Systems and Networking

Research and Advances Mar 1 1969

Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]

Richard C. Singleton

Computing Applications

Research and Advances Mar 1 1969

Remark on algorithm 329 [G6]: distribution of indistinguishable objects into distinguishable slots

M. Gray

Computing Applications

Research and Advances Mar 1 1969

Remark on algorithm 339 [C6]: an algol procedure for the fast Fourier transform with arbitrary factors

Richard C. Singleton

Computing Applications

News Mar 1 1969

President’s letters to the ACM membership: the AFIPS constitution

Bernard A. Galler

Computing Applications

Recent Issues

Explore the Issue Archive