Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer networks.”

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,657 records · Page 92

Comprehensive Material Characterization and Simultaneous Model Calibration for Improved Computational Simulation Credibility

Computational simulation is increasingly relied upon for high-consequence engineering decisions, and a foundational element to solid mechanics simulations is a credible material model. Our ultimate vision is to interlace material characterization and model calibration in a real-time feedback loop, where the current model calibration results will drive the experiment to load regimes that add the most useful information to reduce parameter uncertainty. The current work investigated one key step to this Interlaced Characterization and Calibration (ICC) paradigm, using a finite load-path tree to incorporate history/path dependency of nonlinear material models into a network of surrogate models that replace computationally-expensive finite-element analyses. Our reference simulation was an elastoplastic material point subject to biaxial deformation with a Hill anisotropic yield criterion. Training data was generated using either a space-filling or adaptive sampling method, and surrogates were built using either Gaussian process or polynomial chaos expansion methods. Surrogate error was evaluated to be on the order of 10 ⁻5 and 10 ⁻3 percent for the space-filling and adaptive sampling training data, respectively. Direct Bayesian inference was performed with the surrogate network and with the reference material point simulator, and results agreed to within 3 significant figures for the mean parameter values, with a reduction in computational cost over 5 orders of magnitude. These results bought down risk regarding the surrogate network and facilitated a successful FY22-24 full LDRD proposal to research and develop the complete ICC paradigm.

36 MATERIALS SCIENCE↗

Multi-fidelity modeling to predict the rheological properties of a suspension of fibers using neural networks and Gaussian processes

Unveiling the rheological properties of fiber suspensions is of paramount interest to many industrial applications. There are multiple factors, such as fiber aspect ratio and volume fraction, that play a significant role in altering the rheological behavior of suspensions. Three-dimensional (3D) numerical simulations of coupled differential equations of the suspension of fibers are computationally expensive and time-consuming. Machine learning algorithms can be trained on the available data and make predictions for the cases where no numerical data are available. However, some widely used machine learning surrogates, such as neural networks, require a relatively large training dataset to produce accurate predictions. Multi-fidelity models, which combine high-fidelity data from numerical simulations and less expensive lower fidelity data from resources such as simplified constitutive equations, can pave the way for more accurate predictions. Here, we focus on neural networks and the Gaussian processes with two levels of fidelity, i.e., high and low fidelity networks, to predict the steady-state rheological properties, and compare them to the single-fidelity network. High-fidelity data are obtained from direct numerical simulations based on an immersed boundary method to couple the fluid and solid motion. The low-fidelity data are produced by using constitutive equations. Multiple neural networks and the Gaussian process structures are used for the hyperparameter tuning purpose. Results indicate that with the best choice of hyperparameters, both the multi-fidelity Gaussian processes and neural networks are capable of making predictions with a high level of accuracy with neural networks demonstrating marginally better performance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ASCR Science Network Requirements

The Energy Sciences Network (ESnet) is the primary provider of network connectivity for the US Department of Energy Office of Science, the single largest supporter of basic research in the physical sciences in the United States. In support of the Office of Science programs, ESnet regularly updates and refreshes its understanding of the networking requirements of the instruments, facilities, scientists, and science programs that it serves. This focus has helped ESnet to be a highly successful enabler of scientific discovery for over 20 years. In April 2009 ESnet and the Office of Advanced Scientific Computing Research (ASCR), of the DOE Office of Science, organized a workshop to characterize the networking requirements of the programs funded by ASCR. The ASCR facilities anticipate significant increases in wide area bandwidth utilization, driven largely by the increased capabilities of computational resources and the wide scope of collaboration that is a hallmark of modern science. Many scientists move data sets between facilities for analysis, and in some cases (for example the Earth System Grid and the Open Science Grid), data distribution is an essential component of the use of ASCR facilities by scientists. Due to the projected growth in wide area data transfer needs, the ASCR supercomputer centers all expect to deploy and use 100 Gigabit per second networking technology for wide area connectivity as soon as that deployment is financially feasible. In addition to the network connectivity that ESnet provides, the ESnet Collaboration Services (ECS) are critical to several science communities. ESnet identity and trust services, such as the DOEGrids certificate authority, are widely used both by the supercomputer centers and by collaborations such as Open Science Grid (OSG) and the Earth System Grid (ESG). Ease of use is a key determinant of the scientific utility of network-based services. Therefore, a key enabling aspect for scientists beneficial use of high performance networks is a consistent, widely deployed, well-maintained toolset that is optimized for wide area, high-speed data transfer (e.g. GridFTP) that allows scientists to easily utilize the services and capabilities that the network provides. Network test and measurement is an important part of ensuring that these tools and network services are functioning correctly. One example of a tool in this area is the recently developed perfSONAR, which has already shown its usefulness in fault diagnosis during the recent deployment of high-performance data movers at NERSC and ORNL. On the other hand, it is clear that there is significant work to be done in the area of authentication and access control - there are currently compatibility problems and differing requirements between the authentication systems in use at different facilities, and the policies and mechanisms in use at different facilities are sometimes in conflict. Finally, long-term software maintenance was of concern for many attendees. Scientists rely heavily on a large deployed base of software that does not have secure programmatic funding. Software packages for which this is true include data transfer tools such as GridFTP as well as identity management and other software infrastructure that forms a critical part of the Open Science Grid and the Earth System Grid.

97 MATHEMATICS AND COMPUTING↗

From IMT Device Measurements to Network-Level Consequences: When Learning Suppresses Beyond-LIF Neuron Dynamics

Emerging neuromorphic devices such as insulator--metal transition (IMT) devices exhibit complex temporal dynamics, including slow internal state memory, hysteresis, and burst-like firing, which are poorly captured by conventional leaky integrate-and-fire (LIF) neurons. However, it remains unclear when such dynamics influence learning and inference at the network level, particularly under commonly used unsupervised plasticity rules. We present a controlled, full-stack co-design study spanning experimental characterization of individual IMT devices, compact neuron model development, and large-scale spiking network simulations with identical architectures and learning rules. Rather than optimizing benchmark accuracy, our goal is to diagnose when neuron-level dynamics survive learning and competition, and when they are suppressed, to inform the co-design of devices, networks, and learning rules that can exploit beyond-LIF complexity.

42 ENGINEERING↗

State and Parameter Estimation for Natural Gas Pipeline Networks Using Transient State Data

Here, we formulate two estimation problems for pipeline systems in which measurements of the compressible gas flowing through a network of pipes are affected by time-varying injections, withdrawals, and compression. We consider a state estimation problem that is then extended to a joint state and parameter estimation problem that can be used for data assimilation. In both formulations, the flow dynamics are described on each pipe by space- and time-dependent densities and mass flux which evolve according to a system of coupled partial differential equations, in which momentum dissipation is modeled using the Darcy-Wiesbach friction approximation. These dynamics are first spatially discretized to obtain a system of nonlinear ordinary differential equations on which state and parameter estimation formulations are given as nonlinear least squares problems. A rapid, scalable computational method for performing a nonlinear least squares estimation is developed. Extensive simulations and computational experiments on multiple pipeline test networks demonstrate the effectiveness of the formulations in obtaining state and parameter estimates in the presence of measurement and process noise.

03 NATURAL GAS↗

Automated isotope identification algorithm using artificial neural networks

There is a need to develop an algorithm that can determine the relative activities of radio-isotopes in a large dataset of low-resolution gamma-ray spectra that contains a mixture of many radio-isotopes. Low-resolution gamma-ray spectra that contain mixtures of radio-isotopes often exhibit feature over-lap, requiring algorithms that can analyze these features when overlap occurs. While machine learning and pattern recognition algorithms have shown promise for the problem of radio-isotope identification, their ability to identify and quantify mixtures of radio-isotopes has not been studied. Because machine learning algorithms use abstract features of the spectrum, such as the shape of overlapping peaks and Compton continuum, they are a natural choice for analyzing radio-isotope mixtures. An artificial neural network (ANN) has be trained to calculate the relative activities of 32 radio-isotopes in a spectrum. Furthermore, the ANN is trained with simulated gamma-ray spectra, allowing easy expansion of the library of target radio-isotopes. In this paper we present our initial algorithms based on an ANN and evaluate them against a series measured and simulated spectra.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Application of machine learning for modeling brønsted-guggenheim-scatchard specific ion interaction theory (SIT) coefficients

Machine learning methodologies can provide insight into Brønsted-Guggenheim-Scatchard specific ion interaction theory (SIT) parameter values where experimental data availability may be limited. This study develops and executes machine learning frameworks to model the SIT interaction coefficient, ε. Key findings include successful estimations of ε via artificial neural networks using clustering and value prediction approaches. Additionally, applicability to other chemical parameters is also assessed briefly. Models developed here provide support for a use-case of machine learning in geologic nuclear waste disposal research applications, namely in predictions of chemical behaviors of high ionic strength solutions (i.e., subsurface brines).

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Deep Learning Models Augment Analyst Decisions for Event Discrimination

Long-term seismic monitoring networks are well positioned to leverage advances in machine learning because of the abundance of labeled training data that curated event catalogs provide. In this study, we explore the use of Convolutional and Recurrent Neural Networks to accomplish discrimination of explosive and tectonic sources for local distances. Using a 5-year event catalog generated by the University of Utah Seismograph Stations we train models to produce automated event labels using 90 s event spectrograms from 3-component and single-channel sensors. Both network architectures are able to replicate analyst labels above 98%. Most commonly, model error is the result of label error (70% of cases). Accounting for mislabeled events (~1% of the catalog) model accuracy for both models increases to above 99%. Finally, classification accuracy remains above 98% for shallow tectonic events, indicating that spectral characteristics controlled by event depth do not play a dominant role in event discrimination.

58 GEOSCIENCES↗

A Comparison of Neuromorphic Classification Tasks

A variety of neural network models and machine learning techniques have arisen over the past decade, and their successes with image classification have been stunning. With other classification tasks, selecting and configuring a neural network solution is not straightforward. In this paper, we evaluate and compare a variety of neural network models, trained by a variety of machine learning techniques, on a variety of classification tasks. While Deep Learning typically exhibits the best classification accuracy, we note the promise of Reservoir Computing, and evolutionary optimization on spiking neural networks. In many cases, these technologies perform as well as, or better than Deep Learning, and the resulting networks are much smaller than their Deep Learning counterparts.

Reynolds, John↗

Enterprise Risks for Scientific Software in the Post Exascale Era

The Department of Energy’s Office of Science’s Advanced Scientific Computing Research (ASCR) Office hosts three high performance computing Facilities and one high performance networking Facility. ASCR’s Facilities Division and these four Facilities established a joint working group to address the most severe threats to the software capabilities that can prevent the Facilities from supporting a diverse array of mission critical scientific research carried out by thousands of researchers from national labs, academia, and industry. This report outlines the risk categories, threat matrix calculations, and number of risks in each of the categories along with the threat levels. Two categories—programming environment/tools and system software—account for 13 out of the 20 risks encountered in the risk register. A significant risk to ASCR’s software ecosystem also arises from the possible loss of personnel and expertise past the end of the exascale computing project. The working group recommends that the software enterprise risks are reevaluated regularly, and are considered in future decision making regarding system acquisition, knowledge sharing, partnership development, and strategic planning

97 MATHEMATICS AND COMPUTING↗

Learning Optimal Multigrid Smoothers via Neural Networks

Multigrid methods are one of the most efficient techniques for solving large sparse linear systems arising from partial differential equations (PDEs) and graph Laplacians from machine learning applications. One of the key components of multigrid is smoothing, which aims at reducing high-frequency errors on each grid level. However, finding optimal smoothing algorithms is problem-dependent and can impose challenges for many problems. In this paper, we propose an efficient adaptive framework for learning optimized smoothers from operator stencils in the form of convolutional neural networks (CNNs). Here, the CNNs are trained on small-scale problems from a given type of PDEs based on a supervised loss function derived from multigrid convergence theories and can be applied to large-scale problems of the same class of PDEs. Numerical results on anisotropic rotated Laplacian problems and variable coefficient diffusion problems demonstrate improved convergence rates and solution time compared with classical hand-crafted relaxation methods.

97 MATHEMATICS AND COMPUTING↗

Enabling Real-Time Communication in Multi-Agent Systems: A Graph Neural Network Based Approach

Global connectivity enables effective coordination in Multi-Agent Systems (MAS). Solving these connection problems under hardware constraints is an NP-hard non-Euclidean Degree Constrained Minimum Spanning Tree (DCMST) problem. Prior MAS controllers coordinate team movement for task completion and collision avoidance; some considering Line-of-Sight (LOS) maintenance but prioritizing flexibility over guarantees. Evolutionary Algorithms (EA) have been shown to find good solutions for DCMST, but their performance degrades with larger populations required to support a large MAS. We present a method based on edge graph attention networks, trained offline to reduce online computation times. Empirical comparisons with greedy polynomial-time solvers and EA show that our method leverages latent graph information to consistently find constraint-satisfying solutions in less time.

connectivity maintenance↗

Communication systems and methods

A communication system is provided that include one or more processors that are configured to instruct computing devices that communicate messages with each other via a time-sensitive network to securely exchange the messages using secret information, ad direct the computing devices to exchange the secret information via a dedicated quantum channel in the time-sensitive network. The one or more processors are also configured to determine a quantum channel synchronization time associated with the secret information exchanged via the dedicated quantum channel, and modify a local classical oscillator based on the quantum channel synchronization time, the local classical oscillator configured to provide a current time.

Bush, Stephen Francis↗

Deep learning of parameterized equations with applications to uncertainty quantification

We propose a learning algorithm for discovering unknown parameterized dynamical systems by using observational data of the state variables. Our method is built upon and extends the recent work of discovering unknown dynamical systems, in particular those using deep neural network (DNN). We propose a DNN structure, largely based upon the residual network (ResNet), to not only learn the unknown form of the governing equation but also take into account the random effect embedded in the system, which is generated by the random parameters. Once the DNN model is successfully constructed, it is able to produce system prediction over longer term and for arbitrary parameter values. For uncertainty quantification, it allows us to conduct uncertainty analysis by evaluating solution statistics over the parameter space.

97 MATHEMATICS AND COMPUTING↗

Deep Kronecker neural networks: A general framework for neural networks with adaptive activation functions

Here we propose a new type of neural networks, Kronecker neural networks (KNNs), that form a general framework for neural networks with adaptive activation functions. KNNs employ the Kronecker product, which provides an efficient way of constructing a very wide network while keeping the number of parameters low. Our theoretical analysis reveals that under suitable conditions, KNNs induce a faster decay of the loss than that by the feed-forward networks. This is also empirically verified through a set of computational examples. Furthermore, under certain technical assumptions, we establish global convergence of gradient descent for KNNs. As a specific case, we propose the Rowdy activation function that is designed to get rid of any saturation region by injecting sinusoidal fluctuations, which include trainable parameters. The proposed Rowdy activation function can be employed in any neural network architecture like feed-forward neural networks, Recurrent neural networks, Convolutional neural networks etc. The effectiveness of KNNs with Rowdy activation is demonstrated through various computational experiments including function approximation using feed-forward neural networks, solution inference of partial differential equations using the physics-informed neural networks, and standard deep learning benchmark problems using convolutional and fully-connected neural networks.

97 MATHEMATICS AND COMPUTING↗

The Effects of Disturbance and Climate on Carbon Storage and the Exchanges of CO 2 Water Vapor and Energy Exchange of Evergreen Coniferous Forests in the Pacific Northwest: Integration of Eddy Flux, Plant and Soil Measurements at a Cluster of Supersites. Final report

This is the final technical report containing a summary of all findings with regard to the following objectives of the project: (1) To quantify and understand the effects of wildfire on carbon storage and the exchanges of energy, CO2, and water vapor in a chronosequence of ponderosa pine (disturbance gradient); (2) To investigate the effects of seasonal and interannual variation in climate on carbon storage and the exchanges of energy, CO2, and water vapor in mature conifer forests in two climate zones: mesic 40-yr old Douglas-fir and semi-arid 60-yr old ponderosa pine (climate gradient); (3) To reduce uncertainty in estimates of CO2 feedbacks to the atmosphere by providing an improved model formulation for existing biosphere-atmosphere models; and (4) To provide high quality data for AmeriFlux and the NACP on micrometeorology, meteorology, and biology of these systems. Objective (1): A study integrating satellite remote sensing, AmeriFlux data, and field surveys in a simulation modeling framework estimated that the pyrogenic carbon emissions, tree mortality, and net carbon exchange associated with four large wildfires that burned ~50,000 hectares in 2002-2003 were equivalent to 2.4% of Oregon statewide anthropogenic carbon emissions over the same two-year period. Most emissions were from the combustion of the forest floor and understory vegetation, and only about 1% of live tree mass was combusted on average. Objective (2): A study of multi-year flux records across a chronosequence of ponderosa pine forests yielded that the net carbon uptake is over three times greater at a mature pine forest compared with young pine. The larger leaf area and wetter and cooler soils of the mature forest mainly caused this effect. A study analyzing seven years of carbon and water dynamics showed that interannual and seasonal variability of net carbon exchange was primarily related to variability in growing season length, which was a linear function of plant-available soil moisture in spring and early summer. A multi-year drought (2001-2003) led to a significant reduction of net ecosystem exchange due to carry-over effects in soil moisture and carbohydrate reserves in plant-tissue. In the same forest, the interannual variability in the rate carbon is lost from the soil and forest floor is considerable and related to the variability in tree growth as much as it is to variability in soil climatic conditions. Objective (3): Flux data from the mature ponderosa pine site support a physical basis for filtering nighttime data with friction velocity above the canopy. An analysis of wind fields and heat transport in the subcanopy at the mesic 40-year old Douglas site yielded that the non-linear structure and behavior of spatial temperature gradients and the flow field require enhanced sensor networks to estimate advective fluxes in the subcanopy of forest to close the surface energy balance in forests. Reliable estimates for flux uncertainties are needed to improve model validation and data assimilation in process-based carbon models, inverse modeling studies and model-data synthesis, where the uncertainties may be as important as the fluxes themselves. An analysis of the time scale dependence of the random and flux sampling error yielded that the additional flux obtained by increasing the perturbation timescale beyond about 10 minutes is dominated by random sampling error, and therefore little confidence can be placed in its value. Artificial correlation between gross ecosystem productivity (GEP) and ecosystem respiration (Re) is a consequence of flux partitioning of eddy covariance flux data when GEP is computed as the difference between NEE and computed daytime Re (e.g. using nighttime Re extrapolated into daytime using soil or air temperatures). Tower-data must be adequately spatially averaged before comparison to gridded model output as the time variability of both is inherently different. The eddy-covariance data collected at the mature ponderosa pine site and the mesic Douglas fir site were used to develop and evaluate a new method to extract the signal of ecosystem respiration directly from daytime net ecosystem exchange. This approach may help reducing uncertainty in carbon budgets by providing direct measurements of ecosystem respiration during daylight conditions by replacing modeled estimates. Objective (4): We submitted our flux and biological and ancillary data to the AmeriFlux web site and to Fluxnet. This includes atmospheric carbon, water, and heat fluxes, soil fluxes, NPP, carbon stocks, LAI, and disturbance history. Fluxnet is updating the original La Thuile files and will include the more recent years of data. They will be using a new approach to compute GPP, following discussions within the network about the need to improve GPP methodology

54 ENVIRONMENTAL SCIENCES↗

FTP 100: An Ultra-High Speed Data Transfer Service Over Next Generation 100 Gigabit Per Second Network

Data-intensive applications, including high energy and nuclear physics, astrophysics, climate modeling, nano-scale materials science, genomics, and financing, are expected to generate exabytes of data over the coming years, which must be transferred, visualized, and analyzed by geographically distributed teams of users. High-performance network capabilities must be available to these users at the application level in a transparent, virtualized manner. Moreover, the application users must have the capability to move large datasets from local and remote locations across network environments to their home institutions. To solve these challenges, the main goal of our project is to design and evaluate high-performance data transfer software to support various data-intensive applications. First, we have designed a middleware software that provides access to Remote Direct Memory Access (RDMA) functionalities. This middleware integrates network access, memory management and multitasking in its core design. We address a number of issues related to its efficient implementation, for instance, explicit buffer management and memory registration, and parallelization of RDMA operations, which are vital to delivering the benefit of RDMA to the applications. Built on top of this middleware, an implementation and experimental evaluation of the RDMA-based FTP software, RFTP, is described and evaluated. This application has been implemented by our team to exploit the full capabilities of advanced RDMA mechanisms for ultra-high speed bulk data transfer applications on Energy Sciences Network (ESnet). Second, we designed our data transfer software to optimize TCP/IP based data transfer performance such that RFTP can be fully compatible with today’s Internet. Our kernel optimization techniques with Linux system calls sendfile and splice, can reduce data copy cost. In this report, we summarize the technical challenges of our project, the primary software design methods, the major project milestones achieved, as well as the testbed evaluation work and demonstrations during our project life time.

97 MATHEMATICS AND COMPUTING↗