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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,423 records · Page 79

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Numerical Solution of the Steady-State Network Flow Equations for a Non-Ideal Gas

Herein we formulate a steady-state network flow problem for non-ideal gas that relates injection rates and nodal pressures in the network to flows in pipes. For this problem, we present and prove a theorem on uniqueness of generalized solution for a broad class of non-ideal pressure-density relations that satisfy a monotonicity property. Further, we develop a Newton-Raphson algorithm for numerical solution of the steady-state problem, which is made possible by a systematic non-dimensionalization of the equations. The developed algorithm has been extensively tested on benchmark instances and shown to converge robustly to a generalized solution. Previous results [1]-[4], indicate that the steady-state network flow equations for an ideal gas are difficult to solve by the Newton-Raphson method because of its extreme sensitivity to the initial guess. In contrast, we find that non-dimensionalization of the steady-state problem is key to robust convergence of the Newton-Raphson method. We identify criteria based on the uniqueness of solutions under which the existence of a non-physical generalized solution found by a non-linear solver implies non-existence of a physical solution, i.e., infeasibility of the problem. Finally, we compare pressure and flow solutions based on ideal and non-ideal equations of state to demonstrate the need to apply the latter in practice. The solver developed in this article is open-source and is made available for both the academic and research communities as well as the industry.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Detecting technological maturity from bibliometric patterns

We report the capability to identify emergent technologies based upon easily accessed open-source indicators, such as publications, is important for decision-makers in industry and government. The scientific contribution of this work is the proposition of a machine learning approach to the detection of the maturity of emerging technologies based on publication counts. Time-series of publication counts have universal features that distinguish emerging and growing technologies. We train an artificial neural network classifier, a supervised machine learning algorithm, upon these features to predict the maturity (emergent vs. growth) of an arbitrary technology. With a training set comprised of 22 technologies we obtain a classification accuracy ranging from 58.3% to 100% with an average accuracy of 84.6% for six test technologies. To enhance classifier performance, we augmented the training corpus with synthetic time-series technology life cycle curves, formed by calculating weighted averages of curves in the original training set. Training the classifier on the synthetic data set resulted in improved accuracy, ranging from 83.3% to 100% with an average accuracy of 90.4% for the test technologies. The performance of our classifier exceeds that of competing machine learning approaches in the literature, which report an average classification accuracy of only 85.7% at maximum. Moreover, in contrast to current methods our approach does not require subject matter expertise to generate training labels, and it can be automated and scaled.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

New machine learning techniques for simulation-based inference: InferoStatic nets, kernel score estimation, and kernel likelihood ratio estimation

We propose an intuitive, machine-learning approach to multiparameter inference, dubbed the InferoStatic Networks (ISN) method, to model the score and likelihood ratio estimators in cases when the probability density can be sampled but not computed directly. The ISN uses a backend neural network that models a scalar function called the inferostatic potential \varphi φ . In addition, we introduce new strategies, respectively called Kernel Score Estimation (KSE) and Kernel Likelihood Ratio Estimation (KLRE), to learn the score and the likelihood ratio functions from simulated data. We illustrate the new techniques with some toy examples and compare to existing approaches in the literature. We mention en passant some new loss functions that optimally incorporate latent information from simulations into the training procedure.

Kong, Kyoungchul↗

DOE OSTI2023

Codebase release 0.1 for infstat

Kong, Kyoungchul↗

DOE OSTI2022

New Machine Learning Techniques for Simulation-Based Inference: InferoStatic Nets, Kernel Score Estimation, and Kernel Likelihood Ratio Estimation

We propose an intuitive, machine-learning approach to multiparameter inference, dubbed the InferoStatic Networks (ISN) method, to model the score and likelihood ratio estimators in cases when the probability density can be sampled but not computed directly. The ISN uses a backend neural network that models a scalar function called the inferostatic potential $\varphi$. In addition, we introduce new strategies, respectively called Kernel Score Estimation (KSE) and Kernel Likelihood Ratio Estimation (KLRE), to learn the score and the likelihood ratio functions from simulated data. We illustrate the new techniques with some toy examples and compare to existing approaches in the literature. We mention en passant some new loss functions that optimally incorporate latent information from simulations into the training procedure.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

Learning effective stochastic differential equations from microscopic simulations: Linking stochastic numerics to deep learning

We identify effective stochastic differential equations (SDEs) for coarse observables of fine-grained particle- or agent-based simulations; these SDEs then provide useful coarse surrogate models of the fine scale dynamics. We approximate the drift and diffusivity functions in these effective SDEs through neural networks, which can be thought of as effective stochastic ResNets. The loss function is inspired by, and embodies, the structure of established stochastic numerical integrators (here, Euler–Maruyama and Milstein); our approximations can thus benefit from backward error analysis of these underlying numerical schemes. They also lend themselves naturally to “physics-informed” gray-box identification when approximate coarse models, such as mean field equations, are available. Existing numerical integration schemes for Langevin-type equations and for stochastic partial differential equations can also be used for training; we demonstrate this on a stochastically forced oscillator and the stochastic wave equation. Our approach does not require long trajectories, works on scattered snapshot data, and is designed to naturally handle different time steps per snapshot. We consider both the case where the coarse collective observables are known in advance, as well as the case where they must be found in a data-driven manner.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Physics-informed machine learning of the Lagrangian dynamics of velocity gradient tensor

Reduced models describing the Lagrangian dynamics of the velocity gradient tensor (VGT) in homogeneous isotropic turbulence (HIT) are developed under the physics-informed machine learning (PIML) framework. We consider the VGT at both Kolmogorov scale and coarse-grained scale within the inertial range of HIT. Building reduced models requires resolving the pressure Hessian and subfilter contributions, which is accomplished by constructing them using the integrity bases and invariants of the VGT. The developed models can be expressed using the extended tensor basis neural network (TBNN) introduced by Ling et al. [J. Fluid Mech. 807, 155 (2016)]. Physical constraints, such as Galilean invariance, rotational invariance, and incompressibility condition, are thus embedded in the models explicitly. Our PIML models are trained on the Lagrangian data from a high-Reynolds number direct numerical simulation (DNS). To validate the results, we perform a comprehensive out-of-sample test. We observe that the PIML model provides an improved representation for the magnitude and orientation of the small-scale pressure Hessian contributions. Statistics of the flow, as indicated by the joint PDF of second and third invariants of the VGT, show good agreement with the “ground-truth” DNS data. A number of other important features describing the structure of HIT are reproduced by the model successfully. We have also identified challenges in modeling inertial range dynamics, which indicates that a richer modeling strategy is required. This helps us identify important directions for future research, in particular towards including inertial range geometry into the TBNN.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Differentiable Neural Architecture, Mixed Precision and Accelerator Co-Search

Quantization, effective Neural Network architecture, and efficient accelerator hardware are three important design paradigms to maximize accuracy and efficiency. Mixed Precision Quantization is a process of assigning different precision to different Neural Network layers for optimized inference. Neural Architecture Search (NAS) is a process of automatically designing the neural network for a task and can also be extended to search for the precision of each weight and activation matrix. In this paper, we develop the following three methods: (i) Fast Differentiable Hardware-aware Mixed Precision Quantization Search method to find optimal precision, (ii) Joint Differentiable hardware-aware Architecture and Mixed Precision Quantization Co-search, (iii) Joint Accelerator, Architecture, and Precision triple co-search to find best possibilities in all the three worlds. We demonstrate the effectiveness of our proposed methods targeting Bitfusion accelerator by searching mixed precision models on MobilenetV2. We achieve better accuracy-latency trade-off models than the manually designed and previously proposed search methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A data-driven model for thermodynamic properties of a steam generator under cycling operation

The varying electricity demand from coal power plants due to the intermittent nature of renewable sources leads to load-follow and on/off operations referred to as cycling. Cycling causes transients of properties such as pressure and temperature within various components of the steam generation system.These transients cause increased damage because of fatigue and creep-fatigue interactions shortening the life of components. An algorithm is developed to identify cycling operations from the gross power data. The data-driven model based on artificial neural networks (ANN) is developed using 10 years data from Coal Creek Station power plant located in North Dakota, USA to estimate properties of the steam generator components during cycling operations. Furthermore, the uniqueness of this model is the ability to predict component properties for the cycling as well as base-load operations and is reported for the first time. The ANN model estimates the component properties, for a given gross power profile and initial conditions, as they vary during cycling operations. As a representative example, the ANN estimates are presented for the superheater outlet pressure, reheater inlet temperature, and flue gas temperature at the air heater inlet. The changes in these variables as a function of the gross power over the time duration are compared with measurements to assess the predictive capability of the model. Mean square errors of 4.49E-04 for superheater outlet pressure, 1.62E-03 for reheater inlet temperature, and 4.14E-04 for flue gas temperature at the air heater inlet were observed.

01 COAL, LIGNITE, AND PEAT↗

DOE OSTI2025

Reduced-order modeling for efficient cross section library development in high-temperature gas reactor pebble-bed depletion analysis

Accurate modeling of running-in and equilibrium conditions in pebble-bed reactors (PBRs) requires precise microscopic multigroup neutron cross sections. In Griffin, deterministic neutronics calculations rely on multivariate interpolation over large cross section libraries, resulting in significant memory usage and performance bottlenecks. This work, together with a companion paper on Griffin integration, explores reduced-order models (ROMs) to replace interpolation with lightweight surrogates. Several ROM techniques are benchmarked, with deep neural networks (DNNs) demonstrating superior memory efficiency, scalability, and predictive accuracy. A total of 295 DNNs were trained to build a comprehensive isotope library, integrated into Griffin through a custom LibTorch interface for depletion analysis. Initial results demonstrate that DNN-based ROMs drastically reduce memory demands while preserving accuracy, enabling finer tabulations and additional state variables without overhead. In conclusion, the framework also supports online cross section generation and real-time DNN updates through transfer learning, improving fidelity by capturing self-shielding and evolving nuclide compositions during burnup.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2024

On the universality of S n -equivariant k -body gates

The importance of symmetries has recently been recognized in quantum machine learning from the simple motto: if a task exhibits a symmetry (given by a group $\mathfrak{G}$), the learning model should respect said symmetry. This can be instantiated via $\mathfrak{G}$-equivariant quantum neural networks (QNNs), i.e. parametrized quantum circuits whose gates are generated by operators commuting with a given representation of $\mathfrak{G}$. In practice, however, there might be additional restrictions to the types of gates one can use, such as being able to act on at most k qubits. In this work we study how the interplay between symmetry and k-bodyness in the QNN generators affect its expressiveness for the special case of $\mathfrak{G}=S_n$, the symmetric group. Our results show that if the QNN is generated by one- and two-body Sn-equivariant gates, the QNN is semi-universal but not universal. That is, the QNN can generate any arbitrary special unitary matrix in the invariant subspaces, but has no control over the relative phases between them. Then, we show that in order to reach universality one needs to include n-body generators (if n is even) or ($n-1$)-body generators (if n is odd). As such, our results brings us a step closer to better understanding the capabilities and limitations of equivariant QNNs.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Rethinking skip connections in Spiking Neural Networks with Time-To-First-Spike coding

Time-To-First-Spike (TTFS) coding in Spiking Neural Networks (SNNs) offers significant advantages in terms of energy efficiency, closely mimicking the behavior of biological neurons. In this work, we delve into the role of skip connections, a widely used concept in Artificial Neural Networks (ANNs), within the domain of SNNs with TTFS coding. Our focus is on two distinct types of skip connection architectures: (1) addition-based skip connections, and (2) concatenation-based skip connections. We find that addition-based skip connections introduce an additional delay in terms of spike timing. On the other hand, concatenation-based skip connections circumvent this delay but produce time gaps between after-convolution and skip connection paths, thereby restricting the effective mixing of information from these two paths. To mitigate these issues, we propose a novel approach involving a learnable delay for skip connections in the concatenation-based skip connection architecture. This approach successfully bridges the time gap between the convolutional and skip branches, facilitating improved information mixing. We conduct experiments on public datasets including MNIST and Fashion-MNIST, illustrating the advantage of the skip connection in TTFS coding architectures. Additionally, we demonstrate the applicability of TTFS coding on beyond image recognition tasks and extend it to scientific machine-learning tasks, broadening the potential uses of SNNs.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Convolutional Neural Networks for Problems in Transport Phenomena: A Theoretical Minimum

Convolutional neural network (CNN), a deep learning algorithm, has gained popularity in technological applications that rely on interpreting images (typically, an image is a 2D field of pixels). Transport phenomena is the science of studying different fields representing mass, momentum, or heat transfer. Some of the common fields are species concentration, fluid velocity, pressure, and temperature. Each of these fields can be expressed as an image(s). Consequently, CNNs can be leveraged to solve specific scientific problems in transport phenomena. Herein, we show that such problems can be grouped into three basic categories: (a) mapping a field to a descriptor (b) mapping a field to another field, and (c) mapping a descriptor to a field. After reviewing the representative transport phenomena literature for each of these categories, we illustrate the necessary steps for constructing appropriate CNN solutions using sessile liquid drops as an exemplar problem. If sufficient training data is available, CNNs can considerably speed up the solution of the corresponding problems. Finally, the present discussion is meant to be minimalistic such that readers can easily identify the transport phenomena problems where CNNs can be useful as well as construct and/or assess such solutions.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Evolutionary Architecture Search for Generative Adversarial Networks Based on Weight Sharing

Generative adversarial networks (GANs) are a powerful generative technique but frequently face challenges with training stability. Network architecture plays a significant role in determining the final output of GANs, but designing a fine architecture demands extensive domain expertise. This article aims to address this issue by searching for high-performance generator’s architectures through neural architecture search (NAS). The proposed approach, called evolutionary weight sharing GANs (EWSGAN), is based on weight sharing and comprises two steps. First, a supernet of the generator is trained using weight sharing. Second, a multiobjective evolutionary algorithm (MOEA) is employed to identify optimal subnets from the supernet. These subnets inherit weights directly from the supernet for fitness assessment. Two strategies are used to stabilize the training of the generator supernet: 1) a fair single-path sampling strategy and 2) a discarding strategy. Experimental results indicate that the architecture searched by our method achieved a new state-of-the-art among NAS–GAN methods with a Fréchet inception distance (FID) of 9.09 and an inception score (IS) of 8.99 on the CIFAR-10 dataset. Finally, it also demonstrates competitive performance on the STL-10 dataset, achieving FID of 21.89 and IS of 10.51.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

A Network Integration Approach to Predict Conserved Regulators Related to Pathogenicity of Influenza and SARS-CoV Respiratory Viruses

Respiratory infections stemming from influenza viruses and the Severe Acute Respiratory Syndrome corona virus (SARS-CoV) represent a serious public health threat as emerging pandemics. Despite efforts to identify the critical interactions of these viruses with host machinery, the key regulatory events that lead to disease pathology remain poorly targeted with therapeutics. Here we implement an integrated network interrogation approach, in which proteome and transcriptome datasets from infection of both viruses in human lung epithelial cells are utilized to predict regulatory genes involved in the host response. We take advantage of a novel “crowd-based” approach to identify and combine ranking metrics that isolate genes/proteins likely related to the pathogenicity of SARS-CoV and influenza virus. Subsequently, a multivariate regression model is used to compare predicted lung epithelial regulatory influences with data derived from other respiratory virus infection models. We predicted a small set of regulatory factors with conserved behavior for consideration as important components of viral pathogenesis that might also serve as therapeutic targets for intervention. Our results demonstrate the utility of integrating diverse ‘omic datasets to predict and prioritize regulatory features conserved across multiple pathogen infection models.

Computational Biology↗

DOE OSTI2023

A Reversed Impedance-Based Stability Criterion for IBR Grids

The existing impedance-based stability criterion is effective for analyzing local control interactions; however, it is difficult to scale the existing criterion to analyze wide-area control interactions among numerous IBRs through a complex power system network. The scaled version of the existing criterion requires the impedance response of each IBR in the system as well as of the network looking from all the IBRs. It is quite challenging to obtain all these impedance responses because of the computational effort and the requirement of separately scanning the impedance of the network and the IBRs. We propose a reversed criterion for the impedance-based stability analysis to address these problems. In contrast to the existing criterion, the reversed criterion analyzes the stability of a power system when an IBR is disconnected from the system. The reversed criterion estimates the impact of an IBR on the frequency and damping of power system oscillation modes using the impedance scans of only the IBR and the grid at its terminal. It can be sequentially applied at different IBRs to evaluate their impact on the power system stability. In addition to scalability, the reversed criterion gives flexibility to focus only on a few selected IBRs, depending on their rating, the magnitude of oscillations observed at their terminals, and the vendor support available for implementing stabilizing control system updates. The reversed criterion is demonstrated on a 14-bus power system with 100% IBRs.

control interactions↗

DOE OSTI2024

Enhancing high-fidelity neural network potentials through low-fidelity sampling

The efficacy of neural network potentials (NNPs) critically depends on the quality of the configurational datasets used for training. Prior research using empirical potentials has shown that well-selected liquid–solid transitional configurations of a metallic system can be translated to other metallic systems. This study demonstrates that such validated configurations can be relabeled using density functional theory (DFT) calculations, thereby enhancing the development of high-fidelity NNPs. Training strategies and sampling approaches are efficiently assessed using empirical potentials and subsequently relabeled via DFT in a highly parallelized fashion for high-fidelity NNP training. Our results reveal that relying solely on energy and force for NNP training is inadequate to prevent overfitting, highlighting the necessity of incorporating stress terms into the loss functions. To optimize training involving force and stress terms, we propose employing transfer learning to fine-tune the weights, ensuring that the potential surface is smooth for these quantities composed of energy derivatives. This approach markedly improves the accuracy of elastic constants derived from simulations in both empirical potential-based NNPs and relabeled DFT-based NNPs. Overall, this study offers significant insights into leveraging empirical potentials to expedite the development of reliable and robust NNPs at the DFT level.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Extracting h-Backbone as a Core Structure in Weighted Networks

Determining the core structure of complex network systems allows us to simplify them. Using h -bridge and h -strength measurements in a weighted network, we extract the h -backbone core structure. We find that focusing on the h -backbone in a network allows greater simplification because it has fewer edges and thus fewer adjacent nodes. We examine three practical applications: the co-citation network in an information system, the open flight network in a social system, and coauthorship in network science publications.

97 MATHEMATICS AND COMPUTING↗