SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
In this report some shortened BCH codes for possible applications to large IC random-access memory systems are presented. These codes are given by their parity-check matrices. Encoding and decoding of these codes are discussed.
A tape drive called the Mass Memory Unit (MMU) stores software used by Spacelab computers. MMU tape motion must be minimized during typical flight operations to avoid a loss of scientific data. A projection of the tape motion is needed for evaluation of candidate tape layouts. A computer simulation of the scheduled and unscheduled MMU tape accesses is developed for this purpose. This simulation permits evaluations of candidate tape layouts by tracking and summarizing tape movements. The factors that affect tape travel are investigated and a heuristic is developed to find a good tape layout. An improved tape layout for Spacelab I is selected after the evaluation of fourteen candidates. The simulation model will provide the ability to determine MMU layouts that substantially decrease the tape travel on future Spacelab flights.
A mechanical actuator can be constructed by employing a plurality of memory metal actuator elements in parallel to control the amount of actuating force. In order to facilitate direct control by digital control signals provided by a computer or the like, the actuating elements may vary in stiffness according to a binary relationship. The cooling or reset time of the actuator elements can be reduced by employing Peltier junction cooling assemblies in the actuator.
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.
Report presents algorithm for calculating feedback gain for control of hereditary dynamical systems with control delay. Problem is to approximate optimal feedback gain that minimizes cost function of state and control. Theory applicable to design of controllers for mechanical systems subject to thermal deformation, electrical systems with delay, electrical systems with plasma components, and other systems that exhibit memory.
Report discusses simplified recursive solutions for equations of class of fading-memory filters. Under appropriate assumptions regarding noise and exponential decay of effects of previous states, filter equations reduced to analytic formulas in closed form.
A rotary stepping device includes a rotatable shaft which is driven by means of a coiled spring clutch which is alternately tightened to grip and rotate the shaft and released to return it to a resting position. An actuator formed of a memory metal is used to pull the spring clutch to tighten it and rotate the shaft. The actuator is activated by heating it above its critical temperature and is returned to an elongated configuration by means of the force of the spring cloth.
It is shown that the distribution of refractory metals in a comet-nucleus drill core carries a chemical memory quite distinct from that of volatiles. Using aluminum as an example, it is demonstrated that very refractory structures, either grain cores or refractory aggregates of cores, must be much older than the volatile component. It is argued that isotopic anomalies are specifically associated with aluminum. An evolutionary model capable of rationalizing the interstellar gas depletions of Al and Mg is advocated. The distribution of Al in comets is shown to be crucial to understanding the origin of comets and of the solar system.
The design, implementation, and performance evaluation of a message passing facility (MPF) for shared memory multiprocessors are presented. The MPF is based on a message passing model conceptually similar to conversations. Participants (parallel processors) can enter or leave a conversation at any time. The message passing primitives for this model are implemented as a portable library of C function calls. The MPF is currently operational on a Sequent Balance 21000, and several parallel applications were developed and tested. Several simple benchmark programs are presented to establish interprocess communication performance for common patterns of interprocess communication. Finally, performance figures are presented for two parallel applications, linear systems solution, and iterative solution of partial differential equations.
Described are two programs demonstrating different aspects of Kanerva's Sparse, Distributed Memory (SDM). These programs run on Sun 3 workstations, one using color, and have straightforward graphically oriented user interfaces and graphical output. Presented are descriptions of the programs, how to use them, and what they show. Additionally, this paper describes the software simulator behind each program.
With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. Parallel simulation mimics the interacting servers and queues of a real system by assigning each simulated entity to a processor. By eliminating the event list and maintaining only sufficient synchronization to insure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. A set of shared memory experiments is presented using the Chandy-Misra distributed simulation algorithm to simulate networks of queues. Parameters include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queueing network models.
The Sparsely Distributed Memory (SDM) model (Kanerva, 1984) is compared to Hopfield-type neural-network models. A mathematical framework for comparing the two is developed, and the capacity of each model is investigated. The capacity of the SDM can be increased independently of the dimension of the stored vectors, whereas the Hopfield capacity is limited to a fraction of this dimension. However, the total number of stored bits per matrix element is the same in the two models, as well as for extended models with higher order interactions. The models are also compared in their ability to store sequences of patterns. The SDM is extended to include time delays so that contextual information can be used to cover sequences. Finally, it is shown how a generalization of the SDM allows storage of correlated input pattern vectors.
An approach to magnetic bubble memory which incorporates dual conductor current access drive with a self-structured (strongly interacting) bubble lattice is described. This is expected to provide higher operating speeds, defect tolerance, and higher bit density for a given bubble size as compared to present field access bubble devices. Bubble spacings of 2.5 bubble diameters are projected for a prototype device. Experimental work on device components including detectors, major/minor loops, and gates is described. Defect tolerance has also been demonstrated.
In a test of short-term memory recall, two subjects attempted to recall various lists. For unpracticed subjects, the time it took to read the list is a better predictor of immediate recall than the number of items on the list. For practiced subjects, the two predictors do about equally well. If the items that must be recalled are unfamiliar, it is advantageous to keep the items short to pronounce. On the other hand, if the same items will be encountered over and over again, it is advantageous to make them distinctive, even at the cost of adding to the number of syllables.
The effects of total accumulated dose on the single-event vulnerability of NMOS resistive-load SRAMs are investigated. The bias-dependent shifts in device parameters can imprint the memory state present during exposure or erase the imprinted state. Analysis of these effects is presented along with an analytic model developed for the quantification of these effects. The results indicate that the imprint effect is dominated by the difference in the threshold voltage of the n-channel devices.
With traditional event-list techniques, evaluating a detailed discrete-event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments, using the Chandy-Misra distributed-simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential-simulation of most queueing network models.
The standard formulation of Kanerva's sparse distributed memory (SDM) involves the selection of a large number of data storage locations, followed by averaging the data contained in those locations to reconstruct the stored data. A variant of this model is discussed, in which the predominant pattern is the focus of reconstruction. First, one architecture is proposed which returns the predominant pattern rather than the average pattern. However, this model will require too much storage for most uses. Next, a hybrid model is proposed, called tagged SDM, which approximates the results of the predominant pattern machine, but is nearly as efficient as Kanerva's original formulation. Finally, some experimental results are shown which confirm that significant improvements in the recall capability of SDM can be achieved using the tagged architecture.
Incentives, problems and solutions associated with interfacing laboratory equipment with multiuser, virtual memory computers are presented. The major difficulty concerns how to utilize these computers effectively in a medium sized research group. This entails optimization of hardware interconnections and software to facilitate multiple instrument control, data acquisition and processing. The architecture of the system that was devised, and associated programming and subroutines are described. An example program involving computer controlled hardware for ultrasonic scan imaging is provided to illustrate the operational features.