Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Real world 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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Combining compositional data sets introduces error in covariance network reconstruction

Microbial communities are diverse biological systems that include taxa from across multiple kingdoms of life. Notably, interactions between bacteria and fungi play a significant role in determining community structure. However, these statistical associations across kingdoms are more difficult to infer than intra-kingdom associations due to the nature of the data involved using standard network inference techniques. We quantify the challenges of cross-kingdom network inference from both theoretical and practical points of view using synthetic and real-world microbiome data. We detail the theoretical issue presented by combining compositional data sets drawn from the same environment, e.g. 16S and ITS sequencing of a single set of samples, and we survey common network inference techniques for their ability to handle this error. We then test these techniques for the accuracy and usefulness of their intra- and interkingdom associations by inferring networks from a set of simulated samples for which a ground-truth set of associations is known. We show that while the two methods mitigate the error of cross-kingdom inference, there is little difference between techniques for key practical applications including identification of strong correlations and identification of possible keystone taxa (i.e. hub nodes in the network). Furthermore, we identify a signature of the error caused by transkingdom network inference and demonstrate that it appears in networks constructed using real-world environmental microbiome data.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Combining compositional data sets introduces error in covariance network reconstruction

Microbial communities are diverse biological systems that include taxa from across multiple kingdoms of life. Notably, interactions between bacteria and fungi play a significant role in determining community structure. However, these statistical associations across kingdoms are more difficult to infer than intra-kingdom associations due to the nature of the data involved using standard network inference techniques. We quantify the challenges of cross-kingdom network inference from both theoretical and practical points of view using synthetic and real-world microbiome data. We detail the theoretical issue presented by combining compositional data sets drawn from the same environment, e.g. 16S and ITS sequencing of a single set of samples, and we survey common network inference techniques for their ability to handle this error. We then test these techniques for the accuracy and usefulness of their intra- and inter-kingdom associations by inferring networks from a set of simulated samples for which a ground-truth set of associations is known. We show that while the two methods mitigate the error of cross-kingdom inference, there is little difference between techniques for key practical applications including identification of strong correlations and identification of possible keystone taxa (i.e. hub nodes in the network). Furthermore, we identify a signature of the error caused by transkingdom network inference and demonstrate that it appears in networks constructed using real-world environmental microbiome data.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

An Ensemble of Neural Networks for Moist Physics Processes, Its Generalizability and Stable Integration

Abstract With the recent advances in data science, machine learning has been increasingly applied to convection and cloud parameterizations in global climate models (GCMs). This study extends the work of Han et al. (2020, https://doi.org/10.1029/2020MS002076 ) and uses an ensemble of 32‐layer deep convolutional residual neural networks, referred to as ResCu‐en, to emulate convection and cloud processes simulated by a superparameterized GCM, SPCAM. ResCu‐en predicts GCM grid‐scale temperature and moisture tendencies, and cloud liquid and ice water contents from moist physics processes. The surface rainfall is derived from the column‐integrated moisture tendency. The prediction uncertainty inherent in deep learning algorithms in emulating the moist physics is reduced by ensemble averaging. Results in 1‐year independent offline validation show that ResCu‐en has high prediction accuracy for all output variables, both in the current climate and in a warmer climate with +4K sea surface temperature. The analysis of different neural net configurations shows that the success to generalize in a warmer climate is attributed to convective memory and the 1‐dimensional convolution layers incorporated into ResCu‐en. We further implement a member of ResCu‐en into CAM5 with real world geography and run the neural‐network‐enabled CAM5 (NCAM) for 5 years without encountering any numerical integration instability. The simulation generally captures the global distribution of the mean precipitation, with a better simulation of precipitation intensity and diurnal cycle. However, there are large biases in temperature and moisture in high latitudes. These results highlight the importance of convective memory and demonstrate the potential for machine learning to enhance climate modeling.

Meteorology & Atmospheric Sciences↗
DOE OSTI2021

Location Selection of Fast-Charging Station for Heavy-Duty EVs Using GIS and Grid Analysis: Preprint

This work presents a systematic methodology for the location selection of fast-charging stations for heavy-duty Electric Vehicles (EVs) based on both geospatial and electrical grid analysis. The geo-spatial analysis is based on real-world geographic information system (GIS) data of road networks and existing supportive infrastructures. The grid analysis is implemented based on node level analysis of potential impacts on voltages and power losses in distribution system. A case study using realistic three-phase unbalanced distribution feeder from California and extracted real-world GIS data is used to demonstrate the intuitiveness and effectiveness of the proposed methodology for the location selection of fast charging station for heavy duty EVs.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Cyber-Secure and Safe Operation of Solar Photovoltaic Power Distribution Systems

Solar photovoltaic (PV)-rich power distribution systems are networked Cyber-Physical Systems (CPS). These are control systems where multiple computing nodes and diverse intelligent agents interact with the physical world in real-time. However, the presence of networked components renders them vulnerable to potential cyber-attacks, cyber-intrusions, and other malicious events. This is because these systems depend on the measurements reported from their heterogeneous sensors. This makes them vulnerable to potential cyber-attacks where malicious agents can compromise the sensors or the communication networks carrying the sensor measurements. This paper proposes a novel methodology for enhancing the cyber-security and cyber-resilient post-attack safe operation of solar PV-rich power distribution systems against potential cyber-attacks through the Dynamic Watermarking (DW), using online system identification. The resiliency of the proposed technique is tested and validated with several attack scenarios on both a lab-scale 3kW grid-connected PV inverter and a Hardware-in-the-Loop (HiL) system. The proposed approach can be applied to other types of power distribution systems to enhance their cyber-secure and cyber-resilient safe operation. This paper thereby contributes to the field of cyber-security of Cyber-Physical Energy Systems (CPES).

Kim, Jaewon↗
DOE OSTI2026

Pull Force Evaluation of CCS Insulated End Caps

Insulated end caps installed on DC pins of Combined Charging System (CCS) inlets have been identified as potential debris sources within electric vehicle supply equipment (EVSE) connectors, increasing the risk of electric shock and fire hazards. Although standards such as IEC 62196-1:2022 specify mechanical pull-force requirements for these end caps, it remains unclear whether these requirements provide adequate robustness under real-world conditions. To address this concern, the National Charging Experience (ChargeX) Consortium's Hardware Task Force conducted evaluations of insulated end caps used in OEM CCS inlets. This study assesses the performance of insulated end caps used in OEM CCS inlets, specifically those installed on DC pins, using the procedures defined in IEC 62196-1:2022 (Section Sign) 26.7 and SAE J3400, supplemented by additional experimental conditioning. To ensure relevance to real-world conditions, NLR collaborated with charging network operators (CNOs) to guide the selection of charging inlet samples. Material analyses of the insulated end cap samples were conducted to confirm that the tested materials reflected the types and properties commonly observed in the field. The selected samples underwent temperature and humidity conditioning followed by pull-force testing to evaluate the end-cap integrity. Although SAE J3400 inlets were not directly tested due to limited diversity in available field data, the underlying end-cap principles between CCS and SAE J3400 are comparable, allowing the study's insights to be relevant to both technologies. Overall, this study provides a structured evaluation framework to inform potential refinements to mechanical pull-force requirements in charging standards.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

Location Selection of Fast-Charging Station for Heavy-Duty EVs Using GIS and Grid Analysis

This work presents a systematic methodology for the location selection of fast-charging stations for heavy-duty electric vehicles (EVs) based on both geospatial and electric grid analysis. The geospatial analysis is based on real-world geographic information system (GIS) data of road networks and existing supportive infrastructures. The grid analysis is implemented based on node-level analysis of potential impacts on voltages and power losses in the distribution system. A case study using a realistic, three-phase, unbalanced distribution feeder from California and extracted real-world GIS data is used to demonstrate the intuitiveness and effectiveness of the proposed methodology for the location selection of fast-charging stations for heavy-duty EVs considering both electric and existing transportation infrastructures.

47 OTHER INSTRUMENTATION↗
NASA NTRS1997

Replanning Using Hierarchical Task Network and Operator-Based Planning

In order to scale-up to real-world problems, planning systems must be able to replan in order to deal with changes in problem context. In this paper we describe hierarchical task network and operatorbased re-planning techniques which allow adaptation of a previous plan to account for problems associated with executing plans in real-world domains with uncertainty, concurrency, changing objectives.

HTN/operator-based planning↗
DOE OSTI2020

AWB-GCN: A Graph Convolutional Network Accelerator with Runtime Workload Rebalancing

The recent development of deep learning has been mostly focusing on Euclidean data, such as images, videos, audios, etc. However, most real-world information and relation are often expressed as graphs. To efficiently learn from graph data, graph convolutional networks (GCNs) emerge as a promising approach, showing advantages in several practical applications such as social network analysis, knowledge discovery, 3D modeling, motion capturing, etc. Real-world graphs are usually extremely large and imbalanced, posting significant performance demand and design challenges on the hardware dedicated for GCN inference. In this paper, we propose an architecture design called UW-GCN to accelerate graph convolutional network inference. To tackle the major performance bottleneck from workload imbalance, we propose dynamic neighborhood stealing and remote chunk shuffling techniques, relying on hardware flexibility to achieve hardware auto-tuning under negligible area or delay overhead. Specifically, UW-GCN is able to smartly profile the sparse graph pattern while continuously adjusting the workload distribution via routing reconfiguration among parallel processing elements (PEs). The ideal configuration is then reused in the remaining iterations. To the best of our knowledge, this is the first accelerator design particularly for GCN and the first work relying on hardware auto-tuning, which is normally based on software, to achieve near-optimal workload balance in processing sparse structures.

Geng, Tong↗
DOE OSTI2025

5G-TSN Architecture Capable of Providing Real-time Situational Awareness to Fossil-Energy (FE) Generation Systems (Final Technical Report)

This final report highlights the comprehensive achievements of the project focused on developing and validating a 5G-Time Sensitive Networking (TSN) architecture tailored for real-time operational awareness in fossil energy systems. The initiative successfully advanced through a series of technical milestones, including the integration of EMI-aware network models, deployment of advanced simulation frameworks, and real-world performance characterization at key sites such as UTEP and Fabens. Through the strategic use of NetSim® software, the team created and validated network configurations for wired and wireless environments, tested under varying congestion conditions, and verified network slicing implementations for URLLC-specific applications. Major accomplishments include the migration of simulation tools to the latest NetSim® version to support accurate modeling of TSN and network slicing, extensive EMI measurement campaigns, and the development of a robust simulation model for end-to-end SCADA system integration. Simulations compared both TDD and FDD duplexing modes, revealing insights into their performance under congested conditions. The wireless network was benchmarked for throughput, jitter, and delay metrics, aligning with 3GPP Release 15/16 and IEEE 802.1-TSN standards. A peer-reviewed conference paper was accepted and published, contributing to the broader academic and industrial discourse on 5G-TSN integration in energy systems, in addition to a journal article. Despite minor delays due to software limitations, the project achieved its objectives and delivered validated architecture ready for deployment in advanced energy network environments.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2020

Generalized Canonical Polyadic Tensor Decomposition

Tensor decomposition is a fundamental unsupervised machine learning method in data science, with applications including network analysis and sensor data processing. This work develops a generalized canonical polyadic (GCP) low-rank tensor decomposition that allows other loss functions besides squared error. For instance, we can use logistic loss or Kullback--Leibler divergence, enabling tensor decomposition for binary or count data. We present a variety of statistically motivated loss functions for various scenarios. We provide a generalized framework for computing gradients and handling missing data that enables the use of standard optimization methods for fitting the model. Furthermore, we demonstrate the flexibility of the GCP decomposition on several real-world examples including interactions in a social network, neural activity in a mouse, and monthly rainfall measurements in India.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Deep reinforcement learning with online data augmentation to improve sample efficiency for intelligent HVAC control

Deep Reinforcement Learning (DRL) has started showing success in real-world applications such as building energy optimization. Much of the research in this space utilized simulated environments to train RL-agent in an offline mode. Very few research have used DRL-based control in real-world systems due to two main reasons: 1) sample efficiency challenge---DRL approaches need to perform a lot of interactions with the environment to collect sufficient experiences to learn from, which is difficult in real systems, and 2) comfort or safety related constraints---user's comfort must never or at least rarely be violated. In this work, we propose a novel deep Reinforcement Learning framework with online Data Augmentation (RLDA) to address the sample efficiency challenge of real-world RL. We used a time series Generative Adversarial Network (TimeGAN) architecture as a data generator. We further evaluated the proposed RLDA framework using a case study of an intelligent HVAC control. With a ≈28% improvement in the sample efficiency, RLDA framework lays the way towards increased adoption of DRL-based intelligent control in real-world building energy management systems.

Kurte, Kuldeep↗
DOE OSTI2020

Enabling Seamless Integration of EV Charging Infrastructure with Weak Electric Grids

Widespread adoption of Electric Vehicles (EVs) for light, medium, and heavy-duty applications has gained significant interest. Based on ownership and user preferences, light duty and local delivery medium-duty EVs are typically connected to grid distribution networks whereas larger medium duty and heavy-duty EVs are typically connected to distribution or even sub-transmission networks. Challenges with at-scale EVs and charging infrastructure supporting them include interoperability, distribution network upgrades, surge in demand charges, power quality issues, voltage stability, etc. Based on real-world data, steady-state and dynamic assessments of light-duty EV charging with a focus on DC Fast Charging (DCFC) for weak distribution grids is presented. Three main areas of contributions in this paper include - steady state and dynamic power quality measurements and assessments using real world data, transient assessments of light duty EV integration with weak distribution networks (IEEE 13 node feeder system) under grid-connected and microgrid modes, and formulation of an intelligent charging decision algorithm to enable an impact-minimal charging.

actionable intelligence↗
DOE OSTI2024

Field test of continuous-variable quantum key distribution with a true local oscillator

A continuous-variable quantum key distribution (CV QKD) using a true local (located at the receiver) oscillator (LO) has been proposed to remove any possibility of side-channel attacks associated with transmission of the LO as well as reduce the cross-pulse contamination. Here we report an implementation of true LO-CV QKD using “off-the-shelf” components and conduct QKD experiments using the fiber optical network at Oak Ridge National Laboratory. A phase reference and quantum signal are time multiplexed and then wavelength division multiplexed with the classical communications that “coexist” with each other on a single optical network fiber. Importantly, this is the first demonstration of CV QKD with a receiver-based true LO over a deployed fiber network, a crucial step for its application in real-world situations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Deep learning uncertainty quantification for clinical text classification

Machine learning algorithms are expected to work side-by-side with humans in decision-making pipelines. Thus, the ability of classifiers to make reliable decisions is of paramount importance. Deep neural networks (DNNs) represent the state-of-the-art models to address real-world classification. Although the strength of activation in DNNs is often correlated with the network’s confidence, in-depth analyses are needed to establish whether they are well calibrated. In this paper, we demonstrate the use of DNN-based classification tools to benefit cancer registries by automating information extraction of disease at diagnosis and at surgery from electronic text pathology reports from the US National Cancer Institute (NCI) Surveillance, Epidemiology, and End Results (SEER) population-based cancer registries. In particular, we introduce multiple methods for selective classification to achieve a target level of accuracy on multiple classification tasks while minimizing the rejection amount—that is, the number of electronic pathology reports for which the model’s predictions are unreliable. We evaluate the proposed methods by comparing our approach with the current in-house deep learning-based abstaining classifier. Overall, all the proposed selective classification methods effectively allow for achieving the targeted level of accuracy or higher in a trade-off analysis aimed to minimize the rejection rate. On in-distribution validation and holdout test data, with all the proposed methods, we achieve on all tasks the required target level of accuracy with a lower rejection rate than the deep abstaining classifier (DAC). Interpreting the results for the out-of-distribution test data is more complex; nevertheless, in this case as well, the rejection rate from the best among the proposed methods achieving 97% accuracy or higher is lower than the rejection rate based on the DAC. We show that although both approaches can flag those samples that should be manually reviewed and labeled by human annotators, the newly proposed methods retain a larger fraction and do so without retraining—thus offering a reduced computational cost compared with the in-house deep learning-based abstaining classifier.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Evaluating disease surveillance strategies for early outbreak detection in contact networks with varying community structure

Disease surveillance systems allow public health agencies to respond to emerging diseases before they become widespread. Developing such systems requires identifying optimal ways to monitor in the context of an epidemic outbreak; this problem is known as sensor selection. Contact networks represent the dynamics of interaction in a population and are used to model how a disease spreads in a population and to explore strategies of sensor selection. We evaluated five sensor selection strategies on their ability to provide an early warning of a COVID-like outbreak in synthetic contact networks encapsulated in four network scenarios. Three of these scenarios assessed different aspects of community structure. The fourth scenario employed a contact network representing the population and interactions of 6.8 million people in New York City, constructed from an agent-based simulation using census and transportation data. This scenario exemplifies how sensor selection strategies may perform in a real-world, urban context. Our findings suggest that the choice of the optimal strategy depends heavily on the community structure of the network. Strategies that select highly connected nodes or maximize network coverage are the optimal surveillance strategy for outbreak detection in many network community structures. However, a naive implementation of these strategies may fail to provide an early warning at all—including in the New York City scenario. Moreover, these methods are impractical for real-world use as they require knowledge of the underlying contact network. Instead, a selection strategy that starts with a set of random nodes and then performs a random walk through a chain of neighbors reliably provides early warnings without requiring prior knowledge of the network. We find this method, called “random chain”, to be the most pragmatic for implementation in a real-world disease surveillance context.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Accelerating gradient descent and Adam via fractional gradients

Here we propose a class of novel fractional-order optimization algorithms. We define a fractional-order gradient via the Caputo fractional derivatives that generalizes integer-order gradient. We refer it to as the Caputo fractional-based gradient, and develop an efficient implementation to compute it. A general class of fractional-order optimization methods is then obtained by replacing integer-order gradients with the Caputo fractional-based gradients. To give concrete algorithms, we consider gradient descent (GD) and Adam, and extend them to the Caputo fractional GD (CfGD) and the Caputo fractional Adam (CfAdam). We demonstrate the superiority of CfGD and CfAdam on several large scale optimization problems that arise from scientific machine learning applications, such as ill-conditioned least squares problem on real-world data and the training of neural networks involving non-convex objective functions. Numerical examples show that both CfGD and CfAdam result in acceleration over GD and Adam, respectively. We also derive error bounds of CfGD for quadratic functions, which further indicate that CfGD could mitigate the dependence on the condition number in the rate of convergence and results in significant acceleration over GD.

97 MATHEMATICS AND COMPUTING↗