Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “balanced clustering”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Operando XAS and DFT Uncover Structure-Performance Relationships in Re/TiO 2 for Selective CO 2 Hydrogenation to Methanol

The conversion of CO 2 into value-added chemicals, such as methanol, offers a promising pathway toward a renewable energy future. However, a precise kinetic control and a highly selective catalyst are necessary to overcome the thermodynamic preference for CO 2 hydrogenation to methane. Rhenium-based catalysts, particularly Re/TiO 2 , demonstrate high activity and selectivity for methanol under high-pressure conditions. For example, at 100 bar and 200 °C, a methanol selectivity of 97−99% was obtained. Catalysts with 1 wt % Re and 5 wt % Re/ TiO 2 were used to study the effect of cluster sizes. At 250 °C, the 1 wt % catalyst achieves 97% selectivity at 23% conversion, whereas 5 wt % Re/TiO 2 achieves 74% selectivity at 40% conversion, corresponding to a drop in space-time yield from 65 to 16 g CH 3 OH ·g Re −1 ·h −1 , respectively. X-ray absorption spectroscopy provided insights into the structure of the active sites, while density functional theory calculations revealed the effects of cluster size on the energy barriers for H 2 activation, CH 3 OH dissociation, and CH 3 OH desorption, all of which directly influence conversion and selectivity. These results underscore the importance of balancing cluster size for optimal catalyst performance and provide insights into the design of efficient and selective catalysts for renewable methanol production.

XAS↗
DOE OSTI2021

Balanced k -means clustering on an adiabatic quantum computer

Adiabatic quantum computers are a promising platform for efficiently solving challenging optimization problems. Therefore, many are interested in using these computers to train computationally expensive machine learning models. We present a quantum approach to solving the balanced k-means clustering training problem on the D-Wave 2000Q adiabatic quantum computer. In order to do this, we formulate the training problem as a quadratic unconstrained binary optimization (QUBO) problem. Unlike existing classical algorithms, our QUBO formulation targets the global solution to the balanced k-means model. We test our approach on a number of small problems and observe that despite the theoretical benefits of the QUBO formulation, the clustering solution obtained by a modern quantum computer is usually inferior to the solution obtained by the best classical clustering algorithms. Nevertheless, the solutions provided by the quantum computer do exhibit some promising characteristics. We also perform a scalability study to estimate the run time of our approach on large problems using future quantum hardware. Finally, as a final proof of concept, we used the quantum approach to cluster random subsets of the Iris benchmark data set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Clustering High-dimensional Toxicogenomics Data with Rare Signals

Toxicogenomics studies the gene and protein activities to drug treatments or toxic exposures. As the drugs and genes are numerous, toxicogenomics data are naturally high dimensional, with dimension sizes up to millions. In addition, the distribution of toxicogenomics data is oftentimes skewed, and they contain rare but important signals representing a cell or organism’s response to toxicity. The combination of high dimension and extremely skewed distribution of toxicogenomics data makes clustering analysis extremely challenging.We present our study of clustering toxicogenomics data using classical approaches such as principal component analysis as well as deep learning approaches such as auto-encoders. Our experiments show that these approaches fail to preserve rare signals and produce high-quality clusters. We then explore augmenting matrix factorization with deep learning techniques such as attention mechanism to produce latent representations for clustering. Our technique is able to better preserve rare signals after dimensionality reduction than prior approaches. Furthermore, we combine our augmented matrix factorization with a mechanism similar to autoencoder to balance separable clusters and low regeneration errors. Our experiments demonstrate better clustering with our proposed approach.

Cong, Guojing↗
DOE OSTI2020

Tensile properties of powder-metallurgical-processed tungsten alloys after neutron irradiation near recrystallization temperatures

The tensile properties of powder-metallurgical-processed Pure W, K-doped W, W-3%Re, and K-doped W-3%Re were examined after neutron irradiation up to 0.7 dpa at 910–1020 °C with a thermal neutron shield in the High Flux Isotope Reactor (HFIR). After irradiation, recrystallized Pure W (R) exhibited a brittle fracture mode, while recrystallized K-doped W-3%Re (R) exhibited a ductile fracture mode at 500 °C. K-doped W-3%Re (R) has fine grains, and hence, contains a considerable number of grain boundaries that act as sinks for irradiation defects. Solid solute Re in the W matrix could improve not only the mechanical properties of W, but also its resistance to neutron irradiation. At 500 °C, the ductility of K-doped W-3%Re after irradiation was significantly higher than that of Pure W. The irradiation at ~1000 °C did not induce hardening of stress-relieved (SR) W materials, but SR W materials tended to exhibit a decrease in the ultimate tensile strength (UTS) and an increase in total elongation (TE). Here, the softening due to the recovery and recrystallization of SR W materials and the hardening due to the formation of irradiation defect clusters were balanced during irradiation at ~1000 °C, and ductility was exhibited without an increase in strength.

36 MATERIALS SCIENCE↗
NASA NTRS1999

SAGE: The Self-Adaptive Grid Code

The multi-dimensional self-adaptive grid code, SAGE, is an important tool in the field of computational fluid dynamics (CFD). It provides an efficient method to improve the accuracy of flow solutions while simultaneously reducing computer processing time. Briefly, SAGE enhances an initial computational grid by redistributing the mesh points into more appropriate locations. The movement of these points is driven by an equal-error-distribution algorithm that utilizes the relationship between high flow gradients and excessive solution errors. The method also provides a balance between clustering points in the high gradient regions and maintaining the smoothness and continuity of the adapted grid, The latest version, Version 3, includes the ability to change the boundaries of a given grid to more efficiently enclose flow structures and provides alternative redistribution algorithms.

Davies, Carol B.↗
DOE OSTI2022

Profiling the BLAST bioinformatics application for load balancing on high-performance computing clusters

Abstract Background The Basic Local Alignment Search Tool (BLAST) is a suite of commonly used algorithms for identifying matches between biological sequences. The user supplies a database file and query file of sequences for BLAST to find identical sequences between the two. The typical millions of database and query sequences make BLAST computationally challenging but also well suited for parallelization on high-performance computing clusters. The efficacy of parallelization depends on the data partitioning, where the optimal data partitioning relies on an accurate performance model. In previous studies, a BLAST job was sped up by 27 times by partitioning the database and query among thousands of processor nodes. However, the optimality of the partitioning method was not studied. Unlike BLAST performance models proposed in the literature that usually have problem size and hardware configuration as the only variables, the execution time of a BLAST job is a function of database size, query size, and hardware capability. In this work, the nucleotide BLAST application BLASTN was profiled using three methods: shell-level profiling with the Unix “time” command, code-level profiling with the built-in “profiler” module, and system-level profiling with the Unix “gprof” program. The runtimes were measured for six node types, using six different database files and 15 query files, on a heterogeneous HPC cluster with 500+ nodes. The empirical measurement data were fitted with quadratic functions to develop performance models that were used to guide the data parallelization for BLASTN jobs. Results Profiling results showed that BLASTN contains more than 34,500 different functions, but a single function, RunMTBySplitDB, takes 99.12% of the total runtime. Among its 53 child functions, five core functions were identified to make up 92.12% of the overall BLASTN runtime. Based on the performance models, static load balancing algorithms can be applied to the BLASTN input data to minimize the runtime of the longest job on an HPC cluster. Four test cases being run on homogeneous and heterogeneous clusters were tested. Experiment results showed that the runtime can be reduced by 81% on a homogeneous cluster and by 20% on a heterogeneous cluster by re-distributing the workload. Discussion Optimal data partitioning can improve BLASTN’s overall runtime 5.4-fold in comparison with dividing the database and query into the same number of fragments. The proposed methodology can be used in the other applications in the BLAST+ suite or any other application as long as source code is available.

59 BASIC BIOLOGICAL SCIENCES↗
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 NTRS2004

Analysis of Regen Cooling in Rocket Combustors

The use of detailed CFD modeling for the description of cooling in rocket chambers is discussed. The overall analysis includes a complete three-dimensional analysis of the flow in the regenerative cooling passages, conjugate heat transfer in the combustor walls, and the effects of film cooling on the inside chamber. The results in the present paper omit the effects of film cooling and include only regen cooling and the companion conjugate heat transfer. The hot combustion gases are replaced by a constant temperature wall boundary condition. Load balancing for parallel cluster computations is ensured by using single-block unstructured grids for both fluids and solids, and by using a 'multiple physical zones' to account for differences in the number of equations. Validation of the method is achieved by comparing simple two-dimensional solutions with analytical results. Representative results for cooling passages are presents showing the effects of heat conduction in the copper walls with tube aspect ratios of 1.5:l.

Harper, Brent↗
DOE OSTI2021

QUBO formulations for training machine learning models

Abstract Training machine learning models on classical computers is usually a time and compute intensive process. With Moore’s law nearing its inevitable end and an ever-increasing demand for large-scale data analysis using machine learning, we must leverage non-conventional computing paradigms like quantum computing to train machine learning models efficiently. Adiabatic quantum computers can approximately solve NP-hard problems, such as the quadratic unconstrained binary optimization (QUBO), faster than classical computers. Since many machine learning problems are also NP-hard, we believe adiabatic quantum computers might be instrumental in training machine learning models efficiently in the post Moore’s law era. In order to solve problems on adiabatic quantum computers, they must be formulated as QUBO problems, which is very challenging. In this paper, we formulate the training problems of three machine learning models—linear regression, support vector machine (SVM) and balanced k-means clustering—as QUBO problems, making them conducive to be trained on adiabatic quantum computers. We also analyze the computational complexities of our formulations and compare them to corresponding state-of-the-art classical approaches. We show that the time and space complexities of our formulations are better (in case of SVM and balanced k-means clustering) or equivalent (in case of linear regression) to their classical counterparts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Automated identification of dominant physical processes

The identification of processes that locally and approximately dominate dynamical system behavior has enabled significant advances in understanding and modeling nonlinear differential dynamical systems. Conventional methods of dominant process identification involve piecemeal and ad hoc (non-rigorous, informal) scaling analyses to identify dominant balances of governing equation terms and to delineate the spatiotemporal boundaries (boundaries in space and/or time) of each dominant balance. For the first time, we present an objective global measure of the fit of dominant balances to observations, which is desirable for automation, and was previously undefined. Furthermore, we propose a formal definition of the dominant balance identification problem in the form of an optimization problem. Here, we show that the optimization can be performed by various machine learning algorithms, enabling the automatic identification of dominant balances. Our method is algorithm agnostic and it eliminates reliance upon expert knowledge to identify dominant balances which are not known beforehand.

42 ENGINEERING↗
DOE OSTI2023

Evidence for AGN-regulated Cooling in Clusters at z ∼ 1.4: A Multiwavelength View of SPT-CL J0607-4448

Abstract We present a multiwavelength analysis of the galaxy cluster SPT-CL J0607-4448 (SPT0607), which is one of the most distant clusters discovered by the South Pole Telescope at z = 1.4010 ± 0.0028. The high-redshift cluster shows clear signs of being relaxed with well-regulated feedback from the active galactic nucleus (AGN) in the brightest cluster galaxy (BCG). Using Chandra X-ray data, we construct thermodynamic profiles and determine the properties of the intracluster medium. The cool-core nature of the cluster is supported by a centrally peaked density profile and low central entropy ( K 0 = 18 − 9 + 11 keV cm 2 ), which we estimate assuming an isothermal temperature profile due to the limited spectral information given the distance to the cluster. Using the density profile and gas cooling time inferred from the X-ray data, we find a mass-cooling rate M ̇ cool = 100 − 60 + 90 M ⊙ yr −1 . From optical spectroscopy and photometry around the [O ii ] emission line, we estimate that the BCG star formation rate is SFR [ O II ] = 1.7 − 0.6 + 1.0 M ⊙ yr −1 , roughly two orders of magnitude lower than the predicted mass-cooling rate. In addition, using ATCA radio data at 2.1 GHz, we measure a radio jet power P cav = 3.2 − 1.3 + 2.1 × 10 44 erg s −1 , which is consistent with the X-ray cooling luminosity ( L cool = 1.9 − 0.5 + 0.2 × 10 44 erg s −1 within r cool = 43 kpc). These findings suggest that SPT0607 is a relaxed, cool-core cluster with AGN-regulated cooling at an epoch shortly after cluster formation, implying that the balance between cooling and feedback can be reached quickly. We discuss the implications for these findings on the evolution of AGN feedback in galaxy clusters.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Possibilities and Limitations of Kinematically Identifying Stars from Accreted Ultra-faint Dwarf Galaxies

Abstract The Milky Way has accreted many ultra-faint dwarf galaxies (UFDs), and stars from these galaxies can be found throughout our Galaxy today. Studying these stars provides insight into galaxy formation and early chemical enrichment, but identifying them is difficult. Clustering stellar dynamics in 4D phase space ( E , L z , J r , J z ) is one method of identifying accreted structure that is currently being utilized in the search for accreted UFDs. We produce 32 simulated stellar halos using particle tagging with the Caterpillar simulation suite and thoroughly test the abilities of different clustering algorithms to recover tidally disrupted UFD remnants. We perform over 10,000 clustering runs, testing seven clustering algorithms, roughly twenty hyperparameter choices per algorithm, and six different types of data sets each with up to 32 simulated samples. Of the seven algorithms, HDBSCAN most consistently balances UFD recovery rates and cluster realness rates. We find that, even in highly idealized cases, the vast majority of clusters found by clustering algorithms do not correspond to real accreted UFD remnants and we can generally only recover 6% of UFDs remnants at best. These results focus exclusively on groups of stars from UFDs, which have weak dynamic signatures compared to the background of other stars. The recoverable UFD remnants are those that accreted recently, z accretion ≲ 0.5. Based on these results, we make recommendations to help guide the search for dynamically linked clusters of UFD stars in observational data. We find that real clusters generally have higher median energy and J r , providing a way to help identify real versus fake clusters. We also recommend incorporating chemical tagging as a way to improve clustering results.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1999

Heterogeneous Clustering: Operational and User Impacts

Heterogeneous clustering can improve overall utilization of multiple hosts and can provide better turnaround to users by balancing workloads across hosts. Building a cluster requires both operational changes and revisions in user scripts.

Salm, Saita Wood↗
DOE OSTI2020

Diagnosis of convective organization and cold pools using ARM datasets and evaluation of a unified convection parameterization (UNICON)

Tropical thunderstorms often cluster together. Studies have suggested that the degree to which the tropical thunderstorms are clustered impacts Earth's energy balance and water cycle, as well as extreme precipitation events. However, the processes controlling the spatial distribution of the thunderstorms are poorly understood and are not properly represented in most computer models for weather and climate prediction. Under the goals of better understanding how convection organizes at the mesoscale and advancing the representation of mesoscale convective organization in global climate models, we i) objectively quantified the degrees of convective organization and diagnosed cold pool processes using ARM field campaign observations, ii) examined the organization processes in storm-resolving model simulations, and iii) evaluated the impacts of mesoscale convective organization in global model simulations. The project yielded a firm reference against which the global model representation of mesoscale convective organization and cold pools can be evaluated against and shed new light into the role of parameterized convective organization in the global model simulation of the basic state and variability. Our results revealed two distinct phases of convective clustering during the two-day rain episodes (Cheng et al. 2018) and a new mechanism through which vertical wind shear in the low-troposphere can aid convective organization over tropical oceans (Cheng et al. 2020). It was demonstrated that the interactive representation of cold pools and mesoscale convective organization is key for global models to successfully simulate both the mean state and intraseasonal variability in the tropics (Ahn et al. 2019; 2020).

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

EJFAT: Towards Intelligent Compute Destination Load Balancing

To handle increased data flow, Jefferson Lab (JLab) is partnering with ESnet for development of an AI/ML directed compute work Load Balancer (LB) of UDP streamed data. The LB is FPGA based featuring dynamically configurable, low latency and high throughput destination address switching. The LB provides integration of edge and core computing to support JLab experimental programs, the Electron-Ion Collider, as well as data centers of the future. In the ESnet/JLab FPGA Accelerated Transport (EJFAT) initiative, the function of the LB Data Plane (DP) is to redirect data streams to selectable (but unknown to sender) destination hosts based on current worload and within that host to destination ports as a function of sub- stream id. This effects hierarchical scaling, first across compute machines for processing over a series of events and second, across ports so different data source sub-streams may be assigned to different processors for further parallelization. The LB Control Plane (CP) programs the DP using compute farm telemetry to direct and balance workloads across a compute cluster as the operating conditions require. While Proportional/Integrative/Derivative (PID) controllers are often seen in similar applications, here we investigate the feasibility of a Reinforcement Learning (RL) based schedule manager running in the CP to provide dynamic updates to the DP scheduling policy.

Lawrence, David↗
DOE OSTI2024

Individual Data Sparsity in Smart Thermostat Big Data: Impacts on Modeling Thermostat Use Behavior Dynamics

This study explores the impacts of the sparsity of individual thermostat interaction data on modeling thermostat use behavior dynamics using a dataset of over 100,000 smart thermostats. In developing a data-driven model of Thermal Frustration Theory (TFT), we investigate the challenges and trade-offs in clustering occupant data to enhance predictive accuracy. Our findings reveal that a single, aggregated model fails to capture the diversity of occupant behaviors, resulting in extremely poor prediction performance. Conversely, excessive clustering exacerbates data sparsity, undermining model reliability. By identifying an optimal clustering strategy, we achieve a balance that significantly improves the prediction of manual setpoint changes during demand response (DR) events, enhancing energy management and occupant comfort

Fannon, David↗