May 1975 - Vol. 18 No. 5
Features
Copying cyclic list structures in linear time using bounded workspace
A bounded workspace copying algorithm for arbitrary list structures is given. This algorithm operates in linear time and does not require tag bits. The best previous…
Analysis and performance of inverted data base structures
The need to envision and architecture data base systems in a hierarchical level by level framework is stressed. The inverted data base (file) organization is then…
An intelligent analyzer and understander of English
The paper describes a working analysis and generation program for natural language, which handles paragraph length input. Its core is a system of preferential choice…
The PL/I procedure BASIC_GENERATOR is an implementation of Paton's algorithm [1] for finding a set of basic (fundamental) cycles of a finite undirected graph from its…
In a recent paper [4], Minieka proposes an algorithm for finding kth shortest paths between all pairs of nodes in an N node network. His claimed time is O(k2N3).
A syntactic algorithm for peak detection in waveforms with applications to cardiography
Peaks in a digitized waveform are detected by an algorithm incorporating piecewise linear approximation and tabular parsing techniques. Several parameters serve to…
A heuristic problem solving design system for equipment or furniture layouts
The Designer Problem Solver (DPS) demonstrates that the computer can perform simple design tasks. In particular, it designs furniture and equipment layouts. This task was…