Search NASA⌕ Search

SEARCH · Search NASA

Results for “cluster methods”

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
NASA NTRS1992

Tidal evolution of globular clusters. I - Method

Tidal evolution of globular clusters is regulated by both Galactic tidal effects and internal relaxation processes. In order to investigate the tidal evolution of globular clusters, a numerical scheme which utilizes a Fokker-Planck approach as well as direct numerical integration of the restricted three-body problem is developed. In the inner regions of the cluster, stellar orbits are mapped with the cluster's gravitational potential and orbit-averaged diffusion coefficients. In the outer regions, the Galactic tidal field is explicitly included in the direct orbital integration. This method is presented here with some tests on King-Michie models.

Oh, K. S.↗
DOE OSTI2023

Relativistic Effects From Coupled-Cluster Theory

We discuss the theory and computational challenges of the relativistic coupled-cluster methods. Example calculations of heavy-atom-containing molecules are then presented to demonstrate the importance of scalar-relativistic, spin-orbit coupling, and electron-correlation effects on molecular properties as well as the applicability and usefulness of relativistic coupled-cluster methods in calculations aiming at high-accuracy results. Here, a unique applicability of the spinor-based relativistic coupled-cluster methods is also highlighted using the calculations of open shell actinide-containing small molecules. As a result, a summary is given together with an outlook into future developments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1992

Possibilistic clustering for shape recognition

Clustering methods have been used extensively in computer vision and pattern recognition. Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering in that total commitment of a vector to a given class is not required at each iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from Bezdek's Fuzzy C-Means (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Unfortunately, the memberships resulting from FCM and its derivatives do not correspond to the intuitive concept of degree of belonging, and moreover, the algorithms have considerable trouble in noisy environments. Recently, we cast the clustering problem into the framework of possibility theory. Our approach was radically different from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. We constructed an appropriate objective function whose minimum will characterize a good possibilistic partition of the data, and we derived the membership and prototype update equations from necessary conditions for minimization of our criterion function. In this paper, we show the ability of this approach to detect linear and quartic curves in the presence of considerable noise.

Keller, James M.↗
NASA NTRS1993

Possibilistic clustering for shape recognition

Clustering methods have been used extensively in computer vision and pattern recognition. Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering in that total commitment of a vector to a given class is not required at each iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from Bezdek's Fuzzy C-Means (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Unfortunately, the memberships resulting from FCM and its derivatives do not correspond to the intuitive concept of degree of belonging, and moreover, the algorithms have considerable trouble in noisy environments. Recently, the clustering problem was cast into the framework of possibility theory. Our approach was radically different from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. An appropriate objective function whose minimum will characterize a good possibilistic partition of the data was constructed, and the membership and prototype update equations from necessary conditions for minimization of our criterion function were derived. The ability of this approach to detect linear and quartic curves in the presence of considerable noise is shown.

Keller, James M.↗
DOE OSTI2022

Regional Characteristics of Observable Foreshocks

Abstract Measures of foreshock occurrence are systematically examined using earthquake catalogs for eight regions (Italy, southern California, northern California, Costa Rica, Onshore Japan, Alaska, Turkey, and Greece) after imposing a magnitude ≥3.0 completeness level. Foreshocks are identified using three approaches: a magnitude-dependent space + fixed-time windowing method, a nearest-neighbor clustering method, and a modified magnitude-dependent space + variable-time windowing method. The method with fixed-time windows systematically yields higher counts of foreshocks than the other two clustering methods. We find similar counts of foreshocks across the three methods when the magnitude aperture is equalized by including only earthquakes in the magnitude range M*−2≤ M< M*, in which M* is the mainshock magnitude. For most of the catalogs (excluding Italy and southern California), the measured b-values of the foreshocks of all region-specific mainshocks are lower by 0.1–0.2 than b-values of respective aftershocks. Allowing for variable-time windows results in relatively high probabilities of having at least one foreshock in Italy (∼43%–56%), compared to other regional catalogs. Foreshock probabilities decrease to 14%–41% for regions such as Turkey, Greece, and Costa Rica. Similar trends are found when requiring at least five foreshocks in a sequence to be considered. Estimates of foreshock probabilities for each mainshock are method dependent; however, consistent regional trends exist regardless of method, with regions such as Italy and southern California producing more observable foreshocks than Turkey and Greece. Some regions with relatively high background seismicity have comparatively low probabilities of detectable foreshock activity when using methods that account for variable background, possibly due to depletion of near-failure fault conditions by background activity.

Geochemistry & Geophysics↗
DOE OSTI2020

Designing a parallel Feel-the-Way clustering algorithm on HPC systems

This paper introduces a new parallel clustering algorithm, named Feel-the-Way clustering algorithm, that provides better or equivalent convergence rate than the traditional clustering methods by optimizing the synchronization and communication costs. Our algorithm design centers on how to optimize three factors simultaneously: reduced synchronizations, improved convergence rate, and retained same or comparable optimization cost. To compare the optimization cost, we use the Sum of Square Error (SSE) cost as the metric, which is the sum of the square distance between each data point and its assigned clusters. Compared with the traditional MPI k-means algorithm, the new Feel-the-Way algorithm requires less communications among participating processes. As for the convergence rate, the new algorithm requires fewer number of iterations to converge. As for the optimization cost, it obtains the SSE costs that are close to the k-means algorithm. In the paper, we first design the full-step Feel-the-Way k-means clustering algorithm that can significantly reduce the number of iterations that are required by the original k-means clustering method. Next, we improve the performance of the full-step algorithm by adopting an optimized sampling-based approach, named reassignment-history-aware sampling. Our experimental results show that the optimized sampling-based Feel-the-Way method is significantly faster than the widely used k-means clustering method, and can provide comparable optimization costs. More extensive experiments with several synthetic datasets and real-world datasets (e.g., MNIST, CIFAR-10, ENRON, and PLACES-2) show that the new parallel algorithm can outperform the open source MPI k-means library by up to 110% on a high-performance computing system using 4,096 CPU cores. In addition, the new algorithm can take up to 51% fewer iterations to converge than the k-means clustering algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Hypergraph Random Walks, Laplacians, and Clustering

We propose a flexible framework for clustering hypergraph-structured data based on recently proposed random walks utilizing edge-dependent vertex weights. When incorporating edge-dependent vertex weights (EDVW), a weight is associated with each vertex-hyperedge pair, yielding a weighted incidence matrix of the hypergraph. Such weightings have been utilized in term-document representations of text data sets. We explain how random walks with EDVW serve to construct different hypergraph Laplacian matrices, and then develop a suite of clustering methods that use these incidence matrices and Laplacians for hypergraph clustering. Using 20Newsgroup, U.S. patent, Reuters' Corpus Volume 1, and genetics data sets, we compare the performance of these clustering algorithms experimentally against a variety of existing hypergraph clustering methods. We show that the proposed methods produce higher-quality clusters.

hypergraphs, clustering, laplacian, random walk, M↗
DOE OSTI2021

Cluster Variation Method Analysis of Correlations and Entropy in BCC Solid Solutions

Solid solutions occur when multiple chemical species share sites of a common crystal lattice. Although the single site occupation is random, chemical interaction preferences bias the occupation probabilities of neighboring sites, and this bias reduced the entropy of mixing below its ideal value. Sufficiently strong bias leads to symmetry-breaking phase transitions. Here, we apply the cluster variation method to explore solid solutions on body centered cubic lattices in the context of two specific compounds that exhibit opposite ordering trends. Employing density functional theory to model the energetics, we show that CuZn exhibits an order-disorder transition to the CsCl prototype structure, while AlLi instead takes the NaTl prototype structure, and we evaluate their temperature-dependent order parameters, correlations and entropies.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Probing phase stability in CrMoNbV using cluster expansion method, CALPHAD calculations and experiments

High entropy alloys (HEA), a novel class of materials with multiple principal elements, allow us to tune the properties within a wide composition range where the solid-solution phase is stable. However, it is difficult to experimentally determine the boundaries of the single-phase region. In this paper, we calculate the phase diagram of the CrMoNbV quaternary system, as well as its constituent binary and ternary subsystems, using a combination of the cluster expansion method and CALPHAD calculations. We further verify these results by carrying out experiments at two different compositions of the full quaternary system. Furthermore, our work shows how these computational tools can enable efficient discovery and development of new HEAs.

36 MATERIALS SCIENCE↗
NASA NTRS1994

The luminosity functions of embedded stellar clusters. 1: Method of solution and analytic results

We describe a method for computing the history of the luminosity function in a young cluster still forming within a molecular cloud complex. Our method, which utilizes detailed results from stellar evolution theory, assumes that clusters arise from the continuous collapse of dense cloud cores over a protracted period of time. It is also assumed that stars reaching the main sequence are distributed in mass according to a prescribed initial mass function (IMF). We keep track separately of the contributions to the luminosity function from the populations of protostars, pre-main-sequence stars, and main-sequence stars. We derive expressions for the fractional contribution of these populations to both the total number of stars produced and the total cluster luminosity. In our model, the number of protostars rises quickly at first, but then levels off to a nearly constant value, which it maintains until the dispersal of the cloud complex. The number fraction of protostars always decreases with time. Averaged over the life of the parent cloud, this fraction is typically a few percent. The protostar mass distribution can be expressed as an integral over the IMF.

Fletcher, Andre B.↗
DOE OSTI2022

Watershed zonation through hillslope clustering for tractably quantifying above- and below-ground watershed heterogeneity and functions

Abstract. In this study, we develop a watershed zonation approach for characterizing watershed organization and functions in a tractable manner by integrating multiple spatial data layers. We hypothesize that (1) a hillslope is an appropriate unit for capturing the watershed-scale heterogeneity of key bedrock-through-canopy properties and for quantifying the co-variability of these properties representing coupled ecohydrological and biogeochemical interactions, (2) remote sensing data layers and clustering methods can be used to identify watershed hillslope zones having the unique distributions of these properties relative to neighboring parcels, and (3) property suites associated with the identified zones can be used to understand zone-based functions, such as response to early snowmelt or drought and solute exports to the river. We demonstrate this concept using unsupervised clustering methods that synthesize airborne remote sensing data (lidar, hyperspectral, and electromagnetic surveys) along with satellite and streamflow data collected in the East River Watershed, Crested Butte, Colorado, USA. Results show that (1) we can define the scale of hillslopes at which the hillslope-averaged metrics can capture the majority of the overall variability in key properties (such as elevation, net potential annual radiation, and peak snow-water equivalent – SWE), (2) elevation and aspect are independent controls on plant and snow signatures, (3) near-surface bedrock electrical resistivity (top 20 m) and geological structures are significantly correlated with surface topography and plan species distribution, and (4) K-means, hierarchical clustering, and Gaussian mixture clustering methods generate similar zonation patterns across the watershed. Using independently collected data, we show that the identified zones provide information about zone-based watershed functions, including foresummer drought sensitivity and river nitrogen exports. The approach is expected to be applicable to other sites and generally useful for guiding the selection of hillslope-experiment locations and informing model parameterization.

58 GEOSCIENCES↗
DOE OSTI2021

Analyzing acoustic emission data to identify cracking modes in cement paste using an artificial neural network

This research is focused on the identification of cracking mechanisms for cement paste using acoustic emission data, recorded from compression and notched four-point bending tests. A procedure is developed for analyzing the data by employing an agglomerative hierarchical clustering method, an artificial neural network, and a ray-tracing source location algorithm. An agglomerative hierarchical clustering method is utilized to cluster the AE data from a compression test using frequency-dependent features. A neural network is trained using the compression test data and applied to the AE data emitted during the four-point bending test. The clustered data from the four-point bending test is localized using a ray-tracing algorithm. Based on the occurrence and locations of the clustered events and signal feature analyses, potential cracking mechanisms are identified and assigned.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Coupled Cluster Downfolding Methods: the effect of double commutator terms on the accuracy of ground-state energies

Downfolding coupled cluster (CC) techniques have recently been introduced into quantum chemistry as a tool for the dimensionality reduction of the many-body quantum problem. As opposed to earlier formulations in physics and chemistry based on the concept of effective Hamiltonians, the appearance of the downfolded Hamiltonians is a natural consequence of the single-reference exponential parametrization of the wave function. In this paper, we discuss the impact of higher-order terms originating in double commutators. In analogy to previous studies, we consider the case when only one- and two-body interactions are included in the downfolded Hamiltonians. We demonstrate the efficiency of the many-body expansions involving single and double commutators for the unitary extension of the downfolded Hamiltonians on the example of the beryllium atom, and bond-breaking processes in the Li2 and H2O molecules. For the H2O system, we also analyze energies obtained with downfolding procedures as functions of the active space size.

quantum computing, quantum algorithms, electronic ↗
DOE OSTI2024

Copacabana: a probabilistic membership assignment method for galaxy clusters

Cosmological analyses using galaxy clusters in optical/near-infrared photometric surveys require robust characterization of their galaxy content. Precisely determining which galaxies belong to a cluster is crucial. In this paper, we present the COlor Probabilistic Assignment of Clusters And BAyesiaN Analysis (Copacabana) algorithm. Copacabana computes membership probabilities for all galaxies within an aperture centred on the cluster using photometric redshifts, colours, and projected radial probability density functions. We use simulations to validate Copacabana and we show that it achieves up to 89 per cent membership accuracy with a mild dependence on photometric redshift uncertainties and choice of aperture size. We find that the precision of the photometric redshifts has the largest impact on the determination of the membership probabilities followed by the choice of the cluster aperture size. We also quantify how much these uncertainties in the membership probabilities affect the stellar mass–cluster mass scaling relation, a relation that directly impacts cosmology. Using the sum of the stellar masses weighted by membership probabilities (⁠μ * ⁠) as the observable, we find that Copacabana can reach an accuracy of 0.06 dex in the measurement of the scaling relation at low redshift for a Legacy Survey of Space and Time type survey. These results indicate the potential of Copacabana and μ * to be used in cosmological analyses of optically selected clusters in the future.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Synchronization and Rebound Effects in Residential Loads

Increasing fuel prices and capacity investment deferral place an increasing demand for peak reduction from distribution level systems. Residential and commercial devices, such as HVAC systems and water heaters, are increasingly involved in load control programs, and their use may generate synchronization and rebound effects, such as artificial peaks caused by device optimization. While there have been concerns over device synchronization, few studies quantify the extent of this effect with numerical values. In this study, we attempt to investigate whether control efforts result in device synchronization or rebound effects. We focus on three clustering methods – Ward’s clustering, Euclidean K-means, and Density-based spatial clustering of applications with noise – to evaluate the extent of synchronization of a fleet of water heaters and HVAC systems in Atlanta, Georgia. Our findings show that synchronization and rebound effects are present in the neighborhood’s water heaters, but none were found in the HVAC systems. Further, high usage water heaters are more susceptible to synchronization and rebound effects.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1985

Applications of Fuzzy Set Theory to Satellite Soundings

The introduction of an appropriate fuzzy setting for satellite soundings and its application to clustering methods via unimodal fuzzy sets in the future is proposed. Methods of hard clustering analysis and fuzzy partitioned clustering were applied on simulated data with very encouraging results. The proposed clustering technique is discussed. The notion of a unimodal fuzzy set was chosen to represent the partition of a data set for two reasons: (1) it detects all the locations in the vector space where highly concentrated clusters of points exist; and (2) the notion is general enough to represent clusters that exhibit quite general distributions of points. The technique detects all of the existing unimodal fuzzy sets and realizes the maximum separation among them. It is economical in memory space and computational time requirements and also detects groups that are fairly generally distributed in the feature space.

Munteanu, M. J.↗