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 973 records · Page 54
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Complexity-calibrated benchmarks for machine learning reveal when prediction algorithms succeed and mislead

Abstract Recurrent neural networks are used to forecast time series in finance, climate, language, and from many other domains. Reservoir computers are a particularly easily trainable form of recurrent neural network. Recently, a “next-generation” reservoir computer was introduced in which the memory trace involves only a finite number of previous symbols. We explore the inherent limitations of finite-past memory traces in this intriguing proposal. A lower bound from Fano’s inequality shows that, on highly non-Markovian processes generated by large probabilistic state machines, next-generation reservoir computers with reasonably long memory traces have an error probability that is at least $$\sim 60\%$$ ∼ 60 % higher than the minimal attainable error probability in predicting the next observation. More generally, it appears that popular recurrent neural networks fall far short of optimally predicting such complex processes. These results highlight the need for a new generation of optimized recurrent neural network architectures. Alongside this finding, we present concentration-of-measure results for randomly-generated but complex processes. One conclusion is that large probabilistic state machines—specifically, large $$\epsilon$$ ϵ -machines—are key to generating challenging and structurally-unbiased stimuli for ground-truthing recurrent neural network architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Improved pore network models to simulate single-phase flow in porous media by coupling with lattice Boltzmann method

In this paper, different pore network models to simulate single-phase flow in porous media are built and their accuracy is evaluated. In addition to the conventional pore network model (CPNM) which consists of regular pore bodies and throat bonds, three improved pore network models (IPNMs) are developed allowing to better describing the real pore and throat geometry. The first improved pore network model (IPNM1) replaces the regular throat bond with a throat bond showing the real throat cross section. The second improvement (IPNM2) uses a series of sub-throat bonds with varying cross sections to better describe the real throat geometry, which is firstly proposed in this paper. The third model (IPNM3) extracts the real pore-throat-pore geometry without simplification. The conductance of fluid flow through these more realistic throat bonds is calculated by the lattice Boltzmann method (LBM). The accuracy and computational efficiency of the different pore network models are evaluated taking the LBM simulation over the whole porous medium as reference solution. The global permeability and detailed pressure distributions in the pores for the different pore network models are validated. The results show that the accuracy of the pore network model increases from CPNM to IPNM3, but at the expense of increasing computational cost. This study suggests that IPNM3 can replace a whole-domain LBM simulation with similar accuracy but much lower computational cost. As a first-order approximation the newly proposed IPNM2 is suggested as good compromise between accuracy and computational cost.

42 ENGINEERING↗
DOE OSTI2022

CrossSim Inference Manual v2.0

Neural networks are largely based on matrix computations. During forward inference, the most heavily used compute kernel is the matrix-vector multiplication (MVM): $W \vec{x} $. Inference is a first frontier for the deployment of next-generation hardware for neural network applications, as it is more readily deployed in edge devices, such as mobile devices or embedded processors with size, weight, and power constraints. Inference is also easier to implement in analog systems than training, which has more stringent device requirements. The main processing kernel used during inference is the MVM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Reduced-order modeling of advection-dominated systems with recurrent neural networks and convolutional autoencoders

A common strategy for the dimensionality reduction of nonlinear partial differential equations (PDEs) relies on the use of the proper orthogonal decomposition (POD) to identify a reduced subspace and the Galerkin projection for evolving dynamics in this reduced space. However, advection-dominated PDEs are represented poorly by this methodology since the process of truncation discards important interactions between higher-order modes during time evolution. In this study, we demonstrate that encoding using convolutional autoencoders (CAEs) followed by a reduced-space time evolution by recurrent neural networks overcomes this limitation effectively. We demonstrate that a truncated system of only two latent space dimensions can reproduce a sharp advecting shock profile for the viscous Burgers equation with very low viscosities, and a six-dimensional latent space can recreate the evolution of the inviscid shallow water equations. Additionally, the proposed framework is extended to a parametric reduced-order model by directly embedding parametric information into the latent space to detect trends in system evolution. Furthermore, our results show that these advection-dominated systems are more amenable to low-dimensional encoding and time evolution by a CAE and recurrent neural network combination than the POD-Galerkin technique.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Workshop on Incomplete Network Data Held at Sandia National Labs – Livermore

While network analysis is applied in a broad variety of scientific fields (including physics, computer science, biology, and the social sciences), how networks are constructed and the resulting bias and incompleteness have drawn more limited attention. For example, in biology, gene networks are typically developed via experiment -- many actual interactions are likely yet to be discovered. In addition to this incompleteness, the data-collection processes can introduce significant bias into the observed network datasets. For instance, if you observe part of the World Wide Web network through a classic random walk, then high degree nodes are more likely to be found than if you had selected nodes at random. Unfortunately, such incomplete and biasing data collection methods must be often used.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Scalable multiscale modeling of platelets with 100 million particles

Here, we developed the core components of the AI-aided multiple time stepping algorithm for multiscale modeling of cell dynamics. This algorithm was implemented and analyzed on two supercomputer architectures with an application of simulating the aggregation of 250 platelets, or 102 million particles. To scale on these computers with complex memory and network architectures with GPUs, we devised a biomechanics-informed task mapping scheme to optimize load imbalance, communications, and memory utilization. Our simulations, scaling well up to 192 nodes on a Summit-like supercomputer with a peak speed of 11 petaflops, achieved a rate of 423 μs/day which is 500 times faster than the conventional algorithm using static time step and this has enabled studies of record size blood clots at record spatial–temporal resolutions. Additionally, we discovered the sensitive dependence of the scalability and execution time on the methods of decomposition, CPU–GPU coupling, and task mapping.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Speeding up and reducing memory usage for scientific machine learning via mixed precision

Scientific machine learning (SciML) has emerged as a versatile approach to address complex computational science and engineering problems. Within this field, physics-informed neural networks (PINNs) and deep operator networks (DeepONets) stand out as the leading techniques for solving partial differential equations by incorporating both physical equations and experimental data. However, training PINNs and DeepONets require significant computational resources, including long computational times and large amounts of memory. In search of computational efficiency, training neural networks using half precision (float16) rather than the conventional single (float32) or double (float64) precision has gained substantial interest, given the inherent benefits of reduced computational time and memory consumed. However, we find that float16 cannot be applied to SciML methods, because of gradient divergence at the start of training, weight updates going to zero, and the inability to converge to a local minima. To overcome these limitations, we explore mixed precision, which is an approach that combines the float16 and float32 numerical formats to reduce memory usage and increase computational speed. Our experiments showcase that mixed precision training not only substantially decreases training times and memory demands but also maintains model accuracy. Here, we also reinforce our empirical observations with a theoretical analysis. The research has broad implications for SciML in various computational applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

On a theory of stability for nonlinear stochastic chemical reaction networks

We present elements of a stability theory for small, stochastic, nonlinear chemical reaction networks. Steady state probability distributions are computed with zero-information (ZI) closure, a closure algorithm that solves chemical master equations of small arbitrary nonlinear reactions. Stochastic models can be linearized around the steady state with ZI-closure, and the eigenvalues of the Jacobian matrix can be readily computed. Eigenvalues govern the relaxation of fluctuation autocorrelation functions at steady state. Autocorrelation functions reveal the time scales of phenomena underlying the dynamics of nonlinear reaction networks. In accord with the fluctuation-dissipation theorem, these functions are found to be congruent to response functions to small perturbations. Significant differences are observed in the stability of nonlinear reacting systems between deterministic and stochastic modeling formalisms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

A Multi-scale Computational Platform to Mechanistically Assess the Effect of Genetic Variation on Drug Responses in Human Erythrocyte Metabolism

Progress in systems medicine brings promise to addressing patient heterogeneity and individualized therapies. Recently, genome-scale models of metabolism have been shown to provide insight into the mechanistic link between drug therapies and systems-level off-target effects while being expanded to explicitly include the three-dimensional structure of proteins. The integration of these molecular-level details, such as the physical, structural, and dynamical properties of proteins, notably expands the computational description of biochemical network-level properties and the possibility of understanding and predicting whole cell phenotypes. In this study, we present a multi-scale modeling framework that describes biological processes which range in scale from atomistic details to an entire metabolic network. Using this approach, we can understand how genetic variation, which impacts the structure and reactivity of a protein, influences both native and drug-induced metabolic states. As a proof-of-concept, we study three enzymes (catechol-O-methyltransferase, glucose-6-phosphate dehydrogenase, and glyceraldehyde-3-phosphate dehydrogenase) and their respective genetic variants which have clinically relevant associations. Using all-atom molecular dynamic simulations enables the sampling of long timescale conformational dynamics of the proteins (and their mutant variants) in complex with their respective native metabolites or drug molecules. We find that changes in a protein’s structure due to a mutation influences protein binding affinity to metabolites and/or drug molecules, and inflicts large-scale changes in metabolism

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

What do physics-informed DeepONets learn? Understanding and improving training for scientific computing applications

Physics-informed deep operator networks (DeepONets) have emerged as a promising approach toward numerically approximating the solution of partial differential equations (PDEs). In this work, we aim to develop further understanding of what is being learned by physics-informed DeepONets by assessing the universality of the extracted basis functions and demonstrating their potential toward model reduction with spectral methods. Results provide clarity about measuring the performance of a physics-informed DeepONet through the decays of singular values and expansion coefficients. In addition, we propose a transfer learning approach for improving training for physics-informed DeepONets between parameters of the same PDE as well as across different, but related, PDEs where these models struggle to train well. This approach results in significant error reduction and learned basis functions that are more effective in representing the solution of a PDE.

Deep operator networks↗
DOE OSTI2023

A Systematic Study to Determine 5G Baseline Performance for Scientific Computing

The fifth-generation (5G) cellular networks envisions achieving higher data rates, improved connectivity, reduced latency, and better quality of service (QoS) than the fourthgeneration (4G) cellular networks. Such improved performance can be utilized to address the challenges in applications such as electricity generation in power systems. The traditional power grids responsible for electricity generation suffer from drawbacks such as life-threatening blackout crises, and energy storage proliferation as they are not robust to extreme climatic conditions. A recent study proposed the idea of extending the capabilities of advanced wireless technologies such as the current 5G to develop a robust, energy-efficient, and secure smart grids. However there are two main challenges associated with the integration of power systems and wireless technologies. First, it is imperative to understand the architecture and the enabling technologies of 5G to ensure that the performance requirements of the smart grids are met. Second, an end-to-end testbed is required to determine if the performance requirements are met by estimating the 5G characteristics such as latency, and throughput. Our proposed alleviates the aforementioned concerns in the following manner. To begin with, a systematic study of the 5G architecture including both the StandAlone (SA) and Non-Standalone (NSA) operations is presented. Furthermore, a detailed survey of the possible 5G enabling technologies is elicited. In addition to these, an end-toend testbed that can estimate the 5G characteristics is explained in detail with appropriate preliminary results.

5G, 5G Communication↗
DOE OSTI2024

Accelerate microstructure evolution simulation using graph neural networks with adaptive spatiotemporal resolution

Abstract Surrogate models driven by sizeable datasets and scientific machine-learning methods have emerged as an attractive microstructure simulation tool with the potential to deliver predictive microstructure evolution dynamics with huge savings in computational costs. Taking 2D and 3D grain growth simulations as an example, we present a completely overhauled computational framework based on graph neural networks with not only excellent agreement to both the ground truth phase-field methods and theoretical predictions, but enhanced accuracy and efficiency compared to previous works based on convolutional neural networks. These improvements can be attributed to the graph representation, both improved predictive power and a more flexible data structure amenable to adaptive mesh refinement. As the simulated microstructures coarsen, our method can adaptively adopt remeshed grids and larger timesteps to achieve further speedup. The data-to-model pipeline with training procedures together with the source codes are provided.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Semantic segmentation with a sparse convolutional neural network for event reconstruction in MicroBooNE

We present the performance of a semantic segmentation network, SparseSSNet, that provides pixel-level classification of MicroBooNE data. The MicroBooNE experiment employs a liquid argon time projection chamber for the study of neutrino properties and interactions. SparseSSNet is a submanifold sparse convolutional neural network, which provides the initial machine learning based algorithm utilized in one of MicroBooNE's ν e -appearance oscillation analyses. The network is trained to categorize pixels into five classes, which are re-classified into two classes more relevant to the current analysis. The output of SparseSSNet is a key input in further analysis steps. This technique, used for the first time in liquid argon time projection chambers data and is an improvement compared to a previously used convolutional neural network, both in accuracy and computing resource utilization. Here, the accuracy achieved on the test sample is ≥ 99%. For full neutrino interaction simulations, the time for processing one image is ≈ 0.5 sec, the memory usage is at 1 GB level, which allows utilization of most typical CPU worker machine.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

Thermal modeling of directed energy deposition additive manufacturing using graph theory

Purpose: The purpose of this paper is to develop, apply and validate a mesh-free graph theory–based approach for rapid thermal modeling of the directed energy deposition (DED) additive manufacturing (AM) process. Design/methodology/approach: Here, the authors develop a novel mesh-free graph theory–based approach to predict the thermal history of the DED process. Subsequently, the authors validated the graph theory predicted temperature trends using experimental temperature data for DED of titanium alloy parts (Ti-6Al-4V). Temperature trends were tracked by embedding thermocouples in the substrate. The DED process was simulated using the graph theory approach, and the thermal history predictions were validated based on the data from the thermocouples. Findings: The temperature trends predicted by the graph theory approach have mean absolute percentage error of approximately 11% and root mean square error of 23°C when compared to the experimental data. Moreover, the graph theory simulation was obtained within 4 min using desktop computing resources, which is less than the build time of 25 min. By comparison, a finite element–based model required 136 min to converge to similar level of error. Research limitations/implications: This study uses data from fixed thermocouples when printing thin-wall DED parts. In the future, the authors will incorporate infrared thermal camera data from large parts. Practical implications: The DED process is particularly valuable for near-net shape manufacturing, repair and remanufacturing applications. However, DED parts are often afflicted with flaws, such as cracking and distortion. In DED, flaw formation is largely governed by the intensity and spatial distribution of heat in the part during the process, often referred to as the thermal history. Accordingly, fast and accurate thermal models to predict the thermal history are necessary to understand and preclude flaw formation. Originality/value: This paper presents a new mesh-free computational thermal modeling approach based on graph theory (network science) and applies it to DED. The approach eschews the tedious and computationally demanding meshing aspect of finite element modeling and allows rapid simulation of the thermal history in additive manufacturing. Although the graph theory has been applied to thermal modeling of laser powder bed fusion (LPBF), there are distinct phenomenological differences between DED and LPBF that necessitate substantial modifications to the graph theory approach.

42 ENGINEERING↗
DOE OSTI2021

Quantum networks based on color centers in diamond

With the ability to transfer and process quantum information, large-scale quantum networks will enable a suite of fundamentally new applications, from quantum communications to distributed sensing, metrology, and computing. This Perspective reviews requirements for quantum network nodes and color centers in diamond as suitable node candidates. We give a brief overview of state-of-the-art quantum network experiments employing color centers in diamond and discuss future research directions, focusing, in particular, on the control and coherence of qubits that distribute and store entangled states, and on efficient spin–photon interfaces. We discuss a route toward large-scale integrated devices combining color centers in diamond with other photonic materials and give an outlook toward realistic future quantum network protocol implementations and applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Establishing capabilities for quantum computing and simulations for energy applications

Quantum information science (QIS) is creating potential transformative opportunities to exploit intricate quantum mechanical phenomena in new ways for obtaining and processing information to advance many areas of science and engineering. Since the National Quantum Initiative Act was signed into law in 2018, developing QIS capability and competency is one of the most urgent tasks of DOE to make sure the US win the quantum race. The QIS contains four pillars: quantum computing, quantum simulations, quantum sensing, and quantum networking. To apply QIS in energy related applications, the key is to develop the capability of quantum computing & simulation tools. In this project, we propose to develop the capability of quantum computing and simulations at NETL to target fossil energy related problems. We will install a simulator (e. g. IBM qiskit) on the NETL supercomputer to simulate the environments of quantum computer. Based on the current available quantum algorithms for quantum chemistry, we will develop quantum computing codes to perform simulation which will focus on fossil energy sector challenges, including CO2 capture & conversion, sensing, and fuel conversion. We then will seek opportunities to run our codes on real quantum computers (such as IBM-Q, google Sycamore, etc.). Through this project, the new capability of quantum computing and simulations will be established at NETL. In addition, the NETL workforce in this area will be trained ready to conduct more complicated tasks in line with NETL missions to enhance the nation’s energy foundation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Final Reports of the 2021 Los Alamos National Laboratory Computational Physics Student Summer Workshop

Since 2011, the Los Alamos National Laboratory Computational Physics Student Summer Workshop has been bringing together a highly talented and diverse group of students every summer. Students work in teams of two, alongside typically two mentors, on research projects reflecting a broad range of topics within computational physics. In addition, students attend a series of lectures on topics within computational physics, facility tours, and networking events. The program lasts ten weeks, with this year’s workshop running from June 7 to August 13. At the end of the summer, students give a final presentation, along with a written report. Those reports are what make up the remaining sections of this document. Admission to the workshop is by a competitive process, with the mentors forming the selection committee. One of the important accomplishments of the workshop has been to create a student pipeline from diverse schools that sometimes are not normally tapped by LANL recruiting. Many workshop students maintain a continuing relationship with LANL, returning as student interns, post-doctoral researchers, and staff members. Additionally, workshop alumni act as ambassadors for LANL. The result is a wider awareness both of LANL as a potential employer, and of the technical work that happens at LANL. This year, the workshop was once again in an off-site, virtual format. Students worked on LANL virtual desktop systems remotely, also accessing LANL HPC resources. In order to facilitate communication, student were given accounts on both Webex, a video teleconferencing platform, and Mattermost, an online team collaboration and chat platform, similar to Slack. Daily communication between students and mentors was primarily on Mattermost, with Webex conferencing as needed. The lectures were all done on Webex. Given the difficulty of the virtual format, and a concern that students might have video teleconferencing burn-out, all lectures were optional this year. In spite of this, the attendance was generally high. Lecturers were asked to try to move to a more high-level, ”What is it?,” format. Once again, the students did a tremendous job. Over the course of ten weeks, they did important research across a staggering array of disciplines. The following pages contain the final report for each team’s research efforts. Enjoy!

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗