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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

AGP-based unitary coupled cluster theory for quantum computers

Electronic structure methods typically benefit from symmetry breaking and restoration, specially in the strong correlation regime. Here, the same goes for ansätze on a quantum computer. We develop a unitary coupled cluster method based on the antisymmetrized geminal power (AGP)—a state formally equivalent to the number-projected Bardeen–Cooper–Schrieffer wavefunction. We demonstrate our method for the single-band Fermi–Hubbard Hamiltonian in one and two dimensions. We also explore post-selection as a state preparation step to obtain correlated AGP and prove that it scales no worse than O(√M) in the number of measurements, thereby making it a less expensive alternative to gauge integration to restore particle number symmetry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Measurement of substructure-dependent jet suppression in Pb + Pb collisions at 5.02 TeV with the ATLAS detector

The ATLAS detector at the Large Hadron Collider has been used to measure jet substructure modification and suppression in Pb + Pb collisions at a nucleon–nucleon center-of-mass energy $\sqrt{{^S}_{NN}}$ = 5.02 TeV in comparison with proton–proton (pp) collisions at $\sqrt{{^S}}$ = 5.02 TeV. The Pb + Pb data, collected in 2018, have an integrated luminosity of 1.72 nb -1 , while the pp data, collected in 2017, have an integrated luminosity of 260 pb -1 . Jets used in this analysis are clustered using the anti- k t algorithm with a radius parameter R = 0.4. The jet constituents, defined by both tracking and calorimeter information, are used to determine the angular scale r g of the first hard splitting inside the jet by reclustering them using the Cambridge–Aachen algorithm and employing the soft-drop grooming technique. The nuclear modification factor, R AA , used to characterize jet suppression in Pb + Pb collisions, is presented differentially in r g , jet transverse momentum, and in intervals of collision centrality. The R AA value is observed to depend significantly on jet r g . Jets produced with the largest measured r g are found to be twice as suppressed as those with the smallest r g in central Pb + Pb collisions. The R AA values do not exhibit a strong variation with jet p T in any of the r g intervals. The r g and p T dependence of jet R AA is qualitatively consistent with a picture of jet quenching arising from coherence and provides the most direct evidence in support of this approach.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Ab Initio Study of the Beryllium Isotopes 7 Be to 12 Be

We present a systematic ab initio study of the low-lying states in beryllium isotopes from 7 Be to 12 Be using nuclear lattice effective field theory with the N 3 ⁢LO interaction. Our calculations achieve good agreement with experimental data for energies, radii, and electromagnetic properties. We introduce a novel, model-independent method to quantify nuclear shapes, uncovering a distinct pattern in the interplay between positive and negative parity states across the isotopic chain. By combining Monte Carlo sampling of the many-body density operator with a novel nucleon-grouping algorithm, the prominent two-center cluster structures, the emergence of one-neutron halo, complex nuclear molecular dynamics such as 𝜋 orbital and 𝜎 orbital, emerge naturally.

binding energy & masses↗
DOE OSTI2021

Particle-Tracking Proton Computed Tomography—Data Acquisition, Preprocessing, and Preconditioning

Proton CT (pCT) is a promising new imaging technique that can reconstruct relative stopping power (RSP) more accurately than x-ray CT in each cubic millimeter voxel of the patient. This, in turn, will result in better proton range accuracy and, therefore, smaller planned tumor volumes (PTV). The hardware description and some reconstructed images have previously been reported. In a series of two contributions, we focus on presenting the software algorithms that convert pCT detector data to the final reconstructed pCT images for application in proton treatment planning. There were several options on how to accomplish this, and we will describe our solutions at each stage of the data processing chain. In the first paper of this series, we present the data acquisition with the pCT tracking and energy-range detectors and how the data are preprocessed, including the conversion to the well-formatted track information from tracking data and water-equivalent path length from the data of a calibrated multi-stage energy-range detector. These preprocessed data are then used for the initial image formation with an FDK cone-beam CT algorithm. The output of data acquisition, preprocessing, and FDK reconstruction is presented along with illustrative imaging results for two phantoms, including a pediatric head phantom. The second paper in this series will demonstrate the use of iterative solvers in conjunction with the superiorization methodology to further improve the images resulting from the upfront FDK image reconstruction and the implementation of these algorithms on a hybrid CPU/GPU computer cluster.

42 ENGINEERING↗
DOE OSTI2026

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]↗
DOE OSTI2026

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]↗
NASA NTRS1988

The morphology of multiple-nucleus brightest cluster galaxies

The morphology of high SNR CCD images of 16 multiple-nucleus brightest cluster galaxies is studied using an algorithm that models images of the systems as the line-of-sight superposition of normal elliptical galaxies. The algorithm is applied initially to the classic multiple-nucleus cD galaxy in A2199. Evidence is found suggestive of deep interpenetrating high-speed encounters by its secondaries. The interactions effects studied include noncentric isophotes, brightness profile effects, excess light around primary galaxies, and dynamical friction wakes. The results show that in many cases multiple systems are interacting systems.

Lauer, Tod R.↗
NASA NTRS1996

Effect of Dust Coagulation Dynamics on the Geometry of Aggregates

Master equation gives a more fundamental description of stochastic coagulation processes rather than popular Smoluchowski's equation. In order to examine the effect of the dynamics on the geometry of resulting aggregates, we study Master equation with a rigorous Monte Carlo algorithm. It is found that Cluster-Cluster aggregation model is a good approximation of orderly growth and the aggregates have fluffy structures with a fractal dimension approx. 2. A scaling analysis of Smoluchowski's equation also supports this conclusion.

Nakamura, R.↗
NASA NTRS2005

Probabilisitc Geobiological Classification Using Elemental Abundance Distributions and Lossless Image Compression in Recent and Modern Organisms

Last year we presented techniques for the detection of fossils during robotic missions to Mars using both structural and chemical signatures[Storrie-Lombardi and Hoover, 2004]. Analyses included lossless compression of photographic images to estimate the relative complexity of a putative fossil compared to the rock matrix [Corsetti and Storrie-Lombardi, 2003] and elemental abundance distributions to provide mineralogical classification of the rock matrix [Storrie-Lombardi and Fisk, 2004]. We presented a classification strategy employing two exploratory classification algorithms (Principal Component Analysis and Hierarchical Cluster Analysis) and non-linear stochastic neural network to produce a Bayesian estimate of classification accuracy. We now present an extension of our previous experiments exploring putative fossil forms morphologically resembling cyanobacteria discovered in the Orgueil meteorite. Elemental abundances (C6, N7, O8, Na11, Mg12, Ai13, Si14, P15, S16, Cl17, K19, Ca20, Fe26) obtained for both extant cyanobacteria and fossil trilobites produce signatures readily distinguishing them from meteorite targets. When compared to elemental abundance signatures for extant cyanobacteria Orgueil structures exhibit decreased abundances for C6, N7, Na11, All3, P15, Cl17, K19, Ca20 and increases in Mg12, S16, Fe26. Diatoms and silicified portions of cyanobacterial sheaths exhibiting high levels of silicon and correspondingly low levels of carbon cluster more closely with terrestrial fossils than with extant cyanobacteria. Compression indices verify that variations in random and redundant textural patterns between perceived forms and the background matrix contribute significantly to morphological visual identification. The results provide a quantitative probabilistic methodology for discriminating putatitive fossils from the surrounding rock matrix and &om extant organisms using both structural and chemical information. The techniques described appear applicable to the geobiological analysis of meteoritic samples or in situ exploration of the Mars regolith. Keywords: cyanobacteria, microfossils, Mars, elemental abundances, complexity analysis, multifactor analysis, principal component analysis, hierarchical cluster analysis, artificial neural networks, paleo-biosignatures

Storrie-Lombardi, Michael C.↗
NASA NTRSDate not supplied

A Study of Parallel Scalability and Dynamic Workload Balancing in GlennICE

The Glenn Icing Computational Environment (GlennICE) is a computational tool designed to calculate ice growth on complex three-dimensional geometries. It utilizes user-supplied computational fluid dynamics solutions for the geometry of interest. Key developments include advancements in convergence of collection efficiency, trajectory optimization, and refinement methodology. These improvements have significantly enhanced GlennICE’s efficiency for practical engineering applications. A recent study focused on benchmarking GlennICE’s scalability in a parallel environment using static scheduling. Findings indicated a potential twofold increase in efficiency through workload balance enhancements. This paper presents an analysis of the solver’s new workload balancing improvements, incorporating shared memory and dynamic scheduling routines. Results demonstrate a highly efficient and consistent algorithm across high-performance computing clusters.

Computational Icing↗
NASA NTRSDate not supplied

A Study of Parallel Scalability and Dynamic Workload Balancing in GlennICE

The Glenn Icing Computational Environment (GlennICE) is a computational tool designed to calculate ice growth on complex three-dimensional geometries. It utilizes user-supplied computational fluid dynamics solutions for the geometry of interest. Key developments include advancements in convergence of collection efficiency, trajectory optimization, and refinement methodology. These improvements have significantly enhanced GlennICE’s efficiency for practical engineering applications. A recent study focused on benchmarking GlennICE’s scalability in a parallel environment using static scheduling. Findings indicated a potential twofold increase in efficiency through workload balance enhancements. This paper presents an analysis of the solver’s new workload balancing improvements, incorporating shared memory and dynamic scheduling routines. Results demonstrate a highly efficient and consistent algorithm across high-performance computing clusters.

Computational Icing↗
NASA NTRS2024

SupportU: Smart UAS Program for the Population by Offering Resources and Tools to the Unhoused

Global warming, challenging economic conditions, the opioid epidemic, and other widespread problems, have impacted people globally, particularly over the past several years. Preventable diseases like the common cold and the effects of heat stroke have become increasingly prevalent due to these issues. It is estimated that 150 million people of the world’s population are unhoused globally, with many dwelling in unsafe and unsanitary conditions while lacking access to basic hygienic items and other essentials. Unsanitary conditions coupled with this lack of access exacerbates and prolongs health problems and harms quality of life. Traditional methods of aid, such as homeless shelters and meal programs, face numerous challenges such as having limited reach and resources. To address these problems, the Smart UAS Program for the Population by Offering Resources and Tools to the Unhoused (SUPPORT U) utilizes Uncrewed Aircraft Systems (UAS) to deliver resources to the unhoused and those in need of basic aid, prior to and during extreme temperature conditions, and after natural disasters in rural, suburban, and urban areas. The UA is envisioned to be an autonomous aircraft capable of efficiently distributing essential supplies, including blankets, water, food, and medicine. The UAS fleet relies on advanced navigation and communication technologies to accurately identify unhoused people and efficiently and safely distribute materials to them. This will be done through a machine learning algorithm. By focusing on identified “homeless clusters”, places where unhoused individuals are concentrated, the UAS network increases access to critical resources, thereby helping to mitigate some of the external risks to the health of unhoused individuals. The UA can also be used during crises, such as by transporting supplies to medical tents that are stationed in difficult-to-reach areas suffering from natural disasters.

Samuel Beard↗
DOE OSTI2025

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↗
DOE OSTI2021

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↗
NASA NTRS1993

Fast parallel algorithms that compute transitive closure of a fuzzy relation

The notion of a transitive closure of a fuzzy relation is very useful for clustering in pattern recognition, for fuzzy databases, etc. The original algorithm proposed by L. Zadeh (1971) requires the computation time O(n(sup 4)), where n is the number of elements in the relation. In 1974, J. C. Dunn proposed a O(n(sup 2)) algorithm. Since we must compute n(n-1)/2 different values s(a, b) (a not equal to b) that represent the fuzzy relation, and we need at least one computational step to compute each of these values, we cannot compute all of them in less than O(n(sup 2)) steps. So, Dunn's algorithm is in this sense optimal. For small n, it is ok. However, for big n (e.g., for big databases), it is still a lot, so it would be desirable to decrease the computation time (this problem was formulated by J. Bezdek). Since this decrease cannot be done on a sequential computer, the only way to do it is to use a computer with several processors working in parallel. We show that on a parallel computer, transitive closure can be computed in time O((log(sub 2)(n))2).

Kreinovich, Vladik YA.↗
DOE OSTI2021

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↗
DOE OSTI2021

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↗