Search NASA⌕ Search

SEARCH · Search NASA

Results for “N square clusters”

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 19 records

A search for N-type galaxies

A large number of distant clusters of galaxies was examined for the presence of a bright compact galaxy or blue stellar object. Nearly 600 square degrees of sky were searched using glass copies of the National Geographic Society-Palomar Observatory Sky Survey plates, and over 20 fields were selected for observation. The objects were examined for infrared and ultraviolet excesses, using wideband filter photography and spectroscopy. Initial findings include a faint, distant cluster of galaxies near the quasi-stellar radio source 4C 37.43 with a red shift of 0.370. One of these galaxies has an emission line at 6895 A, indicating a possible red shift of 0.377 of the 5007 A line of (0 III).

Jefferies, J. T.↗

Multi-grid technique for the solution of incompressible Navier-Stokes equations

A computationally efficient method is proposed for obtaining fine-mesh solutions of the Navier-Stokes equations for high-Re flow, including separation. The method involves implementing a multi-grid solution procedure with suitably chosen elements, such that the resulting overall solution technique is efficient as well as robust. The robustness and efficiency of the solution technique are demonstrated by applying it to three model problems: flow in a driven cavity, downstream asymptotic flow in curved ducts of square and polar sections, and Newmann boundary-value problem in clustered curvilinear orthogonal coordinates.

Ghia, K. N.↗

A balanced submatrix merging algorithm for multiprocessor architectures

In this article, a parallel algorithm which applies Givens rotations to selectively annihilate k(k + 1)/2 nonzero elements from two k x n(k not more than n) upper trapezoidal submatrices is described. The new algorithm is suitable for implementation on either a pair of directly connected local-memory processors or two clusters of multiple tightly-coupled processors. Analyses show that in both cases the proposed algorithms achieve optimal speed-up by balancing the work load distribution and masking interprocessor or intercluster communication by computation if k is much small than n. In the context of solving large scale least squares problems, this submatrix merging step is repetitively needed during the entire computation and, furthermore, there are usually many pairs of such submatrices to be merged with each submatrix stored in the memory of a processor or a cluster of processors. The proposed algorithm can be applied to each pair of submatrices concurrently, and thus parallelizes an important step in solving the least squares problems.

Chu, Eleanor↗

Power-Law Template for IR Point Source Clustering

We perform a combined fit to angular power spectra of unresolved infrared (IR) point sources from the Planck satellite (at 217,353,545 and 857 GHz, over angular scales 100 < I < 2200), the Balloonborne Large-Aperture Submillimeter Telescope (BLAST; 250, 350 and 500 microns; 1000 < I < 9000), and from correlating BLAST and Atacama Cosmology Telescope (ACT; 148 and 218 GHz) maps. We find that the clustered power over the range of angular scales and frequencies considered is well fit by a simple power law of the form C_l\propto I(sup -n) with n = 1.25 +/- 0.06. While the IR sources are understood to lie at a range of redshifts, with a variety of dust properties, we find that the frequency dependence of the clustering power can be described by the square of a modified blackbody, nu(sup beta) B(nu,T_eff), with a single emissivity index beta = 2.20 +/- 0.07 and effective temperature T_eff= 9.7 K. Our predictions for the clustering amplitude are consistent with existing ACT and South Pole Telescope results at around 150 and 220 GHz, as is our prediction for the effective dust spectral index, which we find to be alpha_150-220 = 3.68 +/- 0.07 between 150 and 220 GHz. Our constraints on the clustering shape and frequency dependence can be used to model the IR clustering as a contaminant in Cosmic Microwave Background anisotropy measurements. The combined Planck and BLAST data also rule out a linear bias clustering model.

Addison, Graeme E.↗

Power-Law Template for Infrared Point-Source Clustering

We perform a combined fit to angular power spectra of unresolved infrared (IR) point sources from the Planck satellite (at 217, 353, 545, and 857 GHz, over angular scales 100 approx < l approx < 2200), the Balloon-borne Large-Aperture Submillimeter Telescope (BLAST; 250, 350, and 500 micron; 1000 approx < l approx < 9000), and from correlating BLAST and Atacama Cosmology Telescope (ACT; 148 and 218 GHz) maps. We find that the clustered power over the range of angular scales and frequencies considered is well fitted by a simple power law of the form C(sup clust)(sub l) varies as l (sub −n) with n = 1.25 +/- 0.06. While the IR sources are understood to lie at a range of redshifts, with a variety of dust properties, we find that the frequency dependence of the clustering power can be described by the square of a modified blackbody, ν(sup Beta)B(ν, T(sub eff) ), with a single emissivity index Beta = 2.20 +/- 0.07 and effective temperature T(sub eff) = 9.7 K. Our predictions for the clustering amplitude are consistent with existing ACT and South Pole Telescope results at around 150 and 220 GHz, as is our prediction for the effective dust spectral index, which we find to be alpha(sub 150-220) = 3.68 +/- 0.07 between 150 and 220 GHz. Our constraints on the clustering shape and frequency dependence can be used to model the IR clustering as a contaminant in cosmic microwave background anisotropy measurements. The combined Planck and BLAST data also rule out a linear bias clustering model.

cosmic background radiation↗

The Atacama Cosmology Telescope: Dynamical Masses for 44 SZ-Selected Galaxy Clusters over 755 Square Degrees

We present galaxy velocity dispersions and dynamical mass estimates for 44 galaxy clusters selected via the Sunyaev-Zeldovich (SZ) effect by the Atacama Cosmology Telescope. Dynamical masses for 18 clusters are reported here for the first time. Using N-body simulations, we model the different observing strategies used to measure the velocity dispersions and account for systematic effects resulting from these strategies. We find that the galaxy velocity distributions may be treated as isotropic, and that an aperture correction of up to 7 per cent in the velocity dispersion is required if the spectroscopic galaxy sample is sufficiently concentrated towards the cluster centre. Accounting for the radial profile of the velocity dispersion in simulations enables consistent dynamical mass estimates regardless of the observing strategy. Cluster masses M200 are in the range (1 - 15) times 10 (sup 14) Solar Masses. Comparing with masses estimated from the SZ distortion assuming a gas pressure profile derived from X-ray observations gives a mean SZ-to-dynamical mass ratio of 1:10 plus or minus 0:13, but there is an additional 0.14 systematic uncertainty due to the unknown velocity bias; the statistical uncertainty is dominated by the scatter in the mass-velocity dispersion scaling relation. This ratio is consistent with previous determinations at these mass scales.

Sunyaev-Zeldovich (SZ)↗

The Study of Clusters of Galaxies and Large Scale Structures

Many research projects have been initiated and completed under support of this program. The results are summarized below. The work on the ROSAT Deep Survey has been successfully completed. A number of interesting results have been established within this joint MPE, Cal Tech, JHU, ST ScI, ESO collaboration. First, a very large fraction, 70-80 percent, of the X-ray background has been directly resolved into point sources. We have derived a new log N-log S for X-ray sources and have measured a source density of 970 sources per square degree at a limiting flux level. Care was taken in these studies to accurately model and measure the effects of sources confusion. This was possible because of our observing strategy which included both deep PSPC and HRI observations. No evidence of a population of narrow emission line galaxies has been established but some evidence for the evolution of low luminosity AGN (Seyfert galaxies) has been reported. The work on the ROSAT All Sky Survey Northern Cluster Survey has been substantially concluded but the publication of the list has been held up by the need to analyze newly re-calibrated data. This should result in publication over the next year. During the past year we have submitted a paper to the Astrophysical Journal which utilized a sample of clusters originally selected from the ROSAT All-sky survey at redshifts greater than 0.3. This sample was studied with ASCA to determine temperature and luminosity.

Source record↗

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↗

Discovery of Activities via Statistical Clustering of Fixation Patterns

Human behavior often consists of a series of distinct activities, each characterized by a unique pattern of interaction with the visual environment. This is true even in a restricted domain, such as a pilot flying an airplane; in this case, activities with distinct visual signatures might be things like communicating, navigating, monitoring, etc. We propose a novel analysis method for gaze-tracking data, to perform blind discovery of these hypothetical activities. We compare, not individual fixations, but groups of fixations aggregated over a fixed time interval (Tau). We assume that the environment has been divided into a finite set of discrete areas-of-interest (AOIs). For a given time interval, we compute the proportion of time spent fixating each AOI, resulting in an N-dimensional vector, where N is the number of AOIs. These proportions can be converted to integer counts by multiplying by Tau divided by the average fixation duration, a parameter that we fix at 283 milliseconds. We compare different intervals by computing the chi-squared statistic. The p-value associated with the statistic is the likelihood of observing the data under the hypothesis that the data in the two intervals were generated by a single process with a single set of probabilities governing the fixation of each AOI. We cluster the intervals, first by merging adjacent intervals that are sufficiently similar, optionally shifting the boundary between non-merged intervals to maximize the difference. Then we compare and cluster non-adjacent intervals. The method is evaluated using synthetic data generated by a hand-crafted set of activities. While the method generally finds more activities than put into the simulation, we have obtained agreement as high as 80 percent between the inferred activity labels and ground truth.

Eye Movements↗

Linear clusters of galaxies - A194

New measurements for 160 redshifts and previous measurements for 108 other redshifts are presented for galaxies within 5 deg of A194. The galaxy distribution in A194 is shown to be inconsistent with a spherically symmetric King model. A mass-to-light ratio is derived using the virial theorem which is lower than the mean for the groups in the CfA redshift survey (Huchra and Geller, 1982; Geller, 1984). A nonparametric test for galaxy-cluster alignment and a Chi-squared test are used to search for alignment of galaxy major axes with the axis of A194. Evidence for neither luminosity segregation nor significant differences in the velocity or surface distributions of galaxies as a function of morphological type is found.

Chapman, G. N. F.↗

The Study of Clusters of Galaxies and Large Scale Structures

The work on the ROSAT Deep Survey has been successfully completed. A number of interesting results have been established within this joint MPE, Cal Tech, JHU, ST Scl, ESO collaboration. First, a very large fraction, 70-80 percent, of the X-ray background has been directly resolved into point sources. We have derived a new log N-log S for X- ray sources and have measured a source density of 970 sources per square degree at a limiting flux level of 10(exp -15)/erg s sq cm (0.5-2.0 keV). Care was taken in these studies to accurately model and measure the effects of sources confusion. This was possible because of our observing strategy which included both deep PSPC and HRI observations. In the last year we initiated work in the design and development of the Next Generation Space Telescope.

Source record↗

Percolation technique for galaxy clustering

We study percolation in mass and galaxy distributions obtained in 3D simulations of the CDM, C + HDM, and the power law (n = -1) models in the Omega = 1 universe. Percolation statistics is used here as a quantitative measure of the degree to which a mass or galaxy distribution is of a filamentary or cellular type. The very fast code used calculates the statistics of clusters along with the direct detection of percolation. We found that the two parameters mu(infinity), characterizing the size of the largest cluster, and mu-squared, characterizing the weighted mean size of all clusters excluding the largest one, are extremely useful for evaluating the percolation threshold. An advantage of using these parameters is their low sensitivity to boundary effects. We show that both the CDM and the C + HDM models are extremely filamentary both in mass and galaxy distribution. The percolation thresholds for the mass distributions are determined.

Klypin, Anatoly↗

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↗

Discovery of Activities via Statistical Clustering of Fixation Patterns

Human behavior often consists of a series of distinct activities, each characterized by a unique pattern of interaction with the visual environment. This is true even in a restricted domain, such as a piloting an aircraft, where activities with distinct visual signatures might be things like communicating, navigating, and monitoring. We propose a novel analysis method for gaze-tracking data, to perform blind discovery of these hypothetical activities. The method is in some respects similar to recurrence analysis, but here we compare not individual fixations, but groups of fixations aggregated over a fixed time interval. The duration of this interval is a parameter that we will refer to as delta. We assume that the environment has been divided into a set of N different areas-of-interest (AOIs). For a given interval of time of duration delta, we compute the proportion of time spent fixating each AOI, resulting in an N-dimensional vector. These proportions can be converted to integer counts by multiplying by delta divided by the average fixation duration (another parameter that we fix at 280 milliseconds). We compare different intervals by computing the chi-square statistic. The p-value associated with the statistic is the likelihood of observing the data under the hypothesis that the data in the two intervals were generated by a single process with a single set of probabilities governing the fixation of each AOI. The method has been applied to approximately 100 hours of eye movement data collected from pilots in a high-fidelity B747 flight simulator, and the results have been compared to synthetic data in which the each activity is represented as first-order Markov process with random probabilities assigned to the AOIs. Randomly-generated synthetic activities can require thousands of fixations to be discriminated with statistical significance, while the human data can be clustered using averaging windows of some 10's of seconds, suggesting that the actual activities are much more narrowly focused than random Markov models.

activity analysis↗

Optical signatures of high-redshift galaxy clusters

We combine an N-body and gasdynamic simulation of structure formation with an updated population synthesis code to explore the expected optical characteristics of a high-redshift cluster of galaxies. We examine a poor (2 keV) cluster formed in a biased, cold dark matter cosmology and employ simple, but plausible, threshold criteria to convert gas into stars. At z = 2, the forming cluster appears as a linear chain of very blue (g-r approximately equals 0) galaxies, with 15 objects brighter than r = 25 within a 1 square arcmin field of view. After 2 Gyr of evolution, the cluster viewed at z = 1 displays both freshly infalling blue galaxies and red galaxies robbed of recent accretion by interaction with the hot intracluster medium. The range in G-R colors is approximately 3 mag at z = 1, with the reddest objects lying at sites of highest galaxy density. We suggest that red, high-redshift galaxies lie in the cores of forming clusters and that their existence indicates the presence of a hot intracluster medium at redshifts z approximately equals 2. The simulated cluster viewed at z = 2 has several characteristics similar to the collection of faint, blue objects identified by Dressler et al. in a deep Hubble Space Telescope observation. The similarities provide some support for the interpretation of this collection as a high-redshift cluster of galaxies.

Evrard, August E.↗

Kinetics of Diffusional Droplet Growth in a Liquid/Liquid Two-Phase System

We address the problem of diffusional interactions in a finite sized cluster of spherical particles for volume fractions, V(sub v) in the range 0-0.01. We determined the quasi-static monopole diffusion solution for n particles distributed at random in a continuous matrix. A global mass conservation condition is employed, obviating the need for any external boundary condition. The numerical results provide the instantaneous (snapshot) growth or shrinkage rate of each particle, precluding the need for extensive time-dependent computations. The close connection between these snapshot results and the coarsegrained kinetic constants are discussed. A square-root dependence of the deviations of the rate constants from their zero volume fraction value is found for the higher V(sub v) investigated. This behavior is consistent with predictions from diffusion Debye-Huckel screening theory. By contrast, a cube-root dependence, reported in earlier numerical studies, is found for the lower V(sub v) investigated. The roll-over region of the volume fraction where the two asymptotics merge depends on the number of particles, n, alone. A theoretical estimate for the roll-over point predicts that the corresponding V(sub v) varies as n(sup -2), in good agreement with the numerical results.

Glicksman, M. E.↗

Optical studies of 10 high galactic latitude X-ray sources

Optical studies are reported for a representative sample of 10 unidentified high galactic latitude X-ray sources that are north of declination minus 25 deg and that have 3U error boxes less than or of the order of 0.5 square degrees. The source 3U 1410-03 is identified with a peculiar emission-line spiral galaxy, NGC 5506, and a distance group 4 rich cluster of galaxies, Abell 2142, is suggested as a possible identification for 3U 1555+27. It is shown that very few of the unidentified high galactic latitude sources are quasi-stellar sources brighter than 17.5 mag, although one possible X-ray quasar, NAB 0137-01, is reported.

Bahcall, J. N.↗

Discovery of Activities via Statistical Clustering of Fixation Patterns

Human behavior often consists of a series of distinct activities, each characterized by a unique signature of visual behavior. This is true even in a restricted domain, such as piloting an aircraft, where patterns of visual signatures might represent activities like communicating, navigating, and monitoring. We propose a novel analysis method for gaze-tracking data, to perform blind discovery of these activities based on their behavioral signatures. The method is in some respects similar to recurrence analysis, but here we compare not individual fixations, but groups of fixations aggregated over a fixed time interval. The duration of this interval is a parameter that we will refer to as τ. We assume that the environment has been divided into a set of N different areas-of-interest (AOIs). For a given interval of time of duration τ, we compute the proportion of time spent fixating each AOI, resulting in an N-dimensional vector. These proportions can be converted to counts by multiplying by τ divided by the average fixation duration (another parameter that we fix at 280 milliseconds). We compare different intervals by computing the chi-square statistic. The p-value associated with the statistic is the likelihood of observing the data under the hypothesis that the data in the two intervals were generated by a single process with a single set of probabilities governing the fixation of each AOI. We have investigated the method using a set of 10 synthetic "activities," that sample 4 AOIs. Four of these activities visit 3 of the 4 AOIs, with equal probability; as there are four different ways to leave-one- out, there are four such activities. Similarly, there are six different activities that leave-two-out. Sequences of simulated behavior were generated by running each activity for 40 seconds, in sequence, for a total of 6.7 minutes. The figure to the right shows the matrix of chi-square statistics, using a value of 2.8 seconds for τ, corresponding to 10 fixations. Low values (dark) indicate poor evidence for activity differences, while high values (bright) indicate strong evidence. The dark squares along the main diagonal each correspond to the forty second intervals in which the activity was held constant; the 4x4 block at the lower left corresponds to the four leave-one-out activities, while the 6x6 block in the upper right corresponds to the leave-two-out activities. (The anti-diagonal pattern of white squares indicates those activity pairs that share no AOIs.) The chi-square values can be binarized by choosing a particular significance level; we are interested in grouping bins that represent the same activity, effectively accepting the null hypothesis. Therefore, we may adopt a relatively lax criterion; for example, choosing a p-value of 0.2 means that two behaviors that have only a 1-in-5 chance of being produced by a single activity might nevertheless be clustered together. We have explored several methods to perform clustering on the data and solving for the activity probabilities. Greedy methods begin by selecting the time bin that is similar to the most (or least) other bins, and then forming a cluster from it and all other non-discriminable bins. These methods show mediocre performance, as they do not take into account temporal contiguity. Preliminary results indicate that methods that "grow" clusters in time from seed points perform better.

activity analysis↗