Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “clustering algorithm”

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 307 records · Page 17

Tau-Jet Matching and Tag-and-Probe Tau Tagging Efficiencies for HH→bbτ+τ− Searches Using Run 3 CMS Scouting Data

We are studying tau-jet matching efficiency and tau tagging efficiency for the search for Higgs boson pair production in the HH→bbτ+τ− decay channel using Run 3 CMS scouting data. Collision events in the CMS detector produce many particle candidates, so jets are clustered using the anti-kT algorithm to identify possible tau signatures. In Monte Carlo simulation, tau-jet matching efficiency can be measured by comparing generated taus to reconstructed jets. In actual collision data, however, generated taus are not available, so we use a tag-and-probe method with Z→τ+τ− candidate events. In this method, one tau candidate is used as the tag and the other as the probe. The invariant mass of the tau-pair candidates is plotted and fitted with signal and background functions to estimate the number of real tau events and determine the tagging efficiency. By comparing efficiencies in data and Monte Carlo simulation, this work helps evaluate the performance of scouting-based tau reconstruction and tau tagging for future HH→bbτ+τ− searches.

Bellot, Annella [North Central Coll.; Fermilab]↗

Tau-Jet Matching and Tag-and-Probe Tau Tagging Efficiencies for HH→bbτ+τ− Searches Using Run 3 CMS Scouting Data

We are studying tau-jet matching efficiency and tau tagging efficiency for the search for Higgs boson pair production in the HH→bbτ+τ− decay channel using Run 3 CMS scouting data. Collision events in the CMS detector produce many particle candidates, so jets are clustered using the anti-kT algorithm to identify possible tau signatures. In Monte Carlo simulation, tau-jet matching efficiency can be measured by comparing generated taus to reconstructed jets. In actual collision data, however, generated taus are not available, so we use a tag-and-probe method with Z→τ+τ− candidate events. In this method, one tau candidate is used as the tag and the other as the probe. The invariant mass of the tau-pair candidates is plotted and fitted with signal and background functions to estimate the number of real tau events and determine the tagging efficiency. By comparing efficiencies in data and Monte Carlo simulation, this work helps evaluate the performance of scouting-based tau reconstruction and tau tagging for future HH→bbτ+τ− searches.

Bellot, Annella [North Central Coll.; Fermilab]↗

G-Mapper: Learning a Cover in the Mapper Construction

The Mapper algorithm is a visualization technique in topological data analysis (TDA) that outputs a graph reflecting the structure of a given dataset. However, the Mapper algorithm requires tuning several parameters in order to generate a “nice” Mapper graph. This paper focuses on selecting the cover parameter. We present an algorithm that optimizes the cover of a Mapper graph by splitting a cover repeatedly according to a statistical test for normality. Our algorithm is based on G-means clustering, which searches for the optimal number of clusters in 𝑘-means by iteratively applying the Anderson–Darling test. Our splitting procedure employs a Gaussian mixture model to carefully choose the cover according to the distribution of the given data. In conclusion, experiments for synthetic and real-world datasets demonstrate that our algorithm generates covers so that the Mapper graphs retain the essence of the datasets, while also running significantly faster than a previous iterative method.

G-means clustering↗

Dynamic Ride-Matching for Large-Scale Transportation Systems

Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem’s network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time.

33 ADVANCED PROPULSION SYSTEMS↗

Decentralized Failure-Tolerant Optimization of Electric Vehicle Charging

We present a decentralized failure-tolerant algorithm for optimizing electric vehicle (EV) charging, using charging stations as computing agents. The algorithm is based on the alternating direction method of multipliers (ADMM) and it has the following features: (i) It handles capacity, peak demand, and ancillary services coupling constraints. (ii) It does not require a central agent collecting information and performing coordination (e.g. an aggregator), instead all agents exchange information and computations are carried out in a fully decentralized fashion. (iii) It can withstand the failure of any number of computing agents, as long as the remaining computing agents are in a connected communications network. We construct this algorithm by reformulating the optimal EV charging problem in a decomposable form, amenable to ADMM, and then developing efficient decentralized solution methods for the subproblems dealing with coupling constraints. We conduct numerical experiments on industry-scale synthetic EV charging datasets, with up to 1,152 charging stations, using a high performance computing cluster. The experiments demonstrate that the proposed algorithm can solve the optimal EV charging problem fast enough to permit the integration of EV charging with real-time electricity markets, even in the presence of failures.

42 ENGINEERING↗

Electromagnetic Transient (EMT) Simulation Algorithm for Evaluation of Photovoltaic (PV) Generation Systems

Use of inverter-based resources facilitating renewable energy resources such as photovoltaic (PV) generation is increasing rapidly with decreasing costs and reduced emissions associated. To accommodate such rapid growth of inverter-based resources like PV systems, electromagnetic transient (EMT) simulation models of both PV systems and grids are required to analyze the interaction of PVs in the grid (like the post-event analysis). In addition, the EMT simulation would help with the planning of future power grid with a large number of PVs as well as other inverter-based distributed generation systems. In this paper, the EMT simulation models of PV systems and grids are developed based on the differential algebraic equations (DAEs) representing their EMT dynamics. Furthermore, advanced simulation algorithms including numerical stiffness-based hybrid discretization, DAE clustering and aggregation, multi-order integration, and matrix splitting approaches are applied to accelerate the EMT simulation. The proposed algorithm was applied to 125 PV inverters within 52-bus medium-voltage (MV) distribution grid.

Choi, Jongchan↗

Characterization and Quantification of Radiation-Induced Clusters/Precipitates in RPV Steels Using STEM-EDS and Machine Learning

Over the operational lifespan of a nuclear reactor, reactor pressure vessel (RPV) steels are subjected to significant neutron irradiation, resulting in complex microstructural changes and the consequent degradation of mechanical properties. Various physically motivated correlation models have been developed to predict neutron irradiation-induced embrittlement of RPVs under different irradiation conditions. However, the efficient and accurate characterizations and quantification of radiation-induced clusters in RPVs are still challenging, which will affect the precision of the predictive models for embrittlement of RPV components. In the DOE Visiting Faculty Program (VFP) research work at Oak Ridge National Lab (ORNL), I integrate machine learning to aid Scanning Transmission Electron Microscopy – Energy Dispersive X-ray Spectroscopy (STEM-EDS) analyses, which improve the characterization and quantification of radiation-induced clusters in RPV steels, thereby enabling more accurate predictions of material behavior under irradiation. The surveillance base- and welded- RPV steels were annealed at various temperatures of 340 °C, 450 °C and 500 °C for up to 168 hours, respectively. Afterwards, I have characterized radiation-induced clusters using advanced STEM-EDS techniques and subsequently applying machine learning algorithms to analyze and refine STEM-EDS datasets, enhancing the quantification of clusters compositions and distributions. In the end, an efficient workflow for integrating STEM-EDS data analysis with machine learning to address challenges including noise reduction has been developed. The completion of this VFP work will support bridge critical gaps in the accurate quantification of radiation-induced clusters in RPV steels using STEM-EDS and support the development of more precise models for predicting RPV embrittlement in the Light Water Reactor Sustainability program supported by Department of Energy and enhancing the collaboration between ORNL and Alred University. The outcome of the VFP project will leverage a few research papers submission to peer-reviewed journals in the relevant scientific field and a few oral presentations at national and international conferences.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Cluster Expansion Analysis of Atomic Order in Li-Ion Battery Cathode Material LiCo y Ni 1-y O 2

A modified cluster-expansion treatment was developed recently to analyze atomic order in LiCo y Ni 1-y O 2 , a model cathode material for Li-ion batteries. In this treatment, referred to as a “spin-atom” cluster expansion, the occupant of a lattice site is identified by its spin state as well as its atomic species. Further, Effective Cluster Interaction (ECI) coefficients are derived from a large training data set (i.e., the set of atomic arrangements for which DFT calculations are performed) which is filtered by an anomaly detection algorithm to eliminate poorly converged DFT calculations. The cluster expansion incorporates Li-Ni (LN) exchange as well as intralayer Co-Ni (CN) exchange. Monte Carlo simulations based on the cluster expansion were applied to the Ni-rich part of the phase diagram. The simulations predict a miscibility gap between y = 0.05 and y = 0.65.

25 ENERGY STORAGE↗

An overview of the operation architectures and energy management system for multiple microgrid clusters

The emerging novel energy infrastructures, such as energy communities, smart building-based microgrids, electric vehicles enabled mobile energy storage units raise the requirements for a more interconnective and interoperable energy system. It leads to a transition from simple and isolated microgrids to relatively large-scale and complex interconnected microgrid systems named multi-microgrid clusters. In order to efficiently, optimally, and flexibly control multi-microgrid clusters, cross-disciplinary technologies such as power electronics, control theory, optimization algorithms, information and communication technologies, cyber-physical, and big-data analysis are needed. This paper introduces an overview of the relevant aspects for multi-microgrids, including the outstanding features, architectures, typical applications, existing control mechanisms, as well as the challenges.

24 POWER TRANSMISSION AND DISTRIBUTION↗

AutoEnRichness: A hybrid empirical and analytical approach for estimating the richness of galaxy clusters

ABSTRACT We introduce AutoEnRichness, a hybrid approach that combines empirical and analytical strategies to determine the richness of galaxy clusters (in the redshift range of 0.1 ≤ z ≤ 0.35) using photometry data from the Sloan Digital Sky Survey Data Release 16, where cluster richness can be used as a proxy for cluster mass. In order to reliably estimate cluster richness, it is vital that the background subtraction is as accurate as possible when distinguishing cluster and field galaxies to mitigate severe contamination. AutoEnRichness is comprised of a multistage machine learning algorithm that performs background subtraction of interloping field galaxies along the cluster line of sight and a conventional luminosity distribution fitting approach that estimates cluster richness based only on the number of galaxies within a magnitude range and search area. In this proof-of-concept study, we obtain a balanced accuracy of 83.20 per cent when distinguishing between cluster and field galaxies as well as a median absolute percentage error of 33.50 per cent between our estimated cluster richnesses and known cluster richnesses within r200. In the future, we aim for AutoEnRichness to be applied on upcoming large-scale optical surveys, such as the Legacy Survey of Space and Time and Euclid, to estimate the richness of a large sample of galaxy groups and clusters from across the halo mass function. This would advance our overall understanding of galaxy evolution within overdense environments as well as enable cosmological parameters to be further constrained.

79 ASTRONOMY AND ASTROPHYSICS↗

Comparative genetics of Enterococcus faecalis intestinal tissue isolates before and after surgery in a rat model of colon anastomosis

We have recently demonstrated that collagenolytic Enterococcus faecalis plays a key and causative role in the pathogenesis of anastomotic leak, an uncommon but potentially lethal complication characterized by disruption of the intestinal wound following segmental removal of the colon (resection) and its reconnection (anastomosis). Here we hypothesized that comparative genetic analysis of E. faecalis isolates present at the anastomotic wound site before and after surgery would shed insight into the mechanisms by which collagenolytic strains are selected for and predominate at sites of anastomotic disruption. Whole genome optical mapping of four pairs of isolates from rat colonic tissue obtained following surgical resection (herein named "pre-op" isolates) and then 6 days later from the anastomotic site (herein named "post-op" isolates) demonstrated that the isolates with higher collagenolytic activity formed a distinct cluster. In order to perform analysis at a deeper level, a single pair of E. faecalis isolates (16A pre-op and 16A post-op) was selected for whole genome sequencing and assembled using a hybrid assembly algorithm. Comparative genomics demonstrated absence of multiple gene clusters, notably a pathogenicity island in the post-op isolate. No differences were found in the fsr-gelE-sprE genes (EF1817-1822) responsible for regulation and production of collagenolytic activity. Analysis of unique genes among the 16A pre-op and post-op isolates revealed the predominance of transporter systems-related genes in the pre-op isolate and phage-related and hydrolytic enzyme-encoding genes in the post-op isolate. Despite genetic differences observed between pre-op and post-op isolates, the precise genetic determinants responsible for their differential expression of collagenolytic activity remains unknown.

59 BASIC BIOLOGICAL SCIENCES↗

Estimating Cosmological Constraints from Galaxy Cluster Abundance using Simulation-Based Inference

Inferring the values and uncertainties of cosmological parameters in a cosmology model is of paramount importance for modern cosmic observations. In this paper, we use the simulation-based inference (SBI) approach to estimate cosmological constraints from a simplified galaxy cluster observation analysis. Using data generated from the Quijote simulation suite and analytical models, we train a machine learning algorithm to learn the probability function between cosmological parameters and the possible galaxy cluster observables. The posterior distribution of the cosmological parameters at a given observation is then obtained by sampling the predictions from the trained algorithm. Our results show that the SBI method can successfully recover the truth values of the cosmological parameters within the 2σ limit for this simplified galaxy cluster analysis, and acquires similar posterior constraints obtained with a likelihood-based Markov Chain Monte Carlo method, the current state-of the-art method used in similar cosmological studies.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Electromagnetic Transient (EMT) Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (T&D Models)

Simulation of high-fidelity models of extreme fast charging (XFC) systems and large-area power grids with many XFCs can be time consuming in traditional simulators. Traditional simulators use a single method of discretization for all the components that results in imposing a large computational burden of inverting a large matrix as well as increased computations related to single method of discretization (that is typically a trapezoidal method). To overcome the problem of simulating large-area power grids with many XFCs, in this paper, advanced numerical simulation algorithms are applied for the first time together to reduce the dimension of matrix inversion. Here, the algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. These algorithms apply multiple discretization algorithms rather than a single discretization algorithm that further reduces the computational burden. The approaches mentioned here have resulted in speed-up of up to 18x in the simulation of a single distribution system with 15 XFCs and of up to 271x in the simulation of a transmission-distribution system with 300 XFCs in multiple distribution feeders with respect to conventional simulators (like power systems computer aided design [PSCAD]).

42 ENGINEERING↗

Beyond the hubble sequence – exploring galaxy morphology with unsupervised machine learning

We explore unsupervised machine learning for galaxy morphology analyses using a combination of feature extraction with a vector-quantized variational autoencoder (VQ-VAE) and hierarchical clustering (HC). We propose a new methodology that includes: (1) consideration of the clustering performance simultaneously when learning features from images; (2) allowing for various distance thresholds within the HC algorithm; (3) using the galaxy orientation to determine the number of clusters. This set-up provides 27 clusters created with this unsupervised learning that we show are well separated based on galaxy shape and structure (e.g. Sérsic index, concentration, asymmetry, Gini coefficient). These resulting clusters also correlate well with physical properties such as the colour–magnitude diagram, and span the range of scaling relations such as mass versus size amongst the different machine-defined clusters. When we merge these multiple clusters into two large preliminary clusters to provide a binary classification, an accuracy of $\sim 87{{\ \rm per\ cent}}$ is reached using an imbalanced data set, matching real galaxy distributions, which includes 22.7 per cent early-type galaxies and 77.3 per cent late-type galaxies. Comparing the given clusters with classic Hubble types (ellipticals, lenticulars, early spirals, late spirals, and irregulars), we show that there is an intrinsic vagueness in visual classification systems, in particular galaxies with transitional features such as lenticulars and early spirals. Based on this, the main result in this work is not how well our unsupervised method matches visual classifications and physical properties, but that the method provides an independent classification that may be more physically meaningful than any visually based ones.

79 ASTRONOMY AND ASTROPHYSICS↗

Fock-Space Schrieffer–Wolff Transformation: Classically-Assisted Rank-Reduced Quantum Phase Estimation Algorithm

We present an extension of many-body downfolding methods to reduce the resources required in the quantum phase estimation (QPE) algorithm. In this paper, we focus on the Schrieffer–Wolff (SW) transformation of the electronic Hamiltonians for molecular systems that provides significant simplifications of quantum circuits for simulations of quantum dynamics. We demonstrate that by employing Fock-space variants of the SW transformation (or rank-reducing similarity transformations (RRST)) one can significantly increase the locality of the qubit-mapped similarity-transformed Hamiltonians. The practical utilization of the SW-RRST formalism is associated with a series of approximations discussed in the manuscript. In particular, amplitudes that define RRST can be evaluated using conventional computers and then encoded on quantum computers. The SW-RRST QPE quantum algorithms can also be viewed as an extension of the standard state-specific coupled-cluster downfolding methods to provide a robust alternative to the traditional QPE algorithms to identify the ground and excited states for systems with various numbers of electrons using the same Fock-space representations of the downfolded Hamiltonian. The RRST formalism serves as a design principle for developing new classes of approximate schemes that reduce the complexity of quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Three dimensional cluster analysis for atom probe tomography using Ripley’s K-function and machine learning

The size and structure of spatial molecular and atomic clustering can significantly impact material properties and is therefore important to accurately quantify. Ripley’s K-function (K(r)), a measure of spatial correlation, can be used to perform such quantification when the material system of interest can be represented as a marked point pattern. This work demonstrates how machine learning models based on K (r)-derived metrics can accurately estimate cluster size and intra-cluster density in simulated three dimensional (3D) point patterns containing spherical clusters of varying size; over 90% of model estimates for cluster size and intra-cluster density fall within 11% and 18% error of the true values, respectively. These K (r)-based size and density estimates are then applied to an experimental APT reconstruction to characterize MgZn clusters in a 7000 series aluminum alloy. Here we find that the estimates are more accurate, consistent, and robust to user interaction than estimates from the popular maximum separation algorithm. Using K (r) and machine learning to measure clustering is an accurate and repeatable way to quantify this important material attribute.

36 MATERIALS SCIENCE↗

Integration of a DER Management System in Riverside. Final report

The tasks in this project covered various aspects, including algorithm development, algorithm integration into a commercial Active Network Management (ANM) platform, hardware-in-the-loop (HIL) testing in an industry-standard testing platform, pilot demonstration in Riverside, California, and also cost and benefit analysis. The DERMS platform in this project can host different algorithms developed on different platforms (e.g., MATLAB and Python) and it can interact with different hardware devices (e.g., different PV inverters, battery inverters, and different sensors). The DER control solution are based on an advanced model-free, layered, and clustered DER control paradigm. At the core of the DER control algorithms was the concept of Extremum Seeking (ES), which is a model-free probing-based control technique. The ES-based control algorithms were tested on major real-world inverters; both individually and in a cluster. It was shown that even legacy equipment (or when paired with a few additional advanced equipment) can support such advanced control. The monitoring algorithms utilize a heterogeneous set of legacy and advanced sensor measurements, such as behind-the-meter DER sensors, distribution-level Phase Measurement Units, distribution-substation Supervisory Control and Data Acquisition (SCADA), and line current sensors, with their limited availability; in order to infer practical network conditions. Sensor data are utilized to achieve resource forecasting, phase identification, and distribution system state estimation. The technology that was developed and demonstrated in this project could be transformational to utilities, including the smaller municipal utilities such as in Riverside, which may not have the resources to deploy advanced distribution system and DERMS solutions in order to support high penetration of solar power integration. This project created a real-world prototype to provide utilities with an assessment of smart grid monitoring and control technologies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Variational quantum eigensolver with reduced circuit complexity

Abstract The variational quantum eigensolver (VQE) is one of the most promising algorithms to find eigenstates of a given Hamiltonian on noisy intermediate-scale quantum devices (NISQ). The practical realization is limited by the complexity of quantum circuits. Here we present an approach to reduce quantum circuit complexity in VQE for electronic structure calculations. Our ClusterVQE algorithm splits the initial qubit space into clusters which are further distributed on individual (shallower) quantum circuits. The clusters are obtained based on mutual information reflecting maximal entanglement between qubits, whereas inter-cluster correlation is taken into account via a new “dressed” Hamiltonian. ClusterVQE therefore allows exact simulation of the problem by using fewer qubits and shallower circuit depth at the cost of additional classical resources, making it a potential leader for quantum chemistry simulations on NISQ devices. Proof-of-principle demonstrations are presented for several molecular systems based on quantum simulators as well as IBM quantum devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗