Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING NETWORK”

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 1,063 records · Page 59

Constraining chaos: Enforcing dynamical invariants in the training of reservoir computers

Drawing on ergodic theory, we introduce a novel training method for machine learning based forecasting methods for chaotic dynamical systems. The training enforces dynamical invariants—such as the Lyapunov exponent spectrum and the fractal dimension—in the systems of interest, enabling longer and more stable forecasts when operating with limited data. The technique is demonstrated in detail using reservoir computing, a specific kind of recurrent neural network. Finally, results are given for the Lorenz 1996 chaotic dynamical system and a spectral quasi-geostrophic model of the atmosphere, both typical test cases for numerical weather prediction.

97 MATHEMATICS AND COMPUTING↗

Contrasting advantages of learning with random weights and backpropagation in non-volatile memory neural networks

Recently, a Cambrian explosion of novel, non-volatile memory (NVM) devices known as memristive devices have inspired effort in building hardware neural networks that learn like the brain. Early experimental prototypes built simple perceptrons from nanosynapses, and recently, fully-connected multi-layer perceptron (MLP) learning systems have been realized. However, while backpropagating learning systems pair well with high-precision computer memories and achieve state-of-the-art performances, this typically comes with a massive energy budget. For future Internet of Things/peripheral use cases, system energy footprint will be a major constraint, and emerging NVM devices may fill the gap by sacrificing high bit precision for lower energy. In this work, we contrast the well known MLP approach with the Extreme Learning Machine (ELM) or NoProp approach, which uses a large layer of random weights to improve the separability of high-dimensional tasks, and is usually considered inferior in a software context. However, we find that when taking device non-linearity into account, NoProp manages to equal hardware MLP system in terms of accuracy. While also using a sign-based adaptation of the delta rule for energy-savings, we find that NoProp can learn effectively with four to six ’bits’ of device analog capacity, while MLP requires eight bit capacity with the same rule. This may allow the requirements for memristive devices to be relaxed in the context of online learning. By comparing the energy footprint of these systems for several candidate nanosynapses, as well as realistic peripherals, we confirm that memristive NoProp systems save energy compared to MLP systems. Lastly, we show that ELM/NoProp systems can achieve better generalization abilities than nanosynaptic MLP systems when paired with pre-processing layers (which do not require backpropagated error). Collectively, these advantages make such systems worthy of consideration in future accelerators or embedded hardware.

97 MATHEMATICS AND COMPUTING↗

Learning-based Computational Study of the Thermodynamic, Structural, and Dynamic Properties of Molten Salt at the Atomic and Electronic Scale and Experimental Validations (Final Report for Project 19-16909)

The project completed several milestones related to the work scope to determine thermophysical properties of the molten salt FLiNaK. A combined approach to integrate advanced computations with neutron scattering experimental interrogation was used to quantify the structure and mass transport of pure FLiNaK and FLiNaK with additives. The additives investigated included Ce, Cs, Zr, and Cr. The primary outcome of the computational work was the development of a neutral network force field interatomic potential (referred to as the NNFF model in this document). The computational work also involved ab initio calculations to determine the ground truth and molecular dynamics simulations to provide computational analogs to the experimental campaign. The experimental work used enriched F 7 LiNaK prepared by Argonne National Laboratory. The use of enriched F 7 LiNaK reduced parasitic neutron absorption and significantly improved data collection and data quality. Several graduate students were supported during the course of the project, which included a one year no-cost extension. These students were trained in advanced computational methods, advanced neutron scattering methods, neutron scattering data analysis and interpretation, and molten salt sample preparation.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Accelerating discrete dislocation dynamics simulations with graph neural networks

Discrete dislocation dynamics (DDD) is a widely employed computational method to study plasticity at the mesoscale that connects the motion of dislocation lines to the macroscopic response of crystalline materials. However, the computational cost of DDD simulations remains a bottleneck that limits its range of applicability. Here, we introduce a new DDD-GNN framework in which the expensive time-integration of dislocation motion is entirely substituted by a graph neural network (GNN) model trained on DDD trajectories. As a first application, we demonstrate the feasibility and potential of our method on a simple yet relevant model of a dislocation line gliding through an array of obstacles. We show that the DDD-GNN model is stable and reproduces very well unseen ground-truth DDD simulation responses for a range of straining rates and obstacle densities, without the need to explicitly compute nodal forces or dislocation mobilities during time-integration. Our approach opens new promising avenues to accelerate DDD simulations and to incorporate more complex dislocation motion behaviors.

36 MATERIALS SCIENCE↗

Exponential Escape Rate of Filamentary Incubation in Mott Spiking Neurons

Mott materials such as vanadium oxides, when subject to a strong applied voltage, present an inhomogeneous insulator-to-metal transition with formation of metallic filaments within the insulating bulk. This property is enabling the development of compact and power-efficient neuromorphic devices known as Mott neurons. However, the nature of the transition has not been fully understood yet, as it may be attributed to different effects, including Joule self-heating and hot-carrier injection. Moreover, the experimental determination of the threshold voltage needed to induce the transition has proven to be challenging, as the transition becomes increasingly unpredictable when the threshold is approached. The physical understanding of these issues would not only deepen our understanding of Mott insulators, but would also be an important step toward the realization of neuromorphic devices based on such materials. In this work we use numerical simulations based on the Mott resistor network model to study the nature of the filament incubation and formation process. Here, we show that both electronic and thermal effects, in the form of current density focusing and Joule self-heating, respectively, contribute to the filamentary incubation and growth. Remarkably, we find that the percolation of the metallic filaments near the threshold is intrinsically stochastic, qualitatively similar to the familiar Arrhenius activated behavior and to the stochastic firing of biological neurons. More precisely, we characterize the filament percolation as a Poisson point process, which has the same probability distribution as mathematical models of neuronal firing with an exponential escape rate. Finally, we support the numerical simulation results by performing experiments in VO 2 that are in agreement with the exponential escape rate behavior. Thus, we establish a functionality of Mott insulators that opens a path toward implementing neuromorphic hardware with quantum materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Estimation of RTT and Loss Rate of Wide-Area Connections Using MPI Measurements

Scientific computations are expected to be increasingly distributed across wide-area networks, and the Message Passing Interface (MPI) has been shown to scale to support their communications over long distances. These computations should account for certain network parameters to ensure an effective execution, for example, by avoiding highly congested and long connections. The execution times of MPI basic operations reflect the connection parameters, including the Round Trip Time (RTT) and loss rate. We describe five machine leaning methods to estimate the connection RTT and loss rate using execution times of MPI basic operations. We utilize execution time measurements of MPI Sendrecv operations collected over emulated 10 Gbps connections with 0-366 ms round-trip times, wherein the longest connection spans the globe, under up to 20% periodic losses. These methods provide disparate, namely, linear and non-linear, and smooth and non-smooth, estimates of RTT and loss rate. Our results show that accurate estimates can be generated at low loss rates but they become inaccurate at loss rates 10% and higher. Overall, these results constitute a case study of the strengths and limitations of machine learning methods in inferring network-level parameters using application-level measurements.

Rao, Nageswara S.↗

Multiphysics Degradation Modeling of Energy Storage Materials via RKPM with a Neural Network-Enhancement

In energy storage materials, strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking during charge/discharge cycling, resulting in reduced performance and service life. A coupled electro-chemo-mechanical reproducing kernel particle method (RKPM) formulation is developed, and a patch-test is formulated to certify optimal convergence of the proposed RKPM method for the coupled physics system. With microstructural images supplied by the National Renewable Energy Laboratory (NREL), pixel-based model construction by RKPM is then used to represent the complex material microstructures for modeling the coupled physics of these systems. Further, a neural network-enhanced reproducing kernel particle method (NN-RKPM) [1, 2] is introduced to effectively model damage and crack propagation in the material microstructures; the location, orientation, and solution transition near a localization are automatically captured by superimposed block-level NN optimizations. This NN enrichment approach allows for effective modeling of localizations via a fixed background discretization, relieving tedious efforts for adaptive refinement in traditional mesh-based methods. Applications to the heterogeneous microstructures of Li-ion battery cathodes will be presented to demonstrate the effectiveness of the proposed methods. Reference: [1] Baek, J., Chen, J. S., Susuki, K., "Neural Network enhanced Reproducing Kernel Particle Method for Modeling Localizations," International Journal for Numerical Methods in Engineering, Vol. 123, pp 4422-4454, https://doi.org/10.1002/nme.7040, 2022. [2] Baek, J., Chen, J. S., "A Neural Network-Based Enrichment of Reproducing Kernel Approximation for Modeling Brittle Fracture", Computer Methods in Applied Mechanics and Engineering Vol. 410, 116590, 2024.

electro-chemo-mechanical coupling↗

eBPF Community ID Calculation

The code titled “eBPF Community ID Calculation” allows easy correlation of monitoring logs with existing network forensics logs on high-performance computing (HPC) systems. This code implements the Community ID Flow Hashing standard to calculate community ID Flow identifiers. These identifiers will be used to correlate host forensics logs with network forensics logs. The correlation provides valuable insight and the ability to easily pivot between disparate data sources. The computer code removes the libpcap dependency from the code base.

Maerz, StefanA↗

A case study evaluating the portability of an executable computable phenotype algorithm across multiple institutions and electronic health record environments

Abstract Electronic health record (EHR) algorithms for defining patient cohorts are commonly shared as free-text descriptions that require human intervention both to interpret and implement. We developed the Phenotype Execution and Modeling Architecture (PhEMA, http://projectphema.org) to author and execute standardized computable phenotype algorithms. With PhEMA, we converted an algorithm for benign prostatic hyperplasia, developed for the electronic Medical Records and Genomics network (eMERGE), into a standards-based computable format. Eight sites (7 within eMERGE) received the computable algorithm, and 6 successfully executed it against local data warehouses and/or i2b2 instances. Blinded random chart review of cases selected by the computable algorithm shows PPV ≥90%, and 3 out of 5 sites had >90% overlap of selected cases when comparing the computable algorithm to their original eMERGE implementation. This case study demonstrates potential use of PhEMA computable representations to automate phenotyping across different EHR systems, but also highlights some ongoing challenges.

Pacheco, Jennifer A.↗

Scaling Wind Power Innovation Assessment for Rapid Energy Transition with Artificial Intelligence

Planning for energy system decarbonization requires new insights into the potential of renewable technologies, deployed at unprecedented scale, to meet urgent sustainability goals. However, limited scalability of current wind energy research tools restricts characterization of innovation impacts to isolated reference sites, challenging investment and decision making under rapid growth. We demonstrate the transformative potential of artificial intelligence (AI) to inform future technology advancement and energy systems design by leveraging a state-of-the-art surrogate model to conduct a series of fleet-wide wind plant layout optimizations for greater than 6,800 projected U.S. onshore buildout locations. We show how innovative wake steering technology can address an array of barriers to large-scale deployment and integration of wind power. Specifically, wake steering reduces required plant area by an average of 18% and could preserve upwards of 13,000 km2 for future greenfield deployment, potentially easing siting challenges associated with wind energy infrastructure. Further, by enabling reduced turbine spacing and increased energy production, flexible operations of wake steering improve levelized cost of energy, particularly for large plants and in land-constrained settings. Finally, optimizations that consider dynamic energy prices can deliver increased power production and revenue capture during high-value (often low-wind) periods, further bolstering plant economics. Our computationally efficient approach offers a pathway to accelerate nationwide geographic evaluation of innovative technologies.

graph neural networks↗

Fast, High-fidelity Lyα Forests with Convolutional Neural Networks

Full-physics cosmological simulations are powerful tools for studying the formation and evolution of structure in the universe but require extreme computational resources. Here, we train a convolutional neural network to use a cheaper N-body-only simulation to reconstruct the baryon hydrodynamic variables (density, temperature, and velocity) on scales relevant to the Lyα forest, using data from Nyx simulations. We show that our method enables rapid estimation of these fields at a resolution of ~20 kpc, and captures the statistics of the Lyα forest with much greater accuracy than existing approximations. Because our model is fully convolutional, we can train on smaller simulation boxes and deploy on much larger ones, enabling substantial computational savings. Furthermore, as our method produces an approximation for the hydrodynamic fields instead of Lyα flux directly, it is not limited to a particular choice of ionizing background or mean transmitted flux.

79 ASTRONOMY AND ASTROPHYSICS↗

Sentinel

Network intrusion detection systems (NIDS) are commonplace in network security but they frequently employ algorithms that are computational demanding requiring hardware and software with significant power requirements. Two examples of such resource-intensive algorithms used for network security are regular expression matching and broader signature pattern matching which are commonly used in deep packet inspection (DPI). Network security algorithms that have large power requirements may be a challenge for low-power internet-of-things (IoT) environments, which generally lack the power resources to implement complex security measures like computationally expensive DPI at the edge. Furthermore, IoT environments incorporating 5G standalone networks have network latency constraints beyond just power that make DPI at the edge even more difficult. Programmable logic is ideally suited for machine learning inference for DPI because of its deep instruction level parallelism and single-cycle memory access. Machine learning approaches for DPI have been explored before using the programmable logic of field programmable gate arrays (FPGA) as a potential solution for NIDS approaches that would be power-suitable for IoT. However, those previous programmable logic NIDS approaches utilize either a supervised or unsupervised learning model. Sentinel utilizes the ensemble of these two machine learning approaches known as a semi-supervised approach which has shown promise in NIDS implementations. Sentinel provides a programmable logic implementation of a semi-supervised approach for DPI which operates at much lower power and latency than a GPU implementation with negligible loss of accuracy due to quantization through a logistic regressor.

Anderson, MatthewW [Idaho National Laboratory (INL↗

Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks

We present a novel method for graph partitioning, based on reinforcement learning and graph convolutional neural networks. Our approach is to recursively partition coarser representations of a given graph. The neural network is implemented using SAGE graph convolution layers, and trained using an advantage actor critic (A2C) agent. We present two variants, one for finding an edge separator that minimizes the normalized cut or quotient cut, and one that finds a small vertex separator. The vertex separators are then used to construct a nested dissection ordering to permute a sparse matrix so that its triangular factorization will incur less fill-in. The partitioning quality is compared with partitions obtained using METIS and SCOTCH, and the nested dissection ordering is evaluated in the sparse solver SuperLU. Our results show that the proposed method achieves similar partitioning quality as METIS and SCOTCH. Furthermore, the method generalizes across different classes of graphs, and works well on a variety of graphs from the SuiteSparse sparse matrix collection.

97 MATHEMATICS AND COMPUTING↗

Spatiotemporal analysis of 3D human iPSC-derived neural networks using a 3D multi-electrode array

While there is a growing appreciation of three-dimensional (3D) neural tissues (i.e., hydrogel-based, organoids, and spheroids), shown to improve cellular health and network activity to mirror brain-like activity in vivo , functional assessment using current electrophysiology techniques (e.g., planar multi-electrode arrays or patch clamp) has been technically challenging and limited to surface measurements at the bottom or top of the 3D tissue. As next-generation MEAs, specifically 3D MEAs, are being developed to increase the spatial precision across all three dimensions (X, Y, Z), development of improved computational analytical tools to discern region-specific changes within the Z dimension of the 3D tissue is needed. In the present study, we introduce a novel computational analytical pipeline to analyze 3D neural network activity recorded from a “bottom-up” 3D MEA integrated with a 3D hydrogel-based tissue containing human iPSC-derived neurons and primary astrocytes. Over a period of ~6.5 weeks, we describe the development and maturation of 3D neural activity (i.e., features of spiking and bursting activity) within cross sections of the 3D tissue, based on the vertical position of the electrode on the 3D MEA probe, in addition to network activity (identified using synchrony analysis) within and between cross sections. Then, using the sequential addition of postsynaptic receptor antagonists, bicuculline (BIC), 2-amino-5-phosphonovaleric acid (AP-5), and 6-cyano-5-nitroquinoxaline-2,3-dione (CNQX), we demonstrate that networks within and between cross sections of the 3D hydrogel-based tissue show a preference for GABA and/or glutamate synaptic transmission, suggesting differences in the network composition throughout the neural tissue. The ability to monitor the functional dynamics of the entire 3D reconstructed neural tissue is a critical bottleneck; here we demonstrate a computational pipeline that can be implemented in studies to better interpret network activity within an engineered 3D neural tissue and have a better understanding of the modeled organ tissue.

3D culture↗

Parallel programming of an ionic floating-gate memory array for scalable neuromorphic computing

Neuromorphic computers could overcome efficiency bottlenecks inherent to conventional computing through parallel programming and readout of artificial neural network weights in a crossbar memory array. However, selective and linear weight updates and <10-nanoampere read currents are required for learning that surpasses conventional computing efficiency. We introduce an ionic floating-gate memory array based on a polymer redox transistor connected to a conductive-bridge memory (CBM). Selective and linear programming of a redox transistor array is executed in parallel by overcoming the bridging threshold voltage of the CBMs. Synaptic weight readout with currents <10 nanoamperes is achieved by diluting the conductive polymer with an insulator to decrease the conductance. The redox transistors endure >1 billion write-read operations and support >1-megahertz write-read frequencies.

bio-inspired, energy storage (including batteries ↗

Malcolm slides for NSPA workshop

Summary of Malcolm, an INL open source project dealing with network traffic analysis. History and overview of the project. All information is open source and is already publicly available on the IdahoLab GitHub page.

97 MATHEMATICS AND COMPUTING↗