Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “edge 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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

5G Energy FRAME: The Design and Implementation of Data, Model, and Use Case (Year 2 Report)

This report summarizes the Year 2 work of Pacific Northwest National Laboratory’s (PNNL’s) 5G Fabricated Resource and Asset Management Encompassment for energy infrastructure (Energy FRAME) project funded by the Department of Energy Office of Science’s Advanced Scientific Computing Research (ASCR) Program. In this report, newest 5G equipment testing results are presented, along with two 5G-enabled AI/ML examples for grid applications; in addition, the work flow of grid edge, cloud, and High Performance Computing (HPC) platform is introduced, to support and interface the cross-domain simulation for power system transmission, distribution, and communication networks. Last but not least, the outlook for Year 3 work and the overarching impact of 5G Energy FRAME work to a multitude of stakeholders are provided. Additional 5G performance data now is shared through the publicly available weblink, https://www.pnnl.gov/projects/5g-energy-frame/publications

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Track Seeding and Labelling with Embedded-space Graph Neural Networks

To address the unprecedented scale of HL-LHC data, the Exa.TrkX project is investigating a variety of machine learning approaches to particle track reconstruction. The most promising of these solutions, graph neural networks (GNN), process the event as a graph that connects track measurements (detector hits corresponding to nodes) with candidate line segments between the hits (corresponding to edges). Detector information can be associated with nodes and edges, enabling a GNN to propagate the embedded parameters around the graph and predict node-, edge- and graph-level observables. Previously, message-passing GNNs have shown success in predicting doublet likelihood, and we here report updates on the state-of-the-art architectures for this task. In addition, the Exa.TrkX project has investigated innovations in both graph construction, and embedded representations, in an effort to achieve fully learned end-to-end track finding. Hence, we present a suite of extensions to the original model, with encouraging results for hitgraph classification. In addition, we explore increased performance by constructing graphs from learned representations which contain non-linear metric structure, allowing for efficient clustering and neighborhood queries of data points. We demonstrate how this framework fits in with both traditional clustering pipelines, and GNN approaches. The embedded graphs feed into high-accuracy doublet and triplet classifiers, or can be used as an end-to-end track classifier by clustering in an embedded space. A set of post-processing methods improve performance with knowledge of the detector physics. Finally, we present numerical results on the TrackML particle tracking challenge dataset, where our framework shows favorable results in both seeding and track finding.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Almost strong zero modes at finite temperature

Interacting fermionic chains exhibit extended regions of topological degeneracy of their ground states as a result of the presence of Majorana or parafermionic zero modes localized at the edges. In the opposite limit of infinite temperature, the corresponding nonintegrable spin chains, obtained via generalized Jordan-Wigner mapping, are known to host so-called almost strong zero modes, which are long-lived with respect to any bulk excitations. Here we study the fairly unexplored territory that bridges these two extreme cases of zero and infinite temperature. We blend two established techniques for states, the Lanczos series expansion and a tensor network ansatz, uplifting them to the level of operator algebra. This allows us to efficiently simulate large system sizes for arbitrarily long timescales and to extract the temperature-dependent decay rates. We observe that for the Kitaev-Hubbard model, the decay rate of the edge mode depends exponentially on the inverse temperature 𝛽, and on an effective energy scale Δ eff that is greater than the thermodynamic gap of the system Δ.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Leveraging inter-firm influence in the diffusion of energy efficiency technologies: An agent-based model

Energy efficiency technologies (EETs) are crucial for saving energy and reducing carbon dioxide emissions. However, the diffusion of EETs in small and medium-sized enterprises is rather slow. Literature shows the interactions between innovation adopters and potential adopters have significant impacts on innovation diffusion. Enterprises lack the motivation to share information, and EETs usually lack observability, which suppress the inter-firm influence. Thus, an information platform, together with proper policies encouraging or forcing enterprises to disclose EET-related information, should help harness inter-firm influence to accelerate EETs' diffusion. To explore whether and how such an information platform affects EETs' diffusion in small and medium-sized enterprises, this report builds an agent-based model to mimic EET diffusion processes. Based on a series of controlled numerical experiments, some counter-intuitive phenomena are discovered and explained. The results show that the information platform is a double-edged sword that notably accelerates EETs' diffusion by approximately 47% but may also boost negative information to diffuse even faster and delay massive adoption of EETs. Increasing network density and the intensity of inter-firm influence are effective to speed EET diffusion, but their impacts diminish drastically after reaching some critical values (0.05 and 0.15 respectively) and eventually harm the stability of the system. Ultimately, the findings implicate that EET suppliers should carefully launch their promising but immature products; policies that can reduce the perceived risk by enterprises and the effort to maintain an informative rather than judgmental information platform can prominently mitigate the negative side effects brought by high fluidity of information.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

Dendritic Computing with Multigate Ferroelectric Field-Effect Transistors

Although inspired by neuronal systems in the brain, artificial neural networks generally employ point-neurons, which offer computational complexity far less than that of their biological counterparts. Neurons have dendritic arbors that connect to different sets of synapses and offer local nonlinear accumulation – playing a pivotal role in processing and learning. Inspired by this, we propose a novel neuron design based on a multigate ferroelectric field-effect transistor that mimics dendrites. It leverages ferroelectric nonlinearity for local computations within dendritic branches while utilizing the transistor action to generate the neuronal output. The branched architecture enables smaller crossbar arrays in hardware integration, improving efficiency. Using an experimentally calibrated device-circuit-algorithm cosimulation framework, we demonstrate that networks incorporating our dendritic neurons achieve superior performance compared to much larger networks without dendrites (∼ 17× fewer trainable weight parameters). These findings suggest that dendritic hardware can significantly improve computational efficiency and learning capacity of neuromorphic systems optimized for edge applications.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Attention-Augmented Parametric Kernel Graph Neural Network (APKGNN) for Node Classification

We present a new graph neural network, the Attention-based Parametric-Kernel augmented Graph Neural Network (APKGNN), developed for node classification tasks. Despite extensive work on modeling multi-faceted relationships between connected nodes of a graph, the effect of attention on edge features mapped to relationships has not yet been analyzed through learning representation. This study derives such an attention vector by first calculating node features corresponding to endpoints of an edge and then aggregating these with extracted local intrinsic patches of a given graph to generate augmented local patch vectors. This process uses a parametric kernel based on Gaussian mixture models (GMMs) to embed local neighborhoods of the graph in local patches. The patch vectors then convolve with the above node features to produce an updated node representation. We show that this new learning representation (APKGNN) achieves higher node classification accuracy on tasks - both standard benchmarks (Cora, PubMed, Citeseer) and new experimental short text corpora where nodes correspond to text documents and words. This implementation of the GNN convolution layer outperforms state-of-the-art (SOTA) algorithms, achieving higher training, validation, and test accuracy by a significant margin on three standard benchmark data sets under both SOTA experimental settings and those for new testbeds.

Bose, Avishek↗
DOE OSTI2021

EdgeAI: How to Use AI to Collect Reliable and Relevant Watershed Data

Focal Area(s): Focal areas are on data acquisition and assimilation enabled by AI, advanced methods including experimental/network design/optimization, unsupervised learning (including deep learning), and hardware-related efforts involving AI (e.g., edge computing). Science Challenge: The transformational science challenge that we address is the following: – Ensuring, in near real-time, that the data collected from distributed sensor networks is accurate and contains useful information to identify, quantify, and predict watershed and ecosystem dynamic responses to short- and long-term perturbations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Tightest Mixed-Integer Programming Formulations for Quadratic SCUC Optimization

In this project, we developed new, tighter Mixed-Integer Programming (MIP) formulations for the combined Alternating Current (AC) Security-Constrained Unit Commitment (SCUC) and Security-Constrained Optimal Power Flow (SCOPF). The work addresses a critical challenge in power system operations: efficiently determining which generation units to commit and how to optimally dispatch them while maintaining network reliability constraints for both normal and contingency scenarios. Our efforts: 1. Advance the Understanding of SCUC/SCOPF Modeling: By introducing tighter MIP formulations and leveraging cutting-edge optimization tools (Julia/JuMP, PowerModels.jl), this project has pushed forward the state of the art in efficient power systems scheduling. 2. Enhance Technical and Economic Feasibility: The methods developed provide more accurate and potentially faster solutions to large-scale, realistic scheduling and dispatch problems in electric power systems, which can translate into improved reliability and potentially lower costs for grid operations. 3. Benefit to the Public: Greater efficiency in power system operations leads to cost savings for utilities and end-users. Improved reliability and integration of advanced modeling approaches can facilitate the adoption of clean energy resources and better accommodate uncertainties in renewable generation. Because this technology could impact bulk power markets and reliability, these innovations have far-reaching public benefits in terms of cost savings, reliability, and sustainability.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Sensitivity Analysis in the Presence of Intrinsic Stochasticity for Discrete Fracture Network Simulations

Abstract Large‐scale discrete fracture network (DFN) simulators are standard fare for studies involving the sub‐surface transport of particles since direct observation of real world underground fracture networks is generally infeasible. While these simulators have successfully been used in several engineering applications, estimates of output quantities of interest (QoI) — such as breakthrough time of particles reaching the edge of the system — suffer from two distinct types of uncertainty. A run of a DFN simulator requires several parameters to be set that dictate the placement and size of fractures, the density of fractures, and the overall permeability of the system; uncertainty on the proper parameters will lead to uncertainty in the QoI, called epistemic uncertainty. Furthermore, since these input settings to DFN simulators control the stochastic processes which place fractures and govern flow, understanding how this randomness affects the QoI requires several runs of the simulator at distinct random seeds. The uncertainty in the QoI attributed to different realizations (i.e., different seeds) of the same random process (i.e., identical input parameters) leads to a second type of uncertainty, called aleatoric uncertainty. In this paper, we perform a Sensitivity Analysis, which directly attributes the uncertainty observed in the QoI to the epistemic uncertainty from each input parameter and to the aleatoric uncertainty. Beyond the specific takeaways on which input variables influence uncertainty in the QoI the most, a major contribution of this paper is the introduction of a statistically rigorous workflow for characterizing the uncertainty in DFN flow simulations that exhibit heteroskedasticity.

58 GEOSCIENCES↗
DOE OSTI2023

Advancing energy storage through solubility prediction: leveraging the potential of deep learning

Solubility prediction plays a crucial role in energy storage applications, such as redox flow batteries, because it directly affects the efficiency and reliability. Researchers have developed various methods that utilize quantum calculations and descriptors to predict the aqueous solubilities of organic molecules. Notably, machine learning models based on descriptors have shown promise for solubility prediction. As deep learning tools, graph neural networks (GNNs) have emerged to capture complex structure–property relationships for material property prediction. Specifically, MolGAT, a type of GNN model, was designed to incorporate n-dimensional edge attributes, enabling the modeling of intricacies in molecular graphs and enhancing the prediction capabilities. In a previous study, MolGAT successfully screened 23 467 promising redox-active molecules from a database of over 500 000 compounds, based on redox potential predictions. This study focused on applying the MolGAT model to predict the aqueous solubility (log S) of a broad range of organic compounds, including those previously screened for redox activity. The model was trained on a diverse sample of 8494 organic molecules from AqSolDB and benchmarked against literature data, demonstrating superior accuracy compared with other state of the art graph-based and descriptor-based models. Subsequently, the trained MolGAT model was employed to screen redox-active organic compounds identified in the first phase of high-throughput virtual screening, targeting favorable solubility in energy storage applications. The second round of screening, which considered solubility, yielded 12 332 promising redox-active and soluble organic molecules suitable for use in aqueous redox flow batteries. Thus, the two-phase high-throughput virtual screening approach utilizing MolGAT, specifically trained for redox potential and solubility, is an effective strategy for selecting suitable intrinsically soluble redox-active molecules from extensive databases, potentially advancing energy storage through reliable material development. This indicates that the model is reliable for predicting the solubility of various molecules and provides valuable insights for energy storage, pharmaceutical, environmental, and chemical applications.

25 ENERGY STORAGE↗
DOE OSTI2024

Multi-Agent Graph-Attention Deep Reinforcement Learning for Post-Contingency Grid Emergency Voltage Control

Grid emergency voltage control (GEVC) is paramount in electric power systems to improve voltage stability and prevent cascading outages and blackouts in case of contingencies. While most deep reinforcement learning (DRL)-based paradigms perform single agents in a static environment, real-world agents for GEVC are expected to cooperate in a dynamically shifting grid. Moreover, due to high uncertainties from combinatory natures of various contingencies and load consumption, along with the complexity of dynamic grid operation, the data efficiency and control performance of the existing DRL-based methods are challenged. To address these limitations, we propose a multi-agent graph-attention (GATT)-based DRL algorithm for GEVC in multi-area power systems. Here, we develop graph convolutional network (GCN)-based agents for feature representation of the graph-structured voltages to improve the decision accuracy in a data-efficient manner. Furthermore, a cutting-edge attention mechanism concentrates on effective information sharing among multiple agents, synergizing different-sized subnetworks in the grid for cooperative learning. We address several key challenges in the existing DRL-based GEVC approaches, including low scalability and poor stability against high uncertainties. Test results in the IEEE benchmark system verify the advantages of the proposed method over several recent multi-agent DRL-based algorithms.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

ITeM: Independent temporal motifs to summarize and compare temporal networks

We report networks are a fundamental and flexible way of representing various complex systems. Many domains such as communication, citation, procurement, biology, social media, and transportation can be modeled as a set of entities and their relationships. Temporal networks are a specialization of general networks where every relationship occurs at a discrete time. The temporal evolution of such networks is as important to understand as the structure of the entities and relationships. We present the Independent Temporal Motif (ITeM) to characterize temporal graphs from different domains. ITeMs can be used to model the structure and the evolution of the graph. In contrast to existing work, ITeMs are edge-disjoint directed motifs that measure the temporal evolution of ordered edges within the motif. For a given temporal graph, we produce a feature vector of ITeM frequencies and the time it takes to form the ITeM instances. We apply this distribution to measure the similarity of temporal graphs. We show that ITeM has higher accuracy than other motif frequency-based approaches. We define various ITeM-based metrics that reveal salient properties of a temporal network. We also present importance sampling as a method to efficiently estimate the ITeM counts. We present a distributed implementation of the ITeM discovery algorithm using Apache Spark and GraphFrame. We evaluate our approach on both synthetic and real temporal networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Classifying metal‐binding sites with neural networks

Abstract To advance our ability to predict impacts of the protein scaffold on catalysis, robust classification schemes to define features of proteins that will influence reactivity are needed. One of these features is a protein's metal‐binding ability, as metals are critical to catalytic conversion by metalloenzymes. As a step toward realizing this goal, we used convolutional neural networks (CNNs) to enable the classification of a metal cofactor binding pocket within a protein scaffold. CNNs enable images to be classified based on multiple levels of detail in the image, from edges and corners to entire objects, and can provide rapid classification. First, six CNN models were fine‐tuned to classify the 20 standard amino acids to choose a performant model for amino acid classification. This model was then trained in two parallel efforts: to classify a 2D image of the environment within a given radius of the central metal binding site, either an Fe ion or a [2Fe‐2S] cofactor, with the metal visible (effort 1) or the metal hidden (effort 2). We further used two sub‐classifications of the [2Fe‐2S] cofactor: (1) a standard [2Fe‐2S] cofactor and (2) a Rieske [2Fe‐2S] cofactor. The accuracy for the model correctly identifying all three defined features was >95%, despite our perception of the increased challenge of the metalloenzyme identification. This demonstrates that machine learning methodology to classify and distinguish similar metal‐binding sites, even in the absence of a visible cofactor, is indeed possible and offers an additional tool for metal‐binding site identification in proteins.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

A Privacy-Aware Federated Learning Framework for Distributed Energy Resource Analytics in Constrained Environments

To be resilient against extreme weather events, the rural communities in Puerto Rico are leveraging distributed energy resources (DER). However, computing frameworks sup-porting the grid in critical decision-making are still largely centralized. Sensitive consumer data are transmitted over the Internet or cellular networks to a secondary or tertiary node. It guarantees better situational awareness at the cost of a wider attack surface, jeopardizing user privacy, as more DER come online. Cloud, Edge, and Fog computing all require data aggregation at some level. This paper introduces a privacy-aware federated learning framework that leverages the Fog model by pushing analytics all the way to the DER and load assets. These local models train on individual asset data and transmit only learned parameters (such as weights) over secure communications to a global decision-maker. By abstracting personally identifiable consumer data without impacting decision optimality, this framework better aligns with distributed power generation paradigm.

Sundararajan, Aditya↗
DOE OSTI2022

Graph Neural Networks for Charged Particle Tracking on FPGAs

The determination of charged particle trajectories in collisions at the CERN Large Hadron Collider (LHC) is an important but challenging problem, especially in the high interaction density conditions expected during the future high-luminosity phase of the LHC (HL-LHC). Graph neural networks (GNNs) are a type of geometric deep learning algorithm that has successfully been applied to this task by embedding tracker data as a graph—nodes represent hits, while edges represent possible track segments—and classifying the edges as true or fake track segments. However, their study in hardware- or software-based trigger applications has been limited due to their large computational cost. In this paper, we introduce an automated translation workflow, integrated into a broader tool called hls4ml , for converting GNNs into firmware for field-programmable gate arrays (FPGAs). We use this translation tool to implement GNNs for charged particle tracking, trained using the TrackML challenge dataset, on FPGAs with designs targeting different graph sizes, task complexites, and latency/throughput requirements. This work could enable the inclusion of charged particle tracking GNNs at the trigger level for HL-LHC experiments.

Elabd, Abdelrahman↗
DOE OSTI2025

A Grassroots Network and Community Roadmap for Interconnected Autonomous Science Laboratories for Accelerated Discovery

Scientific discovery is being revolutionized by AI and autonomous systems, yet current autonomous laboratories remain isolated islands unable to collaborate across institutions. We present the Autonomous Interconnected Science Lab Ecosystem (AISLE), a grassroots network transforming fragmented capabilities into a unified system that shorten the path from ideation to innovation to impact and accelerates discovery from decades to months. AISLE addresses five critical dimensions: (1) cross-institutional equipment orchestration, (2) intelligent data management with FAIR compliance, (3) AI-agent driven orchestration grounded in scientific principles, (4) interoperable agent communication interfaces, and (5) AI/ML-integrated scientific education. By connecting autonomous agents across institutional boundaries, autonomous science can unlock research spaces inaccessible to traditional approaches while democratizing cutting-edge technologies. This paradigm shift toward collaborative autonomous science promises breakthroughs in sustainable energy, materials development, and public health.

Ferreira da Silva, Rafael [Oak Ridge National Labo↗
DOE OSTI2020

Direction-optimizing Label Propagation and its Application for Community Detection

Label Propagation is a machine learning algorithm typically used for classification. It has also been found to be an effective method for detecting communities in networks. It has two attractive features as a community detection method: it has nearly linear runtime and it requires no \textit{a priori} community information. We propose a new Direction Optimizing Label Propagation Algorithm (DOLPA) that relies on the use of {\em frontiers} and alternates between label {\em push} and label {\em pull} operations to enhance the performance of LPA. Specifically, DOLPA has parameters for tuning the processing order of vertices in a graph. This reduces the number of edges visited and improves the quality of solution. We apply DOLPA to community detection and present the design and implementation of the algorithm as well as its shared-memory parallelization using OpenMP. Empirically, we evaluate our algorithm using synthetic graphs as well as real-world networks. Compared with the state-of-art \textit{Parallel Label Propagation} algorithm, we achieve at least two times the F-Score while reducing the runtime by 50\% for synthetic graphs with overlapping communities. We also compare DOLPA against the state-of-art parallel implementation of the Louvain method using the same graphs and show that DOLPA achieves about three times the F-Score at 10\% the runtime. On real-world graphs, we get a speedup of up to $10\times$ using 64 threads.

Liu, X↗
DOE OSTI2024

Mo 3 S 13 Chalcogel: A High-Capacity Electrode for Conversion-Based Li-Ion Batteries

Despite large theoretical energy densities, metal-sulfide electrodes for energy storage systems face several limitations that impact the practical realization. Here, we present the solution-processable, room temperature (RT) synthesis, local structures, and application of a sulfur-rich Mo 3 S 13 chalcogel as a conversion-based electrode for lithium-sulfide batteries (LiSBs). The structure of the amorphous Mo 3 S 13 chalcogel is derived through operando Raman spectroscopy, synchrotron X-ray pair distribution function (PDF), X-ray absorption near edge structure (XANES), and extended X-ray absorption fine structure (EXAFS) analysis, along with ab initio molecular dynamics (AIMD) simulations. A key feature of the three-dimensional (3D) network is the connection of Mo 3 S 13 units through S–S bonds. Li/Mo 3 S 13 half-cells deliver initial capacity of 1013 mAh g –1 during the first discharge. After the activation cycles, the capacity stabilizes and maintains 312 mAh g –1 at a C/3 rate after 140 cycles, demonstrating sustained performance over subsequent cycling. Such high-capacity and stability are attributed to the high density of (poly)sulfide bonds and the stable Mo–S coordination in Mo 3 S 13 chalcogel. Importantly, these findings showcase the potential of Mo 3 S 13 chalcogels as metal-sulfide electrode materials for LiSBs.

25 ENERGY STORAGE↗