Search NASA⌕ Search

SEARCH · Search NASA

Results for “cluster finding”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Blind chemical tagging with DBSCAN: prospects for spectroscopic surveys

Abstract Chemical tagging has great promise as a technique to unveil our Galaxy’s history. Grouping stars based on their similar chemistry can establish details of the star formation and merger history of the Milky Way. With precise measurements of stellar chemistry, chemical tagging may be able to group together stars born from the same gas cloud, regardless of their current positions and kinematics. Successfully tagging these birth clusters requires high-quality chemical space information and a good cluster-finding algorithm. To test the feasibility of chemical tagging on data from current and upcoming spectroscopic surveys, we construct a realistic set of synthetic clusters, creating both observed spectra and derived chemical abundances for each star. We use Density-Based Spatial Clustering of Applications with Noise (DBSCAN) to group stars based on their spectra or abundances; these groups are matched to input clusters and are found to be highly homogeneous and complete. The percentage of clusters with more than 10 members recovered is 40 per cent when tagging on abundances with uncertainties achievable with current techniques. Based on our fiducial model for the Milky Way, we predict recovering over 600 clusters with at least 10 observed members and 70 per cent membership homogeneity in a sample similar to the Apache Point Observatory Galactic Evolution Experiment survey. Tagging larger surveys like the GALAH survey and the future Milky Way Mapper in Sloan Digital Sky Survey V could recover tens of thousands of clusters at high homogeneity. Access to so many unique co-eval clusters will transform how we understand the star formation history and chemical evolution of our Galaxy.

Price-Jones, Natalie↗
NASA NTRS1985

Cluster-cluster clustering

The cluster correlation function xi sub c(r) is compared with the particle correlation function, xi(r) in cosmological N-body simulations with a wide range of initial conditions. The experiments include scale-free initial conditions, pancake models with a coherence length in the initial density field, and hybrid models. Three N-body techniques and two cluster-finding algorithms are used. In scale-free models with white noise initial conditions, xi sub c and xi are essentially identical. In scale-free models with more power on large scales, it is found that the amplitude of xi sub c increases with cluster richness; in this case the clusters give a biased estimate of the particle correlations. In the pancake and hybrid models (with n = 0 or 1), xi sub c is steeper than xi, but the cluster correlation length exceeds that of the points by less than a factor of 2, independent of cluster richness. Thus the high amplitude of xi sub c found in studies of rich clusters of galaxies is inconsistent with white noise and pancake models and may indicate a primordial fluctuation spectrum with substantial power on large scales.

Barnes, J.↗
NASA NTRS2005

Cepheus OB2: Disk Evolution and Accretion at 3-10 Myr

We presented the results of MMT observations of young stars for our study of protoplanetary disks at ages 1-10 Myr in Tr 37 and NGC 7160. Using low-resolution optical spectra from the Hectospec multifiber spectrograph, we have tripled the number of known low-mass cluster members, identifying 130 new members in Tr 37 and 30 in NGC 7160. We used indicators of youth to identify and classify the low-mass cluster members. With the extended samples, we estimated the disk fraction in the clusters, finding that 40% of the low-mass stars in Tr 37 are actively accreting, whereas only 1 of the 55 low-mass stars in NGC 7160 shows indications of accretion. Optical photometry and theoretical isochrones are used to refine the ages of the clusters, confirming the estimates of 4 Myr for Tr 37 and 10 Myr for NGC 7160.

Sicilia-Aguilar, A.↗
DOE OSTI2022

Serial crystallography with multi-stage merging of thousands of images

KAMO and BLEND provide particularly effective tools to automatically manage the merging of large numbers of data sets from serial crystallography. The requirement for manual intervention in the process can be reduced by extending BLEND to support additional clustering options such as the use of more accurate cell distance metrics and the use of reflection-intensity correlation coefficients to infer `distances' among sets of reflections. This increases the sensitivity to differences in unit-cell parameters and allows clustering to assemble nearly complete data sets on the basis of intensity or amplitude differences. If the data sets are already sufficiently complete to permit it, one applies KAMO once and clusters the data using intensities only. When starting from incomplete data sets, one applies KAMO twice, first using unit-cell parameters. In this step, either the simple cell vector distance of the original BLEND or the more sensitive NCDist is used. This step tends to find clusters of sufficient size such that, when merged, each cluster is sufficiently complete to allow reflection intensities or amplitudes to be compared. One then uses KAMO again using the correlation between reflections with a common hkl to merge clusters in a way that is sensitive to structural differences that may not have perturbed the unit-cell parameters sufficiently to make meaningful clusters. Many groups have developed effective clustering algorithms that use a measurable physical parameter from each diffraction still or wedge to cluster the data into categories which then can be merged, one hopes, to yield the electron density from a single protein form. Since these physical parameters are often largely independent of one another, it should be possible to greatly improve the efficacy of data-clustering software by using a multi-stage partitioning strategy. Here, one possible approach to multi-stage data clustering is demonstrated. The strategy is to use unit-cell clustering until the merged data are sufficiently complete and then to use intensity-based clustering. Using this strategy, it is demonstrated that it is possible to accurately cluster data sets from crystals that have subtle differences.

36 MATERIALS SCIENCE↗
DOE OSTI2019

X-ray scaling relations from a complete sample of the richest maxBCG clusters

Here, we use a complete sample of 38 richest maxBCG clusters to study the ICM–galaxy scaling relations and the halo mass selection properties of the maxBCG algorithm, based on X-ray and optical observations. The clusters are selected from the two largest bins of optical richness in the Planck stacking work with the maxBCG richness N 200 ≥ 78. We analyse their Chandra and XMM–Newton data to derive the X-ray properties of the ICM. We then use the distribution of P(X|N), X = T X , L X , Y X , to study the mass selection P(M|N) of maxBCG. Compared with previous works based on the whole richness sample, a significant fraction of blended systems with boosted richness is skewed into this richest sample. Parts of the blended haloes are picked apart by the redMaPPer, an updated red-sequence cluster finding algorithm with lower mass scatter. Moreover, all the optical blended haloes are resolved as individual X-ray haloes, following the established L X -T X and L X -Y X relations. We further discuss that the discrepancy between ICM–galaxy scaling relations, especially for future blind stacking, can come from several factors, including miscentring, projection, contamination of low-mass systems, mass bias, and covariance bias. We also evaluate the fractions of relaxed and cool core clusters in our sample. Both are smaller than those from SZ or X-ray selected samples. Moreover, disturbed clusters show a higher level of mass bias than relaxed clusters.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

DeepSZ: identification of Sunyaev–Zel’dovich galaxy clusters using deep learning

Galaxy clusters identified via the Sunyaev–Zel’dovich (SZ) effect are a key ingredient in multiwavelength cluster cosmology. In this paper, we present and compare three methods of cluster identification: the standard matched filter (MF) method in SZ cluster finding, a convolutional neural networks (CNN), and a ‘combined’ identifier. We apply the methods to simulated millimeter maps for several observing frequencies for a survey similar to SPT-3G, the third-generation camera for the South Pole Telescope. The MF requires image pre-processing to remove point sources and a model for the noise, while the CNN requires very little pre-processing of images. Additionally, the CNN requires tuning of hyperparameters in the model and takes cut-out images of the sky as input, identifying the cut-out as cluster-containing or not. We compare differences in purity and completeness. The MF signal-to-noise ratio depends on both mass and redshift. Our CNN, trained for a given mass threshold, captures a different set of clusters than the MF, some with signal-to-noise-ratio below the MF detection threshold. However, the CNN tends to mis-classify cut-out whose clusters are located near the edge of the cut-out, which can be mitigated with staggered cut-out. We leverage the complementarity of the two methods, combining the scores from each method for identification. The purity and completeness are both 0.61 for MF, and 0.59 and 0.61 for CNN. The combined method yields 0.60 and 0.77, a significant increase for completeness with a modest decrease in purity. We advocate for combined methods that increase the confidence of many low signal-to-noise clusters.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Structural reversibility of Cu doped NU-1000 MOFs under hydrogenation conditions

The metal-organic framework (MOF), NU-1000, and its metalated counterparts have found proof-of-concept application in heterogeneous catalysis and hydrogen storage amongst others. A vapor-phase technique, akin to atomic layer deposition (ALD), is used to selectively deposit divalent Cu ions on oxo, hydroxo-bridged hexa-zirconium(IV) nodes capped with terminal –OH and -OH 2 ligands. Subsequent reaction with steam yields node-anchored, CuII-oxo,hydroxo clusters. We find that cluster installation via AIM (= ALD In MOFs) is accompanied by an expansion of MOF mesopore (channel) diameter . We investigated the behavior of the cluster-modified material, termed Cu-AIM-NU-1000, to heat treatment up to 325 °C, at atmospheric pressure with a low flow of H2 into the reaction cell. The response under these conditions revealed two important results: (1) Above 200 °C, the initially installed few-metal-ion clusters reduce to neutral Cu atoms. The neutral atoms migrate from the nodes and aggregate into Cu nanoparticles. While the size of particles formed in the MOF interior is constrained by the width of mesopores (ca. 3 nm), those formed on the exterior surface of the MOF can grow as large as ca. 8 nm. (2) Reduction and release of Cu atoms from the MOFs nodes is accompanied NU-1000 undergoes dynamic structural transformation as it reverts back to its original dimension following the release. These results show while the MOF framework itself remains intact at 325 °C in an H 2 atmosphere, the small, AIM-installed Cu II -oxo,hydroxo clusters are stable with respect to reduction and conversion to metallic nanoparticles only up to ~200 °C.

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

Stellar population models based on the SDSS-IV MaStar library of stellar spectra – I. Intermediate-age/old models

ABSTRACT We use the first release of the SDSS/MaStar stellar library comprising ∼9000, high S/N spectra, to calculate integrated spectra of stellar population models. The models extend over the wavelength range 0.36–1.03 µm and share the same spectral resolution ($R\sim 1800$) and flux calibration as the SDSS-IV/MaNGA galaxy data. The parameter space covered by the stellar spectra collected thus far allows the calculation of models with ages and chemical composition in the range $\rm {\mathit{ t}\gt 200 \,Myr, -2 \lt = [Z/H] \lt = + 0.35}$, which will be extended as MaStar proceeds. Notably, the models include spectra for dwarf main-sequence stars close to the core H-burning limit, as well as spectra for cold, metal-rich giants. Both stellar types are crucial for modelling λ > 0.7 µm absorption spectra. Moreover, a better parameter coverage at low metallicity allows the calculation of models as young as 500 Myr and the full account of the blue horizontal branch phase of old populations. We present models adopting two independent sets of stellar parameters (Teff, log g, [Z/H]). In a novel approach, their reliability is tested ‘on the fly’ using the stellar population models themselves. We perform tests with Milky Way and Magellanic Clouds globular clusters, finding that the new models recover their ages and metallicities remarkably well, with systematics as low as a few per cent for homogeneous calibration sets. We also fit a MaNGA galaxy spectrum, finding residuals of the order of a few per cent comparable to the state-of-art models, but now over a wider wavelength range.

Maraston, C.↗
DOE OSTI2021

Stacked CMB lensing and ISW signals around superstructures in the DESI Legacy Survey

The imprints of large-scale structures on the Cosmic Microwave Background (CMB) can be studied via the CMB lensing and Integrated Sachs–Wolfe (ISW) signals. In particular, the stacked ISW signal around supervoids has been claimed in several works to be anomalously high. In this study, we find cluster and void superstructures using four tomographic redshift bins with 0 < z < 0.8 from the DESI Legacy Survey and measure the stacked CMB lensing and ISW signals around them. To compare our measurements with ΛCDM model predictions, we construct a mock catalogue with matched galaxy number density and bias and apply the same photo-z uncertainty as the data. The consistency between the mock and the data is verified via the stacked galaxy density profiles around the superstructures and their quantity. The corresponding lensing convergence and ISW maps are then constructed and compared. The stacked lensing signal agrees with data well except at the highest redshift bin in density peaks, where the mock prediction is significantly higher, by approximately a factor of 1.3. The stacked ISW signal is generally consistent with the mock prediction. We do not obtain a significant signal from voids, A ISW = -0.10 ± 0.69, and the signal from clusters, A ISW = 1.52 ± 0.72, is at best weakly detected. However, these results are strongly inconsistent with previous claims of ISW signals at many times the level of the ΛCDM prediction. We discuss the comparison of our results with past work in this area and investigate possible explanations for this discrepancy.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Scaling pair count to next galaxy surveys

ABSTRACT Counting pairs of galaxies or stars according to their distance is at the core of real-space correlation analyses performed in astrophysics and cosmology. Upcoming galaxy surveys (LSST, Euclid) will measure properties of billions of galaxies challenging our ability to perform such counting in a minute-scale time relevant for the usage of simulations. The problem is only limited by efficient access to the data, hence belongs to the big data category. We use the popular Apache Spark framework to address it and design an efficient high-throughput algorithm to deal with hundreds of millions to billions of input data. To optimize it, we revisit the question of non-hierarchical sphere pixelization based on cube symmetries and develop a new one dubbed the ‘Similar Radius Sphere Pixelization’ (SARSPix) with very close to square pixels. It provides the most adapted indexing over the sphere for all distance-related computations. Using LSST-like fast simulations, we compute autocorrelation functions on tomographic bins containing between a hundred million to one billion data points. In each case, we achieve the construction of a standard pair-distance histogram in about 2 min, using a simple algorithm that is shown to scale, over a moderate number of nodes (16–64). This illustrates the potential of this new techniques in the field of astronomy where data access is becoming the main bottleneck. They can be easily adapted to other use-cases as nearest-neighbours search, catalogue cross-match or cluster finding. The software is publicly available from https://github.com/astrolabsoftware/SparkCorr.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

Scalable Proximity-Based Methods for Large-Scale Analysis of Atom Probe Data

Powered by recent advances in data acquisition technologies, today's state-of-the-art atom probe microscopes yield data sets with sizes ranging from a few million atoms to billions of atoms. Analysis of these atomic data sets within rea-sonable turnaround times is a pressing data analysis challenge for material scientists currently equipped with software systems that do not scale to these massive data sets. Here, we present the shared memory component of a larger ongoing effort to develop a multi-feature data analysis framework capable of analyzing atom probe data of all sizes and scales from desktop multicore machines to large-scale high-performance computing platforms with hybrid (shared and distributed memory) architectures. Our focus here is on a broad class of popular atom probe data analysis methods that rely on core time-consuming k-NN queries. We present a scalable, heuristic algorithm for k-NN queries using three-dimensional range trees. To demonstrate its efficacy, the k-NN algorithm is integrated with two use cases of atom probe data analysis methods and the resulting analysis times are shown to speedup by over 20X on a 32-core Cray XC40 node using workloads up to 8 million atoms, which is already beyond the at-scale capabilities of existing atom probe software. Using this k-NN algorithm, we also introduce a novel parameter estimation method for a class of cluster finding methods, called friends-of-friends (FoF) methods, to completely bypass their expensive pre-processing steps. In each case, we validate the results on a variety of control data sets.

Lu, Hao↗
DOE OSTI2021

I-GCN: A Graph Convolutional Network Accelerator with Runtime Locality Enhancement through Islandization

In this paper, we propose a novel hardware accelerator for GCN inference called I-GCN that significantly improves data locality and reduces unnecessary computation through a new online graph restructuring algorithm we refer to as islandization. The proposed algorithm finds clusters of nodes with strong internal but weak external connections. The islandization process yields two major benefits. First, by processing islands rather than individual nodes, there is better on-chip data reuse and fewer off-chip memory accesses. Second, there is less redundant computation as aggregation for common/shared neighbors in an island can be reused. The parallel search, identification, and leverage of graph islands are all handled purely in hardware at runtime working in an incremental pipelined manner. This is done without any preprocessing of the graph data or adjustment of the GCN model structure.

Geng, Tong↗
DOE OSTI2022

Computational Estimation by Scientific Data Mining with Classical Methods to Automate Learning Strategies of Scientists

Experimental results are often plotted as 2-dimensional graphical plots (aka graphs) in scientific domains depicting dependent versus independent variables to aid visual analysis of processes. Repeatedly performing laboratory experiments consumes significant time and resources, motivating the need for computational estimation. The goals are to estimate the graph obtained in an experiment given its input conditions, and to estimate the conditions that would lead to a desired graph. Existing estimation approaches often do not meet accuracy and efficiency needs of targeted applications. We develop a computational estimation approach called AutoDomainMine that integrates clustering and classification over complex scientific data in a framework so as to automate classical learning methods of scientists. Knowledge discovered thereby from a database of existing experiments serves as the basis for estimation. Challenges include preserving domain semantics in clustering, finding matching strategies in classification, striking a good balance between elaboration and conciseness while displaying estimation results based on needs of targeted users, and deriving objective measures to capture subjective user interests. These and other challenges are addressed in this work. The AutoDomainMine approach is used to build a computational estimation system, rigorously evaluated with real data in Materials Science. Our evaluation confirms that AutoDomainMine provides desired accuracy and efficiency in computational estimation. It is extendable to other science and engineering domains as proved by adaptation of its sub-processes within fields such as Bioinformatics and Nanotechnology.

Computer Science↗
DOE OSTI2020

A VXS [VITA41] Trigger Processor for the 12GEV Experimental Programs at Jefferson Lab

The VXS_Trigger_Processor [VTP] was developed and commissioned for CLAS12 in the fall of 2016. This board is a VITA41 switch card and it collects data from a variety of front-end TDC and Flash ADC modules. The VTP has since been used in several experiments at Jefferson Lab serving as the L1 trigger module for a variety of detector types, such as stacked calorimeters, strip calorimeters, time-of-flight, Cerenkov, hodoscopes, drift chambers, and silicon strips. Trigger algorithms implemented include cluster finding (1D, 2D), drift chamber segment and road finding, geometry matching between various detectors, particle counting, and general global trigger bit processing. The VTP is also capable of reading out each front-end crate with up to 40Gbps Ethernet which is an enormous increase compared to the currently used 200MB/s VME bus. Recent progress has been made to show that a firmware and software upgrade can enable existing Jefferson Lab front-end crates to operate in a streaming DAQ mode. In February 2020, tests will be performed on a full calorimeter and matched hodoscope which are components of the CLAS12 Forward Tagger detector system with beam in Hall B. This paper details the hardware performance, triggered, and streaming applications that have been implemented using the VTP for several experiments at Jefferson Lab.

ABBOTT, David↗
DOE OSTI2026

The Compilation and Validation of the Spectroscopic Redshift Catalogs for the DESI-COSMOS and DESI-XMM-LSS Fields

Over several dedicated programs that include targets beyond the main cosmological samples, the Dark Energy Spectroscopic Instrument collected spectra for 304,970 unique objects in two fields centered on the COSMOS and XMM-LSS fields. In this work, we develop spectroscopic redshift robustness criteria for those spectra, validate these criteria using visual inspection, and provide two custom value-added catalogs with our redshift characterizations. With these criteria, we reliably classify 212,935 galaxies below z < 1.6, 9713 quasars, and 35,222 stars. The resulting catalogs achieve a redshift purity exceeding 99.4% across all galaxy samples. As a critical element in characterizing the selection function, we provide the description of 70 different algorithms that were used to select these targets from imaging data. To facilitate joint imaging/spectroscopic analyses, we provide row-matched photometry from the Dark Energy Camera, Hyper-Suprime Cam, and public COSMOS2020 photometric catalogs. Finally, we demonstrate example applications of these large catalogs to photometric redshift estimation, cluster finding, and completeness studies.

Ratajczak, J. [Univ. of Utah, Salt Lake City, UT (↗
NASA NTRS1988

How to cluster in parallel with neural networks

Partitioning a set of N patterns in a d-dimensional metric space into K clusters - in a way that those in a given cluster are more similar to each other than the rest - is a problem of interest in astrophysics, image analysis and other fields. As there are approximately K(N)/K (factorial) possible ways of partitioning the patterns among K clusters, finding the best solution is beyond exhaustive search when N is large. Researchers show that this problem can be formulated as an optimization problem for which very good, but not necessarily optimal solutions can be found by using a neural network. To do this the network must start from many randomly selected initial states. The network is simulated on the MPP (a 128 x 128 SIMD array machine), where researchers use the massive parallelism not only in solving the differential equations that govern the evolution of the network, but also by starting the network from many initial states at once, thus obtaining many solutions in one run. Researchers obtain speedups of two to three orders of magnitude over serial implementations and the promise through Analog VLSI implementations of speedups comensurate with human perceptual abilities.

Kamgar-Parsi, Behzad↗
NASA NTRS2001

A US coordination Facility for the Spectrum-X-Gamma Observatory

We have completed our efforts in support of the Spectrum X Gamma mission under a NASA grant. These activities have included direct support to the mission, developing unifying tools applicable to SXG and other X-ray astronomy missions, and X-ray astronomy research to maintain our understanding of the importance and relevance of SXG to the field. SXG provides: 1) Simultaneous Multiwavelength Capability; 2) Large Field of View High Resolution Imaging Spectroscopy; 3) Sensitive Polarimetry with SXRP (Stellar X-Ray Polarimeter). These capabilities will ensure the fulfillment of the following objectives: understanding the accretion dynamics and the importance of reprocessing, upscattering, and disk viscosity around black holes; studying cluster mergers; spatially resolving cluster cooling flows to detect cooling gas; detecting cool gas in cluster outskirts in absorption; mapping gas in filaments around clusters; finding the 'missing' baryons in the Universe; determining the activity history of the black hole in the Galactic Center of our own central black hole; determining pulsar beam geometry; searching for the Lense-Thirring effect in black hole sources; constraining emission mechanisms and accretion geometry in AGN.

Forman, W.↗
NASA NTRS2001

Hyperspectral Image Classification using a Self-Organizing Map

The use of hyperspectral data to determine the abundance of constituents in a certain portion of the Earth's surface relies on the capability of imaging spectrometers to provide a large amount of information at each pixel of a certain scene. Today, hyperspectral imaging sensors are capable of generating unprecedented volumes of radiometric data. The Airborne Visible/Infrared Imaging Spectrometer (AVIRIS), for example, routinely produces image cubes with 224 spectral bands. This undoubtedly opens a wide range of new possibilities, but the analysis of such a massive amount of information is not an easy task. In fact, most of the existing algorithms devoted to analyzing multispectral images are not applicable in the hyperspectral domain, because of the size and high dimensionality of the images. The application of neural networks to perform unsupervised classification of hyperspectral data has been tested by several authors and also by us in some previous work. We have also focused on analyzing the intrinsic capability of neural networks to parallelize the whole hyperspectral unmixing process. The results shown in this work indicate that neural network models are able to find clusters of closely related hyperspectral signatures, and thus can be used as a powerful tool to achieve the desired classification. The present work discusses the possibility of using a Self Organizing neural network to perform unsupervised classification of hyperspectral images. In sections 3 and 4, the topology of the proposed neural network and the training algorithm are respectively described. Section 5 provides the results we have obtained after applying the proposed methodology to real hyperspectral data, described in section 2. Different parameters in the learning stage have been modified in order to obtain a detailed description of their influence on the final results. Finally, in section 6 we provide the conclusions at which we have arrived.

Martinez, P.↗