April 1977 - Vol. 20 No. 4
Features
A proof method, subgoal induction, is presented as an alternative or supplement to the commonly used inductive assertion method. Its major virtue is that it can often be…
The editing of picture segmentations using local analysis of graphs
A major problem in picture processing is the elimination of the large number of spurious regions that result from an initial segmentation by region growing techniques.…
Studies in machine cognition using the game of poker
A progress report is presented of on-going research efforts concerning human decision making under uncertainty and risk and human problem solving and learning processes…
Analysis of design alternatives for virtual memory indexes
A class of index structures for use in a virtual memory environment is described. Design alternatives within this class of index structures are analyzed. These…
The stage hypothesis and the s-curve: some contradictory evidence
This paper presents the results of a study testing the s-shaped budget curve of Nolan's stage model of computer development in an organization. Research on the data…
Approximating block accesses in database organizations
When data records are grouped into blocks in secondary storage, it is frequently necessary to estimate the number of blocks XD accessed for a given query. In a recent…
Remark on uniform insertion in structured data structures
In a recent paper, Shneiderman and Scheuermann [1] have defined an interesting operation, called uniform insertion, whereby a (linked) data structure G2 can be embedded…
Comment on weighted increment linear search for scatter tables
I would like to comment on an article by Fabrizio Luccio [1] which discusses weighted increment linear search for scatter tables.
Sorting on a mesh-connected parallel computer
Two algorithms are presented for sorting n2 elements on an n × n mesh-connected processor array that require O (n) routing and comparison steps. The best previous…
Proof techniques for hierarchically structured programs
A method for describing and structuring programs that simplifies proofs of their correctness is presented. The method formally represents a program in terms of levels of…