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

Model and remote-sensing-guided experimental design and hypothesis generation for monitoring snow-soil–plant interactions

In this study, we develop a machine-learning (ML)-enabled strategy for selecting hillslope-scale ecohydrological monitoring sites within snow-dominated mountainous watersheds, with a particular focus on snow-soil–plant interactions. Data layers rely on spatial data layers from both remote sensing and hydrological model simulations. Specifically, a Landsat-based foresummer drought sensitivity index is used to define the dependency of the annual peak plant productivity on the Palmer drought severity index in the early growing season. Hydrological simulations provide the spatiotemporal dynamics of near-surface soil moisture and snow depth. In this framework, a regression analysis identifies the key hydrological variables relevant to the spatial heterogeneity of drought sensitivity. We then apply unsupervised clustering to these key variables, using the Gaussian mixture model, to group hillslopes into several zones that have divergent relationships regarding soil moisture, snow dynamics, and drought sensitivity. Using the datasets collected in the East River Watershed (Crested Butte, Colorado, United States), results show that drought sensitivity is significantly correlated with model-derived soil moisture and snow-free timing over space and time. The relationship is, however, non-linear, such that the correlation decreases above a threshold elevation and in a heavy snow year due to large snowpacks, lateral flow, and soil storage limitations. Clustering is then able to define the zones that have high or low sensitivity to drought, as well as the mid-elevation regions where sensitivity is associated with the topographic aspect and net potential radiation. In addition, the algorithm identifies the most representative hillslopes with road/trail access within each zone for installing monitoring sites. Our method also aims to significantly increase the use of ML and model-simulation results to guide critical zone and watershed monitoring activities.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Trust based attachment

In social systems subject to indirect reciprocity, a positive reputation is key for increasing one’s likelihood of future positive interactions. The flow of gossip can amplify the impact of a person’s actions on their reputation depending on how widely it spreads across the social network, which leads to a percolation problem. To quantify this notion, we calculate the expected number of individuals, the “audience”, who find out about a particular interaction. For a potential donor, a larger audience constitutes higher reputational stakes, and thus a higher incentive, to perform “good” actions in line with current social norms. For a receiver, a larger audience therefore increases the trust that the partner will be cooperative. This idea can be used for an algorithm that generates social networks, which we call trust based attachment (TBA). TBA produces graphs that share crucial quantitative properties with real-world networks, such as high clustering, small-world behavior, and powerlaw degree distributions. We also show that TBA can be approximated by simple friend-of-friend routines based on triadic closure, which are known to be highly effective at generating realistic social network structures. Therefore, our work provides a new justification for triadic closure in social contexts based on notions of trust, gossip, and social information spread. These factors are thus identified as potential significant influences on how humans form social ties.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

LoVoCCS. I. Survey Introduction, Data Processing Pipeline, and Early Science Results

We present the Local Volume Complete Cluster Survey (LoVoCCS; we pronounce it as "low-vox" or "law-vox," with stress on the second syllable), an NSF's National Optical-Infrared Astronomy Research Laboratory survey program that uses the Dark Energy Camera to map the dark matter distribution and galaxy population in 107 nearby (0.03 < z < 0.12) X-ray luminous ([0.1–2.4 keV] L X500 > 10 44 erg s –1 ) galaxy clusters that are not obscured by the Milky Way. The survey will reach Vera C. Rubin Observatory Legacy Survey of Space and Time (LSST) Year 1–2 depth (for galaxies r = 24.5, i = 24.0, signal-to-noise ratio (S/N) > 20; u = 24.7, g = 25.3, z = 23.8, S/N > 10) and conclude in ~2023 (coincident with the beginning of LSST science operations), and will serve as a zeroth-year template for LSST transient studies. We process the data using the LSST Science Pipelines that include state-of-the-art algorithms and analyze the results using our own pipelines, and therefore the catalogs and analysis tools will be compatible with the LSST. We demonstrate the use and performance of our pipeline using three X-ray luminous and observation-time complete LoVoCCS clusters: A3911, A3921, and A85. A3911 and A3921 have not been well studied previously by weak lensing, and we obtain similar lensing analysis results for A85 to previous studies.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Beyond Limber: efficient computation of angular power spectra for galaxy clustering and weak lensing

Angular two-point statistics of large-scale structure observables are important cosmological probes. To reach the high accuracy required by the statistical precision of future surveys, some of these statistics may need to be computed without the commonly employed Limber approximation; the exact computation however requires integration over Bessel functions, and a brute-force evaluation is slow to converge. Here, we present a new method based on our generalized FFTLog algorithm for the efficient computation of angular power spectra beyond the Limber approximation. The new method significantly simplifies the calculation and improves the numerical speed and stability. It is easily extended to handle integrals involving derivatives of Bessel functions, making it equally applicable to numerically more challenging cases such as contributions from redshift-space distortions and Doppler effects. We implement our method for galaxy clustering and galaxy-galaxy lensing power spectra. We find that using the Limber approximation for galaxy clustering in future analyses like LSST Year 1 and DES Year 6 may cause significant biases in cosmological parameters, indicating that going beyond the Limber approximation is necessary for these analyses.

weak gravitational lensing↗
DOE OSTI2025

SITCOMTN-162: Testing the implementation of Metadetection and Cell-Based Coadds on Abell 360 LSSTComCam data

The purpose of this technote is to test the technical quality of LSSTComCam commissioning data, specifically the Rubin_SV_38_7 field, by utilizing cell-based coadds and Metadetection by measuring the tangential and cross weak lensing shear profiles of the massive cluster Abell 360 (called A360 throughout the technote). The process entails generating the cell-based coadds for Metadetection to run on, identifying and removing cluster member galaxies, applying quality cuts, calibrating the shear measurements, and validation. Cell-based coadds and Metadetection are both currently in the process of being implemented within the LSST Science Pipelines at the time of this technote. There is substantial technical value in attempting a difficult measurement prior to full implementation. Measuring the tangential shear around A360 will showcase the current abilities of these algorithms, as well as highlight where work is still needed. As seen from the resulting shear profile of A360, the cell-based coadds and Metadetection are able to work in tandem to produce a shear catalog and resulting reduced shear profile. This technote is one part of a series studying A360 in order to both stress test the commissioning camera and demonstrate the technical capabilities of the Vera Rubin Observatory. We study the quality of the PSF modeling and impact it can have on cluster WL in [Combet et al., 2025], implementation of cell-based coadds and subsequent use for Metadetect [Sheldon et al., 2023] in this technote, photometric calibration in (in prep), source selection and photometric redshifts in [Adari et al., 2025], use of Anacal [Li et al., 2024] to produce a cluster shear profile in [Li et al., 2025], and background subtraction in this field and Fornax in [Zhou et al., 2025].

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Coupled cluster theory on modern heterogeneous supercomputers

This study examines the computational challenges in elucidating intricate chemical systems, particularly through ab-initio methodologies. This work highlights the Divide-Expand-Consolidate (DEC) approach for coupled cluster (CC) theory—a linear-scaling, massively parallel framework—as a viable solution. Detailed scrutiny of the DEC framework reveals its extensive applicability for large chemical systems, yet it also acknowledges inherent limitations. To mitigate these constraints, the cluster perturbation theory is presented as an effective remedy. Attention is then directed towards the CPS (D-3) model, explicitly derived from a CC singles parent and a doubles auxiliary excitation space, for computing excitation energies. The reviewed new algorithms for the CPS (D-3) method efficiently capitalize on multiple nodes and graphical processing units, expediting heavy tensor contractions. As a result, CPS (D-3) emerges as a scalable, rapid, and precise solution for computing molecular properties in large molecular systems, marking it an efficient contender to conventional CC models.

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

Data-driven analysis of relight variability of jet fuels induced by turbulence

For safety purposes, reliable reignition of aircraft engines in the event of flame blow-out is a critical requirement. Typically, an external ignition source in the form of a spark is used to achieve a stable flame in the combustor. However, such forced turbulent ignition may not always successfully relight the combustor, mainly because the state of the combustor cannot be precisely determined. Uncertainty in the turbulent flow inside the combustor, inflow conditions, and spark discharge characteristics can lead to variability in sparking outcomes even for nominally identical operating conditions. Prior studies have shown that of all the uncertain parameters, turbulence is often dominant and can drastically alter ignition behavior. For instance, even when different fuels have similar ignition delay times, their ignition behavior in practical systems can be completely different. In practical operating conditions, it is challenging to understand why ignition fails and how much variation in outcomes can be expected. The focus of this work is to understand relight variability induced by turbulence for two different aircraft fuels, namely Jet-A and a variant named C1. A detailed, previously developed simulation approach is used to generate a large number of successful and failed ignition events. Using this data, the cause of misfire is evaluated based on a discriminant analysis that delineates the difference between turbulent initial conditions that lead to ignition or failure. From the discriminant analysis, a compressed sensing algorithm is then applied to help pinpoint the locations of relevant turbulent features. Findings from the discriminant analysis are confirmed with the time history of near kernel properties. Next, a clustering strategy is used to identify ignition and misfire modes. With this approach, it was determined that the cause of ignition failure is different for the two fuels. While it was found that Jet-A is influenced by fuel entrainment, C1 was found to be more sensitive to small scale turbulence features. Finally, a larger variability is found in the ignition modes of C1, which can be subject to extreme events induced by kernel breakdown.

42 ENGINEERING↗
DOE OSTI2025

Massively parallel phase-field simulations targeting exascale

The interface thickness in the phase-field (PF) method limits its simulation scales. Consequently, large-scale PF simulations become prohibitively expensive for resolving the extremely fine microstructures that typically form during rapid solidification processing. This challenge is significant in predicting microstructure evolution in metal additive manufacturing and has been identified by the United States Department of Energy’s Exascale Computing Project. Here, to address this, we develop a multi-GPU and MPI-based massively parallel simulation code, utilizing state-of-the-art algorithms, software, and libraries, for large-scale three-dimensional (3D) PF simulations. We report the first GPU-parallel PF simulations on Frontier (currently the second TOP500 exascale cluster) and Summit machines, taking dendritic growth as an example problem. We evaluate the parallel performance of our implementation using scaling studies with more than 24 000 GPUs (among the largest known computations to date) and the acceleration performance using large-scale simulations of dendritic growth in 3D. Finally, massively parallel GPUs in these supercomputers enabled the first coupled multiscale simulations of laser melting and subsequent dendritic solidification on the scale of a full melt-pool, demonstrating the feasibility of performing PF simulations with a point total over 2 billion grid points within an acceptable time.

Exascale↗
DOE OSTI2020

Truck platooning in the U.S. national road network: A system-level modeling approach

Truck platooning enables a group of trucks to move close together, which helps reduce truck fuel use and increase effective road capacity. In this paper, a system-level equilibrium model is developed to characterize spontaneous truck platooning with coexistence of non-platooning vehicles in a network, by explicitly accounting for the interlocking relationship among platoon formation time, truck fuel saving, and increase in effective road capacity. To equilibrate the relationships, an algorithm is proposed which involves a diagonalization approach and a bush based algorithm to solve decomposed subproblems. The condition of proportionality is imposed to obtain unique traffic flows for each class of vehicles on road links. In addition, a spatially constrained multivariate clustering technique is employed to construct origin/destination zones that are smaller than the coarse Freight Analysis Framework (FAF) zones, while maintaining reasonable computational burden for network traffic assignment. Model implementation in the U.S. shows that platooning could lead to 7.9% fuel saving among platoonable trucks in 2025 and a comparable increase in effective capacity of platoonable road links, which would account for 60% of rural interstate roads. The fuel saving and road capacity improvement translate into an annual cost reduction of $\$$868 million for the U.S. intercity trucking sector and reduced road infrastructure investment needs worth $\$$4.8 billion. Extensive sensitivity analysis further reveals that fuel saving of platoonable trucks increases with platoon size but decreases with inter-truck distance in a platoon. Fuel saving potential suggests that priority should be given to rural rather than urban roads in deploying platooning technologies. As we expected, greater market penetration of platooning technologies means higher fuel saving and greater increase in effective road capacity.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2023

Impact-Driven Sampling Strategies for Hybrid Attack Graphs

Cyber-Physical Systems (CPSs) have a large input space, with discrete and continuous elements across multiple layers. Hybrid Attack Graph (HAG) provide a flexible and efficient approach to generate attack sequences for a CPS. Analysis and testing of large-scale HAGs are prohibitively costly. We propose a dimension reduction via property-preserving multi-layer graph sampling algorithms. Existing property-preserving graph sampling approaches generate a representative subgraph of an original large-sized graph while preserving the key properties, such as node and edge distribution, clustering coefficients, and betweenness. On the other hand, we propose impact-driven sampling strategies to transform the input data to a lower-dimensional representation while retaining key properties of the data.

Subasi, Omer↗
DOE OSTI2025

COOL-LAMPS. VII. Quantifying Strong-lens Scaling Relations with 177 Cluster-scale Strong Gravitational Lenses in DECaLS

Abstract We estimate the Einstein-radius-enclosed total mass for 177 cluster-scale strong gravitational lenses identified by the ChicagO Optically selected Lenses Located At the Margins of Public Surveys (COOL-LAMPS) collaboration with lens redshifts ranging from 0.2 ⪅ z ⪅ 1.0 using the brightest-cluster-galaxy (BCG) redshift and an observable proxy for the Einstein radius. We constrain the Einstein-radius-enclosed luminosity and stellar mass by fitting parametric spectral energy distributions to aperture photometry from the Dark Energy Camera Legacy Survey (DECaLS) in the g -, r -, and z -band Dark Energy Camera filters. We find that the BCG redshift, enclosed total mass, and enclosed luminosity are strongly correlated and well described by a planar relationship in 3D space. We find that the enclosed total mass and stellar mass are correlated with a logarithmic slope of 0.50 0 − 0.031 + 0.029 , and the enclosed total mass and stellar-to-total mass fraction are correlated with a logarithmic slope of − 0.49 5 − 0.033 + 0.032 . In tandem with the small radii within which these slopes are constrained, this may suggest invariance in baryon conversion efficiency and feedback strength as a function of cluster-centric radii in galaxy clusters. Additionally, the correlations described here should have utility in ranking strong-lensing candidates in upcoming imaging surveys—such as Rubin/Legacy Survey of Space and Time—in which an algorithmic treatment of strong lenses will be needed due to the sheer volume of data these surveys will produce.

Mork, Simon D. (ORCID:0000000255739131)↗
DOE OSTI2025

Entropy-Assisted Quality Pattern Identification in Finance

Short-term patterns in financial time series form the cornerstone of many algorithmic trading strategies, yet extracting these patterns reliably from noisy market data remains a formidable challenge. In this paper, we propose an entropy-assisted framework for identifying high-quality, non-overlapping patterns that exhibit consistent behavior over time. We ground our approach in the premise that historical patterns, when accurately clustered and pruned, can yield substantial predictive power for short-term price movements. To achieve this, we incorporate an entropy-based measure as a proxy for information gain: patterns that lead to high one-sided movements in historical data yet retain low local entropy are more “informative” in signaling future market direction. Compared to conventional clustering techniques such as K-means and Gaussian Mixture Models (GMMs), which often yield biased or unbalanced groupings, our approach emphasizes balance over a forced visual boundary, ensuring that quality patterns are not lost due to over-segmentation. By emphasizing both predictive purity (low local entropy) and historical profitability, our method achieves a balanced representation of Buy and Sell patterns, making it better suited for short-term algorithmic trading strategies. This paper offers an in-depth illustration of our entropy-assisted framework through two case studies on Gold vs. USD and GBPUSD. While these examples demonstrate the method’s potential for extracting high-quality patterns, they do not constitute an exhaustive survey of all possible asset classes.

Physics↗
DOE OSTI2024

Improved particle-flow event reconstruction with scalable neural networks for current and future particle detectors

Abstract Efficient and accurate algorithms are necessary to reconstruct particles in the highly granular detectors anticipated at the High-Luminosity Large Hadron Collider and the Future Circular Collider. We study scalable machine learning models for event reconstruction in electron-positron collisions based on a full detector simulation. Particle-flow reconstruction can be formulated as a supervised learning task using tracks and calorimeter clusters. We compare a graph neural network and kernel-based transformer and demonstrate that we can avoid quadratic operations while achieving realistic reconstruction. We show that hyperparameter tuning significantly improves the performance of the models. The best graph neural network model shows improvement in the jet transverse momentum resolution by up to 50% compared to the rule-based algorithm. The resulting model is portable across Nvidia, AMD and Habana hardware. Accurate and fast machine-learning based reconstruction can significantly improve future measurements at colliders.

Physics↗
DOE OSTI2020

The clustering of DESI-like luminous red galaxies using photometric redshifts

ABSTRACT We present measurements of the redshift-dependent clustering of a DESI-like luminous red galaxy (LRG) sample selected from the Legacy Survey imaging data set, and use the halo occupation distribution (HOD) framework to fit the clustering signal. The photometric LRG sample in this study contains 2.7 million objects over the redshift range of 0.4 < z < 0.9 over 5655 deg2. We have developed new photometric redshift (photo-z) estimates using the Legacy Survey DECam and WISE photometry, with σNMAD = 0.02 precision for LRGs. We compute the projected correlation function using new methods that maximize signal-to-noise ratio while incorporating redshift uncertainties. We present a novel algorithm for dividing irregular survey geometries into equal-area patches for jackknife resampling. For a five-parameter HOD model fit using the MultiDark halo catalogue, we find that there is little evolution in HOD parameters except at the highest redshifts. The inferred large-scale structure bias is largely consistent with constant clustering amplitude over time. In an appendix, we explore limitations of Markov chain Monte Carlo fitting using stochastic likelihood estimates resulting from applying HOD methods to N-body catalogues, and present a new technique for finding best-fitting parameters in this situation. Accompanying this paper, we have released the Photometric Redshifts for the Legacy Surveys catalogue of photo-z’s obtained by applying the methods used in this work to the full Legacy Survey Data Release 8 data set. This catalogue provides accurate photometric redshifts for objects with z < 21 over more than 16 000 deg2 of sky.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

PAIReD jet: A multi-pronged resonance tagging strategy across all Lorentz boosts

We propose a new approach of jet-based event reconstruction that aims to optimally exploit correlations between the products of a hadronic multi-pronged decay across all Lorentz boost regimes. The new approach utilizes clustered small-radius jets as seeds to define unconventional jets, referred to as PAIReD jets. The constituents of these jets are subsequently used as inputs to machine learning-based algorithms to identify the flavor content of the jet. We demonstrate that this approach achieves higher efficiencies in the reconstruction of signal events containing heavy-flavor jets compared to other event reconstruction strategies at all Lorentz boost regimes. Classifiers trained on PAIReD jets also have significantly better background rejections compared to those based on traditional event reconstruction approaches using small-radius jets at low Lorentz boost regimes. The combined effect of a higher signal reconstruction efficiency and better classification performance results in a two to four times stronger rejection of light-flavor jets compared to conventional strategies at low Lorentz-boosts, and rejection rates similar to classifiers based on large-radius multi-pronged jets at high Lorentz-boost regimes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Network Analysis of Academic Medical Center Websites in the United States

Healthcare resources are published annually in repositories such as the AHA Annual Survey Database TM . However, these data repositories are created via manual surveying techniques which are cumbersome in collection and not updated as frequently as website information of the respective hospital systems represented. Also, this resource is not widely available to patients in an easy-to-use format. Network analysis techniques have the potential to create topological maps which serve to aid in pathfinding for patients in their search for healthcare services. This study explores the topological structure of forty United States academic health center websites. Network analysis is utilized to analyze and visualize 48,686 webpages. Several elements of network structure are examined including basic network properties, and centrality measures distributions. The Louvain community detection algorithm is used to examine the extent to which these techniques allow identification of healthcare resources within networks. The results indicate that websites with related healthcare services tend to form observable clusters useful in mapping key resources within a hospital system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Theory of Trotter Error with Commutator Scaling

The Lie-Trotter formula, together with its higher-order generalizations, provides a simple approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly understood. We develop a theory of Trotter error that overcomes the limitations of truncating the Baker-Campbell-Hausdorff expansion. Our analysis directly exploits the commutativity of operator summands, producing tighter error bounds for both real- and imaginary-time evolutions. Whereas previous work achieves similar goals for systems with geometric locality or Lie-algebraic structure, our approach holds in general. We give a host of improved algorithms for digital quantum simulation and quantum Monte Carlo methods, nearly matching or even outperforming the best previous results. Our applications include: (i) a simulation of second-quantized plane-wave electronic structure, nearly matching the interaction-picture algorithm of Low and Wiebe; (ii) a simulation of $k$-local Hamiltonians almost with induced one-norm scaling, faster than the qubitization algorithm of Low and Chuang; (iii) a simulation of rapidly decaying power-law interactions, outperforming the Lieb-Robinson-based approach of Tran et al.; (iv) a hybrid simulation of clustered Hamiltonians, dramatically improving the result of Peng, Harrow, Ozols, and Wu; and (v) quantum Monte Carlo simulations of the transverse field Ising model and quantum ferromagnets, tightening previous analyses of Bravyi and Gosset. We obtain further speedups using the fact that product formulas can preserve the locality of the simulated system. Specifically, we show that local observables can be simulated with complexity independent of the system size for power-law interacting systems, which implies a Lieb-Robinson bound nearly matching a recent result of Tran et al. Our analysis reproduces known tight bounds for first- and second-order formulas. We further investigate the tightness of our bounds for higher-order formulas. For quantum simulation of a one-dimensional Heisenberg model with an even-odd ordering of terms, our result overestimates the complexity by only a factor of $5$. Our bound is also close to tight for power-law interactions and other orderings of terms. This suggests that our theory can accurately characterize Trotter error in terms of both the asymptotic scaling and the constant prefactor.

quantum computing, numerical analysis↗
DOE OSTI2020

TeraChem Cloud: A High-Performance Computing Service for Scalable Distributed GPU-Accelerated Electronic Structure Calculations

The encapsulation and commoditization of electronic structure arise naturally as interoperability, and the use of nontraditional compute resources (e.g., new hardware accelerators, cloud computing) remains important for the computational chemistry community. Here, we present TERACHEM CLOUD, a high-performance computing service (HPCS) that offers on-demand electronic structure calculations on both traditional HPC clusters and cloud-based hardware. The framework is designed using off-the-shelf web technologies and containerization to be extremely scalable and portable. Within the HPCS model, users can quickly develop new methods and algorithms in an interactive environment on their laptop while allowing TERACHEM CLOUD to distribute ab initio calculations across all available resources. This approach greatly increases the accessibility of hardware accelerators such as graphics processing units (GPUs) and flexibility for the development of new methods as additional electronic structure packages are integrated into the framework as alternative backends. Cost-performance analysis indicates that traditional nodes are the most cost-effective long-term solution, but commercial cloud providers offer cutting-edge hardware with competitive rates for short-term large-scale calculations. We demonstrate the power of the TERACHEM CLOUD framework by carrying out several showcase calculations, including the generation of 300,000 density functional theory energy and gradient evaluations on medium-sized organic molecules and reproducing 300 fs of nonadiabatic dynamics on the B800-B850 antenna complex in LH2, with the latter demonstration using over 50 Tesla V100 GPUs in a commercial cloud environment in 8 h for approximately $1250.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗