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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Measurement of inclusive jet cross section and substructure in 𝑝 + 𝑝 collisions at $\sqrt{s}$ = 200 GeV

The jet cross section and jet-substructure observables in 𝑝 + 𝑝 collisions at $\sqrt{s}$ =200 GeV were measured by the PHENIX Collaboration at the Relativistic Heavy Ion Collider (RHIC). Jets are reconstructed from charged-particle tracks and electromagnetic-calorimeter clusters using the anti-𝑘 𝑡 algorithm with a jet radius of 𝑅 = 0.3 for jets with transverse momentum within 8.0 < 𝑝 𝑇 < 40.0 GeV/𝑐 and pseudorapidity |𝜂| < 0.15. Measurements include the jet cross section, as well as distributions of SoftDrop-groomed momentum fraction (𝑧 𝑔 ), charged-particle transverse momentum with respect to jet axis (𝑗 𝑇 ), and radial distributions of charged particles within jets (𝑟). Also measured was the distribution of 𝜉 = −ln⁡(𝑧), where 𝑧 is the fraction of the jet momentum carried by the charged particle. The measurements are compared to theoretical next-to and next-to-next-to-leading-order calculations, the PYTHIA and H erwig event generators, and to other existing experimental results. Indicated from these measurements is a lower particle multiplicity in jets at RHIC energies when compared to models. Also noted are implications for future jet measurements with sPHENIX at RHIC as well as at the future Electron-Ion Collider.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Sachdev-Ye-Kitaev model on a noisy quantum computer

Here we study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. By using a graph-coloring algorithm to minimize the number of commuting clusters of terms in the qubitized Hamiltonian, we find the gate complexity of the time evolution using the first-order product formula for N Majorana fermions is $\mathscr{O}$(N 5 J 2 t 2 /ε) where J is the dimensionful coupling parameter, t is the evolution time, and ε is the desired precision. With this improved resource requirement, we perform the time evolution for N=6,8 with maximum two-qubit circuit depth of 343. We perform different error mitigation schemes on the noisy hardware results and find good agreement with the exact diagonalization results on classical computers and noiseless simulators. In particular, we compute return probability after time t and out-of-time order correlators (OTOC) which is a standard observable of quantifying the chaotic nature of quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Selection function of clusters in Dark Energy Survey year 3 data from cross-matching with South Pole Telescope detections

Context. Galaxy clusters selected based on overdensities of galaxies in photometric surveys provide the largest cluster samples. However, modeling the selection function of such samples is complicated by noncluster members projected along the line of sight (projection effects) and the potential detection of unvirialized objects (contamination). Aims. We empirically constrained the magnitude of these effects by cross-matching galaxy clusters selected in the Dark Energy Survey data with the redMaPPer algorithm with significant detections in three South Pole Telescope surveys (SZ, pol-ECS, pol-500d). Methods. For matched clusters, we augmented the redMaPPer catalog with the SPT detection significance. For unmatched objects we used the SPT detection threshold as an upper limit on the SZe signature. Using a Bayesian population model applied to the collected multiwavelength data, we explored various physically motivated models to describe the relationship between observed richness and halo mass. Results. Our analysis reveals a clear preference for models with an additional skewed scatter component associated with projection effects over a purely log-normal scatter model. We rule out significant contamination by unvirialized objects at the high-richness end of the sample. While dedicated simulations offer a well-fitting calibration of projection effects, our findings suggest the presence of redshift-dependent trends that these simulations may not have captured. Our findings highlight that modeling the selection function of optically detected clusters remains a complicated challenge that requires a combination of simulation and data-driven approaches.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Clusters of galaxies up to z = 1.5 identified from photometric data of the Dark Energy Survey and unWISE

ABSTRACT Using photometric data from the Dark Energy Survey and the Wide-field Infrared Survey Explorer, we estimate photometric redshifts for 105 million galaxies using the nearest-neighbour algorithm. From such a large data base, 151 244 clusters of galaxies are identified in the redshift range of 0.1 < z ≲ 1.5 based on the overdensity of the total stellar mass of galaxies within a given photometric redshift slice, among which 76 826 clusters are newly identified and 30 477 clusters have a redshift z > 1. We cross-match these clusters with those in the catalogues identified from the X-ray surveys and the Sunyaev–Zel’dovich (SZ) effect by the Planck, South Pole Telescope and Atacama Cosmology Telescope surveys, and get the redshifts for 45 X-ray clusters and 56 SZ clusters. More than 95 per cent SZ clusters in the sky region have counterparts in our catalogue. We find multiple optical clusters in the line of sight towards about 15 per cent of SZ clusters.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Electromagnetic Transient Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (Distribution Grid Models)

The distribution and transmission grids are observing an increased penetration of power electronics in loads and generations. For example, there is increasing interest in integrating in extreme fast charging (XFC) systems for fast charging of electrical vehicles. As these systems are integrated, developing high-fidelity electromagnetic transient model of XFC systems in distribution grids and evaluating their interactions with the power grid would be of significant interest. This model will be utilized for design of XFC systems, to identify upgrades in distribution and/or transmission grids, for planning purposes by transmission planners or operators or owners, among others. It can also be utilized in operations for improved reliable performance of the grid and/or XFC station. The challenge with simulating these models is the high computational complexity introduced by the large number of states present in the system and the time-step needed to simulate the system. In this paper, advanced simulations algorithms are applied to reduce the computational complexity of simulating large-scale XFC systems. The algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. While the first three algorithms split the matrix that needs to be inverted from a large matrix to much smaller matrices, the final algorithm reduces the computational burden of applying higher-order integration approaches in the complete system. The comparison made in the previous sentence is with respect to use of homogeneous integration approaches used in conventional electromagnetic transient simulators like power systems computer aided design (PSCAD). The approaches mentioned here have resulted in speed-up of 36x in the simulation of a single distribution system with 15 XFCs.

Debnath, Suman↗
DOE OSTI2020

Finite-Temperature Structures of Supported Subnanometer Catalysts Inferred via Statistical Learning and Genetic Algorithm-Based Optimization

Single-atom catalysts (SACs) minimize noble metal utilization and can alter the activity and selectivity of supported metal nanoparticles. However, the morphology of active centers, including single atoms and subnanometer clusters of a few atoms, remains elusive due to experimental challenges. The computational cost to describe numerous cluster shapes and sizes makes direct first-principles calculations impractical. We present a computational framework to enable structure determination for single-atom and subnanometer cluster catalysts. As a case study, we obtained the low energy structures of Pd n (n = 1-21) clusters supported on CeO 2 (111), which are critical components of automobile three-way catalysts. Trained on density functional theory data, a three-dimensional cluster expansion is established using statistical learning to describe the Hamiltonian and predict energies of supported Pdn clusters of any structure. Low energy stable and metastable structures are identified using a Metropolis Monte Carlo-based genetic algorithm in the canonical ensemble at 300 K. We observe that supported single atoms sinter to form bilayer clusters and large cluster isomers share similarities in both shape and energy, and elucidate the significance of the support and microstructure on cluster stability. We discovered a simple surrogate structure-energy model, where the energy per atom scales with the square root of the average first coordination number, which can be used to estimate energies and compare the stability of clusters. Our framework, applicable to any metal/support system, fills an important methodological gap to predict the stability of supported metal catalysts in the subnanometer regime.

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

Register-Like Storage Block Used as Histograms, Cluster Buffers, and Hough Transform Accumulators for HEP Trigger Systems

In high energy physics experiment trigger systems, block memories are utilized for various purposes, especially in binned searching algorithms. In these algorithms, the storages are demanded to perform like a large set of registers. The writing and reading operation must be performed in single clock cycle and once an event is processed, the memory must be globally reset. These demands can be fulfilled with registers but the cost of using registers for large memory is unaffordable. Another common requirement is the boundary coverage feature during reading process. Additionally, when a memory bin is addressed, the stored contents in the addressed bin and its neighboring bin must be output simultaneously. In this paper, a register-like block storage design scheme is described, which allows updating memory locations in single clock cycle, reading two adjacent bins, and effectively refreshing entire memory within a single clock. The implementation and test results are presented.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Assessing Ground State Energy of Molecules and Energy Profile of the NH3 Capturing CO2 System Using the Quantum Computing Algorithms

Molecule size correlates with the number of electrons on electronic energies and strength of anharmonicity on vibrational properties, however, it is challenging to address using classical computing. In this study, variational quantum eigensolver (VQE) algorithm was implemented on a quantum simulator to quantify electronic and vibrational energies and reaction pathways of CO2 + NH3 = NH2COOH. The VQE-based Hartree-Fock-Embedding algorithm was adopted to benchmark electronic energies for a series of molecules (doi.org/10.1063/5.0188249) and quantify the reaction energy profile of the CO2 capture reaction (doi.org/10.1116/5.0137750). The generated reaction profile is in good agreement with the classical high-level Coupled-Cluster-Singles-and-Doubles (CCSD) results. The quantum computing algorithm also helps enhance the calculation of vibrational ground-state energies by considering the many-body coupling using the Vibrational Self-Consistent Field method, providing results for CO2 and NH3 molecules with accuracy comparable to the direct diagonalization method. Our approach indicates quantum computing can be applied to solve practical problems.

Lee, Yueh-Lin↗
DOE OSTI2026

Automated Classification of Vehicle Movements at Signalized Intersections Using Vehicle Trajectories

Accurate vehicle movement classification through signalized intersections is of paramount importance to the analysis of intersection performance and the optimization of traffic control strategies. Conventional techniques for tracking vehicle turning movements depend on infrastructure-based strategies like human counts, loop detectors, and video analytics, all of which are costly, prone to errors, and spatially constrained. High-frequency trajectory data can be utilized to determine vehicle movement patterns in a scalable and infrastructure-independent method due to the adoption of connected vehicles (CVs). In recent years, several studies have utilized connected vehicle data to generate performance measures. Most of the trajectory-based performance measures approaches, however, require map matching-i.e., extracting geospatial references from maps to identify the movements that individual vehicles make at a signalized intersection. These approaches are often time-consuming and hinder scalability since geographic features need to be provided for an analysis to be conducted. Map matching methods are prone to errors as different map versions change these geographic features. This research presents a novel automatic classification pipeline that uses CV trajectory data to classify vehicle movements at signalized crossings, specifically pass-through left-turn and right-turn maneuvers. The process starts by filtering trips that cross a spatial bounding box that has been defined at the target intersection. Approach and departure headings for each trajectory crossing the boundary are computed and are clustered together to identify dominant movements. The proposed algorithm is used to classify the movement of vehicles at 10 intersections in the state of California, and the results indicate that the algorithm can classify movements at these intersections with varying traffic volumes and road network configurations, all in a map-less framework with no need for conflation of vehicle trajectories to a digital base map.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

S-PLUS DR1 galaxy clusters and groups catalogue using PzWav

ABSTRACT We present a catalogue of 4499 groups and clusters of galaxies from the first data release of the multi-filter (5 broad, 7 narrow) Southern Photometric Local Universe Survey (S-PLUS). These groups and clusters are distributed over 273 deg2 in the Stripe 82 region. They are found using the PzWav algorithm, which identifies peaks in galaxy density maps that have been smoothed by a cluster scale difference-of-Gaussians kernel to isolate clusters and groups. Using a simulation-based mock catalogue, we estimate the purity and completeness of cluster detections: at S/N > 3.3, we define a catalogue that is 80 per cent pure and complete in the redshift range 0.1 < z < 0.4, for clusters with M200 > 1014 M⊙. We also assessed the accuracy of the catalogue in terms of central positions and redshifts, finding scatter of σR = 12 kpc and σz = 8.8 × 10−3, respectively. Moreover, less than 1 per cent of the sample suffers from fragmentation or overmerging. The S-PLUS cluster catalogue recovers ∼80 per cent of all known X-ray and Sunyaev-Zel’dovich selected clusters in this field. This fraction is very close to the estimated completeness, thus validating the mock data analysis and paving an efficient way to find new groups and clusters of galaxies using data from the ongoing S-PLUS project. When complete, S-PLUS will have surveyed 9300 deg2 of the sky, representing the widest uninterrupted areas with narrow-through-broad multi-band photometry for cluster follow-up studies.

Astronomy & Astrophysics↗
DOE OSTI2023

“Smarter” NICs for faster algorithms [Slides]

The basic building block of a distributed-memory cluster or supercomputer is a node. Each node includes a host, which is a processor (xPU) + memory hierarchy. The host can communicate with other hosts via its NIC (network interface controller). A network connects the nodes. The nodes may be arranged in some topology, which determines the network’s carrying capacity and cost.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Measuring Chemical Likeness of Stars with Relevant Scaled Component Analysis

Identification of chemically similar stars using elemental abundances is core to many pursuits within Galactic archeology. However, measuring the chemical likeness of stars using abundances directly is limited by systematic imprints of imperfect synthetic spectra in abundance derivation. We present a novel data-driven model that is capable of identifying chemically similar stars from spectra alone. We call this relevant scaled component analysis (RSCA). RSCA finds a mapping from stellar spectra to a representation that optimizes recovery of known open clusters. By design, RSCA amplifies factors of chemical abundance variation and minimizes those of nonchemical parameters, such as instrument systematics. The resultant representation of stellar spectra can therefore be used for precise measurements of chemical similarity between stars. We validate RSCA using 185 cluster stars in 22 open clusters in the Apache Point Observatory Galactic Evolution Experiment survey. We quantify our performance in measuring chemical similarity using a reference set of 151,145 field stars. We find that our representation identifies known stellar siblings more effectively than stellar-abundance measurements. Using RSCA, 1.8% of pairs of field stars are as similar as birth siblings, compared to 2.3% when using stellar-abundance labels. We find that almost all of the information within spectra leveraged by RSCA fits into a two-dimensional basis, which we link to [Fe/H] and α-element abundances. We conclude that chemical tagging of stars to their birth clusters remains prohibitive. However, using the spectra has noticeable gain, and our approach is poised to benefit from larger data sets and improved algorithm designs.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Combining Spectroscopic and Imaging Galaxy Surveys for Improved Measurements of Large-Scale Structure

Galaxy imaging surveys represent a promising opportunity for testing cosmological models but suffer from significant challenges associated with galaxy redshift uncertainty. I present improved techniques for the use of spectroscopic redshifts for measurements of large-scale structure with galaxy imaging surveys. I additionally present the results of the application of these techniques to data from the Sloan Digital Sky Survey (SDSS) and the Dark Energy Survey (DES). The results of my work are photometric redshift measurements of the approximately 100 million galaxies comprising the the DES Year 3 Weak Lensing Source Galaxy Catalog, constraints on parameters of the Lambda-CDM cosmological model based on the gravitational lensing and clustering of the DES Year 3 source and lens galaxy catalogs, an algorithm for propagating uncertainties measured in simulations to analogous measurements on data, and measurements of the incidence of projection effects in optically detected clusters of galaxies. I argue that continued development of the methods I have worked on is a promising path toward a conclusive test of Lambda-CDM with galaxy surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Global Optimization of Chemical Cluster Structures: Methods, Applications, and Challenges

Chemical clusters are relevant to many applications in catalysis, separations, materials, and energy sciences. Experimentally, the structure of clusters is difficult to determine, but it is very important in understanding their chemistry and properties. Computational methods can be used to examine cluster structure, however finding the most stable structure is not simple, particularly as the cluster size increases. Global optimization techniques have long been used to tackle the problem of the most stable structure, but such approaches would have to look for a global minimum, while sampling local minima over the whole potential energy surface as well. In this review, the state-of-the-art theory of global optimization theory is summarized. First, the definition, significance, relation to experiments, and a brief history of global optimization is presented. We then discuss, in more detail, three versatile global optimization methods: the basin hopping, the artificial bee colony algorithm, and the genetic algorithm. We close with some representative application examples of global optimization of clusters since 2016 and the challenges, open questions and opportunities in this field.

Global optimization, Chemical clusters, Artificial↗
DOE OSTI2020

Symbol alphabets from plabic graphs

Symbol alphabets of n-particle amplitudes in N = 4 super-Yang-Mills theory are known to contain certain cluster variables of Gr(4, n) as well as certain algebraic functions of cluster variables. In this paper we suggest an algorithm for computing these symbol alphabets from plabic graphs by solving matrix equations of the form C ∙ Z = 0 to associate functions on Gr(m, n) to parameterizations of certain cells of Gr(k, n) indexed by plabic graphs. For m = 4 and n = 8 we show that this association precisely reproduces the 18 algebraic symbol letters of the two-loop NMHV eight-particle amplitude from four plabic graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

A mapped dataset of surface ocean acidification indicators in large marine ecosystems of the United States

Mapped monthly data products of surface ocean acidification indicators from 1998 to 2022 on a 0.25° by 0.25° spatial grid have been developed for eleven U.S. large marine ecosystems (LMEs). The data products were constructed using observations from the Surface Ocean CO 2 Atlas, co-located surface ocean properties, and two types of machine learning algorithms: Gaussian mixture models to organize LMEs into clusters of similar environmental variability and random forest regressions (RFRs) that were trained and applied within each cluster to spatiotemporally interpolate the observational data. The data products, called RFR-LMEs, have been averaged into regional timeseries to summarize the status of ocean acidification in U.S. coastal waters, showing a domain-wide carbon dioxide partial pressure increase of 1.4 ± 0.4 μatm yr -1 and pH decrease of 0.0014 ± 0.0004 yr -1 . RFR-LMEs have been evaluated via comparisons to discrete shipboard data, fixed timeseries, and other mapped surface ocean carbon chemistry data products. Regionally averaged timeseries of RFR-LME indicators are provided online through the NOAA National Marine Ecosystem Status web portal.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Variational quantum eigensolver for approximate diagonalization of downfolded Hamiltonians using generalized unitary coupled cluster ansatz

In this paper we discuss the utilization of Variational Quantum Solver (VQE) and recently introduced Generalized Unitary Coupled Cluster (GUCC) formalism for the diagonalization of downfolded/effective Hamiltonians in active spaces. In addition to effective Hamiltonians defined by the downfolding of a subset of virtual orbitals we also consider their form defined by freezing core orbitals, which enables us to deal with larger systems. Furthermore, we also consider various solvers to identify solutions of the GUCC equations. We use N 2 , H 2 O, and C 2 H 4 , and benchmark systems to illustrate the performance of the combined framework.

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

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗