Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network analysis”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Transcriptomic and metabolomic changes in postharvest sugarbeet roots reveal widespread metabolic changes in storage and identify genes potentially responsible for respiratory sucrose loss

Endogenous metabolism is primarily responsible for losses in sucrose content and processing quality in postharvest sugarbeet roots. The genes responsible for this metabolism and the transcriptional changes that regulate it, however, are largely unknown. To identify genes and metabolic pathways that participate in postharvest sugarbeet root metabolism and the transcriptional changes that contribute to their regulation, transcriptomic and metabolomic profiles were generated for sugarbeet roots at harvest and after 12, 40 and 120 d storage at 5 and 12°C and gene expression and metabolite concentration changes related to storage duration or temperature were identified. During storage, 8656 genes, or 34% of all expressed genes, and 225 metabolites, equivalent to 59% of detected metabolites, were altered in expression or concentration, indicating extensive transcriptional and metabolic changes in stored roots. These genes and metabolites contributed to a wide range of cellular and molecular functions, with carbohydrate metabolism being the function to which the greatest number of genes and metabolites classified. Because respiration has a central role in postharvest metabolism and is largely responsible for sucrose loss in sugarbeet roots, genes and metabolites involved in and correlated to respiration were identified. Seventy-five genes participating in respiration were differentially expressed during storage, including two bidirectional sugar transporter SWEET17 genes that highly correlated with respiration rate. Weighted gene co-expression network analysis identified 1896 additional genes that positively correlated with respiration rate and predicted a pyruvate kinase gene to be a central regulator or biomarker for respiration rate. Overall, these results reveal the extensive and diverse physiological and metabolic changes that occur in stored sugarbeet roots and identify genes with potential roles as regulators or biomarkers for respiratory sucrose loss.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Mapping of flumioxazin tolerance in a snap bean diversity panel leads to the discovery of a master genomic region controlling multiple stress resistance genes

Effective weed management tools are crucial for maintaining the profitable production of snap bean (Phaseolus vulgaris L.). Preemergence herbicides help the crop to gain a size advantage over the weeds, but the few preemergence herbicides registered in snap bean have poor waterhemp (Amaranthus tuberculatus) control, a major pest in snap bean production. Waterhemp and other difficult-to-control weeds can be managed by flumioxazin, an herbicide that inhibits protoporphyrinogen oxidase (PPO). However, there is limited knowledge about crop tolerance to this herbicide. We aimed to quantify the degree of snap bean tolerance to flumioxazin and explore the underlying mechanisms. We investigated the genetic basis of herbicide tolerance using genome-wide association mapping approach utilizing field-collected data from a snap bean diversity panel, combined with gene expression data of cultivars with contrasting response. The response to a preemergence application of flumioxazin was measured by assessing plant population density and shoot biomass variables. Snap bean tolerance to flumioxazin is associated with a single genomic location in chromosome 02. Tolerance is influenced by several factors, including those that are indirectly affected by seed size/weight and those that directly impact the herbicide's metabolism and protect the cell from reactive oxygen species-induced damage. Transcriptional profiling and co-expression network analysis identified biological pathways likely involved in flumioxazin tolerance, including oxidoreductase processes and programmed cell death. Transcriptional regulation of genes involved in those processes is possibly orchestrated by a transcription factor located in the region identified in the GWAS analysis. Several entries belonging to the Romano class, including Bush Romano 350, Roma II, and Romano Purpiat presented high levels of tolerance in this study. The alleles identified in the diversity panel that condition snap bean tolerance to flumioxazin shed light on a novel mechanism of herbicide tolerance and can be used in crop improvement.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Using Machine Learning for Quantum Annealing Accuracy Prediction

Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of very high quality, problem instances are usually not solved to optimality due to imperfections of the current generations quantum annealers. In this contribution, we aim to understand some of the factors contributing to the hardness of a problem instance, and to use machine learning models to predict the accuracy of the D-Wave 2000Q annealer for solving specific problems. We focus on the maximum clique problem, a classic NP-hard problem with important applications in network analysis, bioinformatics, and computational chemistry. By training a machine learning classification model on basic problem characteristics such as the number of edges in the graph, or annealing parameters, such as the D-Wave’s chain strength, we are able to rank certain features in the order of their contribution to the solution hardness, and present a simple decision tree which allows to predict whether a problem will be solvable to optimality with the D-Wave 2000Q. We extend these results by training a machine learning regression model that predicts the clique size found by D-Wave.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Neuroevolution Application to Collaborative and Heuristics-Based Connected and Autonomous Vehicle Cohort Simulation at Uncontrolled Intersection

Artificial intelligence is gaining tremendous attractiveness and showing great success in solving various problems, such as simplifying optimal control derivation. This work focuses on the application of Neuroevolution to the control of Connected and Autonomous Vehicle (CAV) cohorts operating at uncontrolled intersections. The proposed method implementation’s simplicity, thanks to the inclusion of heuristics and effective real-time performance are demonstrated. The resulting architecture achieves nearly ideal operating conditions in keeping the average speeds close to the speed limit. It achieves twice as high mean speed throughput as a controlled intersection, hence enabling lower travel time and mitigating energy inefficiencies from stop-and-go vehicle dynamics. Low deviation from the road speed limit is hence continuously sustained for cohorts of at most 50 m long. This limitation can be mitigated with additional lanes that the cohorts can split into. The concept also allows the testing and implementation of fast-turning lanes by simply replicating and reconnecting the control architecture at each new road crossing, enabling high scalability for complex road network analysis. The controller is also successfully validated within a high-fidelity vehicle dynamic environment, showing its potential for driverless vehicle control in addition to offering a new traffic control simulation model for future autonomous operation studies.

Jacquelin, Frederic (ORCID:0000000183154344)↗
DOE OSTI2021

Spatial–Temporal Patterns of Historical, Near-Term, and Projected Drought in the Conterminous United States

Major droughts in the United States have heavily impacted the hydrologic system, negatively effecting energy and food production. Improved understanding of historical drought is critical for accurate forecasts. Data from global climate models (GCMs), commonly used to assess drought, cannot effectively evaluate local patterns because of their low spatial scale. This research leverages downscaled (~4 km grid spacing) temperature and precipitation estimates from nine GCMs’ data under the business-as-usual scenario (Representative Concentration Pathway 8.5) to examine drought patterns. Drought severity is estimated using the Palmer Drought Severity Index (PDSI) with the Thornthwaite evapotranspiration method. The specific objectives were (1) To reproduce historical (1966–2005) drought and calculate near-term to future (2011–2050) drought patterns over the conterminous USA. (2) To uncover the local variability of spatial drought patterns in California between 2012 and 2018 using a network-based approach. Our estimates of land proportions affected by drought agree with the known historical drought events of the mid-1960s, late 1970s to early 1980s, early 2000s, and between 2012 and 2015. Network analysis showed heterogeneity in spatial drought patterns in California, indicating local variability of drought occurrence. The high spatial scale at which the analysis was performed allowed us to uncover significant local differences in drought patterns. This is critical for highlighting possible weak systems that could inform adaptation strategies such as in the energy and agricultural sectors.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Developing capacitated p-median location-allocation model in the spopt library to allow UCL student teacher placements using public transport

Location-allocation is a key tool within the GIS and network analysis toolbox. In this paper we discuss the real world application of a location-allocation case study (approx 800 students, 500 schools) from UCL using public transport. The use of public transportation is key for this case study, as many location-allocation approaches only make use of drive-time or walking-time distances, but the location of UCL in Greater London, UK makes the inclusion of public transport vital for this case study. The location-allocation is implemented as a capacitated p-median location-allocation model, using the spopt library, part of the Python Spatial Analysis Library (PySAL). The capacitated variation of the p-median location-allocation problem is a new addition to the spopt library, which this work will present. The results from the initial version of the capacitated p-median location-allocation problem has shown a marked improvement on public transport travel time, with public transport travel time reduced by 891 minutes overall for an initial sample of 93 students (9.58 minutes per student). Results will be presented below and plans for further improvement shared.

Bearman, Nick↗
DOE OSTI2020

Deep Learning for Automated Identification of Eels in Sonar Data

Freshwater eels, such as the American eel (Anguilla rostrata) present numerous challenges related to safe downstream fish passage at hydroelectric facilities. One of those challenges is effective monitoring of their abundance, movements, and behavior to facilitate design and operation of eel protection and passage facilities. A previous EPRI study documented the ability of human analysts to reliably identify American eels in data obtained with a 1100/1800 kHz, multibeam sonar. This report describes a project to develop deep learning (a subset of artificial intelligence) tools to automate the time-consuming, subjective process of eel identification in multibeam sonar data. The project exploited new data collected in the laboratory and the existing data from the prior EPRI field study to develop and test deep learning and other data analytic tools, including wavelet filtering, differencing for static object removal, and convolutional neural network analysis. The analysis of the laboratory data demonstrated feasibility of the approach, revealed object characteristics observed with the sonar that distinguish eels from similarly sized and shaped acoustic targets, and provided additional data for algorithm selection and training. Deep learning algorithms trained and tested on the laboratory data alone achieved accuracy rates of greater than 98% when classifying acoustic images of eels and similar-sized neutrally buoyant sticks. The algorithm trained and tested on the pre-existing field data alone, and yielded classification accuracy of 9.3% false positives and 13.3% false negatives when distinguishing between eels and sticks/PVC pipes based on video clips (i.e., multiple, consecutive images). This performance is comparable to the classification accuracy achieved by human analysts in the prior study. The deep learning algorithm trained on a combination of video clips obtained in the laboratory and the field and tested on video clips from the field, was able to distinguish eels from sticks and PVC pipes (a river debris analog) of similar size with 100% accuracy. Outreach to the hardware, software, and end-user communities early in the project helped to identify needs and specify the application space. Outreach to those communities at the end of the project communicated project results and opportunities for further development. The project achieved proof of concept for automated identification of eel in multibeam sonar data. Future work should focus on acquisition of additional data for more robust algorithm training and testing; modification of the software tools to accommodate multiple acoustic targets in the acoustic field at a given time; identification of additional object classes; incorporation of motion in the object identification and classification algorithms; operationalizing the software tools, including integration with other existing sonar data analysis tools; and partnering with hardware and software providers for distribution of the software tools with their commercial products.

13 HYDRO ENERGY↗
DOE OSTI2023

Scalable Graph Analytics and HPC Operational Enhancement: Parallel Computing and ML/DL Innovations

Parallel computing plays a pivotal role in the efficient processing of large-scale graphs. Complex network analysis stands as a capti- vating research frontier, holding promise across diverse scientific domains such as sociology, biology, online media, and recommenda- tion systems. In this era, Machine Learning (ML) and Deep Learning (DL) have emerged as indispensable tools, underpinning remarkable technological achievements. Within this dynamic landscape, my research revolves around advancing parallel algorithms tailored for large-scale graph operations. To achieve this, I harness the power of cutting-edge technologies including OpenMP, MPI, HIP, and CUDA, on the High-Performance Computing (HPC) platforms to unlock optimal performance. I also apply ML/DL techniques to HPC operational data, to streamline the monitoring and maintenance of supercomputers, alleviating the complexities associated with their upkeep and enhancing user support. My research echoes the syn- ergy between parallel computing, large-scale graph analysis, and ML/DL, improving computational efficiency and user experience.

Sattar, Naw Safrin↗
DOE OSTI2023

RADIANCE Executive Summary

Microgrids are gaining attention from organizations and cities because of their potential reliability and resilience benefits, especially in remote geographic areas: Microgrids can provide local power during emergencies, and they can reduce the costs of imported fuel by reducing overall fuel use. But the complexities and novelties of microgrid technologies are often barriers to deployment that require testing and validation to overcome. This report describes the testing, validation, and deployment of microgrid technologies in Cordova, Alaska, completed through the U.S. Department of Energy (DOE) Grid Modernization Laboratory Consortium (GMLC) project Resilient Alaskan Distribution system Improvements using Automation, Network analysis, Control, and Energy storage (RADIANCE).

ARIES↗
DOE OSTI2021

Event Cause Analysis in Distribution Networks using Synchro Waveform Measurements

This paper presents a machine learning method for event cause analysis to enhance situational awareness in distribution networks. The data streams are captured using time-synchronized high sampling rates synchro waveform measurement units (SWMU). The proposed method is formulated based on a machine learning method, the convolutional neural network (CNN). This method is capable of capturing the spatiotemporal feature of the measurements effectively and perform the event cause analysis. Several events are considered in this paper to encompass a range of possible events in real distribution networks, including capacitor bank switching, transformer energization, fault, and high impedance fault (HIF). The dataset for our study is generated using the real time digital simulator (RTDS) to simulate real-world events. The event cause analysis is performed using only one cycle of the voltage waveforms after the event is detected. The simulation results show the effectiveness of the proposed machine learning-based method compared to the state-of-the-art classifiers.

Niazazari, Iman↗
DOE OSTI2022

Understanding the Influence of Receptive Field and Network Complexity in Neural Network-Guided TEM Image Analysis

Abstract Trained neural networks are promising tools to analyze the ever-increasing amount of scientific image data, but it is unclear how to best customize these networks for the unique features in transmission electron micrographs. Here, we systematically examine how neural network architecture choices affect how neural networks segment, or pixel-wise separate, crystalline nanoparticles from amorphous background in transmission electron microscopy (TEM) images. We focus on decoupling the influence of receptive field, or the area of the input image that contributes to the output decision, from network complexity, which dictates the number of trainable parameters. For low-resolution TEM images which rely on amplitude contrast to distinguish nanoparticles from background, we find that the receptive field does not significantly influence segmentation performance. On the other hand, for high-resolution TEM images which rely on both amplitude and phase-contrast changes to identify nanoparticles, receptive field is an important parameter for increased performance, especially in images with minimal amplitude contrast. Rather than depending on atom or nanoparticle size, the ideal receptive field seems to be inversely correlated to the degree of nanoparticle contrast in the image. Our results provide insight and guidance as to how to adapt neural networks for applications with TEM datasets.

42 ENGINEERING↗
DOE OSTI2024

Predicting Drug Effects from High-dimensional Asymmetric Drug Data Sets using Graph Neural Networks: A Comprehensive Analysis of Multi-target Drug Effect Prediction

Graph neural networks (GNNs) have emerged as one of the most effective Machine learning (ML) techniques for drug effect prediction from drug molecular graphs. Despite having immense potential, GNN models lack performance when using data sets that contain high dimensional asymmetrically co-occurrent drug effects as targets with complex correlations between them. Training individual learning models for each drug effect and incorporating every prediction result for a wide spectrum of drug effects is beyond practicality. Such an implication provides a testbed to address this challenge as multi-target prediction problems, aiming to predict all drug effects at a time. We develop standard and hybrid graph neural networks (GNNs)to perform two separate tasks that are multi-regression for continuous values and multi-label classification for categorical values contained in our data sets. Since this step makes the target data even more sparse and introduces asymmetric label co-occurrence, the learning of multi-label classification models becomes difficult and heavily impacts the GNN's performance. To address these challenges, we propose a new data oversampling technique to improve multi-label classification performances on all the given imbalanced molecular graph data sets. Using the technique, we improve the data imbalance ratio of the drug effects better than before while protecting the data set's integrity. Finally, we evaluate multi-label classification performance using the best-performant hybrid GNN model on all the oversampled data sets obtained from the proposed oversampling technique. These results outperform those of other ML models including GNN models when they are trained on the original data sets or oversampled data sets using MLSMOTE (a well-known oversampling technique) in all evaluation metrics precision, recall, and F1 score by a significant margin.

Bose, Avishek [ORNL]↗
DOE OSTI2026

Measuring the Energy Consumption and Efficiency of Deep Neural Networks: An Empirical Analysis and Design Recommendations

Addressing the "Red-AI" trend of rising energy consumption by large-scale neural networks, this study investigates the measured energy consumption of training various fully connected neural network architectures. We introduce the BUTTER-E dataset, an augmentation to the BUTTER Empirical Deep Learning dataset, containing energy consumption and performance data from 41,129 individual experimental runs spanning 30,582 distinct configurations: 13 datasets, 20 sizes (trainable parameters), 8 "shapes", and 14 depths on both CPUs and GPUs using node-level watt-meters. This dataset reveals the complex relationship between dataset size, network structure, and energy use. Our analysis uncovers a surprising, hardware-mediated non-linear relationship between energy efficiency and network design, challenging the assumption that reducing the number of parameters or FLOPs is the best way to achieve greater energy efficiency. We propose a straightforward and effective energy model that accounts for network size, computing, and memory hierarchy. Highlighting the need for cache-considerate algorithm development, we suggest a codesign approach to energy efficient network, algorithm, and hardware design. This work contributes to the fields of sustainable computing and Green AI, offering practical guidance for creating more energy-efficient neural networks and promoting sustainable AI.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Throughput Measurements and Profile Analysis of Cloud Networks

Cloud networks utilize virtual connections to connect virtual machines distributed across cloud sites. They are increasingly deployed due to flexible provisioning using software and cost-effectiveness in not requiring to build physical network infrastructure. However, their extensive virtualization makes it unclear how well the established practices of conventional networks translate to them. Here, we study throughput measurements over a Google Cloud network using a matching hardware emulated conventional network, which provide production and exploratory conditions, respectively. The measurements span connections representing local, cross-continental and around the Earth distances. We study the effects of parallel flows, congestion control algorithms and retransmissions on the network throughput profile expressed as a function of RTT. We compare the throughput profile of Google Cloud network with those of emulated network under various loss conditions, including those too disruptive or expensive in the former. Our analysis based on the concave-convex shape and utilization-concavity coefficients of throughput profiles indicates an overall agreement of performance between the two networks, thereby justifying the use of conventional network emulations to analyze cloud networks. In terms of practical use, our study establishes that BBR and BBRv2 alpha TCP achieve higher throughput compared to loss-based congestion control algorithms under most network configurations, especially, under losses at large RTT.

Phanekham, Derek [Southern Methodist Univ., Dallas↗
DOE OSTI2025

Modeling MTS pyrolysis and SiC deposition kinetics using principal component analysis and neural networks

Accurate chemical kinetics modeling is crucial for improving the efficiency of chemical processing and synthesis of ceramic matrix composites. Detailed kinetic models are computationally expensive due to the large number of transported chemical species, while the simplified physics-based models, such as single-step global mechanisms, are efficient but often overlook key chemical intermediates and pathways. Recent deep learning approaches promise accurate and cost-effective models. Yet, they require additional closures for the transported nonlinear latent variables, complicating integration with existing solvers. In this work, we develop a hybrid linear—nonlinear reduced model for silicon carbide deposition from methyltrichlorosilane precursor by combining principal component analysis (PCA) and autoencoder (AE) neural network (NN) approaches. PCA is used to identify a smaller set of linear transport variables, enabling direct reuse of conventional transport solvers. NNs then reconstruct the full chemical state from these reduced variables. We demonstrate the method on a chemical vapor deposition reactor—comprising a gas-phase pyrolysis plug flow reactor and a heterogeneous surface reactor—over a wide range of temperatures, pressures, and residence times. Our PCA–AE model achieves high accuracy with only five transported scalars, achieving an eightfold cost reduction compared to detailed mechanisms, in both a priori (using data from the test set only) and a posteriori (coupled with a differential equation solver). In conclusion, notable errors arise primarily near training domain boundaries and for long residence times, indicating the need for domain shift indicators and better long-horizon predictions in future reduced chemistry model development.

autoencoder neural networks↗
DOE OSTI2020

Slip Tendency Analysis of Fracture Networks to Determine Suitability of Candidate Testbeds for the EGS Collab Hydroshear Experiment

Experiment 2 of the EGS Collab project is aimed at testing stimulation by hydro-shearing of existing natural fractures, versus Experiment 1, which is focused on hydraulic fracturing a rock mass to enhance permeability. The main criterion for the testbed selection in Experiment 2 is the presence of an interconnected network of fractures, at least 10 meters in extent, and with orientations such that shear slip can be induced at injection pressures less than the minimum horizontal stress (Shmin). The feasibility analysis for this experiment requires a well-constrained stress state along with well-characterized fracture networks. The fracture systems at two candidate locations in the Sanford Underground Research Facility (SURF), the 4850 Level (number refers to depth below ground surface in feet) and the 4100 Level, have been characterized to different extents. The 4850 Level has a well-characterized Discrete Fracture Network (DFN) from borehole (drilled for an experimental test bed) and drift observations. In contrast, the 4100 level has a fracture network characterized only by observations from the drift wall, which provides little constraint on fracture extents. This paper will present assessments for the interpreted slip potential for the natural fractures at the two locations. Data uncertainties are addressed by performing a probabilistic analysis that takes into account the uncertainty in the stress state, uncertainty in the fracture properties, and preliminary borehole locations. There is strong evidence of shear stimulation of some natural fractures in Experiment 1 on the 4850 level. We use examples of natural fractures strongly linked to shear stimulation in Experiment 1 from multiple monitoring indicators to test the consistency of the stress model and guide the uncertainty interpretation. This analysis is intended to guide the site selection process for Experiment 2 by highlighting the fracture orientations that are likely to be shear-stimulated in a majority of modeled realizations.

40 EE - Geothermal Technologies Office (EE-4G)↗
DOE OSTI2021

Deep Cellular Recurrent Network for Efficient Analysis of Time-Series Data With Spatial Information

Efficient processing of large-scale time series data is an intricate problem in machine learning. Conventional sensor signal processing pipelines with hand engineered feature extraction often involve huge computational cost with high dimensional data. Deep recurrent neural networks have shown promise in automated feature learning for improved time-series processing. However, generic deep recurrent models grow in scale and depth with increased complexity of the data. This is particularly challenging in presence of high dimensional data with temporal and spatial characteristics. Consequently, this work proposes a novel deep cellular recurrent neural network (DCRNN) architecture to efficiently process complex multi-dimensional time series data with spatial information. Here, the cellular recurrent architecture in the proposed model allows for location-aware synchronous processing of time series data from spatially distributed sensor signal sources. Extensive trainable parameter sharing due to cellularity in the proposed architecture ensures efficiency in the use of recurrent processing units with high-dimensional inputs. This study also investigates the versatility of the proposed DCRNN model for classification of multi-class time series data from different application domains. Consequently, the proposed DCRNN architecture is evaluated using two time-series datasets: a multichannel scalp EEG dataset for seizure detection, and a machine fault detection dataset obtained in-house. The results suggest that the proposed architecture achieves state-of-the-art performance while utilizing substantially less trainable parameters when compared to comparable methods in the literature.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

“Understanding Robustness Lottery”: A Geometric Visual Comparative Analysis of Neural Network Pruning Approaches

Deep learning approaches have provided state-of-the-art performance in many applications by relying on large and overparameterized neural networks. However, such networks are very brittle and are difficult to deploy on resource-limited platforms. Model pruning, i.e., reducing the size of the network, is a widely adopted strategy that can lead to a more robust and compact model. Many heuristics exist for model pruning, but our understanding of the pruning process remains limited due to the black-box nature of a neural network model. Empirical studies show that some heuristics improve performance whereas others can make models more brittle. Here, this work aims to shed light on how different pruning methods alter the network’s internal feature representation and the corresponding impact on model performance. To facilitate a comprehensive comparison and characterization of the high-dimensional model feature space, we introduce a visual geometric analysis of feature representations. We evaluated a set of critical geometric concepts decomposed from the commonly adopted classification loss and used them to design a visualization system to compare and highlight the impact of pruning on model performance and feature representation. The proposed tool provides an environment for an in-depth comparison of pruning methods and a comprehensive understanding of how the model responds to common data corruption. By leveraging the proposed visualization, machine learning researchers can reveal the similarities between pruning methods and redundancy in robustness evaluation benchmarks, obtain geometric insights about the differences between pruned models that achieve superior robustness performance, and identify samples that are robust or fragile to model pruning and common data corruption.

Li, Zhimin [Univ. of Utah, Salt Lake City, UT (Uni↗