Search NASA⌕ Search

SEARCH · Search NASA

Results for “clustering 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 955 records · Page 53

Source identification by non-negative matrix factorization combined with semi-supervised clustering

Machine-learning methods and apparatus are provided to solve blind source separation problems with an unknown number of sources and having a signal propagation model with features such as wave-like propagation, medium-dependent velocity, attenuation, diffusion, and/or advection, between sources and sensors. In exemplary embodiments, multiple trials of non-negative matrix factorization are performed for a fixed number of sources, with selection criteria applied to determine successful trials. A semi-supervised clustering procedure is applied to trial results, and the clustering results are evaluated for robustness using measures for reconstruction quality and cluster separation. The number of sources is determined by comparing these measures for different trial numbers of sources. Source locations and parameters of the signal propagation model can also be determined. Disclosed methods are applicable to a wide range of spatial problems including chemical dispersal, pressure transients, and electromagnetic signals, and also to non-spatial problems such as cancer mutation.

Alexandrov, Boian S.↗

Selection function of clusters in Dark Energy Survey year 3 data from cross-matching with South Pole Telescope detections

Context. Galaxy clusters selected based on overdensities of galaxies in photometric surveys provide the largest cluster samples. However, modeling the selection function of such samples is complicated by noncluster members projected along the line of sight (projection effects) and the potential detection of unvirialized objects (contamination). Aims. We empirically constrained the magnitude of these effects by cross-matching galaxy clusters selected in the Dark Energy Survey data with the redMaPPer algorithm with significant detections in three South Pole Telescope surveys (SZ, pol-ECS, pol-500d). Methods. For matched clusters, we augmented the redMaPPer catalog with the SPT detection significance. For unmatched objects we used the SPT detection threshold as an upper limit on the SZe signature. Using a Bayesian population model applied to the collected multiwavelength data, we explored various physically motivated models to describe the relationship between observed richness and halo mass. Results. Our analysis reveals a clear preference for models with an additional skewed scatter component associated with projection effects over a purely log-normal scatter model. We rule out significant contamination by unvirialized objects at the high-richness end of the sample. While dedicated simulations offer a well-fitting calibration of projection effects, our findings suggest the presence of redshift-dependent trends that these simulations may not have captured. Our findings highlight that modeling the selection function of optically detected clusters remains a complicated challenge that requires a combination of simulation and data-driven approaches.

79 ASTRONOMY AND ASTROPHYSICS↗

Comparison of the Brueckner and coupled-cluster approaches to electron correlation

The coupled-cluster and Brueckner electron correlation methods are used to determine the equilibrium structures, dipole moments, harmonic vibrational frequencies, and IR intensities of NH3, FON, Be3, BeC2, and BeO2. The singles and doubles coupled-cluster and Brueckner doubles methods are employed, and the corresponding methods that include a perturbational estimate of connected triple excitations are also investigated. The T sub 1 diagnostic is found to provide a good indication of the magnitude of the difference between the results obtained with the coupled-cluster and Brueckner methods. For NH3, the T sub 1 diagnostic is small and so the differences between results obtained from coupled-cluster and Brueckner theories are quite small. It is found for all of the molecules under consideration that inclusion of the contribution from connected triple excitations is more important than the differences between the Brueckner and coupled-cluster correlation methods.

Lee, Timothy J.↗

Observing dynamical friction in galaxy clusters

We present a novel method to detect the effects of dynamical friction in observed galaxy clusters. Following accretion into clusters, massive satellite galaxies will backsplash to systematically smaller radii than less massive satellites, an effect that may be detected by stacking the number density profiles of galaxies around clusters. We show that this effect may be understood using a simple toy model which reproduces the trends with halo properties observed in simulations. We search for this effect using SDSS redMaPPer clusters with richness 10 < λ < 20, and find that bright ( M {sub i} < −21.5) satellites have smaller splashback radii than fainter ( M {sub i} > −20) satellites at 99% confidence.

79 ASTRONOMY AND ASTROPHYSICS↗

Dynamical Mass Measurements of Contaminated Galaxy Clusters Using Machine Learning

We study dynamical mass measurements of galaxy clusters contaminated by interlopers and show that a modern machine learning algorithm can predict masses by better than a factor of two compared to a standard scaling relation approach. We create two mock catalogs from Multidark's publicly available N-body MDPL1 simulation, one with perfect galaxy cluster membership information and the other where a simple cylindrical cut around the cluster center allows interlopers to contaminate the clusters. In the standard approach, we use a power-law scaling relation to infer cluster mass from galaxy line-of-sight (LOS) velocity dispersion. Assuming perfect membership knowledge, this unrealistic case produces a wide fractional mass error distribution, with a width of ${\rm{\Delta }}\epsilon \approx 0.87$. Interlopers introduce additional scatter, significantly widening the error distribution further (${\rm{\Delta }}\epsilon \approx 2.13$). We employ the support distribution machine (SDM) class of algorithms to learn from distributions of data to predict single values. Applied to distributions of galaxy observables such as LOS velocity and projected distance from the cluster center, SDM yields better than a factor-of-two improvement (${\rm{\Delta }}\epsilon \approx 0.67$) for the contaminated case. Remarkably, SDM applied to contaminated clusters is better able to recover masses than even the scaling relation approach applied to uncontaminated clusters. We show that the SDM method more accurately reproduces the cluster mass function, making it a valuable tool for employing cluster observations to evaluate cosmological models.

79 ASTRONOMY AND ASTROPHYSICS↗

Software for the frontiers of quantum chemistry: An overview of developments in the Q-Chem 5 package

This article summarizes technical advances contained in the fifth major release of the Q-Chem quantum chemistry program package, covering developments since 2015. A comprehensive library of exchange-correlation functionals, along with a suite of correlated many-body methods, continues to be a hallmark of the Q-Chem software. The many-body methods include novel variants of both coupled-cluster and configuration-interaction approaches along with methods based on the algebraic diagrammatic construction and variational reduced density-matrix methods. Methods highlighted in Q-Chem 5 include a suite of tools for modeling core-level spectroscopy, methods for describing metastable resonances, methods for computing vibronic spectra, the nuclear-electronic orbital method, and several different energy decomposition analysis techniques. High-performance capabilities including multithreaded parallelism and support for calculations on graphics processing units are described. Q-Chem boasts a community of well over 100 active academic developers, and the continuing evolution of the software is supported by an "open teamware" model and an increasingly modular design.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Electronic Structure and Anion Photoelectron Spectroscopy of Uranium–Gold Clusters UAu n – , n = 3–7

A collaborative effort between experiment and theory towards elucidating the electronic and molecular structures of uranium-gold clusters is presented. Anion photoelectron spectra of UAu n – (n=3-7) were taken at third (355 nm) and fourth (266 nm) harmonics of a Nd:YAG laser, as well as excimer (ArF 193nm) photon energies, where the experimental adiabatic electron affinities (AEA) and vertical detachment energies (VDE) values were measured. Complementary first principles calculations were subsequently carried out to corroborate experimentally determined electron detachment energies and to determine the geometry and electronic structure for each cluster. Except for the ring-like neutral isomer of UAu 6 where one unpaired electron is spread over the Au atoms, all other neutral and anionic UAu n clusters (n = 3 - 7) were calculated to possess open-shell electrons with the unpaired electrons localized on the central U atom. The smaller clusters closely resemble the analogous UF n species, but significant deviations are seen starting with UAu 5 where a competition between U-Au and Au-Au bonding begins to become apparent. The UAu 6 system appears to mark a transition where Au-Au interactions begin to dominate, where both a ring-like and two heavily distorted octahedral structures around the central U atom are to be nearly isoenergetic. With UAu 7 , only ring-like structures are calculated. Altogether, the calculated electron detachment energies are in good agreement with the experimental values

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Unsupervised learning of ferroic variants from atomically resolved STEM images

An approach for the analysis of atomically resolved scanning transmission electron microscopy data with multiple ferroic variants in the presence of imaging non-idealities and chemical variabilities based on a rotationally invariant variational autoencoder (rVAE) is presented. We show that an optimal local descriptor for the analysis is a sub-image centered at specific atomic units, since materials and microscope distortions preclude the use of an ideal lattice as a reference point. The applicability of unsupervised clustering and dimensionality reduction methods is explored and is shown to produce clusters dominated by chemical and microscope effects, with a large number of classes required to establish the presence of rotational variants. Comparatively, the rVAE allows extraction of the angle corresponding to the orientation of ferroic variants explicitly, enabling straightforward identification of the ferroic variants as regions with constant or smoothly changing latent variables and sharp orientational changes. This approach allows further exploration of the chemical variability by separating the rotational degrees of freedom via rVAE and searching for remaining variability in the system. The code used in this article is available at https://github.com/saimani5/ferroelectric_domains_rVAE.

30 DIRECT ENERGY CONVERSION↗

Fast electrostatic force calculation on parallel computer clusters

The fast multipole method (FMM) and smooth particle mesh Ewald (SPME) are well known fast algorithms to evaluate long range electrostatic interactions in molecular dynamics and other fields. FMM is a multi-scale method which reduces the computation cost by approximating the potential due to a group of particles at a large distance using few multipole functions. This algorithm scales like O(N) for N particles. SPME algorithm is an O(NlnN) method which is based on an interpolation of the Fourier space part of the Ewald sum and evaluating the resulting convolutions using fast Fourier transform (FFT). Those algorithms suffer from relatively poor efficiency on large parallel machines especially for mid-size problems around hundreds of thousands of atoms. A variation of the FMM, called PWA, based on plane wave expansions is presented in this paper. A new parallelization strategy for PWA, which takes advantage of the specific form of this expansion, is described. Its parallel efficiency is compared with SPME through detail time measurements on two different computer clusters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fully versus constrained statistical fragmentation of carbon clusters and their heteronuclear derivatives

The Microcanonical Metropolis Monte Carlo (MMMC) method has been shown to describe reasonably well fragmentation of clusters composed of identical atomic species. However, this is not so clear in the case of heteronuclear clusters as some regions of phase space might be inaccessible due to the different mobility of the different atomic species, the existence of large isomerization barriers, or the quite different chemical nature of the possible intermediate species. In this paper, we introduce a constrained statistical model that extends the range of applicability of the MMMC method to such mixed clusters. The method is applied to describe fragmentation of isolated clusters with high, moderate, and no heteronuclear character, namely, C n H m , C n N, and C n clusters for which experimental fragmentation branching ratios are available in the literature. We show that the constrained statistical model describes fairly well fragmentation of CnHm clusters in contrast with the poor description provided by the fully statistical model. The latter model, however, works pretty well for both C n and C n N clusters, thus showing that the ultimate reason for this discrepancy is the inability of the MMMC method to selectively explore the whole phase space. This conclusion has driven us to predict the fragmentation patterns of the C 4 N cluster for which experiments are not yet available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

2012 MOLECULAR AND IONIC CLUSTERS GORDON RESEARCH CONFERENCE, JANUARY 29 - FEBRUARY 3, 2012

The Gordon Research Conference on 'Molecular and Ionic Clusters' focuses on clusters, which are the initial molecular species found in gases when condensation begins to occur. Condensation can take place solely from molecules interacting with each other, mostly at low temperatures, or when molecules condense around charged particles (electrons, protons, metal cations, molecular ions), producing ion molecule clusters. These clusters provide models for solvation, allow a pristine look at geometric as well as electronic structures of molecular complexes or matter in general, their interaction with radiation, their reactivity, their thermodynamic properties and, in particular, the related dynamics. This conference focuses on new ways to make clusters composed of different kinds of molecules, new experimental techniques to investigate the properties of the clusters and new theoretical methods with which to calculate the structures, dynamical motions and energetics of the clusters. Some of the main experimental methods employed include molecular beams, mass spectrometry, laser spectroscopy (from infrared to XUV; in the frequency as well as the time domain) and photoelectron spectroscopy. Techniques include laser absorption spectroscopy, laser induced fluorescence, resonance enhanced photoionization, mass-selected photodissociation, photofragment imaging, ZEKE photoelectron spectroscopy, etc. From the theoretical side, this conference highlights work on potential surfaces and measurable properties of the clusters. The close ties between experiment, theory and computation have been a hallmark of the Gordon Research Conference on Molecular and Ionic Clusters. In the 2012 meeting, we plan to have sessions that will focus on topics including: (1) The use of cluster studies to probe fundamental phenomena; (2) Finite size effects on structure and thermodynamics; (3) Intermolecular forces and cooperative effects; (4) Molecular clusters as models for solvation; and (5) Studies of clusters at XUV light sources.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Dark Energy Survey Year 1 results: validation of weak lensing cluster member contamination estimates from P(z) decomposition

Weak lensing source galaxy catalogues used in estimating the masses of galaxy clusters can be heavily contaminated by cluster members, prohibiting accurate mass calibration. In this study, we test the performance of an estimator for the extent of cluster member contamination based on decomposing the photometric redshift P(z) of source galaxies into contaminating and background components. We perform a full scale mock analysis on a simulated sky survey approximately mirroring the observational properties of the Dark Energy Survey Year One observations (DES Y1), and find excellent agreement between the true number profile of contaminating cluster member galaxies in the simulation and the estimated one. We further apply the method to estimate the cluster member contamination for the DES Y1 redMaPPer cluster mass calibration analysis, and compare the results to an alternative approach based on the angular correlation of weak lensing source galaxies. We find indications that the correlation based estimates are biased by the selection of the weak lensing sources in the cluster vicinity, which does not strongly impact the P(z) decomposition method. Collectively, these benchmarks demonstrate the strength of the P(z) decomposition method in alleviating membership contamination and enabling highly accurate cluster weak lensing studies without broad exclusion of source galaxies, thereby improving the total constraining power of cluster mass calibration via weak lensing.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Bidirectional canopy reflectance and its relationship to vegetation characteristics

A method for determining the relationship between bidirectional canopy reflectance (CR) of a vegetated area and its characteristics (type and growth stage) is presented. In the method, the three-dimensional CR surface is expressed in terms of spherical harmonics which are weighted by appropriate coefficients, and the coefficients are analyzed by a cluster technique. The method is applied to four vegetation types (soybeans, corn, shinnery oak, and orchard grass) at various stages of growth.

Goel, Narendra S.↗

MOCK OBSERVATIONS OF BLUE STRAGGLERS IN GLOBULAR CLUSTER MODELS

We created artificial color-magnitude diagrams of Monte Carlo dynamical models of globular clusters and then used observational methods to determine the number of blue stragglers in those clusters. We compared these blue stragglers to various cluster properties, mimicking work that has been done for blue stragglers in Milky Way globular clusters to determine the dominant formation mechanism(s) of this unusual stellar population. We find that a mass-based prescription for selecting blue stragglers will select approximately twice as many blue stragglers than a selection criterion that was developed for observations of real clusters. However, the two numbers of blue stragglers are well-correlated, so either selection criterion can be used to characterize the blue straggler population of a cluster. We confirm previous results that the simplified prescription for the evolution of a collision or merger product in the BSE code overestimates their lifetimes. We show that our model blue stragglers follow similar trends with cluster properties (core mass, binary fraction, total mass, collision rate) as the true Milky Way blue stragglers as long as we restrict ourselves to model clusters with an initial binary fraction higher than 5%. We also show that, in contrast to earlier work, the number of blue stragglers in the cluster core does have a weak dependence on the collisional parameter Γ in both our models and in Milky Way globular clusters.

79 ASTRONOMY AND ASTROPHYSICS↗

Spectroscopic Confirmation of Two Massive Red-sequence-selected Galaxy Clusters at Z ~ Approximately Equal to 1.2 in the Sparcs-North Cluster Survey

The Spitzer Adaptation of the Red-sequence Cluster Survey (SpARCS) is a deep z -band imaging survey covering the Spitzer SWIRE Legacy fields designed to create the first large homogeneously-selected sample of massive clusters at z > 1 using an infrared adaptation of the cluster red-sequence method. We present an overview of the northern component of the survey which has been observed with CFHT/MegaCam and covers 28.3 deg(sup 2). The southern component of the survey was observed with CTIO/MOSAICII, covers 13.6 deg(sup 2), and is summarized in a companion paper by Wilson et al. (2008). We also present spectroscopic confirmation of two rich cluster candidates at z approx. 1.2. Based on Nod-and- Shuffle spectroscopy from GMOS-N on Gemini there are 17 and 28 confirmed cluster members in SpARCS J163435+402151 and SpARCS J163852+403843 which have spectroscopic redshifts of 1.1798 and 1.1963, respectively. The clusters have velocity dispersions of 490 +/- 140 km/s and 650 +/- 160 km/s, respectively which imply masses (M(sub 200)) of (1.0 +/- 0.9) x 10(exp 14) Stellar Mass and (2.4 +/- 1.8) x 10(exp 14) Stellar Mass. Confirmation of these candidates as bonafide massive clusters demonstrates that two-filter imaging is an effective, yet observationally efficient, method for selecting clusters at z > 1.

Muzzin, Adam↗

PDG: A Composite Method Based on the Resolution of the Identity

The Gaussian-3 (G3) composite approach for thermochemical properties is revisited in light of the enhanced computational efficiency and reduced memory costs by applying the resolution-of-the-identity (RI) approximation for two-electron repulsion integrals (ERIs) to the computationally demanding component methods in the G3 model: the energy and gradient computations via the second-order Møller–Plesset perturbation theory (MP2) and the energy computations using the coupled-cluster singles–doubles method augmented with noniterative triples corrections [CCSD(T)]. Efficient implementation of the RI-based methods is achieved by employing a hybrid distributed/shared memory model based on MPI and OpenMP. The new variant of the G3 composite approach based on the RI approximation is termed the RI-G3 scheme, or alternatively the PDG method. The accuracy of the new RI-G3/PDG scheme is compared to the “standard” G3 composite approach that employs the memory-expensive four-center ERIs in the MP2 and CCSD(T) calculations. Taking the computation of the heats of formation of the closed-shell molecules in the G3/99 test set as a test case, it is demonstrated that the RI approximation introduces negligible changes to the mean absolute errors relative to the standard G3 model (less than 0.1 kcal/mol), while the standard deviations remain unaltered. Furthermore, the efficiency and memory requirements for the RI-MP2 and RI-CCSD(T) methods are compared to the standard MP2 and CCSD(T) approaches, respectively. The hybrid MPI/OpenMP-based RI-MP2 energy plus gradient computation is found to attain a 7.5× speedup over the standard MP2 calculations. For the most demanding CCSD(T) calculations, the application of the RI approximation is found to nearly halve the memory demand, confer about a 4–5× speedup for the CCSD iterations, and reduce the computational time for the compute-intensive triples correction step by several hours.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗