January 1970 - Vol. 13 No. 1
Features
Automatic segmentation of cyclic program structures based on connectivity and processor timing
Time-shared, multiprogrammed, and overlayed batch systems frequently require segmentation of computer programs into discrete portions. These program portions are…
Recursive computation of certain derivatives&a study of error propagation
A brief study is made of the propagation of errors in linear first-order difference equations. The recursive computation of successive derivatives of ex/x and (cos x)/x…
A processor allocation method for time-sharing
A scheduling algorithm is proposed which is intended to minimize changes of tasks on processors and thereby reduce overhead. The algorithm also has application to more…
Natural language question-answering systems: 1969
Recent experiments in programming natural language question-answering systems are reviewed to summarize the methods that have been developed for syntactic, semantic, and…
Experience with an extensible language
An operational extensible language system is described. The system and its base language are appraised with respect to efficiency, flexibility, and utility for different…
A note on minimal length polygonal approximation to a digitized contour
A method for extracting a smooth polygonal contour from a digitized image is illustrated. The ordered sequence of contour points and the connection graph of the image are…
Interchange rolls of perforated tape for information interchange
This proposed American National Standard has been accepted for publication by American National Standards (formerly USASI) Committee X3, Computers and Information…
Fortran Tausworthe pseudorandom number generator
Intermediate computations in an “Extremely Portable Random Number Generator” by J. B. Kruskal [Comm. ACM 12, 2 (Feb. 1969), 93-94] exceed 15 bits plus sign.…