SEARCH · Search NASA

Results for “cluster number”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

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 NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. 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 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 the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗

NASA NTRS1992

The fuzzy C spherical shells algorithm - A new approach

The fuzzy c spherical shells (FCSS) algorithm is specially designed to search for clusters that can be described by circular arcs or, more generally, by shells of hyperspheres. In this paper, a new approach to the FCSS algorithm is presented. This algorithm is computationally and implementationally simpler than other clustering algorithms that have been suggested for this purpose. An unsupervised algorithm which automatically finds the optimum number of clusters is also proposed. This algorithm can be used when the number of clusters is not known. It uses a cluster validity measure to identify good clusters, merges all compatible clusters, and eliminates spurious clusters to achieve the final result. Experimental results on several data sets are presented.

Krishnapuram, Raghu↗

NASA NTRS1994

Cluster Computation of Flight Reynolds Number Flows

The performance of a workstation cluster used for the solution of the Reynolds-averaged Navier-Stokes equations is compared with a conventional vector supercomputer architecture. The application simulation of the steady flowfield about a transonic transport was computed using an implicit diagonal scheme in an overset mesh framework. Static load balancing was used, while coarse grain decomposition was achieved by solution of a grid zone per processor. Price/performance ratios are estimated for several scenarios in which such clusters may be utilized.

Atwood, Christopher A.↗

NASA NTRS2000

Modeling of HiPco Process for Carbon Nanotube Production

High-pressure carbon monoxide (HiPco) reactor, developed at Rice University, is used to produce single-walled carbon nanotubes (SWNT) from gas-phase reactions of iron carbonyl and nickel carbonyl in carbon monoxide at high pressures (10 - 100 atm). Computational modeling is used to better understand the HiPco process. In the present model, decomposition of the precursor, metal cluster formation and growth, and carbon nanotube growth are addressed. Decomposition of precursor molecules is necessary to initiate metal cluster formation. The metal clusters serve as catalysts for carbon nanotube growth. Diameter of metal clusters and number of atoms in these clusters are some of the essential information for predicting carbon nanotube formation and growth, which is then modeled by Boudouard reaction (2CO ---> C(s) + CO2) with metal catalysts. The growth kinetic model is integrated with a two-dimensional axisymmetric reactor flow model to predict reactor performance.

Gokcen, T.↗

NASA NTRS2002

Modeling of the HiPco process for carbon nanotube production. II. Reactor-scale analysis

The high-pressure carbon monoxide (HiPco) process, developed at Rice University, has been reported to produce single-walled carbon nanotubes from gas-phase reactions of iron carbonyl in carbon monoxide at high pressures (10-100 atm). Computational modeling is used here to develop an understanding of the HiPco process. A detailed kinetic model of the HiPco process that includes of the precursor, decomposition metal cluster formation and growth, and carbon nanotube growth was developed in the previous article (Part I). Decomposition of precursor molecules is necessary to initiate metal cluster formation. The metal clusters serve as catalysts for carbon nanotube growth. The diameter of metal clusters and number of atoms in these clusters are some of the essential information for predicting carbon nanotube formation and growth, which is then modeled by the Boudouard reaction with metal catalysts. Based on the detailed model simulations, a reduced kinetic model was also developed in Part I for use in reactor-scale flowfield calculations. Here this reduced kinetic model is integrated with a two-dimensional axisymmetric reactor flow model to predict reactor performance. Carbon nanotube growth is examined with respect to several process variables (peripheral jet temperature, reactor pressure, and Fe(CO)5 concentration) with the use of the axisymmetric model, and the computed results are compared with existing experimental data. The model yields most of the qualitative trends observed in the experiments and helps to understanding the fundamental processes in HiPco carbon nanotube production.

Validation Studies↗

NASA NTRSDate not supplied

Urban Air Mobility Airspace Dynamic Density

Effective flight planning requires information about a variety of potential threats, such as adverse weather or airspace restrictions, and about alternatives available if unforeseen events occur. Expected traffic along the route of flight is also essential to a safe outcome so that, for example, adequate fuel/energy supply can be loaded prior to flight. A dynamic density (DD) metric is introduced for the emerging urban air mobility (UAM) concept to predict airspace congestion that may lead to loss of separation between aircraft or less efficient operations. Using inspiration from dynamic density metric research for traditional air traffic management and a two-way highway analogy, we develop a dynamic density metric for a portion of airspace (aUAM corridor) that aggregates the impact from five factors: aircraft density, density of populous clusters, mean number of aircraft in populous clusters, mean distance between aircraft, and minimum distance between aircraft. This works describes our methodology, rationale, use cases, and visualization techniques to efficiently present the DD metric to an operator for informed decision making. We also present an approach for validating the metric. However, validation remains part of future work.

UAM↗

DOE OSTI2020

Constraining radio mode feedback in galaxy clusters with the cluster radio AGNs properties to z ∼ 1

ABSTRACT We study the properties of the Sydney University Molonglo Sky Survey (SUMSS) 843 MHz radio active galactic nuclei (AGNs) population in galaxy clusters from two large catalogues created using the Dark Energy Survey (DES): ∼11 800 optically selected RM-Y3 and ∼1000 X-ray selected MARD-Y3 clusters. We show that cluster radio loud AGNs are highly concentrated around cluster centres to $z$ ∼ 1. We measure the halo occupation number for cluster radio AGNs above a threshold luminosity, finding that the number of radio AGNs per cluster increases with cluster halo mass as N ∝ M1.2 ± 0.1 (N ∝ M0.68 ± 0.34) for the RM-Y3 (MARD-Y3) sample. Together, these results indicate that radio mode feedback is favoured in more massive galaxy clusters. Using optical counterparts for these sources, we demonstrate weak redshift evolution in the host broad-band colours and the radio luminosity at fixed host galaxy stellar mass. We use the redshift evolution in radio luminosity to break the degeneracy between density and luminosity evolution scenarios in the redshift trend of the radio AGNs luminosity function (LF). The LF exhibits a redshift trend of the form (1 + $z$)γ in density and luminosity, respectively, of γD = 3.0 ± 0.4 and γP = 0.21 ± 0.15 in the RM-Y3 sample, and γD = 2.6 ± 0.7 and γP = 0.31 ± 0.15 in MARD-Y3. We discuss the physical drivers of radio mode feedback in cluster AGNs, and we use the cluster radio galaxy LF to estimate the average radio-mode feedback energy as a function of cluster mass and redshift and compare it to the core (<0.1R500) X-ray radiative losses for clusters at $z$ < 1.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

Bi-cross validation of spectral clustering hyperparameters

One challenge impeding the analysis of terabyte scale X-ray scattering data from the Linac Coherent Light Source (LCLS) is determining the number of clusters required for the execution of traditional clustering algorithms. Here, we demonstrate that the previous work using bi-cross validation to determine the number of singular vectors directly maps to the spectral clustering problem of estimating both the number of clusters and hyperparameter values. Here by applying this method to LCLS X-ray scattering data enables the identification of dropped shots without manually setting boundaries on detector fluence and provides a path toward identifying rare and anomalous events.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

G-Mapper: Learning a Cover in the Mapper Construction

The Mapper algorithm is a visualization technique in topological data analysis (TDA) that outputs a graph reflecting the structure of a given dataset. However, the Mapper algorithm requires tuning several parameters in order to generate a “nice” Mapper graph. This paper focuses on selecting the cover parameter. We present an algorithm that optimizes the cover of a Mapper graph by splitting a cover repeatedly according to a statistical test for normality. Our algorithm is based on G-means clustering, which searches for the optimal number of clusters in 𝑘-means by iteratively applying the Anderson–Darling test. Our splitting procedure employs a Gaussian mixture model to carefully choose the cover according to the distribution of the given data. In conclusion, experiments for synthetic and real-world datasets demonstrate that our algorithm generates covers so that the Mapper graphs retain the essence of the datasets, while also running significantly faster than a previous iterative method.

G-means clustering↗

DOE OSTI2024

The cluster decomposition of the configurational energy of multicomponent alloys

Abstract The cluster expansion method (CEM) is a widely used lattice-based technique in the study of multicomponent alloys. Despite its prevalent use, a clear understanding of expansion terms is lacking. We present a modern mathematical formalism of the CEM and introduce thecluster decomposition—a unique and basis-independent decomposition for functions of the atomic configuration in a crystal. We identify the cluster decomposition as an invariant ANOVA decomposition; and demonstrate how functional analysis of variance and sensitivity analysis can be used to interpret interactions among species. Furthermore, we show how the mathematical structure of the cluster decomposition enables numerical evaluation that scales with the number of clusters and is independent of the number of species. Overall, our work enables rigorous interpretations of interactions among species, provides opportunities to explore parameter estimation beyond linear regression, introduces a numerical efficient implementation, and enables analysis of cluster expansions based on established mathematical and statistical principles.

Chemistry↗

DOE OSTI2022

Manifold Learning-Based Polynomial Chaos Expansions for High-Dimensional Surrogate Models

In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantities of interest of the computational or analytical model. For this purpose, we employ Grassmannian diffusion maps, a two-step nonlinear dimension reduction technique which allows us to reduce the dimensionality of the data and identify meaningful geometric descriptions in a parsimonious and inexpensive manner. Polynomial chaos expansion is then used to construct a mapping between the stochastic input parameters and the diffusion coordinates of the reduced space. An adaptive clustering technique is proposed to identify an optimal number of clusters of points in the latent space. The similarity of points allows us to construct a number of geometric harmonic emulators which are finally utilized as a set of inexpensive pretrained models to perform an inverse map of realizations of latent features to the ambient space and thus perform accurate out-of-sample predictions. Thus, the proposed method acts as an encoder-decoder system which is able to automatically handle very high-dimensional data while simultaneously operating successfully in the small-data regime. The method is demonstrated on two benchmark problems and on a system of advection-diffusion-reaction equations which model a first-order chemical reaction between two species. In all test cases, the proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.

42 ENGINEERING↗

NASA NTRS1961

Investigation of Net-Thrust and Base-Pressure Characteristics of Cylindrical Afterbodies with Clustered Supersonic Nozzles at Transonic Mach Numbers

A wind-tunnel investigation has been conducted at Mach numbers from 0.9 to 1.4 to determine the net-thrust and base-pressure characteristics of cylindrical afterbodies having clustered supersonic nozzles. The design Mach numbers of the nozzles were 2.0 and 2.5 and the number of clustered nozzles ranged from two to six. The nozzles had throat-to- base diameter ratios of 0.155, 0.225, 0.278, and 0.320. Some models were tested with various configurations of extended, shrouded, flush, and canted nozzles. The nozzles discharged unheated air from the base at ratios of jet total pressure to free-stream static pressure ranging from 1 to approximately 20. The results of this investigation showed that both the ratio of total exit area to base area and the number of jets affect the net-thrust factor to a significant degree for the extended-nozzle configurations. Good net-thrust factors were obtained with all the model configurations near the design jet total-pressure ratio; however, the extended-nozzle configuration had the highest net-thrust factor over the test jet total- pressure-ratio range. Canting the twin nozzles outward resulted in a favorable thrust factor over a limited jet total-pressure-ratio range, and surrounding the nozzles with a single shroud reduced thrust factors for the range of jet total-pressure ratio of this investigation.

Andrews, Earl H., Jr.↗

DOE OSTI2025

Optical galaxy cluster mock catalogs with realistic projection effects: Validations with the SDSS clusters

Galaxy clusters identified in optical imaging surveys suffer from projection effects: Physically unassociated galaxies along a cluster’s line of sight can be counted as its members and boost the observed richness (the number of cluster members). To model the impact of projection on cluster cosmology analyses, we apply a halo occupation distribution model to 𝑁-body simulations to simulate the red galaxies contributing to cluster members, and we use the number of galaxies in a cylinder along the line of sight (counts in cylinders) to model the impact of projection on cluster richness. We compare three projection models: uniform, quadratic, and Gaussian, and we convert between them by matching their effective cylinder volumes. We validate our mock catalogs using SDSS redMaPPer clusters’ data vectors, including counts vs richness, stacked lensing signal, spectroscopic redshift distribution of member galaxies, and richness remeasured on a redshift grid. We find the former two are insensitive to the projection model, while the latter two favor a quadratic projection model with a width of ≈180 ℎ −1 Mpc (equivalent to the volume of a uniform model with a width of 100 ℎ −1 Mpc and a Gaussian model with a width of 110 ℎ −1 Mpc, or a Gaussian redshift error of 0.04). Furthermore, our framework provides an efficient and flexible way to model optical cluster data vectors, paving the way for a simulation-based joint analysis for clusters, galaxies, and shear.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2019

Accelerating the Global Arrays ComEx Runtime using Multiple Progress Ranks

Partitioned Global Address Space (PGAS) models are part of system software that are being designed to support communication runtime for exascale applications. Suitability of using MPI as a scalable PGAS communication subsystem has been shown as a viable option due to its standardization and higher performance. We used MPI two-sided semantics with a combination of automatic and user defined splitting of MPI communicators to achieve asynchronous progress. Our implementation can make use of multiple asynchronous progress ranks (PR) per node that can be mapped to the computing architecture of a node in a distributed cluster. We are able to show significant speed up of over 2.0X and scaling of communication bound computational chemistry application over 1024 nodes of state- of-the-art HPC clusters. Our results show that while running a communication bound application workload on a certain number of cluster nodes, a use of optimum number of ranks dedicated for communication may be used to achieve asynchronous communication progress and obtain highest performance.

PGAS, global-arrays, NWCHEM, NWChemEx, HPC, GPGPU↗

DOE OSTI2021

Revisiting Newly Large Magellanic Cloud Age-gap Star Clusters

Recently, a noticeable number of new star clusters was identified in the outskirts of the Large Magellanic Cloud (LMC) populating the so-called star-cluster age gap, a space of time (∼4–12 Gyr) where the only known star cluster is up-to-date ESO 121-SC 03. We used Survey of the Magellanic Stellar History DR2 data sets, as well as those employed to identify these star-cluster candidates, to produce relatively deep color–magnitude diagrams (CMDs) of 17 out of 20 discovered age-gap star clusters with the aim of investigating them in detail. Our analysis relies on a thorough CMD cleaning procedure of the field-star contamination, which presents variations in its stellar density and astrophysical properties, such as luminosity and effective temperature, around the star-cluster fields. We built star-cluster CMDs from stars with membership probabilities assigned from the cleaning procedure. These CMDs and their respective spatial distribution maps favor the existence of LMC star field density fluctuations rather than age-gap star clusters, although a definitive assessment on them will be possible from further deeper photometry.

47 OTHER INSTRUMENTATION↗

NASA NTRS2019

Cluster Analysis of IRIS Spectroscopic Line Profiles and SDO/AIA EUV Emission in Observations and RMHD Simulations of the Solar Atmosphere

Spatially-resolved observations from the IRIS and SDO/AIA satellites, especially when coupled with realistic 3D RMHD simulations, are a powerful tool for analysis of processes in the solar chromosphere, transition region, and corona. However, the complexity of the data makes understanding the observations and modeling results difficult. In this work, we apply unsupervised clustering algorithms for analysis of observational and synthetic chromospheric Mg II h&k 2796Å&2803Å and transition region C II 1334Å&1335Å line profiles observed by IRIS, and extreme ultraviolet (EUV) emission observed by SDO/AIA, for various types of problems. The synthetic line profiles are computed for simulations of the quiescent solar atmosphere (using the StellarBox and RH1.5 codes). The K-Means clustering algorithm is applied, and the selection of an optimal number of clusters is supported by the average silhouette width technique. We discuss applications of the line profile clustering method to 1) visualization of computational and observational spectroscopic imaging data; 2) understanding of evolutionary trends and behavior patterns of quiet Sun emission and during solar flares; and 3) recognition of heating events and shock waves.

Sadykov, Viacheslav↗

DOE OSTI2022

Poisson hurdle model-based method for clustering microbiome features

Abstract Motivation High-throughput sequencing technologies have greatly facilitated microbiome research and have generated a large volume of microbiome data with the potential to answer key questions regarding microbiome assembly, structure and function. Cluster analysis aims to group features that behave similarly across treatments, and such grouping helps to highlight the functional relationships among features and may provide biological insights into microbiome networks. However, clustering microbiome data are challenging due to the sparsity and high dimensionality. Results We propose a model-based clustering method based on Poisson hurdle models for sparse microbiome count data. We describe an expectation–maximization algorithm and a modified version using simulated annealing to conduct the cluster analysis. Moreover, we provide algorithms for initialization and choosing the number of clusters. Simulation results demonstrate that our proposed methods provide better clustering results than alternative methods under a variety of settings. We also apply the proposed method to a sorghum rhizosphere microbiome dataset that results in interesting biological findings. Availability and implementation R package is freely available for download at https://cran.r-project.org/package=PHclust. Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗