January 1971 Table of Contents | Communications of the ACM

advertisement

Home → Magazine Archive → January 1971 (Vol. 14, No. 1)

Table of Contents

ACM Vice President Ralston comments on: committees, committees, committees

Anthony Ralston

Pages 1-2

Signature simulation and certain cryptographic codes

Three cyphers allegedly authored by Thomas Jefferson Beale in 1822 have been the subject of intensive study for over 100 years. Generations of cryptanalysts have expended untold man-years, thus far without success, attempting …

Carl Hammer

Pages 3-14

Pattern width at a given angle

That the pattern feature “width as a function of angle” possesses several possible interpretations is demonstrated in this paper, which is a review of the width concept in pattern recognition and the geometrical concept itself …

Allen Klinger

Pages 15-20

The reconstruction of binary patterns from their projections

Given the horizontal and vertical projections of a finite binary pattern f, can we reconstruct the original pattern f? In this paper we give a characterization of patterns that are reconstructable from their projections. Three …

Shi-Kuo Chang

Pages 21-25

A language for treating geometric patterns in a two-dimensional space

In this paper CADEP, a problem-oriented language for positioning geometric patterns in a two-dimensional space, is presented. Although the language has been specifically designed for the automatic generation of integrated circuit …

G. Bracchi, D. Ferrari

Pages 26-32

Construction of rational and negative powers of a formal series

Some methods are described for the generation of fractional and negative powers of any formal series, such as Poisson series or Chebyshev series. It is shown that, with the use of the three elementary operations of addition, …

R. A. Broucke

Pages 32-35

Comments on prevention of system deadlocks

Habermann's method of deadlock prevention is discussed, where deadlock is defined as a system state from which resource allocations to certain processes are not possible. It is shown that the scheduler may introduce “artificial” …

Richard C. Holt

Pages 36-38

Proof of a program: FIND

A proof is given of the correctness of the algorithm “Find.” First, an informal description is given of the purpose of the program and the method used. A systematic technique is described for constructing the program proof during …

C. A. R. Hoare

Pages 39-45

Further evidence for the analysis of algorithms for the zero-one programming problem

The purpose of this note is to report computational experience additional to that recently summarized by Gue et al., with two algorithms for the zero-one linear programming problem. An error in Gue's paper is corrected. The utility …

L. G. Proll

Pages 46-47

Complex gamma function

C. W. Lucas, C. W. Terrill

Pages 48-49

Circular integer partitioning

M. W. Coleman, M. S. Taylor

Page 48

Minit algorithm for linear programming

In his Certification of Algorithm 245 [1], Ralph L. London exhibits a common confusion between an algorithm, its representation, and its implementation on a processor—a code. In the present state of the art we can attempt, in …

Å. Kolm, T. Dahlstrand

Page 50

Comment on London's certification of algorithms 245

In his Certification of Algorithm 245 [1], Ralph L. London exhibits a common confusion between an algorithm, its representation, and its implementation on a processor—a code. In the present state of the art we can attempt, in …

K. A. Redish

Pages 50-51

Comment on the conversion of decision tables to computer programs

In their article [2] C. R. Muthukrishnan and V. Rajaraman have developed two excellent algorithms for conversion of limited entry and mixed entry decision tables to computer programs. I must, however, take issue with their contention …

Solomon L. Pollack

Page 52