SEARCH · Search NASA

Results for “Long 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS1988

Sparse distributed memory prototype: Principles of operation

Sparse distributed memory is a generalized random access memory (RAM) for long binary words. Such words can be written into and read from the memory, and they can be used to address the memory. The main attribute of the memory is sensitivity to similarity, meaning that a word can be read back not only by giving the original right address but also by giving one close to it as measured by the Hamming distance between addresses. Large memories of this kind are expected to have wide use in speech and scene analysis, in signal detection and verification, and in adaptive control of automated equipment. The memory can be realized as a simple, massively parallel computer. Digital technology has reached a point where building large memories is becoming practical. The research is aimed at resolving major design issues that have to be faced in building the memories. The design of a prototype memory with 256-bit addresses and from 8K to 128K locations for 256-bit words is described. A key aspect of the design is extensive use of dynamic RAM and other standard components.

Flynn, Michael J.↗

NASA NTRS1991

Distributed memory compiler methods for irregular problems: Data copy reuse and runtime partitioning

Outlined here are two methods which we believe will play an important role in any distributed memory compiler able to handle sparse and unstructured problems. We describe how to link runtime partitioners to distributed memory compilers. In our scheme, programmers can implicitly specify how data and loop iterations are to be distributed between processors. This insulates users from having to deal explicitly with potentially complex algorithms that carry out work and data partitioning. We also describe a viable mechanism for tracking and reusing copies of off-processor data. In many programs, several loops access the same off-processor memory locations. As long as it can be verified that the values assigned to off-processor memory locations remain unmodified, we show that we can effectively reuse stored off-processor data. We present experimental data from a 3-D unstructured Euler solver run on iPSC/860 to demonstrate the usefulness of our methods.

Das, Raja↗

NASA NTRS1989

Sparse distributed memory: Principles and operation

Sparse distributed memory is a generalized random access memory (RAM) for long (1000 bit) binary words. Such words can be written into and read from the memory, and they can also be used to address the memory. The main attribute of the memory is sensitivity to similarity, meaning that a word can be read back not only by giving the original write address but also by giving one close to it as measured by the Hamming distance between addresses. Large memories of this kind are expected to have wide use in speech recognition and scene analysis, in signal detection and verification, and in adaptive control of automated equipment, in general, in dealing with real world information in real time. The memory can be realized as a simple, massively parallel computer. Digital technology has reached a point where building large memories is becoming practical. Major design issues were resolved which were faced in building the memories. The design is described of a prototype memory with 256 bit addresses and from 8 to 128 K locations for 256 bit words. A key aspect of the design is extensive use of dynamic RAM and other standard components.

Flynn, M. J.↗

NASA NTRS1989

A Cerebellar-model Associative Memory as a Generalized Random-access Memory

A versatile neural-net model is explained in terms familiar to computer scientists and engineers. It is called the sparse distributed memory, and it is a random-access memory for very long words (for patterns with thousands of bits). Its potential utility is the result of several factors: (1) a large pattern representing an object or a scene or a moment can encode a large amount of information about what it represents; (2) this information can serve as an address to the memory, and it can also serve as data; (3) the memory is noise tolerant--the information need not be exact; (4) the memory can be made arbitrarily large and hence an arbitrary amount of information can be stored in it; and (5) the architecture is inherently parallel, allowing large memories to be fast. Such memories can become important components of future computers.

Kanerva, Pentti↗

NASA NTRS1997

Accurate Magnetometer/Gyroscope Attitudes Using a Filter with Correlated Sensor Noise

Magnetometers and gyroscopes have been shown to provide very accurate attitudes for a variety of spacecraft. These results have been obtained, however, using a batch-least-squares algorithm and long periods of data. For use in onboard applications, attitudes are best determined using sequential estimators such as the Kalman filter. When a filter is used to determine attitudes using magnetometer and gyroscope data for input, the resulting accuracy is limited by both the sensor accuracies and errors inherent in the Earth magnetic field model. The Kalman filter accounts for the random component by modeling the magnetometer and gyroscope errors as white noise processes. However, even when these tuning parameters are physically realistic, the rate biases (included in the state vector) have been found to show systematic oscillations. These are attributed to the field model errors. If the gyroscope noise is sufficiently small, the tuned filter 'memory' will be long compared to the orbital period. In this case, the variations in the rate bias induced by field model errors are substantially reduced. Mistuning the filter to have a short memory time leads to strongly oscillating rate biases and increased attitude errors. To reduce the effect of the magnetic field model errors, these errors are estimated within the filter and used to correct the reference model. An exponentially-correlated noise model is used to represent the filter estimate of the systematic error. Results from several test cases using in-flight data from the Compton Gamma Ray Observatory are presented. These tests emphasize magnetometer errors, but the method is generally applicable to any sensor subject to a combination of random and systematic noise.

Sedlak, J.↗

NASA NTRS1999

Timescales of Soil Moisture Anomalies: Results from Two GCMs

Soil moisture anomalies dissipate over timescales that may span weeks to months. Characterizing the geographical and seasonal variations in these timescales can have important practical benefit; significant soil moisture "memory" allows long-lead forecasts of soil moisture, which have been found in recent studies to be essential for useful Ion--lead forecasts of precipitation in many regions. In this talk, we will present and compare the soil moisture timescales derived in two separate general circulation model (GCM) studies. Both studies employ multiple ensembles of short-term climate simulations. Timescales at a given point are effectively estimated by determining how quickly the soil moisture distribution generated in one ensemble of simulations (characterized by a unique set of initial soil moisture conditions) approaches that produced by another ensemble (characterized by a different set of initial soil moisture conditions). The talk will include a discussion of why the timescales produced by the two GCMs differ in some regions, and it will also describe the impact of soil moisture memory on simulated precipitation.

Koster, Randal D.↗

NASA NTRS1979

On the design of a postprocessor for a search for extraterrestrial intelligence /SETI/ system

The design of an on-line postprocessor for a search for extraterrestrial intelligence (SETI) system is described. Signal processing tasks of the postprocessor include: (1) analysis of power level, phase coherence, and state of polarization of single-channel signals in a search for significant signals; (2) grouping or aggregation of adjacent channel data, time averaging of data; and (3) the detection of drifting and modulated signals. Control functions include multichannel spectrum analyzer frequency and clock control, system calibration and selfdiagnostic, control of data flow to and from short-term and long-term (archival) memories, and operation of detection subsystems, such as a visual display and a tunable receiver.

Healy, T. J.↗

NASA NTRS1979

The suitability of the ILLIAC IV architecture for image processing

The major architectural features of the ILLIAC IV large scale, array processor are summarized along with their applicability to image processing. Several image processing algorithms are considered, including multispectral classification, texture feature extraction, two-dimensional Fourier transform, and synthetic aperture radar processing. The basic parallelism of the ILLIAC IV (64 processing elements acting in lock-step) is usually fully utilized by the image processing applications. The major architectural aspect of the system with respect to image processing is the relatively small local scratch-pad memory and the long latency time to access the main storage device. The major precision used for the image processing applications is the 32-bit floating point, given a choice of 8-bit integers and 64-bit floating point.

Stevenson, D. K.↗

NASA NTRS1991

Flight Checklists And Interruptions

Report examines relation between performances of flight checklists and interruptions. Based on study of simulated flights of Boeing 707 Airplane. During each flight series of overlapping problems introduced. Study investigated patterns of communication that in carrying out checklists, may contribute to accidents. Showed good crews had high continuity in following checklists and it is not number of interruptions but rather duration of interruptions associated with quality of performance. Suggests greater burden placed on memory by one long interruption than by several short ones.

Linde, C.↗

NASA NTRS1993

Simplified jet-A kinetic mechanism for combustor application

Successful modeling of combustion and emissions in gas turbine engine combustors requires an adequate description of the reaction mechanism. For hydrocarbon oxidation, detailed mechanisms are only available for the simplest types of hydrocarbons such as methane, ethane, acetylene, and propane. These detailed mechanisms contain a large number of chemical species participating simultaneously in many elementary kinetic steps. Current computational fluid dynamic (CFD) models must include fuel vaporization, fuel-air mixing, chemical reactions, and complicated boundary geometries. To simulate these conditions a very sophisticated computer model is required, which requires large computer memory capacity and long run times. Therefore, gas turbine combustion modeling has frequently been simplified by using global reaction mechanisms, which can predict only the quantities of interest: heat release rates, flame temperature, and emissions. Jet fuels are wide-boiling-range hydrocarbons with ranges extending through those of gasoline and kerosene. These fuels are chemically complex, often containing more than 300 components. Jet fuel typically can be characterized as containing 70 vol pct paraffin compounds and 25 vol pct aromatic compounds. A five-step Jet-A fuel mechanism which involves pyrolysis and subsequent oxidation of paraffin and aromatic compounds is presented here. This mechanism is verified by comparing with Jet-A fuel ignition delay time experimental data, and species concentrations obtained from flametube experiments. This five-step mechanism appears to be better than the current one- and two-step mechanisms.

Lee, Chi-Ming↗

NASA NTRS1995

Morphology and kainate-receptor immunoreactivity of identified neurons within the entorhinal cortex projecting to superior temporal sulcus in the cynomolgus monkey

Projections of the entorhinal cortex to the hippocampus are well known from the classical studies of Cajal (Ramon y Cajal, 1904) and Lorente de No (1933). Projections from the entorhinal cortex to neocortical areas are less well understood. Such connectivity is likely to underlie the consolidation of long-term declarative memory in neocortical sites. In the present study, a projection arising in layer V of the entorhinal cortex and terminating in a polymodal association area of the superior temporal gyrus has been identified with the use of retrograde tracing. The dendritic arbors of neurons giving rise to this projection were further investigated by cell filling and confocal microscopy with computer reconstruction. This analysis demonstrated that the dendritic arbor of identified projection neurons was largely confined to layer V, with the exception of a solitary, simple apical dendrite occasionally ascending to superficial laminae but often confined to the lamina dissecans (layer IV). Finally, immunoreactivity for glutamate-receptor subunit proteins GluR 5/6/7 of the dendritic arbor of identified entorhinal projection neurons was examined. The solitary apical dendrite of identified entorhinal projection neurons was prominently immunolabeled for GluR 5/6/7, as was the dendritic arbor of basilar dendrites of these neurons. The restriction of the large bulk of the dendritic arbor of identified entorhinal projection neurons to layer V implies that these neurons are likely to be heavily influenced by hippocampal output arriving in the deep layers of the entorhinal cortex. Immunoreactivity for GluR 5/6/7 throughout the dendritic arbor of such neurons indicates that this class of glutamate receptor is in a position to play a prominent role in mediating excitatory neurotransmission within hippocampal-entorhinal circuits.

NASA Discipline Neuroscience↗

NASA NTRS2020

Ellicott City Disasters II - Building a Real-Time Predictive Flood Model for Improving Early Warning Systems in Ellicott City, Maryland

As flood events in the United States grow in frequency and intensity, the uses of applied remote sensing analyses are increasingly necessary for effective flood monitoring and warning systems. The NASA DEVELOP Ellicott City Disasters III project investigated the use of machine learning for applications in flood risk detection to support the improvement of early warning systems in Ellicott City, Maryland. To strengthen the efforts of the Howard County Office of Emergency Management (OEM) in building a more robust flood monitoring system, this term built on the predictive capability of the long-short term memory (LSTM) model created by the second term of this DEVELOP project to create a Sequentially Trained Real-time EstimAted Model (STREAM). Enhancements to the model included the integration of both real-time and predicted weather products from the National Weather Service to increase predictive capacity. These weather products were supplemented by stream gauge data from the OEM as well as real-time radar products. The resultant flood risk model was trained to evaluate input variables and predict stage height in Ellicott City in real time. The model, upgraded to predict stage height up to 8 hours in advance, was incorporated into an online dashboard in a user-friendly interface. The project demonstrated the potential for integration of open data and NASA Earth observations into a flood risk forecasting tool capable of informing real-time decision-making.

Erika Munshi↗

NASA NTRS2020

Ellicott City Disasters III: Building a Real-Time Statistical Flood Model for Improving Early Warning Systems in Ellicott City, Maryland

Erika Munshi↗

NASA NTRSDate not supplied

Early Information Parameter-Set Analysis for Satellite Close Approaches using Machine Learning

Understanding orbital mechanics is essential in space flight and navigation applications, and leveraging modern force models for flight path projection remains an important aspect in space mission design and operation. However, force models do not capture all the dynamics or perturbations in the space environment and thus are subject to errors in predicting the state vectors. The further out the predicted miss distance between spacecraft is from the time of closest approach (TCA), the larger the propagated errors in the predicted miss distance at TCA is. The dependency on these force models for spacecraft flight state prediction calls for a more reliable method that can quantify, or even reduce, these propagated errors. With recent advances in the field artificial intelligence, specifically in machine and deep learning algorithms, a model that implements these approaches can improve on the modern force model approach. The goal for this work is to provide an early-information decision-making threshold, in order to prioritize risk assessment implementation, given the ongoing increase of space objects. In analyzing the relationship of several parameters from conjunction data messages(CDMs) and solar information, early information becomes viable in miss distance prediction with unsupervised learning techniques, which learn the parameters that are linked together with miss distance and probability of collision (Pc) variables. Another approach implemented for identifying relationships within CDMs is supervised learning, in which a shallow neural network binary classifier learns to distinguish events with Pc values¡108. These parameters detected in the unsupervised process are then applied to a regression neural network, which predicts the miss distance at TCA for a specific event within a given uncertainty bound. For the regression neural network, a Long Short Term Memory (LSTM) neural network is implemented, which yields memory about each time step in an event. Using an LSTM network, the model learns to predict miss distance within 0.2km of the value measured at TCA. Although there is a limited amount of "close miss" data to train a network, the network learns to associate parameters, like large energy dissipation rates with the secondary object, with an elevated Pc

Brianna I. Robertson↗

NASA NTRS2022

Multi-Variate LSTM Prediction of Alaska Magnetometer Chain Utilizing a Coupled Model Approach

During periods of rapidly changing geomagnetic conditions electric fields form within the Earth’s surface and induce currents known as geomagnetically induced currents(GICs), which interact with unprotected electrical systems our society relies on. In this study, we train multi-variate Long-Short Term Memory neural networks to predict magnitude of north-south component of the geomagnetic field (|BN|) at multiple ground magnetometer stations across Alaska provided by the SuperMAG database with a future goal of predicting geomagnetic field disturbances. Each neural network is driven by solar wind and interplanetary magnetic field inputs from the NASA OMNI database spanning from 2000–2015 and is fine tuned for each station to maximize the effectiveness in predicting |BN|. The neural networks are then compared against multivariate linear regression models driven with the same inputs at each station using Heidke skill scores with thresholds at the 50, 75, 85, and 99 percentiles for |BN|. The neural network models show significant increases over the linear regression models for |BN| thresholds. We also calculate the Heidke skill scores for d|BN|/dt by deriving d|BN|/dt from |BN| predictions. However, neural network models do not show clear outperformance compared to the linear regression models. To retain the sign information and thus predict BN instead of |BN|, a secondary so-called polarity model is utilized. The polarity model is run in tandem with the neural networks predicting geomagnetic field in a coupled model approach and results in a high correlation between predicted and observed values for all stations. We find this model a promising starting point for a machine learned geomagnetic field model to be expanded upon through increased output time history and fast turnaround times.

Matthew Blandin↗

NASA NTRSDate not supplied

Document Classification Techniques for Aviation Letters of Agreement

Often when working with technical documents, it is helpful to classify them into specific categories. In this paper, we conduct a thorough review of natural language processing techniques to perform this classification task on Letters of Agreement (LOAs), technical aviation documents outlining rules for utilizing US airspace. We evaluate multiple techniques, including Transfer Learning, for representing the text in the documents as embeddings: unigram and bigram Term Frequency Inverse Document Frequency (TFIDF), Word2Vec, Doc2Vec, GloVe and RoBERTa. We investigate a wide range of classification models: K-Nearest Neighbors, Random Forest, Support Vector Machines (SVM), Logistic Regression, Naive Bayes, Feed-Forward Neural Network, Convolutional Neural Networks (CNNs) and Long-Short Term Memory (LSTM). By comparing the different methods, we found the best overall approach for our task was to use unigram TFIDF representations with SVM while also gaining insight into how the other methodologies performed on a small technical datasets.

Aayushi Batra↗

NASA NTRSDate not supplied

Document Classification Techniques for Aviation Letters of Agreement

Often when working with historic air traffic management (ATM) documents, it is helpful to classify them into specific categories. In this paper, we conduct a thorough review of natural language processing techniques to perform this classification task on Letters of Agreement (LOAs), technical aviation documents outlining rules for utilizing US airspace. We evaluate multiple techniques for representing the text in the documents as embeddings: unigram and bigram Term Frequency Inverse Document Frequency (TFIDF), Word2Vec, Doc2Vec, GloVe and RoBERTa. We investigate a wide range of classification models: K-Nearest Neighbors, Random Forest, Support Vector Machines (SVM), Logistic Regression, Naive Bayes, Feed-Forward Neural Network, Convolutional Neural Networks (CNNs) and Long-Short Term Memory (LSTM). By comparing the different methods, we found the best overall approach for our task was to use unigram TFIDF representations with SVM while also gaining insight into how the other methodologies performed on a small technical datasets.

ATM↗

NASA NTRSDate not supplied

Document Classification Techniques for Aviation Letters of Agreement

ATM↗