Search NASA⌕ Search

SEARCH · Search NASA

Results for “Cluster Computing”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

An experimental and computational view of the photoionization of diol–water clusters

In the interstellar medium, diols and other prebiotic molecules adsorb onto icy mantles surrounding dust grains. Water in the ice may affect the reactivity and photoionization of these diols. Ethylene glycol (EG), 1,2-propylene glycol, and 1,3-propylene glycol clusters with water clusters were used as a proxy to study these interactions. The diol–water clusters were generated in a continuous supersonic molecular beam, photoionized by synchrotron-based vacuum ultraviolet light from the Advanced Light Source, and subsequently detected by reflectron time-of-flight mass spectrometry. The appearance energies for the detected clusters were determined from the mass spectra, collected at increasing photon energy. Clusters of both diol fragments and unfragmented diols with water were detected. The lowest energy geometry optimized conformers for the observed EG–water clusters and EG fragment–water clusters have been visualized using density functional theory (DFT), providing insight into hydrogen bonding networks and how these affect fragmentation and appearance energy. As the number of water molecules clustered around EG fragments (m/z 31 and 32) increased, the appearance energy for the cluster decreased, indicating a stabilization by water. This trend was supported by DFT calculations. Fragment clusters from 1,2-propylene glycol exhibited a similar trend, but with a smaller energy decrease, and no trend was observed from 1,3-propylene glycol. In conclusion, we discuss and suggest that the reactivity and photoionization of diols in the presence of water depend on the size of the diol, the location of the hydroxyl group, and the number of waters clustered around the diol.

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

Computer program documentation: ISOCLS iterative self-organizing clustering program, program C094

The author has identified the following significant results. This program implements an algorithm which, ideally, sorts a given set of multivariate data points into similar groups or clusters. The program is intended for use in the evaluation of multispectral scanner data; however, the algorithm could be used for other data types as well. The user may specify a set of initial estimated cluster means to begin the procedure, or he may begin with the assumption that all the data belongs to one cluster. The procedure is initiatized by assigning each data point to the nearest (in absolute distance) cluster mean. If no initial cluster means were input, all of the data is assigned to cluster 1. The means and standard deviations are calculated for each cluster.

Minter, R. T.↗
NASA NTRS2009

Understanding the Scalability of Bayesian Network Inference using Clique Tree Growth Curves

Bayesian networks (BNs) are used to represent and efficiently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to perform computation in BNs is clique tree clustering and propagation. In this approach, BN computation consists of propagation in a clique tree compiled from a Bayesian network. There is a lack of understanding of how clique tree computation time, and BN computation time in more general, depends on variations in BN size and structure. On the one hand, complexity results tell us that many interesting BN queries are NP-hard or worse to answer, and it is not hard to find application BNs where the clique tree approach in practice cannot be used. On the other hand, it is well-known that tree-structured BNs can be used to answer probabilistic queries in polynomial time. In this article, we develop an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN's non-root nodes to the number of root nodes, or (ii) the expected number of moral edges in their moral graphs. Our approach is based on combining analytical and experimental results. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for each set. For the special case of bipartite BNs, we consequently have two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, we systematically increase the degree of the root nodes in bipartite Bayesian networks, and find that root clique growth is well-approximated by Gompertz growth curves. It is believed that this research improves the understanding of the scaling behavior of clique tree clustering, provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms, and presents an aid for analytical trade-off studies of clique tree clustering using growth curves.

Mengshoel, Ole Jakob↗
DOE OSTI2020

Spatially Resolved Mapping of Three-Dimensional Molecular Orientations with ~2 nm Spatial Resolution through Tip-Enhanced Raman Scattering

We record local optical field images of silver nanocubes (75 nm) using tip-enhanced Raman (TER) spectral imaging. The images that we observe are consistent with several recent reports from our group, but here, we demonstrate sub-2 nm spatial resolution in local optical field nanoimaging under ambient laboratory conditions. This is achieved by scanning the substrate (nanocube on Si) relative to a 4-thiobenzonitrile (TBN)-functionalized Ag-coated TER probe. The spatial resolution that we obtain necessitates that only a few molecules govern the recorded optical response; molecular orientation becomes an important consideration in such measurements. We model the orientation through geometry optimization of a TBN molecule chemisorbed onto an Ag79 cluster (sphere with a ~1 nm diameter). Using the computed orientation of the cluster-bound molecule, we then model the optical response using formalism that accounts for the orientation of the molecule relative to vector components of the local optical fields. We find optimal agreement between experiment and theory. In effect, this work reveals the parallels between single-molecule Raman scattering and high-spatial-resolution TER spectroscopy, even when the images themselves cannot be used to visualize a single molecule in real space.

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

Sodium Superionic Conductors Based on Clusters

Owing to the high abundance and low cost of sodium (Na), Na-based rechargeable batteries hold great potential for large-scale applications in the future energy industry. However, as key component of the battery electrolyte, only a few Na-based superionic conductors can reach the ionic conductivity comparable to that of liquid or gel electrolytes. Here, we provide a guideline for the development of cluster-based Na-rich antiperovskite superionic conductors using computational studies. With a selected cluster ion BCl 4 – , we are able to achieve high-room-temperature Na-ionic conductivity over 10 –3 S/cm and low activation energies below 0.2 eV in the antiperovskite crystals Na 3 S(BCl 4 ) and Na 3 S(BCl 4 ) 0.5 I 0.5 . In addition, these materials have large bandgaps and favorable mechanical properties. Here, a comprehensive study of the stability and formation energy of these materials further illustrates possible routes for their synthesis. New insights into the conduction mechanism of these cluster-based superionic conductors are provided, including the cooperative motion of Na ions and the significant reduction of the migration barrier due to the changing orientation of the cluster ion.

25 ENERGY STORAGE↗
DOE OSTI2023

Proper orthogonal descriptors for efficient and accurate interatomic potentials

Here, we present the proper orthogonal descriptors for efficient and accuracy representation of the potential energy surface. The potential energy surface is represented as a many-body expansion of parametrized potentials in which the potentials are functions of atom positions and parameters. The proper orthogonal decomposition is employed to decompose the parametrized potentials into a set of proper orthogonal descriptors (PODs). Because of the rapid convergence of the proper orthogonal decomposition, relevant snapshots can be sampled exhaustively to represent the atomic neighborhood environment accurately with a small number of descriptors. The proper orthogonal descriptors are used to develop interatomic potentials by using a linear expansion of the descriptors and determining the expansion coefficients from a weighted least-squares regression against a density functional theory (DFT) training set. We present a comprehensive evaluation of the POD potentials on previously published DFT data sets comprising Li, Mo, Cu, Ni, Si, Ge, and Ta elements. The data sets represent a diverse pool of metals, transition metals, and semiconductors. The accuracy of the POD potentials are comparable to that of state-of-the-art machine learning potentials such as the spectral neighbor analysis potential (SNAP) and the atomic cluster expansion (ACE).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1973

Forest and range mapping in the Houston area with ERTS-1

ERTS-1 data acquired over the Houston area has been analyzed for applications to forest and range mapping. In the field of forestry the Sam Houston National Forest (Texas) was chosen as a test site, (Scene ID 1037-16244). Conventional imagery interpretation as well as computer processing methods were used to make classification maps of timber species, condition and land-use. The results were compared with timber stand maps which were obtained from aircraft imagery and checked in the field. The preliminary investigations show that conventional interpretation techniques indicated an accuracy in classification of 63 percent. The computer-aided interpretations made by a clustering technique gave 70 percent accuracy. Computer-aided and conventional multispectral analysis techniques were applied to range vegetation type mapping in the gulf coast marsh. Two species of salt marsh grasses were mapped.

Heath, G. R.↗
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 OSTI2016

A hybrid computational strategy to address WGS variant analysis in >5000 samples

Abstract Background The decreasing costs of sequencing are driving the need for cost effective and real time variant calling of whole genome sequencing data. The scale of these projects are far beyond the capacity of typical computing resources available with most research labs. Other infrastructures like the cloud AWS environment and supercomputers also have limitations due to which large scale joint variant calling becomes infeasible, and infrastructure specific variant calling strategies either fail to scale up to large datasets or abandon joint calling strategies. Results We present a high throughput framework including multiple variant callers for single nucleotide variant (SNV) calling, which leverages hybrid computing infrastructure consisting of cloud AWS, supercomputers and local high performance computing infrastructures. We present a novel binning approach for large scale joint variant calling and imputation which can scale up to over 10,000 samples while producing SNV callsets with high sensitivity and specificity. As a proof of principle, we present results of analysis on Cohorts for Heart And Aging Research in Genomic Epidemiology (CHARGE) WGS freeze 3 dataset in which joint calling, imputation and phasing of over 5300 whole genome samples was produced in under 6 weeks using four state-of-the-art callers. The callers used were SNPTools, GATK-HaplotypeCaller, GATK-UnifiedGenotyper and GotCloud. We used Amazon AWS, a 4000-core in-house cluster at Baylor College of Medicine, IBM power PC Blue BioU at Rice and Rhea at Oak Ridge National Laboratory (ORNL) for the computation. AWS was used for joint calling of 180 TB of BAM files, and ORNL and Rice supercomputers were used for the imputation and phasing step. All other steps were carried out on the local compute cluster. The entire operation used 5.2 million core hours and only transferred a total of 6 TB of data across the platforms. Conclusions Even with increasing sizes of whole genome datasets, ensemble joint calling of SNVs for low coverage data can be accomplished in a scalable, cost effective and fast manner by using heterogeneous computing platforms without compromising on the quality of variants.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1997

Visualization of Unsteady Computational Fluid Dynamics

The current compute environment that most researchers are using for the calculation of 3D unsteady Computational Fluid Dynamic (CFD) results is a super-computer class machine. The Massively Parallel Processors (MPP's) such as the 160 node IBM SP2 at NAS and clusters of workstations acting as a single MPP (like NAS's SGI Power-Challenge array and the J90 cluster) provide the required computation bandwidth for CFD calculations of transient problems. If we follow the traditional computational analysis steps for CFD (and we wish to construct an interactive visualizer) we need to be aware of the following: (1) Disk space requirements. A single snap-shot must contain at least the values (primitive variables) stored at the appropriate locations within the mesh. For most simple 3D Euler solvers that means 5 floating point words. Navier-Stokes solutions with turbulence models may contain 7 state-variables. (2) Disk speed vs. Computational speeds. The time required to read the complete solution of a saved time frame from disk is now longer than the compute time for a set number of iterations from an explicit solver. Depending, on the hardware and solver an iteration of an implicit code may also take less time than reading the solution from disk. If one examines the performance improvements in the last decade or two, it is easy to see that depending on disk performance (vs. CPU improvement) may not be the best method for enhancing interactivity. (3) Cluster and Parallel Machine I/O problems. Disk access time is much worse within current parallel machines and cluster of workstations that are acting in concert to solve a single problem. In this case we are not trying to read the volume of data, but are running the solver and the solver outputs the solution. These traditional network interfaces must be used for the file system. (4) Numerics of particle traces. Most visualization tools can work upon a single snap shot of the data but some visualization tools for transient problems require dealing with time.

Haimes, Robert↗
NASA NTRS2007

Radio Sources toward Galaxy Clusters at 30 GHz

Extragalactic radio sources are a significant contaminant in cosmic microwave background and Sunyaev-Zel'dovich effect experiments. Deep interferometric observations with the BIMA and OVRO arrays are used to characterize the spatial, spectral, and flux distributions of radio sources toward massive galaxy clusters at 28.5 GHz. We compute counts of millijansky source fluxes from 89 fields centered on known massive galaxy clusters and 8 noncluster fields. We find that source counts in the inner regions of the cluster fields (within 0.5' of the cluster center) are a factor of 8.9 (sup +4.3)(sub -2.8) times higher than counts in the outer regions of the cluster fields (radius greater than 0.5'). Counts in the outer regions of the cluster fields are, in turn, a factor of 3.3 (sup +4.1) (sub -1.8) greater than those in the noncluster fields. Counts in the noncluster fields are consistent with extrapolations from the results of other surveys. We compute the spectral indices of millijansky sources in the cluster fields between 1.4 and 28.5 GHz and find a mean spectral index of alpha = 0.66 with an rms dispersion of 0.36, where flux S proportional to nu(sup -alpha). The distribution is skewed, with a median spectral index of 0.72 and 25th and 75th percentiles of 0.51 and 0.92, respectively. This is steeper than the spectral indices of stronger field sources measured by other surveys.

Coble, K.↗
DOE OSTI2020

Connected three-body terms in single-reference unitary many-body theories: Iterative and perturbative approximations

This work introduces various approaches to include connected three-body terms in unitary many-body theories, focusing on the driven similarity renormalization group (DSRG). Starting from the least approximate method—the linearized DSRG truncated to one-, two-, and three-body operators [LDSRG(3)]—we develop several approximate LDSRG(3) models with reduced computational cost. Through a perturbative analysis, we motivate a family of iterative LDSRG(3)-n and -n' (n = 1, 2, 3, 4) methods that contain a subset of the LDSRG(3) diagrams. Among these variants, the LDSRG(3)-2 scheme has the same computational complexity of coupled cluster theory with singles, doubles, and triples (CCSDT), but it outperforms CCSDT in the accuracy of the predicted correlation energies. We also propose and implement two perturbative triples corrections based on the linearized DSRG truncated to one- and two-body operators augmented with recursive semi-quadratic commutators [qDSRG(2)]. Overall, the resulting qDSRG(2)+(T) approach matches the accuracy of the “gold-standard” coupled cluster theory with singles, doubles, and perturbative triples model on the energetics of twenty-eight closed-shell atoms and small molecules.

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

Accurate In Bond Energies

InXn atomization energies are computed for n = 1-3 and X = H, Cl, and CH3. The geometries and frequencies are determined using density functional theory. The atomization energies are computed at the coupled cluster level of theory. The complete basis set limit is obtained by extrapolation. The scalar relativistic effect is computed using the Douglas-Kroll approach. While the heats of formation for InH, InCl and InCl3 are in good agreement with experiment, the current results show that the experimental value for In(CH3)3 must be wrong.

Bauschlicher, Charles W., Jr.↗
DOE OSTI2015

Simulation of circularly polarized luminescence spectra using coupled cluster theory

We report the first computations of circularly polarized luminescence (CPL) rotatory strengths at the equation-of-motion coupled cluster singles and doubles (EOM-CCSD) level of theory. Using a test set of eight chiral ketones, we compare both dipole and rotatory strengths for absorption (electronic circular dichroism) and emission to the results from time-dependent density-functional theory (TD-DFT) and available experimental data for both valence and Rydberg transitions. For two of the compounds, we obtained optimized geometries of the lowest several excited states using both EOM-CCSD and TD-DFT and determined that structures and EOM-CCSD transition properties obtained with each structure were sufficiently similar that TD-DFT optimizations were acceptable for the remaining test cases. Agreement between EOM-CCSD and the Becke three-parameter exchange function and Lee-Yang-Parr correlation functional (B3LYP) corrected using the Coulomb attenuating method (CAM-B3LYP) is typically good for most of the transitions, though agreement with the uncorrected B3LYP functional is significantly worse for all reported properties. The choice of length vs. velocity representation of the electric dipole operator has little impact on the EOM-CCSD transition strengths for nearly all of the states we examined. For a pair of closely related β, γ-enones, (1R)-7-methylenebicyclo[2.2.1]heptan-2-one and (1S)-2-methylenebicyclo[2.2.1]heptan-7-one, we find that EOM-CCSD and CAM-B3LYP agree with the energetic ordering of the two possible excited-state conformations, resulting in good agreement with experimental rotatory strengths in both absorption and emission, whereas B3LYP yields a qualitatively incorrect result for the CPL signal of (1S)-2-methylenebicyclo[2.2.1]heptan-7-one. Finally, we predict that one of the compounds considered here, trans-bicyclo[3.3.0]octane-3,7-dione, is unique in that it exhibits an achiral ground state and a chiral first excited state, leading to a strong CPL signal but a weak circular dichroism signal.

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

A Fast Implementation of the ISOCLUS Algorithm

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

Memarsadeghi, Nargess↗