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 55 records · Page 3

Isoflurane induced cognitive impairment in aged rats through hippocampal calcineurin/NFAT signaling

Calcineurin (CaN) over-activation constrains synaptic plasticity and memory formation. Upon CaN activation, NFAT imports into the nucleus and guides its downstream genes, which also affect neuronal and synaptic function. Aberrant CaN/NFAT signaling involves in neurotoxicity and cognitive impairment in neurological disorders such as Alzheimer's disease, but its role in postoperative cognitive dysfunction (POCD) remains uninvestigated. Inhaled anesthetic isoflurane facilitates the development of POCD, and the present study investigated the role of CaN/NFAT signaling in isoflurane induced cognitive impairment of aged rats, and the therapeutic effects of CaN inhibitor cyclosporine A (CsA). The results indicated that hippocampal CaN activity increased and peaked at 6 h after isoflurane exposure, and NFAT, especially NFATc4, imported into the nucleus following CaN activation. Furthermore, phamacological inhibition of CaN by CsA markedly attenuated isoflurane induced aberrant CaN/NFATc4 signaling in the hippocampus, and rescued relevant spatial learning and memory impairment of aged rats. Overall, the study suggests hippocampal CaN/NFAT signaling as the upstream mechanism of isoflurane induced cognitive impairment, and provides potential therapeutic target and possible treatment methods for POCD. - Highlights: • Isoflurane induces hippocampal calcineurin activation. • Isoflurane induces hippocampal NFAT, especially NFATc4, nuclear import. • Cyclosporine A attenuates isoflurane induced aberrant calcineurin/NFAT signaling. • Cyclosporine A rescues isoflurane induced cognitive impairment. • Calcineurin/NFAT signaling is the upstream mechanism of isoflurane induced synaptic dysfunction and cognitive impairment.

60 APPLIED LIFE SCIENCES↗

Voltage switching of a VO{sub 2} memory metasurface using ionic gel

We demonstrate an electrolyte-based voltage tunable vanadium dioxide (VO{sub 2}) memory metasurface. Large spatial scale, low voltage, non-volatile switching of terahertz (THz) metasurface resonances is achieved through voltage application using an ionic gel to drive the insulator-to-metal transition in an underlying VO{sub 2} layer. Positive and negative voltage application can selectively tune the metasurface resonance into the “off” or “on” state by pushing the VO{sub 2} into a more conductive or insulating regime respectively. Compared to graphene based control devices, the relatively long saturation time of resonance modification in VO{sub 2} based devices suggests that this voltage-induced switching originates primarily from electrochemical effects related to oxygen migration across the electrolyte–VO{sub 2} interface.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Turbulence-induced relative velocity of dust particles. II. The bidisperse case

We extend our earlier work on turbulence-induced relative velocity between equal-size particles (Paper I, in this series) to particles of arbitrarily different sizes. The Pan and Padoan (PP10) model shows that the relative velocity between different particles has two contributions, named the generalized shear and acceleration terms, respectively. The generalized shear term represents the particles' memory of the spatial flow velocity difference across the particle distance in the past, while the acceleration term is associated with the temporal flow velocity difference on individual particle trajectories. Using the simulation of Paper I, we compute the root-mean-square relative velocity, (w {sup 2}){sup 1/2}, as a function of the friction times, τ{sub p1} and τ{sub p2}, of the two particles and show that the PP10 prediction is in satisfactory agreement with the data, confirming its physical picture. For a given τ{sub p1} below the Lagrangian correlation time of the flow, T{sub L}, (w {sup 2}){sup 1/2} as a function of τ{sub p2} shows a dip at τ{sub p2} ≅ τ{sub p1}, indicating tighter velocity correlation between similar particles. Defining a ratio f ≡ τ{sub p,{sub l}}/τ{sub p,{sub h}}, with τ{sub p,{sub l}} and τ{sub p,{sub h}} the friction times of the smaller and larger particles, we find that (w {sup 2}){sup 1/2} increases with decreasing f due to the generalized acceleration contribution, which dominates at f ≲ 1/4. At a fixed f, our model predicts that (w {sup 2}){sup 1/2} scales as τ{sub p,h}{sup 1/2} for τ{sub p,{sub h}} in the inertial range of the flow, stays roughly constant for T{sub L} ≲ τ{sub p,{sub h}} ≲ T{sub L}/f, and finally decreases as τ{sub p,h}{sup −1/2} for τ{sub p,{sub h}} >> T{sub L}/f. The acceleration term is independent of the particle distance, r, and reduces the r dependence of (w {sup 2}){sup 1/2} in the bidisperse case.

79 ASTRONOMY AND ASTROPHYSICS↗

Scaling Irregular Applications through Data Aggregation and Software Multithreading

Bioinformatics, data analytics, semantic databases, knowledge discovery are emerging high performance application areas that exploit dynamic, linked data structures such as graphs, unbalanced trees or unstructured grids. These data structures usually are very large, requiring significantly more memory than available on single shared memory systems. Additionally, these data structures are difficult to partition on distributed memory systems. They also present poor spatial and temporal locality, thus generating unpredictable memory and network accesses. The Partitioned Global Address Space (PGAS) programming model seems suitable for these applications, because it allows using a shared memory abstraction across distributed-memory clusters. However, current PGAS languages and libraries are built to target regular remote data accesses and block transfers. Furthermore, they usually rely on the Single Program Multiple Data (SPMD) parallel control model, which is not well suited to the fine grained, dynamic and unbalanced parallelism of irregular applications. In this paper we present {\bf GMT} (Global Memory and Threading library), a custom runtime library that enables efficient execution of irregular applications on commodity clusters. GMT integrates a PGAS data substrate with simple fork/join parallelism and provides automatic load balancing on a per node basis. It implements multi-level aggregation and lightweight multithreading to maximize memory and network bandwidth with fine-grained data accesses and tolerate long data access latencies. A key innovation in the GMT runtime is its thread specialization (workers, helpers and communication threads) that realize the overall functionality. We compare our approach with other PGAS models, such as UPC running using GASNet, and hand-optimized MPI code on a set of typical large-scale irregular applications, demonstrating speedups of an order of magnitude.

Aggregation↗

SU-F-BRD-09: A Random Walk Model Algorithm for Proton Dose Calculation

Purpose: To develop a random walk model algorithm for calculating proton dose with balanced computation burden and accuracy. Methods: Random walk (RW) model is sometimes referred to as a density Monte Carlo (MC) simulation. In MC proton dose calculation, the use of Gaussian angular distribution of protons due to multiple Coulomb scatter (MCS) is convenient, but in RW the use of Gaussian angular distribution requires an extremely large computation and memory. Thus, our RW model adopts spatial distribution from the angular one to accelerate the computation and to decrease the memory usage. From the physics and comparison with the MC simulations, we have determined and analytically expressed those critical variables affecting the dose accuracy in our RW model. Results: Besides those variables such as MCS, stopping power, energy spectrum after energy absorption etc., which have been extensively discussed in literature, the following variables were found to be critical in our RW model: (1) inverse squared law that can significantly reduce the computation burden and memory, (2) non-Gaussian spatial distribution after MCS, and (3) the mean direction of scatters at each voxel. In comparison to MC results, taken as reference, for a water phantom irradiated by mono-energetic proton beams from 75 MeV to 221.28 MeV, the gamma test pass rate was 100% for the 2%/2mm/10% criterion. For a highly heterogeneous phantom consisting of water embedded by a 10 cm cortical bone and a 10 cm lung in the Bragg peak region of the proton beam, the gamma test pass rate was greater than 98% for the 3%/3mm/10% criterion. Conclusion: We have determined key variables in our RW model for proton dose calculation. Compared with commercial pencil beam algorithms, our RW model much improves the dose accuracy in heterogeneous regions, and is about 10 times faster than MC simulations.

60 APPLIED LIFE SCIENCES↗

Electronic and thermal properties of the phase-change memory material, Ge 2 Sb 2 Te 5 , and results from spatially resolved transport calculations

Here, we report new insights into the electronic, structural, and transport (heat and charge) properties of the phase-change memory material amorphous Ge 2 Sb 2 Te 5 . Using realistic structural models of Konstantinou et al., (2019), we analyze the topology, electronic states, and lattice dynamics with density functional methods, including hybrid-functional calculations and machine-learned interatomic potentials. The Kohn–Sham orbitals near the Fermi level display a strong electron–phonon coupling, and exhibit large energy fluctuations at room temperature. The conduction tail states exhibit larger phonon-induced fluctuations than the valence tail states. To resolve transport at the atomic scale, we employ space-projected electronic conductivity and site-projected thermal conductivity methods. Local analysis of heat transport highlights the role of filamentary networks dominated by Te, with Sb and Ge making progressively smaller contributions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Multivariate and Multiscale Dependence in the Global Climate System Revealed Through Complex Networks

A systematic characterization of multivariate dependence at multiple spatio-temporal scales is critical to understanding climate system dynamics and improving predictive ability from models and data. However, dependence structures in climate are complex due to nonlinear dynamical generating processes, long-range spatial and long-memory temporal relationships, as well as low-frequency variability. Here we utilize complex networks to explore dependence in climate data. Specifically, networks constructed from reanalysis-based atmospheric variables over oceans and partitioned with community detection methods demonstrate the potential to capture regional and global dependence structures within and among climate variables. Proximity-based dependence as well as long-range spatial relationships are examined along with their evolution over time, yielding new insights on ocean meteorology. The tools are implicitly validated by confirming conceptual understanding about aggregate correlations and teleconnections. Our results also suggest a close similarity of observed dependence patterns in relative humidity and horizontal wind speed over oceans. In addition, updraft velocity, which relates to convective activity over the oceans, exhibits short spatiotemporal decorrelation scales but long-range dependence over time. The multivariate and multi-scale dependence patterns broadly persist over multiple time windows. Our findings motivate further investigations of dependence structures among observations, reanalysis and model-simulated data to enhance process understanding, assess model reliability and improve regional climate predictions.

54 ENVIRONMENTAL SCIENCES↗

Learning Temporal and Spatial Correlations Jointly: A Unified Framework for Wind Speed Prediction

Leveraging both temporal and spatial correlations to predict wind speed remains one of the most challenging and less studied areas of wind speed prediction. In this paper, the problem of predicting wind speeds for multiple sites is investigated by using the spatio-temporal correlation. We proposed a deep architecture termed predictive spatio-temporal network (PSTN), which is a unified framework integrating a convolutional neural network (CNN) and a long short-term memory (LSTM). Initially, the spatial features are extracted from the spatial wind speed matrices (SWSMs) by the CNN at the bottom of the model. Then, the LSTM captures the temporal dependencies among the spatial features extracted from contiguous time points. Lastly, the predicted wind speeds are given by the last state of the top layer of the LSTM, which are generated by using the spatial features and temporal dependencies. Though composed of two kinds of architectures, PSTN is trained with one loss function in an end-to-end (E2E) manner, which can learn temporal and spatial correlations jointly. Experiments for short-term predictions are conducted on real-world data, whose results demonstrate that PSTN outperforms prior methods.

42 ENGINEERING↗

Tag-Split Cache for Efficient GPGPU Cache Utilization

Modern GPUs employ cache to improve memory system efficiency. However, large amount of cache space is underutilized due to irregular memory accesses and poor spatial locality which exhibited commonly in GPU applications. Our experiments show that using smaller cache lines could improve cache space utilization, but it also frequently suffers from significant performance loss by introducing large amount of extra cache requests. In this work, we propose a novel cache design named tag-split cache (TSC) that enables fine-grained cache storage to address the problem of cache space underutilization while keeping memory request number unchanged. TSC divides tag into two parts to reduce storage overhead, and it supports multiple cache line replacement in one cycle.

performance and energy optimization↗

Memory access optimization for particle operations in computational fluid dynamics-discrete element method simulations

Computational Fluid Dynamics - Discrete Element Method is used to model gas-solid systems in several applications in energy, pharmaceutical and petrochemical industries. Computational performance bottlenecks often limit the problem sizes that can be simulated at industrial scale. The data structures used to store several millions of particles in such large-scale simulations have a large memory footprint that does not fit into the processor cache hierarchies on current high-performance-computing platforms, leading to reduced computational performance. This paper specifically addresses this aspect of memory access bottlenecks in industrial scale simulations. The use of space-filling curves to improve memory access patterns is described and their impact on computational performance is quantified in both shared and distributed memory parallelization paradigms. The Morton space filling curve applied to uniform grids and k-dimensional tree partitions are used to reorder the particle data-structure thus improving spatial and temporal locality in memory. The performance impact of these techniques when applied to two benchmark problems, namely the homogeneous-cooling-system and a fluidized-bed, are presented. We report these optimization techniques lead to approximately two-fold performance improvement in particle focused operations such as neighbor-list creation and data-exchange, with ~ 1.5 times overall improvement in a fluidization simulation with 1.27 million particles.

97 MATHEMATICS AND COMPUTING↗

A Binomial Stochastic Framework for Efficiently Modeling Discrete Statistics of Convective Populations

Abstract Understanding the coupling between convective clouds and the general circulation, as well as addressing the gray zone problem in convective parameterization, requires insight into the genesis and maintenance of spatial patterns in cumulus cloud populations. In this study, a simple toy model for recreating populations of interacting convective objects as distributed over a two‐dimensional Eulerian grid is formulated to this purpose. Key elements at the foundation of the model include i) a fully discrete formulation for capturing discrete behavior in convective properties at small population sample sizes, ii) object age‐dependence for representing life‐cycle effects, and iii) a prognostic number budget allowing for object interactions and co‐existence of multiple species. A primary goal is to optimize the computational efficiency of this system. To this purpose the object birth rate is represented stochastically through a spatially aware Bernoulli process. The same binomial stochastic operator is applied to horizontal advection of objects, conserving discreteness in object number. The applicability to atmospheric convection as well as behavior implied by the formulation is assessed. Various simple applications of the BiOMi model (Binomial Objects on Microgrids) are explored, suggesting that important convective behavior can be captured at low computational cost. This includes i) subsampling effects and associated powerlaw scaling in the convective gray zone, ii) stochastic predator‐prey behavior, iii) the downscale turbulent energy cascade, and iv) simple forms of spatial organization and convective memory. Consequences and opportunities for convective parameterization in next‐generation weather and climate models are discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable parallel distance field construction for large-scale applications

Computing distance fields is fundamental to many scientific and engineering applications. Distance fields can be used to direct analysis and reduce data. In this paper, we present a highly scalable method for computing 3D distance fields on massively parallel distributed-memory machines. Anew distributed spatial data structure, named parallel distance tree, is introduced to manage the level sets of data and facilitate surface tracking overtime, resulting in significantly reduced computation and communication costs for calculating the distance to the surface of interest from any spatial locations. Our method supports several data types and distance metrics from real-world applications. We demonstrate its efficiency and scalability on state-of-the-art supercomputers using both large-scale volume datasets and surface models. We also demonstrate in-situ distance field computation on dynamic turbulent flame surfaces for a petascale combustion simulation. In conclusion, our work greatly extends the usability of distance fields for demanding applications.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗