Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed machine learning”

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 613 records · Page 34

Multi-Edge Graph Convolutional Networks for Power Systems

The exponential electrification of transportation has contributed to highly intermittent load variations in the distribution grid. This uncertainty has raised challenges for distribution system operation and control. Accurate nodal voltage estimation is highly essential for the safe and reliable operation of the grid. Graph convolutional networks have been used in machine-learning-based models for power grid applications like voltage estimation for their ability to capture the network topology of the grid. This paper presents a novel multi-edge graph convolutional layer that considers resistance and reactance as edge attributes. This layer is created by modifying the message-passing function within the graph convolutional network. The novel layer is then used to create a multi-edge graph convolutional network-based surrogate model for estimating voltage in the distribution network with highly uncertain electric vehicle loads. Results indicate improved performance of the multi-edge graph convolutional network model when compared to a standard graph convolutional network model.

Ravi, Abhijith↗

Real-Time Edge AI for Distributed Systems (READS): Progress on Beam Loss De-Blending for the Fermilab Main Injector and Recycler

The Fermilab Main Injector enclosure houses two accelerators, the Main Injector and Recycler. During normal operation, high intensity proton beams exist simultaneously in both. The two accelerators share the same beam loss monitors (BLM) and monitoring system. Beam losses in the Main Injector enclosure are monitored for tuning the accelerators and machine protection. Losses are currently attributed to a specific machine based on timing. However, this method alone is insufficient and often inaccurate, resulting in more difficult machine tuning and unnecessary machine downtime. Machine experts can often distinguish the correct source of beam loss. This suggests a machine learning (ML) model may be producible to help de-blend losses between machines. Work is underway as part of the Fermilab Real-time Edge AI for Distributed Systems Project (READS) to develop a ML empowered system that collects streamed BLM data and additional machine readings to infer in real-time, which machine generated beam loss.

43 PARTICLE ACCELERATORS↗

Quantum Image Denoising: A Framework via Boltzmann Machines, QUBO, and Quantum Annealing

We investigate a framework for binary image denoising via restricted Boltzmann machines (RBMs) that introduces a denoising objective in quadratic unconstrained binary optimization (QUBO) form and is well-suited for quantum annealing. The denoising objective is attained by balancing the distribution learned by a trained RBM with a penalty term for derivations from the noisy image. We derive the statistically optimal choice of the penalty parameter assuming the target distribution has been well-approximated, and further suggest an empirically supported modification to make the method robust to that idealistic assumption. We also show under additional assumptions that the denoised images attained by our method are, in expectation, strictly closer to the noise-free images than the noisy images are. While we frame the model as an image denoising model, it can be applied to any binary data. As the QUBO formulation is well-suited for implementation on quantum annealers, we test the model on a D-Wave Advantage machine, and also test on data too large for current quantum annealers by approximating QUBO solutions through classical heuristics.

restricted Boltzmann machine↗

Star–Galaxy Image Separation with Computationally Efficient Gaussian Process Classification

Abstract We introduce a novel method for discerning optical telescope images of stars from those of galaxies using Gaussian processes (GPs). Although applications of GPs often struggle in high-dimensional data modalities such as optical image classification, we show that a low-dimensional embedding of images into a metric space defined by the principal components of the data suffices to produce high-quality predictions from real large-scale survey data. We develop a novel method of GP classification hyperparameter training that scales approximately linearly in the number of image observations, which allows for application of GP models to large-size Hyper Suprime-Cam Subaru Strategic Program data. In our experiments, we evaluate the performance of a principal component analysis embedded GP predictive model against other machine-learning algorithms, including a convolutional neural network and an image photometric morphology discriminator. Our analysis shows that our methods compare favorably with current methods in optical image classification while producing posterior distributions from the GP regression that can be used to quantify object classification uncertainty. We further describe how classification uncertainty can be used to efficiently parse large-scale survey imaging data to produce high-confidence object catalogs.

79 ASTRONOMY AND ASTROPHYSICS↗

Transient Data Library of Solar Grid Integrated Distributed System

This submission contains an open-source library of transient events in distributed system with high solar PV. The library includes the collected data, related documents and scripts for loading the data. The data library is built for transient event detection and machine learning based analysis algorithm development. The data was collected via both field test and software simulation. The units for the data are included in the data file headers for each data series. A text editor or spreadsheet software, such as Excel, and Matlab is required to view the data.

algorithms↗

Reconstruction of Six-Dimensional Phase Space

A phase space is a mathematical representation of all possible physical states of a system. Particle beams at Fermilab exist within a six-dimensional (6D) phase space defined by three positional components, (x, y, z) and three momentum components, (px, py, pz). To reconstruct this space implies taking measurement data from detectors and mapping out particle behavior using computational methods. The beam detectors, however, are only able to detect spatial distribution among the events of the beam, therefore being limited to positional data. Also, due to the vast number of events in a particle beam, it is extremely difficult to analyze and differentiate every single one’s behavior. However, with Machine Learning (ML), which can distinguish between patterns and map out particle behavior more efficiently. We first used the particle beam software, G4beamline, to simulate a 10,000-event muon beam, adjusting parameters such as initial momentum magnitude (p¬0) and virtual detector position. Using ten virtual detectors, we analyzed p0 values such that minimum 9,990 events were analyzed by every detector. We then input the data from these beam simulations to a C++ program, that randomly selects 100 events, and creates a 2D histogram based on spatial distribution, detector position, and event intensity. This process is repeated 100 times to create 100 histograms per p0 value. These images were then input to a modified ResNet18 Convolutional Neural Network (CNN) for training, and to predict p0 from some unseen set of histograms. The model was accurate when trained on momentum increments of 5 MeV/c and provided with denser training samples around highly variable test values. These results displayed machine learning being able to accurately predict p0 from being trained on different particle behaviors.

Shirlee, Jermain [Fermilab]↗

Scalability analysis of heavy-duty gas turbines using data-driven machine learning

With the increasing integration of variable renewable energy sources into power systems, the role of flexible power generation technologies like gas turbines (GT) in rapid grid balancing remains crucial. This sustained importance underscores the need for scaled and precise modeling of GT to ensure effective integration within evolving energy frameworks. While physics-driven GT models integrate thermodynamics, fluid dynamics, and combustion principles, they often rely on approximate mathematical representations to accommodate scaling that may not capture the actual complex dynamics for GTs and inertial effects associated to GTs with different ratings. In this study, a data-driven model is proposed using machine learning (ML) techniques to conduct GT scalability analysis and performance evaluation with high accuracy. The ML model, trained on data from various operating conditions and performance parameters, aims to uncover intricate relationships and patterns, resembling GT characteristics at different scales (ratings). The model is developed to capture complex system interaction and to adapt to changing operational scenarios at different capacities, providing valuable insights of power system dynamics. In this study, the real-time digital simulator platform was employed to generate training data for the ML model and assess its dynamic characteristics. The ultimate objective was to develop a detailed modeling framework based on governing equations and data-driven ML capable of predicting key performance indicators, in thermal systems such as GTs, including power output, speed, fuel consumption, and exhaust temperature under diverse operating conditions at different scales. The developed ML framework demonstrated high accuracy, with mean relative errors for GT power prediction, reference speed, exhaust temperature, and compressor pressure ratio (CPR) parameters consistently below 0.1% across typical load fluctuation scenarios. Maximum deviations were limited to approximately 0.5 K for exhaust temperature and 0.009 for CPR, underscoring the model’s ability to replicating dynamic GT behavior with high precision. The adaptability of the ML model enables its application across diverse operational conditions and its extension to other thermal systems. By leveraging advanced ML techniques, this study presents a robust and scalable modeling framework that enhances GT simulation precision, facilitating improved integration into evolving power systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Harnessing the Power of Machine Learning and Omics to Identify Environmental Regulation on Microbial Functional Composition for Soil C, N, and P Cycling

Microbial enzyme-mediated soil organic matter (SOM) decomposition regulates many key ecosystem functions, such as elemental cycling, soil carbon sequestration, and soil fertility. However, representing microbial processes in Earth system models (ESMs) remains challenging due to a limited understanding of the spatial patterns of diverse microbial functions responsible for soil carbon (C), nitrogen (N), and phosphorus (P) cycling as well as the underlying mechanisms regulating their relative abundances across various environments. We collected published metagenomics data across the continental US (CONUS) to identify hundreds of microbial genes involved in soil C, N, and P cycling and grouped them into eight enzyme functional classes (EFCs). Each EFC represented a group of gene-encoded potential enzymes that decompose similar soil compounds. By integrating the abundances of omics-informed EFCs with the corresponding environmental information, we trained a machine learning (ML) model to identify key edaphic, climate, and vegetation factors regulating the abundances of each EFC. Quantitative analysis of effects of these factors revealed that the spatial distribution of eight EFCs for soil C, N, and P cycling across CONUS reflected potential resource optimization strategies of microbial communities under nutrient limitation, preferential organic-mineral associations, and climatological stresses. This insight, together with the interpreted ML tool and the CONUS-level benchmark for EFCs abundances, paves the way for parameterizing environmental-regulated microbial functional dynamics in biogeochemical models.

machine learning↗

Smart detection of indoor occupant thermal state via infrared thermography, computer vision, and machine learning

The ability to measure occupants’ thermal state in real time will enable major advances in the control of air conditioning systems. This study proposes predicting occupant thermal state by a combination of infrared thermography, computer vision, and machine learning. The approach (1) uses cheek, nose, and hand temperatures because they are least subject to blockage by hair, glasses, and clothing; (2) measures the distribution of skin temperatures within geometrically defined sub-areas of the face and hand; and (3) uses temperature differences within and between these areas to eliminate the effects of calibration drift that are unavoidable in thermal infrared (TIR) cameras. Two series of tests were conducted, respectively in an outdoor carport and an indoor environmental chamber, collecting a total of 48,422 sets of cheek, nose, and hand skin temperatures using a TIR camera and computer-vision technology, coupled with 715 subjective responses of thermal sensations. To predict occupant thermal state, Random Forest classification models were built using either absolute skin temperatures (the maximum and median temperatures of cheek and hand segments, and the temperature of the central spot on the nose), or intra- and inter-segment temperature differences of cheeks, hands, and nose. These measurements were found to accurately predict occupant thermal state. Using the maximum and median temperatures for cheek and nose, or for cheek and hand, predicts thermal state with an accuracy of 92–96%. In conclusion, using only the intra- and inter-segment temperature differences from cheek and nose is 83% accurate; adding the hand temperature differences increases the accuracy to 96%.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Hyperspectral Inversion Framework for Estimating Absorbing Inherent Optical Properties and Biogeochemical Parameters in Inland and Coastal Waters

The simultaneous remote estimation of biogeochemical parameters (BPs) and inherent optical properties (IOPs) from hyperspectral satellite imagery of globally distributed optically distinct inland and coastal waters is a complex, unsolved, non-unique inverse problem. To tackle this problem, we leverage a machine-learning model termed Mixture Density Networks (MDNs). MDNs outperform operational algorithms by calculating the covariance between the simultaneously estimated products. We train the MDNs on a large ( N = 8237) dataset of co-aligned, in situ measured, hyperspectral remote sensing reflectance (R rs ), BPs, and absorbing IOPs from globally representative optically distinct inland and coastal waters. The estimated IOPs include absorption due to phytoplankton (a ph ), chromophoric dissolved organic matter (a cdom ), and non-algal particles (a nap ). The estimated BPs include chlorophyll-a, total suspended solids, and phycocyanin (PC). MDNs dramatically reduce uncertainty in the retrievals, relative to operational algorithms, when using a 50/50 dataset split, where the MDNs are trained on a randomly selected half of the in situ dataset and validated on the other half. Our model is shown to have higher, or equivalent, generalization performance than the calculated operational algorithms available for all BPs and IOPs (except PC) via a leave-one-out cross-validation assessment. The MDNs are sensitive to uncertainties in the hyperspectral satellite R rs , resulting from instrument noise and atmospheric correction; there is a difference of ~37.4–62.8% (using median symmetric accuracy) between the MDNs’ estimates derived from co-located satellite-derived R rs and in situ R rs . Of the IOPs, a cdom and a nap are less sensitive to uncertainties in hyperspectral satellite imagery relative to a ph , with remote estimates of a ph exhibiting incorrect spectral shape and magnitude relative to in situ measured IOPs. Despite the uncertainties in satellite derived R rs , the spatial distributions of BPs and IOPs in MDN-derived product maps of Lake Erie and the Curonian Lagoon, based on imagery taken with the Hyperspectral Imager for the Coastal Ocean (HICO) and PRecursore Iper-Spettrale della Missione Applicativa (PRISMA), are confirmed via co-aligned in situ measurements and agree with the literature’s understanding of these well-studied regions. The consistency and accuracy of the model on HICO and PRISMA imagery, despite radiometric uncertainties, demonstrate its applicability to future hyperspectral missions, such as the Plankton, Aerosol, Cloud, ocean Ecosystem (PACE) mission, where the simultaneous estimation model will serve as a key part of phytoplankton community composition analysis.

Ryan E. O'Shea↗

Assurance by Design for Cyber Physical Data-Driven Systems

Currently, Cyber Physical Data-Driven Systems (CPDDS) employ machine learning for the classification, data fusion, and control of our nation’s infrastructure, such as the power grid, transportation networks (e.g., fuel distribution, air traffic control), and DoD long-duration collaborative autonomous platforms including unmanned underwater, ground, surface, space, and aerial systems. Many CPDDSs are system-of-systems that should be designed to communicate over disadvantaged networks. It is important to assure that the CPDDSs are resilient against physical and cyber threats by design. Additionally, their design should tolerate misclassification errors resulting from natural and/or adversarial distribution shifts within their data driven components. The all-domain nature of the problem of assuring the design of CPDDSs requires a multi-disciplinary perspective as outlined in this chapter.

Chikkagoudar, Satish↗

Generative learning for slow manifolds and bifurcation diagrams

In dynamical systems characterized by separation of time scales, the approximation of so called “slow manifolds”, on which the long term dynamics lie, is a useful step for model reduction. Initializing on such slow manifolds is a useful step in modeling, since it circumvents fast transients, and is crucial in multiscale algorithms (like the equation-free approach) alternating between fine scale (fast) and coarser scale (slow) simulations. In a similar spirit, when one studies the infinite time dynamics of systems depending on parameters, the system attractors (e.g., its steady states) lie on bifurcation diagrams (curves for one-parameter continuation, and more generally, on manifolds in state parameter space. Sampling these manifolds gives us representative attractors (here, steady states of ODEs or PDEs) at different parameter values. Algorithms for the systematic construction of these manifolds (slow manifolds, bifurcation diagrams) are required parts of the “traditional” numerical nonlinear dynamics toolkit. In more recent years, as the field of Machine Learning develops, conditional score-based generative models (cSGMs) have been demonstrated to exhibit remarkable capabilities in generating plausible data from target distributions that are conditioned on some given label. It is tempting to exploit such generative models to produce samples of data distributions (points on a slow manifold, steady states on a bifurcation surface) conditioned on (consistent with) some quantity of interest (QoI, observable). In this work, we present a framework for using cSGMs to quickly (a) initialize on a low-dimensional (reduced-order) slow manifold of a multi-time-scale system consistent with desired value(s) of a QoI (a “label”) on the manifold, and (b) approximate steady states in a bifurcation diagram consistent with a (new, out-of-sample) parameter value. This conditional sampling can help uncover the geometry of the reduced slow-manifold and/or approximately “fill in” missing segments of steady states in a bifurcation diagram. Finally, the quantity of interest, which determines how the sampling is conditioned, is either known a priori or identified using manifold learning-based dimensionality reduction techniques applied to the training data.

Dynamical systems↗

Heterogeneous microstructure of yttrium hydride and its relation to mechanical properties

Here, the goal of this study is to investigate the properties of yttrium hydride materials in relation to the microstructure, especially its homogeneity. High-throughput nanoindentation mapping was used to evaluate hardness distribution. Raman spectral imaging demonstrated its sensitivity to the presence of YH2 and impurities. Raman peak position maps were correlated with residual stress in the specimens. Electron backscatter diffraction mapping provided phase distributions with correlation to high-energy X-ray diffraction analysis. The experimental mapping data were combined and analyzed using unsupervised machine learning cluster procedures. The machine learning analysis revealed that yttrium hydride specimens contained a major δ-YH2 – x phase component and minor α-Y and δ-YH2 – x components with significant residual stress. The minor phase fraction decreased with increasing nominal H/Y ratio, which affected the nanoindentation and Vickers hardness. The multimodal mapping procedures described herein affect developing important microstructure–property relationships, as well as correlations in heterogeneity and mechanical properties.

36 MATERIALS SCIENCE↗

Characterizing electrical panel capacity, breaker space, and loads in U.S. single-family homes

Electrical panels distribute electricity to appliances, equipment, and other building loads and maintain safety by preventing overloads of branch circuits, feeders, and utility service wires connecting homes to the grid. Load calculations in the National Electrical Code (NEC) determine the capacity of installed electrical panels in the United States, which are rated in amps (A). Circuit breakers within electrical panels affect the magnitude and number of loads that panels can serve. In home retrofits and renovations, existing electrical panels may not accommodate new electrical loads, either due to insufficient electrical capacity or a lack of available breaker spaces. Homes with these panel constraints may need to replace existing panels with new panels that have greater capacity and breaker space.

24 POWER TRANSMISSION AND DISTRIBUTION↗

‘Flux+Mutability’: a conditional generative approach to one-class classification and anomaly detection

Abstract Anomaly Detection is becoming increasingly popular within the experimental physics community. At experiments such as the Large Hadron Collider, anomaly detection is growing in interest for finding new physics beyond the Standard Model. This paper details the implementation of a novel Machine Learning architecture, called Flux+Mutability, which combines cutting-edge conditional generative models with clustering algorithms. In the ‘flux’ stage we learn the distribution of a reference class. The ‘mutability’ stage at inference addresses if data significantly deviates from the reference class. We demonstrate the validity of our approach and its connection to multiple problems spanning from one-class classification to anomaly detection. In particular, we apply our method to the isolation of neutral showers in an electromagnetic calorimeter and show its performance in detecting anomalous dijets events from standard QCD background. This approach limits assumptions on the reference sample and remains agnostic to the complementary class of objects of a given problem. We describe the possibility of dynamically generating a reference population and defining selection criteria via quantile cuts. Remarkably this flexible architecture can be deployed for a wide range of problems, and applications like multi-class classification or data quality control are left for further exploration.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

ML-Based Power System Stability Assessment Considering Network Topology Changes: WECC 20,000+ Bus System Case Study

Modern power grids are fast-changing and thus require real-time monitoring and online stability assessment. With the rapid development of machine learning (ML) techniques, using data-driven models to provide fast and accurate estimations of power system stability marginal information, such as frequency nadir for frequency stability and critical clearing time (CCT) for transient stability, have become possible. However, despite the numerous research on ML-based methods for frequency nadir and CCT prediction, there is limited work on the impact of different network topology changes. Furthermore, most previous studies only focused on small or synthetic systems, and there is a lack of research on actual large power system models. In this paper, the above issues are addressed by studying the actual U.S. Western Electricity Coordinating Council (WECC) system model with more than 20,000 buses. Massive simulations are conducted in PowerWorld Simulator to study the impact of various topology change scenarios on both frequency stability and transient stability. System operating information is extracted from the success dispatch cases of various network topologies to generate a comprehensive dataset for ML-based models. Two ML methods, random forest (RF) and multilayer perceptron (MLP) neural network, are trained and tested for both frequency nadir prediction and CCT prediction. Test results have proven the models are capable of online stability assessment for large power networks such as the WECC system with sufficient accuracy.

critical clearing time↗