Search NASA⌕ Search

SEARCH · Search NASA

Results for “memory”

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.

At least 973 records · Page 54

Shape-memory properties in Ni-Ti sputter-deposited film

A Ni-Ti alloy, generically called nitinol, was prepared from sputtering targets of two different compositions on glass substrates using a dc magnetron source. The as-deposited films were amorphous in structure and did not exhibit a shape memory. The amorphous films were crystallized with a suitable annealing process, and the transformation properties were measured using differential scanning calorimetry. The annealed films demonstrated a strong shape-memory effect. Stress/strain measurements and physical manipulation were used to evaluate the shape recovery. These tests demonstrated sustained tensile stresses of up to 480 MPa in the high-temperature phase, and a characteristic plastic deformation in the low-temperature phase.

Busch, J. D.↗

Design of a Shape Memory Alloy deployment hinge for reflector facets

A design concept for a Shape Memory Alloy (SMA) actuated hinge mechanism for deploying segmented facet-type reflector surfaces on antenna truss structures is presented. The mechanism uses nitinol, a nickel-titanium shape memory alloy, as a displacement-force micro-actuator. An electrical current is used to resistively heat a 'plastically' elongated SMA actuator wire, causing it to contract in response to a thermally-induced phase transformation. The resulting tension creates a moment, imparting rotary motion between two adjacent panels. Mechanical stops are designed into the device to limit its range of motion and to establish positioning accuracy at the termination of deployment. The concept and its operation are discussed in detail, and an analytical dynamic simulation model is presented. The model has been used to perform nondimensionalized parametric design studies.

Anders, W. S.↗

Execution time support for scientific programs on distributed memory machines

Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

Prediction of error rates in dose-imprinted memories on board CRRES by two different methods

An analysis of the expected space radiation effects on the single event upset (SEU) properties of CMOS/bulk memories onboard the Combined Release and Radiation Effects Satellite (CRRES) is presented. Dose-imprint data from ground test irradiations of identical devices are applied to the predictions of cosmic-ray-induced space upset rates in the memories onboard the spacecraft. The calculations take into account the effect of total dose on the SEU sensitivity of the devices as the dose accumulates in orbit. Estimates of error rates, which involved an arbitrary selection of a single pair of threshold linear energy transfer (LET) and asymptotic cross-section values, were compared to the results of an integration over the cross-section curves versus LET. The integration gave lower upset rates than the use of the selected values of the SEU parameters. Since the integration approach is more accurate and eliminates the need for an arbitrary definition of threshold LET and asymptotic cross section, it is recommended for all error rate predictions where experimental sigma-versus-LET curves are available.

Brucker, G. J.↗

Experimental Optoelectronic Associative Memory

Optoelectronic associative memory responds to input image by displaying one of M remembered images. Which image to display determined by optoelectronic analog computation of resemblance between input image and each remembered image. Does not rely on precomputation and storage of outer-product synapse matrix. Size of memory needed to store and process images reduced.

Chao, Tien-Hsin↗

Shape-Memory Wires Switch Rotary Actuator

Thermomechanical rotary actuator based on shape-memory property of alloy composed of equal parts of titanium and nickel. If alloy stretched while below transition temperature, it reverts to original length when heated above transition temperature. Two capstans on same shaft wrapped with shape-memory wires. As one wire heated, it contracts and stretches opposite wire. Wires heated in alternation so they switch shaft between two extreme angular positions; "on" and "off" positions of rotary valve.

Brudnicki, Myron J.↗

BIRD: A general interface for sparse distributed memory simulators

Kanerva's sparse distributed memory (SDM) has now been implemented for at least six different computers, including SUN3 workstations, the Apple Macintosh, and the Connection Machine. A common interface for input of commands would both aid testing of programs on a broad range of computer architectures and assist users in transferring results from research environments to applications. A common interface also allows secondary programs to generate command sequences for a sparse distributed memory, which may then be executed on the appropriate hardware. The BIRD program is an attempt to create such an interface. Simplifying access to different simulators should assist developers in finding appropriate uses for SDM.

Rogers, David↗

Content addressable memory project

The progress on the Rutgers CAM (Content Addressable Memory) Project is described. The overall design of the system is completed at the architectural level and described. The machine is composed of two kinds of cells: (1) the CAM cells which include both memory and processor, and support local processing within each cell; and (2) the tree cells, which have smaller instruction set, and provide global processing over the CAM cells. A parameterized design of the basic CAM cell is completed. Progress was made on the final specification of the CPS. The machine architecture was driven by the design of algorithms whose requirements are reflected in the resulted instruction set(s). A few of these algorithms are described.

Hall, Josh↗

Sparse distributed memory

Sparse distributed memory was proposed be Pentti Kanerva as a realizable architecture that could store large patterns and retrieve them based on partial matches with patterns representing current sensory inputs. This memory exhibits behaviors, both in theory and in experiment, that resemble those previously unapproached by machines - e.g., rapid recognition of faces or odors, discovery of new connections between seemingly unrelated ideas, continuation of a sequence of events when given a cue from the middle, knowing that one doesn't know, or getting stuck with an answer on the tip of one's tongue. These behaviors are now within reach of machines that can be incorporated into the computing systems of robots capable of seeing, talking, and manipulating. Kanerva's theory is a break with the Western rationalistic tradition, allowing a new interpretation of learning and cognition that respects biology and the mysteries of individual human beings.

Denning, Peter J.↗

Vienna FORTRAN: A FORTRAN language extension for distributed memory multiprocessors

Exploiting the performance potential of distributed memory machines requires a careful distribution of data across the processors. Vienna FORTRAN is a language extension of FORTRAN which provides the user with a wide range of facilities for such mapping of data structures. However, programs in Vienna FORTRAN are written using global data references. Thus, the user has the advantage of a shared memory programming paradigm while explicitly controlling the placement of data. The basic features of Vienna FORTRAN are presented along with a set of examples illustrating the use of these features.

Chapman, Barbara↗

An empirical investigation of sparse distributed memory using discrete speech recognition

Presented here is a step by step analysis of how the basic Sparse Distributed Memory (SDM) model can be modified to enhance its generalization capabilities for classification tasks. Data is taken from speech generated by a single talker. Experiments are used to investigate the theory of associative memories and the question of generalization from specific instances.

Danforth, Douglas G.↗

Formal verification of a set of memory management units

This document describes the verification of a set of memory management units (MMU). The verification effort demonstrates the use of hierarchical decomposition and abstract theories. The MMUs can be organized into a complexity hierarchy. Each new level in the hierarchy adds a few significant features or modifications to the lower level MMU. The units described include: (1) a page check translation look-aside module (TLM); (2) a page check TLM with supervisor line; (3) a base bounds MMU; (4) a virtual address translation MMU; and (5) a virtual address translation MMU with memory resident segment table.

Schubert, E. Thomas↗

The optical implementation of inner product neural associative memory

A liquid-crystal TV spatial light modulator (LCTV SLM) input device and LCTV nonlinear thresholding element are presently used to accomplish an all-optical implementation of an inner-product neural associative memory. This architecture represents an alternative to the vector-matrix multiplication method of the Hopfield model, which is most often employed by neural network associative memory models. LCTV SLM experimental results are presented and discussed.

Liu, Hua-Kuang↗

High speed, nondestructive readout from thin-film ferroelectric memory

High-speed polarization-direction-dependent photoresponse from ferroelectric lead zirconate titanate (PbZr(0.53)Ti(0.47)O3) thin films sandwiched between conducting electrodes to form a memory capacitor is reported. Laser pulses with a full width at half maximum of around 10 ns at 532-nm wavelength are utilized to readout the photoresponse signal from individual polarized elements. Such readout is repeated over a million times, with no detectable degradation in the photoresponse or the remanent polarization suggesting its potential as a nondestructive readout (NDRO) of nonvolatile polarization state in thin-film ferroelectric memories. In principle both electronic as well as thermal mechanisms could be triggered by such photon exposure of ferroelectric thin films. A comparison of the photoresponse from capacitors with semitransparent and opaque top electrodes suggests that the observed NDRO signal is primarily due to thermally triggered mechanisms.

Thakoor, Sarita↗

Optoelectronic Inner-Product Neural Associative Memory

Optoelectronic apparatus acts as artificial neural network performing associative recall of binary images. Recall process is iterative one involving optical computation of inner products between binary input vector and one or more reference binary vectors in memory. Inner-product method requires far less memory space than matrix-vector method.

Liu, Hua-Kuang↗

Shape-Memory-Alloy Release Mechanism

Release-nut mechanism activated by electric current applied to shape-memory alloy. Separates attached objects quickly by remote control. Does not create hazard or cause damage. Shape-memory release-nut mechanism unaffected by moisture or vacuum. Requires sustained current lasting 5 seconds or longer, and insensitive to electromagnetic interference. Mechanism can be reused.

Mckinnis, Darin↗

Scalable problems and memory bounded speedup

In this paper three models of parallel speedup are studied. They are fixed-size speedup, fixed-time speedup and memory-bounded speedup. The latter two consider the relationship between speedup and problem scalability. Two sets of speedup formulations are derived for these three models. One set considers uneven workload allocation and communication overhead and gives more accurate estimation. Another set considers a simplified case and provides a clear picture on the impact of the sequential portion of an application on the possible performance gain from parallel processing. The simplified fixed-size speedup is Amdahl's law. The simplified fixed-time speedup is Gustafson's scaled speedup. The simplified memory-bounded speedup contains both Amdahl's law and Gustafson's scaled speedup as special cases. This study leads to a better understanding of parallel processing.

Sun, Xian-He↗