Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “local 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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Scalable semidefinite programming approach to variational embedding for quantum many-body problems

In quantum embedding theories, a quantum many-body system is divided into localized clusters of sites which are treated with an accurate ‘high-level’ theory and glued together self-consistently by a less accurate ‘low-level’ theory at the global scale. The recently introduced variational embedding approach for quantum many-body problems combines the insights of semidefinite relaxation and quantum embedding theory to provide a lower bound on the ground-state energy that improves as the cluster size is increased. The variational embedding method is formulated as a semidefinite program (SDP), which can suffer from poor computational scaling when treated with black-box solvers. Here, we exploit the interpretation of this SDP as an embedding method to develop an algorithm which alternates parallelizable local updates of the high-level quantities with updates that enforce the low-level global constraints. Moreover, we show how translation invariance in lattice systems can be exploited to reduce the complexity of projecting a key matrix to the positive semidefinite cone.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

ADEPT: a domain independent sequence alignment strategy for gpu architectures

Bioinformatic workflows frequently make use of automated genome assembly and protein clustering tools. At the core of most of these tools, a significant portion of execution time is spent in determining optimal local alignment between two sequences. This task is performed with the Smith-Waterman algorithm, which is a dynamic programming based method. With the advent of modern sequencing technologies and increasing size of both genome and protein databases, a need for faster Smith-Waterman implementations has emerged. Multiple SIMD strategies for the Smith-Waterman algorithm are available for CPUs. However, with the move of HPC facilities towards accelerator based architectures, a need for an efficient GPU accelerated strategy has emerged. Existing GPU based strategies have either been optimized for a specific type of characters (Nucleotides or Amino Acids) or for only a handful of application use-cases. In this paper, we present ADEPT, a new sequence alignment strategy for GPU architectures that is domain independent, supporting alignment of sequences from both genomes and proteins. Our proposed strategy uses GPU specific optimizations that do not rely on the nature of sequence. We demonstrate the feasibility of this strategy by implementing the Smith-Waterman algorithm and comparing it to similar CPU strategies as well as the fastest known GPU methods for each domain. ADEPT’s driver enables it to scale across multiple GPUs and allows easy integration into software pipelines which utilize large scale computational systems. We have shown that the ADEPT based Smith-Waterman algorithm demonstrates a peak performance of 360 GCUPS and 497 GCUPs for protein based and DNA based datasets respectively on a single GPU node (8 GPUs) of the Cori Supercomputer. Overall ADEPT shows 10x faster performance in a node-to-node comparison against a corresponding SIMD CPU implementation. ADEPT demonstrates a performance that is either comparable or better than existing GPU strategies. We demonstrated the efficacy of ADEPT in supporting existing bionformatics software pipelines by integrating ADEPT in MetaHipMer a high-performance denovo metagenome assembler and PASTIS a high-performance protein similarity graph construction pipeline. Our results show 10% and 30% boost of performance in MetaHipMer and PASTIS respectively.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Accurate and efficient open-source implementation of domain-based local pair natural orbital (DLPNO) coupled-cluster theory using a t1-transformed Hamiltonian

We present an efficient, open-source formulation for coupled-cluster theory through perturbative triples with domain-based local pair natural orbitals [DLPNO-CCSD(T)]. Similar to the implementation of the DLPNO-CCSD(T) method found in the ORCA package, the most expensive integral generation and contraction steps associated with the CCSD(T) method are linear-scaling. In this work, we show that the t1-transformed Hamiltonian allows for a less complex algorithm when evaluating the local CCSD(T) energy without compromising efficiency or accuracy. Our algorithm yields sub-kJ mol−1 deviations for relative energies when compared with canonical CCSD(T), with typical errors being on the order of 0.1 kcal mol−1, using our TightPNO parameters. We extensively tested and optimized our algorithm and parameters for non-covalent interactions, which have been the most difficult interaction to model for orbital (PNO)-based methods historically. To highlight the capabilities of our code, we tested it on large water clusters, as well as insulin (787 atoms).

Chemistry↗
DOE OSTI2024

Hidden orders and phase transitions for the fully packed quantum loop model on the triangular lattice

Abstract Quantum loop and dimer models are prototypical correlated systems with local constraints, which are not only intimately connected to lattice gauge theories and topological orders but are also widely applicable to the broad research areas of quantum materials and quantum simulation. Employing our sweeping cluster quantum Monte Carlo algorithm, we reveal the complete phase diagram of the triangular-lattice fully packed quantum loop model. Apart from the known lattice nematic (LN) solid and the even$${{\mathbb{Z}}}_{2}$$ Z 2 quantum spin liquid (QSL) phases, we discover a hidden vison plaquette (VP) phase, which had been overlooked and misinterpreted as a QSL for more than a decade. Moreover, the VP-to-QSL continuous transition belongs to the (2 + 1)D cubic * universality class, which offers a lattice realization of the (fractionalized) cubic fixed point that had long been considered as irrelevant towards the O(3) symmetry until corrected recently by conformal bootstrap calculations. Our results are therefore of relevance to recent developments in both experiments and theory, and facilitate further investigations of hidden phases and transitions.

Physics↗
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

A circuit-generated quantum subspace algorithm for the variational quantum eigensolver

Recent research has shown that wavefunction evolution in real and imaginary time can generate quantum subspaces with significant utility for obtaining accurate ground state energies. Inspired by these methods, we propose combining quantum subspace techniques with the variational quantum eigensolver (VQE). In our approach, the parameterized quantum circuit is divided into a series of smaller subcircuits. The sequential application of these subcircuits to an initial state generates a set of wavefunctions that we use as a quantum subspace to obtain high-accuracy groundstate energies. We call this technique the circuit subspace variational quantum eigensolver (CSVQE) algorithm. By benchmarking CSVQE on a range of quantum chemistry problems, we show that it can achieve significant error reduction in the best case compared to conventional VQE, particularly for poorly optimized circuits, greatly improving convergence rates. Furthermore, we demonstrate that when applied to circuits trapped at local minima, CSVQE can produce energies close to the global minimum of the energy landscape, making it a potentially powerful tool for diagnosing local minima.

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

The Future Electron-Ion Collider

Generalized Parton Distributions include rich information and became a powerful tool for studying hadron structure. Deeply Virtual Compton Scattering is the golden channel to access GPDs. The development of high luminosity and high-acceptance detectors (Electron-Ion Collider) allows physicists to overcome the difficulty of DVCS measurements. The outstanding performance of the accelerator performs the eA collisions at the center of mass energy from 20 to 140 GeV, while the luminosity at the scale of 1034 cm?2s?1. The new type of high-density crystal, PWO-II, produced by CRYTUR in 2×2×20 cm3 will be utilized in the calorimeter. The transparency of PWO-II crystals is > 70% at 620 nm, > 60% at 420 nm, and >35% at 360 nm. The crystals also show good radiation hardness under 30 Gy radiation exposure. Ten PWO-II crystals have a uniform light yield at 30 p.e./MeV, providing sufficient light yield to reduce the fluctuation of the energy measurements. Near 3000 crystals were constructed inside the 12-sided polygon supporting structure in the simulation. The island clustering algorithm was used for reconstructed the energy. The energy resolution study by the particle gun shows the stochastic term and constant term are 1.8% and 1.2%, respectively. The spatial resolution of NEEMC varies from 5% to 15% of the crystal?s width depending on the particle?s incident angle. The pion rejection of NEEMC can reach 103 with electron efficiency > 85% when the particle?s energy is larger than 1GeV. The Pi0- identified efficiency study can be interpreted as finding the local maxima in the single cluster caused by two high energy close photons. The study results show that efficiency is nearly 100% for pi0 energy is smaller than 10 GeV, and efficiency drops to 30% with 20 GeV pi0. The new type of 3x3 pixelated AC-LGAD were wire bonded to ALTIROC for performance test. The cross-talk between the adjacent channels is about 20% for VPA and 10% for TZ. A series of the TDC characteristic measurements show that the jitter for both preamplifiers is about 20 ps, and the time-walk effect is mild for inject charge > 12 pF. Furthermore, the beta source radiation results quantify the sharing scale of the 3x3 pixels AC-LGAD (? 20%). The electronics simulation study results show no significant changes in the spatial resolution, whether ADC resolution is 8, 10, or 12 bits. The 8-bit ADC is decided to use in the EICROC as it has a smaller size and power consumption than the 10-bit and 12-bit ADC. The ECCE is one of the full detector proposals for EIC. The new type of DVCS generator, called TOPEG, is used to generate the high acceptance beam configurations of 18×110 GeV2 electron and 4He. The acceptance study shows a -1.8 < ? < -1.4 gap between the BEMC and EEMC. The 10?x,y geometry cut is applied on the Roman Pots, so the acceptance of Roman Pots quickly drops to 0% when the polar angle of the recoiled 4He < 2 mrad. This primary ECCE simulation study suggests extending the acceptance of BEMC longitudinally as the structure limits the radial size of EEMC. The acceptance of the Roman Pots is still challenging. In 2023, The overall design of ePIC was finalized by merging two full detector proposals (ECCE and ATHENA) after a series of intensive simulation studies.

Wang, Pu-Kai↗
DOE OSTI2022

Distributed Hierarchical Contour Trees

Contour trees are a significant tool for data analysis as they capture both local and global variation. However, their utility has been limited by scalability, in particular for distributed computation and storage. We report a distributed data structure for storing the contour tree of a data set distributed on a cluster, based on a fan-in hierarchy, and an algorithm for computing it based on the boundary tree that represents only the superarcs of a contour tree that involve contours that cross boundaries between blocks. This allows us to limit the communication cost for contour tree computation to the complexity of the block boundaries rather than of the entire data set.

Carr, Hamish A↗
DOE OSTI2021

Explicit structure-preserving geometric particle-in-cell algorithm in curvilinear orthogonal coordinate systems and its applications to whole-device 6D kinetic simulations of tokamak physics

Explicit structure-preserving geometric particle-in-cell (PIC) algorithm in curvilinear orthogonal coordinate systems is developed. The work reported represents a further development of the structure-preserving geometric PIC algorithm achieving the goal of practical applications in magnetic fusion research. The algorithm is constructed by discretizing the field theory for the system of charged particles and electromagnetic field using Whitney forms, discrete exterior calculus, and explicit non-canonical symplectic integration. In addition to the truncated infinitely dimensional symplectic structure, the algorithm preserves exactly many important physical symmetries and conservation laws, such as local energy conservation, gauge symmetry and the corresponding local charge conservation. As a result, the algorithm possesses the long-term accuracy and fidelity required for first-principles-based simulations of the multiscale tokamak physics. The algorithm has been implemented in the SymPIC code, which is designed for high-efficiency massively-parallel PIC simulations in modern clusters. The code has been applied to carry out whole-device 6D kinetic simulation studies of tokamak physics. A self-consistent kinetic steady state for fusion plasma in the tokamak geometry is numerically found with a predominately diagonal and anisotropic pressure tensor. The state also admits a steady-state sub-sonic ion flow in the range of 10 km s -1 , agreeing with experimental observations and analytical calculations Kinetic ballooning instability in the self-consistent kinetic steady state is simulated. It is shown that high-n ballooning modes have larger growth rates than low-n global modes, and in the nonlinear phase the modes saturate approximately in 5 ion transit times at the 2% level by the E × B flow generated by the instability. These results are consistent with early and recent electromagnetic gyrokinetic simulations.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

MatLab Package for Whispering Gallery Mode Data

Dye-doped whispering gallery mode resonator (WGMR) microspheres yield highly structured emission spectra that are extremely sensitive to their environment and are of intense interest for use in a variety of sensing applications. Efforts to leverage the unique sensitivities of WGMRs have relied on stringent experimental requirements to correlate specific spectral shifts/changes to an analyte/stimulus such as 1) precise positional knowledge, 2) reference spectra for each microsphere, and 3) high mechanical stability. Consequently, these can hinder adequate mixing or incorporation of analytes and creates challenges for remote sensing. The MATLAB codes provided here are to be used in conjunction with a continuous flow technique for measuring WGM spectra of dye-doped microspheres suspended in solution. One MATLAB script, smooths the data, automatically baseline corrects it to isolate the whispering gallery modes (WGM) from the unwanted bulk emission, and assesses the similarity of each spectrum to aid in selecting a set of unique WGM spectra for further analysis. The next script is designed to analyze WGM spectra to determine the size of the resonator and the refractive index (RI) of its local environment without a priori knowledge of the individual microsphere. The final script allows the user to cluster spheres based on the product of their RI and radius and the contrast ratio of the RI of the sphere material and that of its environment by using a shared nearest neighbor spectral clustering algorithm.

Lilley, Laura↗
DOE OSTI2023

Unsupervised learning of representative local atomic arrangements in molecular dynamics data

Molecular dynamics (MD) simulations present a data-mining challenge, given that they can generate a considerable amount of data but often rely on limited or biased human interpretation to examine their information content. By not asking the right questions of MD data we may miss critical information hidden within it. Here we combine dimensionality reduction (UMAP) and unsupervised hierarchical clustering (HDBSCAN) to quantitatively characterize prevalent coordination environments of chemical species within MD data. By focusing on local coordination, we significantly reduce the amount of data to be analyzed by extracting all distinct molecular formulas within a given coordination sphere. We then efficiently combine UMAP and HDBSCAN with alignment or shape-matching algorithms to partition these formulas into structural isomer families indicating their relative populations. The method was employed to reveal details of cation coordination in electrolytes based on molecular liquids.

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

Metals and Quantum Materials with Spin-orbit Interactions by Quantum Monte Carlo methods

The key goals of this project were as follows: 1) Analysis and benchmarks of electron correlation effects recovered in the fixed-node approximation that is inherent to quantum Monte Carlo (QMC) method as applied to metallic states; 2) development of new algorithms for electron spin-degrees of freedom to be treated as explicit quantum variables; 3) designing electronic structure QMC algorithm for efficient evaluation of spin-orbit effects in systems with heavy atoms; 4) adapting the algorithm to complex wave functions and developing corresponding fixed-phase approximation; 5) design and testing of algorithm for valence-only non-local spin-orbit operators; 6) analysis of fixed-node vs fixed-phase errors and their comparisons. The key accomplishments: i) We carried out a systematic study of Li systems by the fixed-node diffusion Monte Carlo method. This involved Li atom, molecule, cluster and solid calculated by the full range of QMC methods including fixed-node QMC.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Data Analysis of the 2020 Central Idaho Mainshock-Aftershock Sequence

In an effort to inform the Senior Seismic Hazard Analysis Committee for the Idaho National Laboratory, we provide an improved aftershock catalog related to the March 31, 2020, Mw6.5 Stanley, Idaho earthquake from picks related to a temporary network of two real-time and 15 non-telemetered seismometers within the epicentral area. From the permanent and temporary (XP) real-time network, the USGS cataloged 1,946 aftershocks between April 1, 2020 and October 31, 2020. To improve aftershock location and magnitudes, we manually picked arrival times of P and S waves from off-line stations in the XP temporary network, generated a new crustal velocity model, and independently relocated each event using the HypoDD double-difference earthquake algorithm. We created our new velocity model from existing broadband and active source seismic campaign data that were acquired near the epicentral region prior to the 2020 earthquake. We compare arrival time differences, epicentral locations and depths between aftershocks recorded with the two catalogs. We find the addition of local stations provides tighter aftershock clustering that suggests an improved aftershock locations. To detect lower magnitude events, we employed deep learning. Our method solves common problems associated with detecting many events that have a low signal-to-noise ratio. From the machine learning database, we detected more than 74,000 aftershocks. Based on the number of identified earthquakes and Gutenberg-Richter relationships derived from the USGS catalog, we estimate that we have reduced the completion magnitude for the Stanley earthquake sequence to below M1 using this machine learning approach. We located each aftershock with our new velocity model. Our new velocity model and picks suggests aftershocks occurred mostly at shallower depths than assessed in the USGS catalog. These aftershocks align along two linear trends that suggest the activation of two unnamed primary faults.

58 GEOSCIENCES↗
DOE OSTI2025

Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data

In this paper, we propose a personalized Tucker decomposition (perTucker) to address the limitations of traditional tensor decomposition methods in capturing heterogeneity across different datasets. perTucker decomposes tensor data into shared global components and personalized local components. We introduce an order orthogonality assumption and develop a proximal gradient regularized block coordinate descent algorithm guaranteed to converge to a stationary point. The unique and common representations learned by perTucker reveal intrinsic statistical patterns in data and provide valuable information for a wide range of downstream analytics, including anomaly detection, source classification, and clustering. We demonstrate perTucker’s effectiveness through a simulation study and two case studies on solar flare detection and tonnage signal classification.

14 SOLAR ENERGY↗
DOE OSTI2023

An Extension of the Athena++ Code Framework for Radiation-magnetohydrodynamics in General Relativity Using a Finite-solid-angle Discretization

We extend the general-relativistic magnetohydrodynamics (GRMHD) capabilities of Athena++ to incorporate radiation. The intensity field in each finite-volume cell is discretized in angle, with explicit transport in both space and angle properly accounting for the effects of gravity on null geodesics, and with matter and radiation coupled in a locally implicit fashion. Here we describe the numerical procedure in detail, verifying its correctness with a suite of tests. Motivated in particular by black hole accretion in the high-accretion-rate, thin-disk regime, we demonstrate the application of the method to this problem. With excellent scaling on flagship computing clusters, the port of the algorithm to the GPU-enabled AthenaK code now allows the simulation of many previously intractable radiation-GRMHD systems.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

VoroClust: Scalable Clustering for Remote Sensing

Although supervised machine learning provides a powerful framework for image classification and segmentation, it requires comprehensive consistent datasets, which are not available for many remote-sensing applications. Remote-sensing datasets are expensive to collect, and each is acquired under different environmental conditions or with significant variations in system operating parameters. Unsupervised clustering algorithms analyze the structure of each dataset independently, rather than drawing on similarities with existing “training” examples, and are thus well suited for practical remote-sensing applications. We introduce VoroClust, a fast density-based unsupervised clustering algorithm applicable to high-resolution and high-dimensional data. VoroClust runs as fast as distance-based clustering methods, while capturing complex regional geometries at least as well as current-density-based methods. It uses a data-centered sphere cover to reduce computational demands, while still capturing data topology. It then propagates clusters outward from local peaks in density. We show that VoroClust provides fast state-of-the-art clustering for both high-resolution polarimetric synthetic aperture radar and high-dimensional hyperspectral imaging datasets.

42 ENGINEERING↗
DOE OSTI2021

Scalable, In-situ Data Clustering Data Analysis for Extreme Scale Scientific Computing (Final Report)

The objective of this project is to address challenges in the design and development of scalable in-situ data clustering and analytics algorithms and software. Our goal is to develop parallel software consisting of a set of spatio-temporal data clustering and anomaly detection functions, both of which are very important for large-scale analysis and have wide applicability for in-situ runs as well as post-processing analysis. Our design principles for in-situ analysis consider the following: (1) identify parts of the computation can be done close to the data within the nodes, while it is still in memory; (2) extract analysis components can (and should) be performed in remote staging and analysis nodes; (3) develop error-bound approximation methods for applications tolerable for small errors; (4) identify the type of derived distributions and statistics, for spatio-temporal data, that can be kept locally in order to both accelerate computations and meet energy constraints in subsequent iterations and phases; (5) use a self-describing data format so that data can be consistent and understood among local storage (memory and SSDs) and at staging and analysis nodes, thereby providing portability and flexibility; (6) develop service-oriented functions that can schedule in-situ and post-hoc analysis tasks based on the dynamic requirements of applications. Our development focus is to produce the parallel data analysis software/library that will be scalable, reusable, extensible, and generic for applications in different disciplines. The software will be able to run in-situ with the simulations as well as post-hoc analysis. This approach will satisfy many synergistic requirements for data intensive applications executed on data coming from instruments and experiments. In particular, the proposed multilevel approach is directly applicable to perform design tradeoffs for running part of the algorithms near the instruments and the rest on remote (analysis) systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A new self-adaptive reconstruction method to identify defects through Wigner–Seitz approach

A new self-adaptive reconstruction method based on local atomic structure at any given molecular dynamics (MD) step has been developed in this article. The method can be used in Wigner–Seitz defect analysis approach to correctly and efficiently explore the information of both point defects and complex defect clusters (e.g. dislocation loops and voids) formed after a displacement cascade where the cascade interacts with grain boundaries and/or dislocations. The algorithm and validation are provided in detail. Results for identification of radiation defects during and after cascades interacting with a dislocation network show that the new method can well recognize all simple and complex defects and defect clusters. Thus, this new method provides a totally new way to explore the density and size of radiation defects at atomic scale after complex MD evolution processes, providing correct information to understand and predict radiation damage in materials through atomic simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗