A view of Kanerva's sparse distributed memory

Pentti Kanerva is working on a new class of computers, which are called pattern computers. Pattern computers may close the gap between capabilities of biological organisms to recognize and act on patterns (visual, auditory, tactile, or olfactory) and capabilities of modern computers. Combinations of numeric, symbolic, and pattern computers may one day be capable of sustaining robots. The overview of the requirements for a pattern computer, a summary of Kanerva's Sparse Distributed Memory (SDM), and examples of tasks this computer can be expected to perform well are given

Will machines ever think

Artificial Intelligence research has come under fire for failing to fulfill its promises. A growing number of AI researchers are reexamining the bases of AI research and are challenging the assumption that intelligent behavior can be fully explained as manipulation of symbols by algorithms. Three recent books -- Mind over Machine (H. Dreyfus and S. Dreyfus), Understanding Computers and Cognition (T. Winograd and F. Flores), and Brains, Behavior, and Robots (J. Albus) -- explore alternatives and open the door to new architectures that may be able to learn skills

Virtual memory

Virtual memory was conceived as a way to automate overlaying of program segments. Modern computers have very large main memories, but need automatic solutions to the relocation and protection problems. Virtual memory serves this need as well and is thus useful in computers of all sizes. The history of the idea is traced, showing how it has become a widespread, little noticed feature of computers today

First 3 years of operation of RIACS (Research Institute for Advanced Computer Science) (1983-1985)

The focus of the Research Institute for Advanced Computer Science (RIACS) is to explore matches between advanced computing architectures and the processes of scientific research. An architecture evaluation of the MIT static dataflow machine, specification of a graphical language for expressing distributed computations, and specification of an expert system for aiding in grid generation for two-dimensional flow problems was initiated. Research projects for 1984 and 1985 are summarized

Is random access memory random?

Most software is contructed on the assumption that the programs and data are stored in random access memory (RAM). Physical limitations on the relative speeds of processor and memory elements lead to a variety of memory organizations that match processor addressing rate with memory service rate. These include interleaved and cached memory. A very high fraction of a processor's address requests can be satified from the cache without reference to the main memory. The cache requests information from main memory in blocks that can be transferred at the full memory speed. Programmers who organize algorithms for locality can realize the highest performance from these computers

Notes on implementation of sparsely distributed memory

The Sparsely Distributed Memory (SDM) developed by Kanerva is an unconventional memory design with very interesting and desirable properties. The memory works in a manner that is closely related to modern theories of human memory. The SDM model is discussed in terms of its implementation in hardware. Two appendices discuss the unconventional approaches of the SDM: Appendix A treats a resistive circuit for fast, parallel address decoding; and Appendix B treats a systolic array for high throughput read and write operations

Altered Gravity and Early Heart Development in Culture

The macromolecules comprising the cytoskeleton and extracellular matrix of cells may be sensitive to gravitation. Since early development of organs depends on dynamic interactions across cell surfaces, altered gravity may disturb development. We investigated this possibility for heart development. Previous studies showed that the extracellular matrix glycoprotein fibronectin (Fn) is necessary for normal heart development. We cultured precardiac tissue explants in a high aspect ratio bioreactor vessel (HARV) to simulate microgravity. We observed tissue morphology, contraction, and Fn distribution by immunolocalization in HARV rotated and control (lxg) explants, cultured 18 hr. We also measured Fn amount by immunoassay. Explants in HARV were rotated at 6 rpm to achieve continuous freefall. Thirty-five of 37 control, but only 1 of 37 matched rotated explants exhibited contractions. Tissue architecture was identical. Immunolocalization of Fn showed remarkable differences which may be related to the development of contractions. The Fn staining in the HARV explants was less intense in all areas. Areas of linear staining along epithelia were present but shorter, and there was less intercellular staining in both mesenchymal tissue and myocardium. Initial immunoassay results of 5 matched pairs of explants showed a 22% reduction in total tissue Fn in the HARV rotated samples. Our results indicate that altered gravity in the HARV reduced the amount and distribution of Fn, as assessed by two independent criteria. This was correlated with a reduction in the development of contractile activity

White paper: A plan for cooperation between NASA and DARPA to establish a center for advanced architectures

Large, complex computer systems require many years of development. It is recognized that large scale systems are unlikely to be delivered in useful condition unless users are intimately involved throughout the design process. A mechanism is described that will involve users in the design of advanced computing systems and will accelerate the insertion of new systems into scientific research. This mechanism is embodied in a facility called the Center for Advanced Architectures (CAA). CAA would be a division of RIACS (Research Institute for Advanced Computer Science) and would receive its technical direction from a Scientific Advisory Board established by RIACS. The CAA described here is a possible implementation of a center envisaged in a proposed cooperation between NASA and DARPA

Cellular automaton rules conserving the number of active sites

This paper shows how to determine all the unidimensional two-state cellular automaton rules of a given number of inputs which conserve the number of active sites. These rules have to satisfy a necessary and sufficient condition. If the active sites are viewed as cells occupied by identical particles, these cellular automaton rules represent evolution operators of systems of identical interacting particles whose total number is conserved. Some of these rules, which allow motion in both directions, mimic ensembles of one-dimensional pseudo-random walkers. Numerical evidence indicates that the corresponding stochastic processes might be non-Gaussian.Comment: 14 pages, 5 figure