Home → Magazine Archive → February 1988 (Vol. 31, No. 2)
Table of Contents
Authors
Rosalie Steier
Pages 99-ff.
Editorial
Peter J. Denning
Page 100
Vice-President's letter
Dennis Frailey
Pages 101-103
Policy discussion
Peter J. Denning
Pages 104-105
The art and science of visualizing data
"I manipulate the laser," the artist said, having exploited laboratory equipment. "This is a parallel pipeline systolic SIMD engine we call the 'Jell-O Engine,'" the animator/straight man announced, but not until he had decimated …
Karen A. Frenkel
Pages 111-121
Coons Award Lecture
The 1987 recipient of the Steven A. Coons Award speaks out on the state of the art in computer graphics and what the future can bring the industry under the right influences.
Donald P. Greenberg
Pages 123-131
Ray tracing Jell-O brand gelatin
New technology is presented for imaging a restricted class of dessert foods.
Paul S. Heckbert
Pages 131-134
Pattern formation and chaos in networks
Chaos theory involves the study of how complicated behavior can arise in systems that are based on simple rules, and how minute changes in the input of a system can lead to great differences in the output. Using computer graphics …
Clifford A. Pickover
Pages 136-151
Connectionist expert systems
Connectionist networks can be used as expert system knowledge bases. Furthermore, such networks can be constructed from training examples by machine learning techniques. This gives a way to automate the generation of expert systems …
Stephan I. Gallant
Pages 152-169
Computing with structured connectionist networks
The design and applications of massively parallel computational models could lead to dramatic advances in the ability to automate complex tasks such as those found in artificial intelligence.
Jerome A. Feldman, Mark A. Fanty, Nigel H. Goddard, Kenton J. Lynne
Pages 170-187
NPATH: a measure of execution path complexity and its applications
Software engineering is a discipline in search of objective measures for factors that contribute to software quality. NPATH, which counts the acyclic execution paths through a function, is an objective measure of software complexity …
Brian A. Nejmeh
Pages 188-200
Parallel text search methods
A comparison of recently proposed parallel text search methods to alternative available search strategies that use serial processing machines suggests parallel methods do not provide large-scale gains in either retrieval effectiveness …
Gerard Salton, Chris Buckley
Pages 202-215
Binomial random variate generation
Existing binomial random-variate generators are surveyed, and a new generator designed for moderate and large means is developed. The new algorithm, BTPE, has fixed memory requirements and is faster than other such algorithms …
Voratas Kachitvichyanukul, Bruce W. Schmeiser
Pages 216-222