Search NASA⌕ Search

SEARCH · Search NASA

Results for “spatial 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 91 records · Page 5

Satellite Gravimetry Improves Seasonal Streamflow Forecast Initialization in Africa

West Africa is one of the poorest regions in the world and highly vulnerable to extreme hydrological events due to the lack of reliable monitoring and forecast systems. For the first time, we demonstrate that initial hydrological conditions informed by satellite-based terrestrial water storage (TWS) estimates improve seasonal streamflow forecasts. TWS variability detected by the Gravity Recovery and Climate Experiment (GRACE) satellites is assimilated into a land surface model during 2003–2016 and used to initialize 6-month hindcasts (i.e., forecasts of past events) during West Africa's wet seasons. We find that GRACE data assimilation (DA) generally increases groundwater and soil moisture storage in the region, resulting in increased evapotranspiration and reduced total runoff. Total runoff is particularly lower at the headwaters of the Niger River, positively impacting streamflow simulations and hindcast initializations. Compared to simulations without GRACE-DA, hindcasts are notably improved at locations draining from large basin areas, in particular, over the Niger River basin, which is consistent with GRACE's coarse spatial resolution. The long memory of groundwater and deep soil moisture, two main TWS components updated by GRACE-DA, is reflected in prolonged improvements in the streamflow hindcasts. Model accuracy at Niamey, Niger, the most populated city where streamflow observations are available, improved up to 33% during the flood season. These new findings directly contribute to ongoing developments in food security, flood potential forecast, and water-related disaster warning systems for Africa.

Augusto Getirana↗

FDEM v. 3.0

Program FDEM_v3.0 is designed to simulate three-dimensional (3D) electromagnetic (EM) wave propagation within an isotropic and heterogeneous body. The medium is characterized by the three isotropic (but spatially-variable) parameters electric permittivity, magnetic permeability, and current conductivity. The numerical solution methodology is explicit, time-domain, finite-differencing of the EH (i.e., electric vector – magnetic vector) coupled partial differential system on uniform, but staggered, spatial and temporal grids. In order to suppress grid boundary reflections, FDEM_v3.0 implements “perfectly matched layer” (PML) absorbing boundary conditions on all flanks of the 3D spatial grid in a memory efficient manner.

Aldridge, David F.↗

zorder-lib: Library API for Z-Order Memory Layout

This document describes the motivation for, elements of, and use of the zorder-lib, a library API that implements organization of and access to data in memory using either a-order (also known as "row-major" order) or z-order memory layouts. The primary motivation for this work is to improve the performance of many types of data- intensive codes by increasing both spatial and temporal locality of memory accesses. The basic idea is that the cost associated with accessing a datum is less when it is nearby in either space or time.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

zorder-lib: Library API for Z-Order Memory Layout

This document describes the motivation for, elements of, and use of the zorder-lib, a library API that implements organization of and access to data in memory using either a-order (also known as “row-major” order) or z-order memory layouts. The primary motivation for this work is to improve the performance of many types of data-intensive codes by increasing both spatial and temporal locality of memory accesses. The basic idea is that the cost associated with accessing a datum is less when it is nearby in either space or time.

97 MATHEMATICS AND COMPUTING↗

Effects of Digitization and JPEG Compression on Land Cover Classification Using Astronaut-Acquired Orbital Photographs

Studies that utilize astronaut-acquired orbital photographs for visual or digital classification require high-quality data to ensure accuracy. The majority of images available must be digitized from film and electronically transferred to scientific users. This study examined the effect of scanning spatial resolution (1200, 2400 pixels per inch [21.2 and 10.6 microns/pixel]), scanning density range option (Auto, Full) and compression ratio (non-lossy [TIFF], and lossy JPEG 10:1, 46:1, 83:1) on digital classification results of an orbital photograph from the NASA - Johnson Space Center archive. Qualitative results suggested that 1200 ppi was acceptable for visual interpretive uses for major land cover types. Moreover, Auto scanning density range was superior to Full density range. Quantitative assessment of the processing steps indicated that, while 2400 ppi scanning spatial resolution resulted in more classified polygons as well as a substantially greater proportion of polygons < 0.2 ha, overall agreement between 1200 ppi and 2400 ppi was quite high. JPEG compression up to approximately 46:1 also did not appear to have a major impact on quantitative classification characteristics. We conclude that both 1200 and 2400 ppi scanning resolutions are acceptable options for this level of land cover classification, as well as a compression ratio at or below approximately 46:1. Auto range density should always be used during scanning because it acquires more of the information from the film. The particular combination of scanning spatial resolution and compression level will require a case-by-case decision and will depend upon memory capabilities, analytical objectives and the spatial properties of the objects in the image.

Robinson, Julie A.↗

CRCNS22 Learning Rules in the Hippocampus and their Mapping to Neuromorphic Systems (Final Technical Report)

Large scale biologically-realistic computational models are key to investigating the interplay between structure and function in nervous systems, thus paving the way to new clinical methods and neuro-inspired computing solutions. This project focuses on the hippocampus, in particular the CA3-CA1 regions, due to their role in associative learning and memory, pattern separation and completion, and spatial navigation. Investigations into the neuronal organization and learning rule(s) of this circuit can shed light into how declarative memories are formed, stored, recalled and forgotten and inform computational, experimental and clinical neuroscience work. Our project aims at developing a novel data-driven methodology supported by a broad heterogeneous base of neuroscience experimental knowledge and inspired from advances in computer science and engineering. Specifically, this work will benchmark existing and new learning rules within a full-scale spiking neural network simulation of the CA3-CA1 region. The model will be based on an open-source repository, called the Hippocampome, which contains neuronal morphologies, firing patterns, synapse probabilities, and most other required parameters for all known neuron types in the rodent hippocampal formation. The model will be first trained in a supervised fashion for associative memory tasks using backpropagation through time traditionally used in computer science, enhanced with a new technique called the surrogate gradient method. This optimization method will be used to obtain a global loss minimization, but it is not biologically inspired as it assumes the use of data not locally available to the synapses. However, we propose its use as a benchmarking tool, to compare the training performance of local biologically plausible and hardware-mappable learning rules at scale. New rules or combinations will be proposed and tested as needed, based on the obtained results. Progress in this area will also drive the development of novel hardware-mappable algorithms for continual lifelong learning and categorization of new events from few presented examples. This project goes beyond the existing state-of-the-art by looking at large scale realistic neuronal circuits as networks trainable via global optimization methods such as surrogate gradient descent. The objective function of the brain that supports learning is largely unknown, but it is likely that it operates through local learning rules. Studying network trajectories around local minima as proposed in this work represents a useful strategy for understanding whether a network is training by using a specific (set of) learning rule(s). Starting from a completely untrained network is a challenging test since it is difficult to determine how the learning rule affects the trajectory of the network. This interdisciplinary project will help understand what rule governs learning in these regions or if multiple learning rules are involved. The work will develop a robust methodology to measure if the network is converging to the target solution, oscillating around it, or diverging away.

59 BASIC BIOLOGICAL SCIENCES↗

Engineering complex topological memories from simple Abelian models

In three spatial dimensions, particles are limited to either bosonic or fermionic statistics. Two-dimensional systems, on the other hand, can support anyonic quasiparticles exhibiting richer statistical behaviors. An exciting proposal for quantum computation is to employ anyonic statistics to manipulate information. Since such statistical evolutions depend only on topological characteristics, the resulting computation is intrinsically resilient to errors. The so-called non-Abelian anyons are most promising for quantum computation, but their physical realization may prove to be complex. Abelian anyons, however, are easier to understand theoretically and realize experimentally. Here we show that complex topological memories inspired by non-Abelian anyons can be engineered in Abelian models. We explicitly demonstrate the control procedures for the encoding and manipulation of quantum information in specific lattice models that can be implemented in the laboratory. This bridges the gap between requirements for anyonic quantum computation and the potential of state-of-the-art technology. - Highlights: > A novel quantum memory using Abelian anyons is developed. > This uses an advanced encoding, inspired by non-Abelian anyons. > Errors are suppressed topologically, by means of single spin interactions. > An implementation with current Josephson junction technology is proposed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neural networks for data compression and invariant image recognition

An approach to invariant image recognition (I2R), based upon a model of biological vision in the mammalian visual system (MVS), is described. The complete I2R model incorporates several biologically inspired features: exponential mapping of retinal images, Gabor spatial filtering, and a neural network associative memory. In the I2R model, exponentially mapped retinal images are filtered by a hierarchical set of Gabor spatial filters (GSF) which provide compression of the information contained within a pixel-based image. A neural network associative memory (AM) is used to process the GSF coded images. We describe a 1-D shape function method for coding of scale and rotationally invariant shape information. This method reduces image shape information to a periodic waveform suitable for coding as an input vector to a neural network AM. The shape function method is suitable for near term applications on conventional computing architectures equipped with VLSI FFT chips to provide a rapid image search capability.

Gardner, Sheldon↗

Creative-Dynamics Approach To Neural Intelligence

Paper discusses approach to mathematical modeling of artificial neural networks exhibiting complicated behaviors reminiscent of creativity and intelligence of biological neural networks. Neural network treated as non-Lipschitzian dynamical system - as described in "Non-Lipschitzian Dynamics For Modeling Neural Networks" (NPO-17814). System serves as tool for modeling of temporal-pattern memories and recognition of complicated spatial patterns.

Zak, Michail A.↗

The Improved Simple Corner Balance Method and Efforts to Enhance its Computational Performance

The diamond difference (DD) spatial discretization has long been a work horse of the neutron transport community. For nearly as long as DD has been used in neutron transport, it has been observed that DD produces undamped, non-physical angular fluxes in spatially under resolved problems and can fail in the thick diffusion limit. A long list of alternative spatial discretizations, all with better physics properties: accuracy, robustness, and/or preservation of the thick diffusion limit, have been proposed as alternatives to DD. Unfortunately, these alternative spatial discretizations also require significantly more floating point operations (FLOPs) per unknown compared to DD. Historically, neutron transport problems of interest have been able to be resolved sufficiently that DD is accurate enough and FLOPs have been the computational performance bottleneck controlling time to solution. Thus, in practice DD has been and remains a preferred spatial discretization for neutron transport simulations. Trends in computing architecture are leading to a new paradigm where data movement, not FLOPs will control time to solution. This presents an opportunity to improve neutron transport physics by reconsidering more FLOP intensive spatial discretization than DD without incurring a time to solution penalty. In this work, we consider the improved simple corner balance (ISCB) spatial discretization, a unique alternative to DD that has the same memory footprint as DD, and detail efforts to improve its computational performance. The ISCB spatial discretization is a more FLOP intensive spatial discretization than DD with the same memory footprint as DD. Though designed to maximize FLOP intensity, third party libraries such as LAPACK are not tuned for the unique, frequent, small linear algebra needs of neutron transport problems. While hand coding a sparse Gauss elimination is likely to be faster than a dense matrix solve (CM vs. HGE), were LAPACK suitable for small linear algebra problems, we would not have seen a performance increase with decreased numbers of LAPACK calls for the Schur complement solve (SC4 vs. SC1). Significant effort has reduced the relative compute time of ISCB to DD, but on current computer architectures DD is still faster than ISCB. Future work comparing the overall efficiency of ISCB to DD may reveal that while ISCB is slower than DD on current computers, ISCB is more accurate than DD by a factor greater than the compute time slowdown. As new computer architectures become available, we will test our hypothesis that neutron transport simulations will be bandwidth limited, ideally rendering the additional FLOPs required by ISCB to be 'free' [in terms of time to solution]. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Jamming, fragility and pinning phenomena in superconducting vortex systems

Abstract We examine driven superconducting vortices interacting with quenched disorder under a sequence of perpendicular drive pulses. As a function of disorder strength, we find four types of behavior distinguished by the presence or absence of memory effects. The fragile and jammed states exhibit memory, while the elastic and pinning dominated regimes do not. In the fragile regime, the system organizes into a pinned state during the first pulse, flows during the second perpendicular pulse, and then returns to a pinned state during the third pulse which is parallel to the first pulse. This behavior is the hallmark of the fragility proposed for jamming in particulate matter. For stronger disorder, we observe a robust jamming state with memory where the system reaches a pinned or reduced flow state during the perpendicular drive pulse, similar to the shear jamming of granular systems. We show signatures of the different states in the spatial vortex configurations, and find that memory effects arise from coexisting elastic and pinned components of the vortex assembly. The sequential perpendicular driving protocol we propose for distinguishing fragile, jammed, and pinned phases should be general to the broader class of driven interacting particles in the presence of quenched disorder.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Prospective memory in dynamic environments: effects of load, delay, and phonological rehearsal

A new paradigm was developed to examine prospective memory performance in a visual-spatial task that resembles some aspects of the work of air traffic controllers. Two experiments examined the role of workload (number of aeroplanes that participants directed), delay (between receipt of prospective instructions and execution), and phonological rehearsal. High workload increased prospective memory errors but increasing delay from 1-3 or 5 minutes had no effect. Shadowing aurally presented text reduced prospective memory performance, presumably because it prevented verbal rehearsal of the prospective instructions. However, performance on the foreground task of directing aeroplanes to routine destinations was affected only by workload and not by opportunity for rehearsal. Our results suggest that ability to maintain performance on a routine foreground task while performing a secondary task--perhaps analogous to conversation--does not predict ability to retrieve a prospective intention to deviate from the routine.

Aerospace Medicine↗

A Deep Learning Modeling Framework to Capture Mixing Patterns in Reactive-Transport Systems

Prediction and control of chemical mixing are vital for many scientific areas such as subsurface reactive transport, climate modeling, combustion, epidemiology, and pharmacology. Due to the complex nature of mixing in heterogeneous and anisotropic media, the mathematical models related to this phenomenon are not analytically tractable. Numerical simulations often provide a viable route to predict chemical mixing accurately. However, contemporary modeling approaches for mixing cannot utilize available spatial-temporal data to improve the accuracy of the future prediction and can be compute-intensive, especially when the spatial domain is large and for long-term temporal predictions. To address this knowledge gap, in this work we will present in this paper a deep learning (DL) modeling framework applied to predict the progress of chemical mixing under fast bimolecular reactions. This framework uses convolutional neural networks (CNN) for capturing spatial patterns and long short-term memory (LSTM) networks for forecasting temporal variations in mixing. By careful design of the framework—placement of non-negative constraint on the weights of the CNN and the selection of activation function, the framework ensures non-negativity of the chemical species at all spatial points and for all times. Our DL-based framework is fast, accurate, and requires minimal data for training. The time needed to obtain a forecast using the model is a fraction (≈ O(-6)) of the time needed to obtain the result using a high-fidelity simulation. To achieve an error of 10% (measured using the infinity norm) for capturing local-scale mixing features such as interfacial mixing, only 24% to 32% of the sequence data for model training is required. To achieve the same level of accuracy for capturing global-scale mixing features, the sequence data required for model training is 64% to 70% of the total spatial-temporal data. Hence, the proposed approach—a fast and accurate way to forecast long-time spatial-temporal mixing patterns in heterogeneous and anisotropic media—will be a valuable tool for modeling reactive-transport in a wide range of applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Efficient Silent Data Corruption Detection Method with Error-Feedback Control and Even Sampling for HPC Applications

The silent data corruption (SDC) problem is attracting more and more attentions because it is expected to have a great impact on exascale HPC applications. SDC faults are hazardous in that they pass unnoticed by hardware and can lead to wrong computation results. In this work, we formulate SDC detection as a runtime one-step-ahead prediction method, leveraging multiple linear prediction methods in order to improve the detection results. The contributions are twofold: (1) we propose an error feedback control model that can reduce the prediction errors for different linear prediction methods, and (2) we propose a spatial-data-based even-sampling method to minimize the detection overheads (including memory and computation cost). We implement our algorithms in the fault tolerance interface, a fault tolerance library with multiple checkpoint levels, such that users can conveniently protect their HPC applications against both SDC errors and fail-stop errors. We evaluate our approach by using large-scale traces from well-known, large-scale HPC applications, as well as by running those HPC applications on a real cluster environment. Experiments show that our error feedback control model can improve detection sensitivity by 34-189% for bit-flip memory errors injected with the bit positions in the range [20,30], without any degradation on detection accuracy. Furthermore, memory size can be reduced by 33% with our spatial-data even-sampling method, with only a slight and graceful degradation in the detection sensitivity.

Di, Sheng↗

Angular-spatial hp -adaptivity for radiative transfer with discontinuous Galerkin spectral element methods

Radiative transfer is important for many science and engineering applications, and numerical simulations of radiative transfer can be challenging. For instance, the radiation field is seven-dimensional – three spatial, two angular, one wavelength, and one temporal – and often features steep gradients. Therefore, memory usage is a key issue. To reduce memory, some past work has investigated the use of adaptive mesh refinement (AMR), typically for either the spatial or angular coordinate, and typically for only h -adaptivity. Here, we propose the use of AMR for the spatial and angular coordinates together, and the use of h - and p -adaptivity together as hp -AMR for the potential for further memory savings. We implemented the proposed method for several test cases in two spatial and one angular dimension, with the discontinuous Galerkin spectral element method. These test cases featured highly anisotropic angular radiation, with or without steep spatial gradients. Our primary findings from these test cases were: (1) Angular hp -adaptivity can deliver the radiation solution with the same accuracy as, and with much less computational memory than, uniform angular h - or p -refinements, or angular h -adaptivity alone. This is most obvious when the incoming radiation is highly anisotropic, in which case the savings can be orders of magnitude. (2) Full spatial-angular hp -adaptivity is more efficient in solution representation, compared to solely spatial or solely angular -adaptivity. This is most evident when steep gradients are present in both the spatial and angular distribution. These results suggest that adaptive spatial- hp angular-refinement may perform well in large-scale seven-dimensional applications.

Adaptive refinement↗

Spiers Memorial Lecture : Surface-enhanced Raman spectroscopy: from single particle/molecule spectroscopy to ångstrom-scale spatial resolution and femtosecond time resolution

Four decades on, surface-enhanced Raman spectroscopy (SERS) continues to be a vibrant field of research that is growing (approximately) exponentially in scope and applicability while pushing at the ultimate limits of sensitivity, spatial resolution, and time resolution. This introductory paper discusses some aspects related to all four of the themes for this Faraday Discussion. First, the wavelength-scanned SERS excitation spectroscopy (WS-SERES) of single nanosphere oligomers ( viz. , dimers, trimers, etc. ), the distance dependence of SERS, the magnitude of the chemical enhancement mechanism, and the progress toward developing surface-enhanced femtosecond stimulated Raman spectroscopy (SE-FSRS) are discussed. Second, our efforts to develop a continuous, minimally invasive, in vivo glucose sensor based on SERS are highlighted. Third, some aspects of our recent work in single molecule SERS and the translation of that effort to ångstrom-scale spatial resolution in ultrahigh vacuum tip-enhanced Raman spectroscopy (UHV-TERS) and single molecule electrochemistry using electrochemical (EC)-TERS will be presented. Finally, we provide an overview of analytical SERS with our viewpoints on SERS substrates, approaches to address the analyte generality problem ( i.e. target molecules that do not spontaneously adsorb and/or have Raman cross sections <10 -29 cm 2 sr -1 ), SERS for catalysis, and deep UV-SERS.

Chemistry↗