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

Modeling of H2 Dispersion at ARIES

Hydrogen is a versatile and clean energy carrier that can be produced from various renewable sources such as wind, solar, and hydropower and help decarbonize electricity grids, industry, and transportation. Using the Hydrogen Research Facility under Advanced Research on Integrated Energy Systems (ARIES) at the National Renewable Energy Laboratory's (NREL) Flatirons campus as a test bench, the study examines the feasibility, useability, and value of using computational fluid dynamics (CFD) techniques to model hydrogen dispersion. The ARIES facility was chosen because controlled hydrogen releases can be performed at a rate of 27 kg-H2/hr. Site-specific atmospheric and weather condition data such as wind speed and temperature were used as inputs to the model. The results show statistical distributions and ranges of hydrogen concentrations at locations throughout the domain. Wind conditions are found to significantly impact the release behavior, including the hydrogen cloud's direction and concentrations. At low wind speeds (below 1 mph), hydrogen forms a cloud and at higher wind speeds (> 2-4 mph) hydrogen plume stretches in the direction of wind momentum. From >100 simulations for ARIES site-specific conditions, statistical quantities combined with a clustering algorithm were used to propose sensor location at various elevations from ground.

dispersion↗
DOE OSTI2020

NWPEsSe: an Adaptive-Learning Global Optimization Algorithm for Nanosized Cluster Systems

Global optimization constitutes an important and fundamental problem in theoretical studies in many chemical fields, such as catalysis, materials or separations problems. In this paper, a novel algorithm has been developed for the global optimization of large systems including neat and ligated clusters in gas phase, and supported clusters in periodic boundary conditions. The method is based on an updated artificial bee colony (ABC) algorithm method, that allows for adaptive-learning during the search process. The new algorithm is tested against four classes of systems of diverse chemical nature: gas phase Au_55, ligated Au_8^(2+), Au_8 supported on graphene oxide and defected rutile, and a large cluster assembly ?[Co?_6 Te_8 (PEt_3 )_6][C_60 ]_n, with sizes ranging between 1 to 3 nm and containing up to 1300 atoms. Reliable global minima (GMs) are obtained for all cases, either confirming published data or reporting new lower energy structures. The algorithm and interface to other codes in the form of an independent program, Northwest Potential Energy Search Engine (NWPEsSe), is freely available and it provides a powerful and efficient approach for global optimization of nanosized cluster systems. The work described in this publication was performed at Pacific Northwest National Laboratory (PNNL), which is operated by Battelle for the United States Department of Energy (DOE) under Contract DE-AC05-76RL0180. J. Z. and V.-A. G. acknowledge support from DOE, Office of Science, Office of Basic Energy Sci-ences, Chemical, Geological and Biological Sciences Division and computing resources from PNNL’s Research Computing Facility and the National Energy Research Scientific Computing Center.

Zhang, Jun↗
NASA NTRS2006

Development of a Genetic Algorithm to Automate Clustering of a Dependency Structure Matrix

Much technology assessment and organization design data exists in Microsoft Excel spreadsheets. Tools are needed to put this data into a form that can be used by design managers to make design decisions. One need is to cluster data that is highly coupled. Tools such as the Dependency Structure Matrix (DSM) and a Genetic Algorithm (GA) can be of great benefit. However, no tool currently combines the DSM and a GA to solve the clustering problem. This paper describes a new software tool that interfaces a GA written as an Excel macro with a DSM in spreadsheet format. The results of several test cases are included to demonstrate how well this new tool works.

Rogers, James L.↗
NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental tool in numerous image processing and remote sensing applications. For example, unsupervised clustering is often used to obtain vegetation maps of an area of interest. This approach is useful when reliable training data are either scarce or expensive, and when relatively little a priori information about the data is available. Unsupervised clustering methods play a significant role in the pursuit of unsupervised classification. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points (or samples) in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute a set of cluster centers in d-space. Although there is no specific optimization criterion, the algorithm is similar in spirit to the well known k-means clustering method in which the objective is to minimize the average squared distance of each point to its nearest center, called the average distortion. One significant feature of ISOCLUS over k-means is that clusters may be merged or split, and so the final number of clusters may be different from the number k supplied as part of the input. This algorithm will be described in later in this paper. The ISOCLUS algorithm can run very slowly, particularly on large data sets. Given its wide use in remote sensing, its efficient computation is an important goal. We have developed a fast implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm, the filtering algorithm, by Kanungo et al.. They showed that, by storing the data in a kd-tree, it was possible to significantly reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm. For technical reasons, which are explained later, it is necessary to make a minor modification to the ISOCLUS specification. We provide empirical evidence, on both synthetic and Landsat image data sets, that our algorithm's performance is essentially the same as that of ISOCLUS, but with significantly lower running times. We show that our algorithm runs from 3 to 30 times faster than a straightforward implementation of ISOCLUS. Our adaptation of the filtering algorithm involves the efficient computation of a number of cluster statistics that are needed for ISOCLUS, but not for k-means.

Memarsadeghi, Nargess↗
NASA NTRS1976

DHARMA - Discriminant hyperplane abstracting residuals minimization algorithm for separating clusters with fuzzy boundaries

Learning of discriminant hyperplanes in imperfectly supervised or unsupervised training sample sets with unreliably labeled samples along the fuzzy joint boundaries between sample clusters is discussed, with the discriminant hyperplane designed to be a least-squares fit to the unreliably labeled data points. (Samples along the fuzzy boundary jump back and forth from one cluster to the other in recursive cluster stabilization and are considered unreliably labeled.) Minimization of the distances of these unreliably labeled samples from the hyperplanes does not sacrifice the ability to discriminate between classes represented by reliably labeled subsets of samples. An equivalent unconstrained linear inequality problem is formulated and algorithms for its solution are indicated. Landsat earth sensing data were used in confirming the validity and computational feasibility of the approach, which should be useful in deriving discriminant hyperplanes separating clusters with fuzzy boundaries, given supervised training sample sets with unreliably labeled boundary samples.

Dasarathy, B. V.↗
NASA NTRS1983

Filamentary galaxy clustering - A mapping algorithm

A simple and objective algorithm is presented which not only accurately identifies the filamentary structures in the Shane-Wirtanen galaxy count catalog, but also finds a set of visually less impressive filaments in a static hierarchical model of the clustering conducted by Soneira and Peebles (1978). The statistical properties of the elements in the model, while very similar to those in the data, show a significant excess of long and bright filaments in the data relative to the model. Two possible interpretations of these results are presented and discussed.

Gott, J. R., III↗
NASA NTRS1992

The void spectrum in two-dimensional numerical simulations of gravitational clustering

An algorithm for deriving a spectrum of void sizes from two-dimensional high-resolution numerical simulations of gravitational clustering is tested, and it is verified that it produces the correct results where those results can be anticipated. The method is used to study the growth of voids as clustering proceeds. It is found that the most stable indicator of the characteristic void 'size' in the simulations is the mean fractional area covered by voids of diameter d, in a density field smoothed at its correlation length. Very accurate scaling behavior is found in power-law numerical models as they evolve. Eventually, this scaling breaks down as the nonlinearity reaches larger scales. It is shown that this breakdown is a manifestation of the undesirable effect of boundary conditions on simulations, even with the very large dynamic range possible here. A simple criterion is suggested for deciding when simulations with modest large-scale power may systematically underestimate the frequency of larger voids.

Kauffmann, Guinevere↗
DOE OSTI2021

ParChain: a framework for parallel hierarchical agglomerative clustering using nearest-neighbor chain

This paper studies the hierarchical clustering problem, where the goal is to produce a dendrogram that represents clusters at varying scales of a data set. We propose the ParChain framework for designing parallel hierarchical agglomerative clustering (HAC) algorithms, and using the framework we obtain novel parallel algorithms for the complete linkage, average linkage, and Ward's linkage criteria. Compared to most previous parallel HAC algorithms, which require quadratic memory, our new algorithms require only linear memory, and are scalable to large data sets. ParChain is based on our parallelization of the nearest-neighbor chain algorithm, and enables multiple clusters to be merged on every round. We introduce two key optimizations that are critical for efficiency: a range query optimization that reduces the number of distance computations required when finding nearest neighbors of clusters, and a caching optimization that stores a subset of previously computed distances, which are likely to be reused. Experimentally, we show that our highly-optimized implementations using 48 cores with two-way hyper-threading achieve 5.8--110.1x speedup over state-of-the-art parallel HAC algorithms and achieve 13.75--54.23x self-relative speedup. Compared to state-of-the-art algorithms, our algorithms require up to 237.3x less space. Our algorithms are able to scale to data set sizes with tens of millions of points, which existing algorithms are not able to handle.

Computer Science↗
NASA NTRS1976

AHIMSA - Ad hoc histogram information measure sensing algorithm for feature selection in the context of histogram inspired clustering techniques

An algorithm is proposed for dimensionality reduction in the context of clustering techniques based on histogram analysis. The approach is based on an evaluation of the hills and valleys in the unidimensional histograms along the different features and provides an economical means of assessing the significance of the features in a nonparametric unsupervised data environment. The method has relevance to remote sensing applications.

Dasarathy, B. V.↗
DOE OSTI2024

Miscentring of optical galaxy clusters based on Sunyaev–Zeldovich counterparts

ABSTRACT The ‘miscentring effect’, i.e. the offset between a galaxy cluster’s optically defined centre and the centre of its gravitational potential, is a significant systematic effect on brightest cluster galaxy (BCG) studies and cluster lensing analyses. We perform a cross-match between the optical cluster catalogue from the Hyper Suprime-Cam (HSC) Survey S19A Data Release and the Sunyaev–Zeldovich cluster catalogue from Data Release 5 of the Atacama Cosmology Telescope (ACT). We obtain a sample of 186 clusters in common in the redshift range $0.1 \le z \le 1.4$ over an area of 469 deg$^2$. By modelling the distribution of centring offsets in this fiducial sample, we find a miscentred fraction (corresponding to clusters offset by more than 330 kpc) of ∼25 per cent, a value consistent with previous miscentring studies. We examine the image of each miscentred cluster in our sample and identify one of several reasons to explain the miscentring. Some clusters show significant miscentring for astrophysical reasons, i.e. ongoing cluster mergers. Others are miscentred due to non-astrophysical, systematic effects in the HSC data or the cluster-finding algorithm. After removing all clusters with clear, non-astrophysical causes of miscentring from the sample, we find a considerably smaller miscentred fraction, $\sim 10~\,\rm per\,cent$. We show that the gravitational lensing signal within 1 Mpc of miscentred clusters is considerably smaller than that of well-centred clusters, and we suggest that the ACT SZ centres are a better estimate of the true cluster potential centroid.

Ding, Jupiter (ORCID:0000000296119799)↗
NASA NTRS1981

An algorithm for spatial heirarchy clustering

A method for utilizing both spectral and spatial redundancy in compacting and preclassifying images is presented. In multispectral satellite images, a high correlation exists between neighboring image points which tend to occupy dense and restricted regions of the feature space. The image is divided into windows of the same size where the clustering is made. The classes obtained in several neighboring windows are clustered, and then again successively clustered until only one region corresponding to the whole image is obtained. By employing this algorithm only a few points are considered in each clustering, thus reducing computational effort. The method is illustrated as applied to LANDSAT images.

Dejesusparada, N.↗
DOE OSTI2025

A Perspective on Quantum Computing Applications in Quantum Chemistry Using 25-100 Logical Qubits

The intersection of quantum computing and quantum chemistry represents a promising frontier for achieving quantum utility in domains of both scientific and societal relevance. Owing to the exponential growth of classical resource requirements for simulating quantum systems, quantum chemistry has long been recognized as a natural candidate for quantum computation. This perspective focuses on identifying scientifically meaningful use cases where early fault-tolerant quantum computers, which are considered to be equipped with approximately 25-100 logical qubits, could deliver tangible impact. While recent advances in classical computing have pushed the boundaries of tractable simulations to unprecedented scales, this logical-qubit regime represents the first window where quantum devices can pursue qualitatively distinct strategies, such as polynomial-scaling phase estimation, direct simulation of quantum dynamics, and active-space embedding, that remain challenging for classical solvers, such as multireference charge-transfer and conical-intersection states central to photochemistry and materials design. We highlight near-term opportunities in algorithm and software design, discuss representative chemical problems suited for quantum acceleration, and propose strategic roadmaps and collaborative pathways for advancing practical quantum utility in quantum chemistry.

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

Reducing Communication in Graph Neural Network Training

Graph Neural Networks (GNNs) are powerful and flexible neural networks that use the naturally sparse connectivity information of the data. GNNs represent this connectivity as sparse matrices, which have lower arithmetic intensity and thus higher communication costs compared to dense matrices, making GNNs harder to scale to high concurrencies than convolutional or fully-connected neural networks. Here, we introduce a family of parallel algorithms for training GNNs and show that they can asymptotically reduce communication compared to previous parallel GNN training methods. We implement these algorithms, which are based on 1D, 1. 5D, 2D, and 3D sparse-dense matrix multiplication, using torch.distributed on GPU-equipped clusters. Our algorithms optimize communication across the full GNN training pipeline. We train GNNs on over a hundred GPUs on multiple datasets, including a protein network with over a billion edges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Association between optically identified galaxy clusters and the underlying dark matter halos

Clusters of galaxies trace massive dark matter halos in the Universe, but they can include multiple halos projected along lines of sight. Here, we study the halos contributing to clusters using the Cardinal simulation, which mimics the Dark Energy Survey data. We use the red-sequence-based cluster finding algorithm redMaPPer as a case study. For each cluster, we identify the halos hosting its member galaxies, and we define the main halo as the one contributing the most to the cluster's richness ($λ$, the estimated number of member galaxies). At $z=0.3$, for clusters with $λ> 60$, the main halo typically contributes to $92\%$ of the richness, and this fraction drops to $67\%$ for $λ\approx 20$. Defining "clean" clusters as those with $\geq50\%$ of the richness contributed by the main halo, we find that $100\%$ of the $λ> 60$ clusters are clean, while $73\%$ of the $λ\approx 20$ clusters are clean. Three halos can usually account for more than $80\%$ of the richness of a cluster. The main halos associated with redMaPPer clusters have a completeness ranging from $98\%$ at virial mass $10^{14.6}~h^{-1}M_{\odot}$ to $64\%$ at $10^{14}~h^{-1}M_{\odot}$. In addition, we compare the inferred cluster centers with true halo centers, finding that $30\%$ of the clusters are miscentered with a mean offset $40\%$ of the cluster radii, in agreement with recent X-ray studies. These systematics worsen as redshift increases, but we expect that upcoming surveys extending to longer wavelengths will improve the cluster finding at high redshifts. Our results affirm the robustness of the redMaPPer algorithm and provide a framework for benchmarking other cluster-finding strategies.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Machine-learning identification of the variability of mean velocity and turbulence intensity for wakes generated by onshore wind turbines: Cluster analysis of wind LiDAR measurements

Light detection and ranging (LiDAR) measurements of isolated wakes generated by wind turbines installed at an onshore wind farm are leveraged to characterize the variability of the wake mean velocity and turbulence intensity during typical operations, which encompass a breadth of atmospheric stability regimes and rotor thrust coefficients. The LiDAR measurements are clustered through the k-means algorithm, which enables identifying the most representative realizations of wind turbine wakes while avoiding the imposition of thresholds for the various wind and turbine parameters. Considering the large number of LiDAR samples collected to probe the wake velocity field, the dimensionality of the experimental dataset is reduced by projecting the LiDAR data on an intelligently truncated basis obtained with the proper orthogonal decomposition (POD). The coefficients of only five physics-informed POD modes are then injected in the k-means algorithm for clustering the LiDAR dataset. The analysis of the clustered LiDAR data and the associated supervisory control and data acquisition and meteorological data enables the study of the variability of the wake velocity deficit, wake extent, and wake-added turbulence intensity for different thrust coefficients of the turbine rotor and regimes of atmospheric stability. Furthermore, the cluster analysis of the LiDAR data allows for the identification of systematic off-design operations with a certain yaw misalignment of the turbine rotor with the mean wind direction.

17 WIND ENERGY↗