Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random 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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

GrainGNN: A dynamic graph neural network for predicting 3D grain microstructure

We propose GrainGNN, a surrogate model for the evolution of polycrystalline grain structure under rapid solidification conditions in metal additive manufacturing. High fidelity simulations of solidification microstructures are typically performed using multicomponent partial differential equations (PDEs) with moving interfaces. The inherent randomness of the PDE initial conditions (grain seeds) necessitates ensemble simulations to predict microstructure statistics, e.g., grain size, aspect ratio, and crystallographic orientation. Here, currently such ensemble simulations are prohibitively expensive and surrogates are necessary.In GrainGNN, we use a dynamic graph to represent interface motion and topological changes due to grain coarsening. We use a reduced representation of the microstructure using hand-crafted features; we combine pattern finding and altering graph algorithms with two neural networks, a classifier (for topological changes) and a regressor (for interface motion). Both networks have an encoder-decoder architecture; the encoder has a multi-layer transformer long-short-term-memory architecture; the decoder is a single layer perceptron.We evaluate GrainGNN by comparing it to high-fidelity phase field simulations for in-distribution and out-of-distribution grain configurations for solidification under laser power bed fusion conditions. GrainGNN results in 80%–90% pointwise accuracy; and nearly identical distributions of scalar quantities of interest (QoI) between phase field and GrainGNN simulations compared using Kolmogorov-Smirnov test. GrainGNN's inference speedup (PyTorch on single x86 CPU) over a high-fidelity phase field simulation (CUDA on a single NVIDIA A100 GPU) is 150×–2000× for 100-initial grain problem. Further, using GrainGNN, we model the formation of 11,600 grains in 220 seconds on a single CPU core.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Application of the AI2 Climate Emulator to E3SMv2's Global Atmosphere Model, With a Focus on Precipitation Fidelity

Abstract Can the current successes of global machine learning‐based weather simulators be generalized beyond 2‐week forecasts to stable and accurate multiyear runs? The recently developed AI2 Climate Emulator (ACE) suggests this is feasible, based upon 10‐year simulations with a network trained on output from a physics‐based global atmosphere model using a grid spacing of approximately 110 km and forced by a repeating annual cycle of sea‐surface temperature. Here we show that ACE, without modification, can be trained to emulate another major atmospheric model, EAMv2, run at a comparable grid spacing for at least 10 years with similarly small climate biases—a prerequisite to wider applicability. With an analysis that combines multiple temporal, spatial, and frequency domain perspectives, we show that ACE faithfully represents the spatiotemporal structure of EAMv2 precipitation and related variables. Finally, we show that a pretrained ACE network is able to adapt to a new global climate model simulation data set with 10 fewer training steps than when starting from random initialization, all while still maintaining low levels of climate bias. Further analysis of these fine‐tuning experiments reveal ACE's intriguing ability to interpolate between distinct global climate models.

Duncan, James P. C.↗
DOE OSTI2023

Reliability of Open Public Electric Vehicle Direct Current Fast Chargers

The aim was to systematically evaluate the usability of all public electric vehicles (EV) direct current fast chargers (DCFC) in the San Francisco region. To achieve a rapid transition to EVs, a highly reliable and easy to use charging infrastructure is critical to building confidence among consumers. The functionality and usability of all 182 open, public DCFC charging stations with CCS connectors (combined charging system) in the 9 counties of the Bay Area were tested (655 electric vehicle service equipment (EVSE) ports). An EVSE was classified as functional if it charged an EV for 2 minutes. Overall, 73.3% of the 655 EVSEs were functional. The causes of the nonfunctioning EVSEs (23.5%) were blank or unresponsive screens or error messages; payment system failures; charge initiation failures; network failures; or broken connectors. In addition, the cable was too short to reach the EV inlet for 3.2% of the EVSEs. A random sampling of 10% of the EVSEs, approximately 8 days after the first evaluation, found no overall change in functionality. The level of functionality found with field testing conflicts with the 95–98% uptime reported by the EV service providers (EVSPs) who operate the EV charging stations. There is a need for precise and verifiable definitions of uptime, downtime, and excluded time, as applied to public EV chargers. In conclusion, the level of failure of the existing public EV DCFC charge infrastructure highlights the importance of improving the system design and maintenance to improve adoption of EVs.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Entropy Analysis of FPGA Interconnect and Switch Matrices for Physical Unclonable Functions

Random variations in microelectronic circuit structures represent the source of entropy for physical unclonable functions (PUFs). In this paper, we investigate delay variations that occur through the routing network and switch matrices of a field-programmable gate array (FPGA). The delay variations are isolated from other components of the programmable logic, e.g., look-up tables (LUTs), flip-flops (FFs), etc., using a feature of Xilinx FPGAs called dynamic partial reconfiguration (DPR). A set of partial designs is created to fix the placement of a time-to-digital converter (TDC) and supporting infrastructure to enable the path delays through the target interconnect and switch matrices to be extracted by subtracting out common-mode delay components. Delay variations are analyzed in the different levels of routing resources available within FPGAs, i.e., local routing and across-chip routing. Data are collected from a set of Xilinx Zynq 7010 devices, and a statistical analysis of within-die variations in delay through a set of the randomly-generated and hand-crafted interconnects is presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Parallel-in-Time Solution of Allen-Cahn Equations by Integrating Operator Learning into the Parareal Method

While recent advances in deep learning have shown promising efficiency gains in solving time-dependent partial differential equations (PDEs), matching the accuracy of conventional numerical solvers still remains a challenge. One strategy to improve the accuracy of deep learning-based solutions for time-dependent PDEs is to use the learned model as the coarse propagator in the Parareal method and a traditional numerical method as the fine solver. However, successful integration of deep learning into the Parareal method requires consistency between the coarse and fine solvers, particularly for PDEs exhibiting rapid changes such as sharp transitions. Here, to ensure this consistency, we propose using convolutional neural networks (CNNs) to learn the fully discrete time-stepping operator defined by the same numerical scheme employed as the fine solver. We demonstrate the effectiveness of the proposed method in solving the classical and mass-conservative Allen–Cahn (AC) equations. Through iterative updates in the Parareal algorithm, our approach achieves a significant computational speedup compared to traditional fine solvers while converging to high-accuracy solutions. Our results highlight that the proposed hybrid Parareal algorithm effectively accelerates simulations, particularly when implemented on multiple GPUs, and converges to the desired accuracy in only a few iterations. Another advantage of our method is that the CNN model is trained on trajectory-based data generated from random initial conditions, such that the trained model can be used to solve the AC equations with various initial conditions without retraining. This work demonstrates the potential of integrating neural network methods into parallel-in-time frameworks for efficient and accurate simulations of time-dependent PDEs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Islands Within Islands: Bacterial Phylogenetic Structure and Consortia in Hawaiian Lava Caves and Fumaroles

Lava caves, tubes, and fumaroles in Hawai‘i present a range of volcanic, oligotrophic environments from different lava flows and host unexpectedly high levels of bacterial diversity. These features provide an opportunity to study the ecological drivers that structure bacterial community diversity and assemblies in volcanic ecosystems and compare the older, more stable environments of lava tubes, to the more variable and extreme conditions of younger, geothermally active caves and fumaroles. Using 16S rRNA amplicon-based sequencing methods, we investigated the phylogenetic distinctness and diversity and identified microbial interactions and consortia through co-occurrence networks in 70 samples from lava tubes, geothermal lava caves, and fumaroles on the island of Hawai‘i. Our data illustrate that lava caves and geothermal sites harbor unique microbial communities, with very little overlap between caves or sites. We also found that older lava tubes (500–800 yrs old) hosted greater phylogenetic diversity (Faith's PD) than sites that were either geothermally active or younger (<400 yrs old). Geothermally active sites had a greater number of interactions and complexity than lava tubes. Average phylogenetic distinctness, a measure of the phylogenetic relatedness of a community, was higher than would be expected if communities were structured at random. This suggests that bacterial communities of Hawaiian volcanic environments are phylogenetically over-dispersed and that competitive exclusion is the main driver in structuring these communities. This was supported by network analyses that found that taxa (Class level) co-occurred with more distantly related organisms than close relatives, particularly in geothermal sites. Network “hubs” (taxa of potentially higher ecological importance) were not the most abundant taxa in either geothermal sites or lava tubes and were identified as unknown families or genera of the phyla, Chloroflexi and Acidobacteria. These results highlight the need for further study on the ecological role of microbes in caves through targeted culturing methods, metagenomics, and long-read sequence technologies.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Genetic programming for understanding cognitive biases that generate polarization in social networks

Recent studies have applied agent-based models to infer human-interpretable explanations of individual-scale behaviors that generate macro-scale patterns in complex social systems. Genetic programming has proven to be an ideal explainable AI tool for this purpose, where primitives may be expressed in an interpretable fashion and assembled into agent rules. Evolutionary model discovery (EMD) is a tool that combines genetic programming and random forest feature importance analysis, to infer individual-scale, human-interpretable explanations from agent-based models. We deploy EMD to investigate the cognitive biases behind the emergence of ideological polarization within a population. An agent-based model is developed to simulate a social network, where agents are able to create or sever links with one another, and update an internal ideological stance based on their neighbors' stances. Agent rules govern these actions and constitute of cognitive biases. A set of 7 cognitive biases are included as genetic program primitives in the search for rules that generate hyper-polarization among the population of agents. We find that heterogeneity in cognitive biases is more likely to generate polarized social networks. Highly polarized social networks are likely to emerge when individuals with confirmation bias are exposed to those with either attentional bias, egocentric bias, or cognitive dissonance.

Gunaratne, Chathika↗
DOE OSTI2024

A robust synthetic data generation framework for machine learning in high-resolution transmission electron microscopy (HRTEM)

Machine learning techniques are attractive options for developing highly-accurate analysis tools for nanomaterials characterization, including high-resolution transmission electron microscopy (HRTEM). However, successfully implementing such machine learning tools can be difficult due to the challenges in procuring sufficiently large, high-quality training datasets from experiments. In this work, we introduce Construction Zone, a Python package for rapid generation of complex nanoscale atomic structures which enables fast, systematic sampling of realistic nanomaterial structures and can be used as a random structure generator for large, diverse synthetic datasets. Using Construction Zone, we develop an end-to-end machine learning workflow for training neural network models to analyze experimental atomic resolution HRTEM images on the task of nanoparticle image segmentation purely with simulated databases. Further, we study the data curation process to understand how various aspects of the curated simulated data—including simulation fidelity, the distribution of atomic structures, and the distribution of imaging conditions—affect model performance across three benchmark experimental HRTEM image datasets. Using our workflow, we are able to achieve state-of-the-art segmentation performance on these experimental benchmarks and, further, we discuss robust strategies for consistently achieving high performance with machine learning in experimental settings using purely synthetic data. Construction Zone and its documentation are available at https://github.com/lerandc/construction_zone.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Active Learning Framework

Machine learning (ML) of interatomic potentials show great promise to accelerate scientific simulation, e.g., by emulating expensive computations at a high accuracy but much reduced computational cost. Training datasets are calculated from computationally expensive ab initio quantum mechanics methods, density functional theory (DFT). Trained on this data, an ML model can be very successful in predicting energy and forces for new atomic configurations. A critical factor is the quality and diversity of the training dataset. Thus, a highly automated approach to dataset construction based on active learning framework is designed suitable for material physics. The active learning scheme begins with fully randomized atomic configurations. Then, many Molecular Dynamics (MD) trajectories are simulated using current ML potentials, where each MD trajectory is initialized to a random disordered configuration. The temperature is varied in order to diversify the sampled configuration during these simulations. The variance of predictions for eight neural networks within an ensemble is analyzed to determine whether the model is operating as expected. This helps in determining whether collecting more data would be helpful to the model by checking the ensemble variance is greater than the threshold. In this case, the MD trajectory is terminated and the final atomic configuration is placed on a queue (SQL database) for DFT calculations and added to training dataset. Periodically, ML model is retrained to the updated training model. This Active Learning loop is iterated until the cost of MD simulations becomes prohibitively expensive. The MD simulations will hopefully be sufficiently robust to support nucleation after many active learning iterations. In this sense, active learning scheme must automatically discover the important low energy and nonequilibrium physics.

Nebgen, Benjamin↗
DOE OSTI2026

Entanglement-fidelity limits of photonically networked atomic qubits from recoil and timing

The remote entanglement of two atomic quantum memories through photonic interactions is accompanied by atomic momentum recoil. When the interactions occur at different times, such as from the random emission over the lifetime of the atomic excited state, the difference in recoil timing can expose “which-path” information and ultimately lead to decoherence. Time-bin encoded photonic qubits can be particularly sensitive to asynchronous recoil timing. In this paper we study the limits of entanglement fidelity in atomic systems due to recoil and other timing imbalances and show how these effects can be suppressed or even eliminated through proper experimental design.

Quantum communication↗
DOE OSTI2023

A Bayesian model for multivariate discrete data using spatial and expert information with application to inferring building attributes

When modeling sparsely observed multivariate data, strong prior information elicited from experts can be used to bolster predictive accuracy and counteract sampling bias. Similarly, modeling autocorrelation in space can help make use of co-occurrence patterns present in many types of spatial data. To make use of both expert prior information and spatial structure, we propose a novel graphical model for a spatial Bayesian network developed specifically to address challenges in inferring the attributes of buildings from geographically sparse observational data. This model is implemented as the sum of a spatial multivariate Gaussian random field and a tabular conditional probability function in real-valued space prior to projection onto the probability simplex. This modeling form is especially suitable for the usage of prior information in the form of sets of atomic rules obtained from experts. To perform inference with missing data, we implement a Markov chain Monte Carlo scheme composed of alternating steps of Gibbs sampling of missing entries and Hamiltonian Monte Carlo for model parameters. A case study in building attribution is presented to highlight the advantages and limitations of this approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Non-mercury methylating microbial taxa are integral to understanding links between mercury methylation and elemental cycles in marine and freshwater sediments

The goal of this study was to explore the role of non-mercury (Hg) methylating taxa in mercury methylation and to identify potential links between elemental cycles and Hg methylation. Statistical approaches were utilized to investigate the microbial community and biochemical functions in relation to methylmercury (MeHg) concentrations in marine and freshwater sediments. Sediments were collected from the methylation zone (top 15 cm) in four Hg-contaminated sites. Both abiotic (e.g., sulfate, sulfide, iron, salinity, total organic matter, etc.) and biotic factors (e.g., hgcA, abundances of methylating and non-methylating taxa) were quantified. Random forest and stepwise regression were performed to assess whether non-methylating taxa were significantly associated with MeHg concentration. Co-occurrence and functional network analyses were constructed to explore associations between taxa by examining microbial community structure, composition, and biochemical functions across sites. Regression analysis showed that approximately 80% of the variability in sediment MeHg concentration was predicted by total mercury concentration, the abundances of Hg methylating taxa, and the abundances of the non-Hg methylating taxa. The co-occurrence networks identified Paludibacteraceae and Syntrophorhabdaceae as keystone non Hg methylating taxa in multiple sites, indicating the potential for syntrophic interactions with Hg methylators. Strong associations were also observed between methanogens and sulfate-reducing bacteria, which were likely symbiotic associations. The functional network results suggested that non-Hg methylating taxa play important roles in sulfur respiration, nitrogen respiration, and the carbon metabolism-related functions methylotrophy, methanotrophy, and chemoheterotrophy. Interestingly, keystone functions varied by site and did not involve carbon- and sulfur-related functions only. In conclusion, our findings highlight associations between methylating and non-methylating taxa and sulfur, carbon, and nitrogen cycles in sediment methylation zones, with implications for predicting and understanding the impact of climate and land/sea use changes on Hg methylation.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Network-Scale Ubiquitous Volume Estimation Using Tree-Based Ensemble Learning Methods

Currently ubiquitous volume data for roadway networks remains the key missing dimension in traffic operations. Most volume data are average annual daily traffic (AADT) measures derived from the Highway Performance Monitoring System (HPMS). Although methods to factor the AADT to hourly averages for typical day of week exist, actual volume data is limited to a sparse collection of locations in which volumes are continuously recorded. This paper/poster explores the use of state-of-art machine learning techniques to estimate accurate volume measures that span the highway network providing ubiquitous coverage in space, and point-in-time measures for a specific date and time. Three tree-based ensemble learning models, random forest (RF), gradient boost machine (GBM), and extreme gradient boost (XGBoost), were tested for volume estimation by learning from combined dataset of commercial probe data provided by TomTom, the FHWA's Travel Monitoring Analysis System (TMAS) data, and other infrastructure attributes such as number of lanes, speed limit, and weather. The methods were tested on major corridors and freeways in the metropolitan area of Denver. All three machine learning methods were able to provide hourly volume estimates 24 hours a day, 7 days a week, and 365 days a year with around 18% mean absolute error to true volume and about 5% of error with respect to roadway capacity. The low error measures allow the potential application by transportation agencies.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2022

Entanglement perspective on the quantum approximate optimization algorithm

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial N -qubit product state | 0 〉 ⊗ N and the final one regarding entanglement? Here, we consider the QAOA algorithm for solving the paradigmatic MaxCut problem on different types of graphs. We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits and find that there is a volume-law entanglement barrier between the initial and final states. We also investigate the entanglement spectrum in connection with random matrix theory. In addition, we compare the entanglement production with a quantum annealing protocol aiming to solve the same MaxCut problems. Finally, we discuss the implications of our results for the simulation of QAOA circuits with tensor network-based methods relying on low-entanglement for efficiency, such as matrix product states.

Dupont, Maxime↗
DOE OSTI2021

Skip-Connected Self-Recurrent Spiking Neural Networks with Joint Intrinsic Parameter and Synaptic Weight Training

As an important class of spiking neural networks (SNNs), recurrent spiking neural networks (RSNNs) possess great computational power and have been widely used for processing sequential data like audio and text. However, most RSNNs suffer from two problems. 1. Due to the lack of architectural guidance, random recurrent connectivity is often adopted, which does not guarantee good performance. 2. Training of RSNNs is in general challenging, bottlenecking achievable model accuracy. To address these problems, we propose a new type of RSNNs called Skip-Connected Self-Recurrent SNNs (ScSr-SNNs). Recurrence in ScSr-SNNs is introduced in a stereotyped manner by adding self-recurrent connections to spiking neurons. The SNNs with self-recurrent connections can realize recurrent behaviors similar to those of more complex RSNNs while the error gradients can be more straightforwardly calculated due to the mostly feedforward nature of the network. The network dynamics is enriched by skip connections between nonadjacent layers. Moreover, we propose a new backpropagation (BP) method called backpropagated intrinsic plasticity (BIP) to further boost the performance of ScSr-SNNs by training intrinsic model parameters. Unlike standard intrinsic plasticity rules that adjust the neuron's intrinsic parameters according to neuronal activity, the proposed BIP method optimizes intrinsic parameters based on the backpropagated error gradient of a well-defined global loss function in addition to synaptic weight training. Here, based on challenging speech, neuromorphic speech, and neuromorphic image datasets, the proposed ScSr-SNNs can boost performance by up to 2.85% compared with other types of RSNNs trained by state-of-the-art BP methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Computational Power of Random Quantum Circuits in Arbitrary Geometries

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of approximately 50 qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and, therefore, how much infidelity is suffered) in generating highly entangled states. Here, we describe recent hardware upgrades to Quantinuum’s H2 quantum computer, enabling it to operate on up to 56 qubits with arbitrary connectivity and 99.843(5)% two-qubit gate fidelity. We define a class of circuits with random geometries that become hard to classically simulate in very low depth and implement them utilizing the flexible connectivity of H2. A careful analysis demonstrating the fast saturation of classical simulation complexity with depth indicates that H2 can yield data well beyond the reach of state-of-the art classical simulation methods at unprecedented fidelities. We find that the considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the quantum charge-coupled device architecture as continued progress is made toward building larger machines. Published by the American Physical Society 2025

DeCross, M.↗
DOE OSTI2021

Voltage Estimation in Low-Voltage Distribution Grids with Distributed Energy Resources

Present distribution grids generally have limited sensing capabilities and are therefore characterized by low observability. Improved observability is a prerequisite for increasing the hosting capacity of distributed energy resources such as solar photovoltaics (PV) in distribution grids. In this context, this paper presents learning-aided low-voltage estimation using untapped but readily available and widely distributed sensors from cable television (CATV) networks. The cable broadband sensors offer timely local voltage magnitude sensing with 5-minute resolution and can provide an order of magnitude more data on the time-varying state of a secondary distribution system than currently deployed utility sensors. The proposed solution incorporates voltage readings from neighboring CATV sensors, taking into account spatio-temporal aspects of the observations, and estimates single-phase voltage magnitudes at all non-monitored low-voltage buses using random forests. The effectiveness of the proposed approach was demonstrated using a multi-phase 1572-bus feeder from the SMART-DS data set for two case studies passive distribution feeder (without PV) and active distribution feeder (with PV). The analysis was conducted on simulated data, and the results show voltage estimates with a high degree of accuracy, even at extremely low percentages of observable nodes.

24 POWER TRANSMISSION AND DISTRIBUTION↗