SEARCH · Engineering Papers

Results for “cluster computer”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 973 records · Page 54

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Significant DBSCAN+: Statistically Robust Density-based Clustering

Cluster detection is important and widely used in a variety of applications, including public health, public safety, transportation, and so on. Given a collection of data points, we aim to detect density-connected spatial clusters with varying geometric shapes and densities, under the constraint that the clusters are statistically significant. The problem is challenging, because many societal applications and domain science studies have low tolerance for spurious results, and clusters may have arbitrary shapes and varying densities. As a classical topic in data mining and learning, a myriad of techniques have been developed to detect clusters with both varying shapes and densities (e.g., density-based, hierarchical, spectral, or deep clustering methods). However, the vast majority of these techniques do not consider statistical rigor and are susceptible to detecting spurious clusters formed as a result of natural randomness. On the other hand, scan statistic approaches explicitly control the rate of spurious results, but they typically assume a single “hotspot” of over-density and many rely on further assumptions such as a tessellated input space. To unite the strengths of both lines of work, we propose a statistically robust formulation of a multi-scale DBSCAN, namely Significant DBSCAN+, to identify significant clusters that are density connected. As we will show, incorporation of statistical rigor is a powerful mechanism that allows the new Significant DBSCAN+ to outperform state-of-the-art clustering techniques in various scenarios. We also propose computational enhancements to speed-up the proposed approach. Experiment results show that Significant DBSCAN+ can simultaneously improve the success rate of true cluster detection (e.g., 10–20% increases in absolute F1 scores) and substantially reduce the rate of spurious results (e.g., from thousands/hundreds of spurious detections to none or just a few across 100 datasets), and the acceleration methods can improve the efficiency for both clustered and non-clustered data.

Computer Science↗

DOE OSTI2022

Guanosine Dianions Hydrated by One to Four Water Molecules

Intermolecular interactions as those present in molecule…water complexes may profoundly influence the physico-chemical properties of molecules. Here, we carried out an experimentally-computational study on the doubly-deprotonated guanosine monophosphate…water clusters, [dGMP-2H] 2- •nH 2 O (n=1–4), using a combination of negative anion photoelectron spectroscopy (NIPES) with molecular dynamics (MD) and quantum chemical (QM) calculations. Successive addition of water molecules to [dGMP-2H] 2- increases the experimental adiabatic detachment (ADE) and vertical detachment energy (VDE) by 0.5 to 0.1 eV, depending on the cluster size. In order to choose the representative conformations, we combined MD simulations with a clustering procedure to identify low energy geometries for which ADEs and VDEs were computed at the CAM-B3LYP/6-31++G(d,p) level. Our results demonstrate that the assumed approach lead to the sound geometries and energetics of the studied micro-solvates since the calculated ADEs and VDEs are in pretty good agreement with the experimental characteristics. The evolution of hydrogen bonding with cluster size indicates possibility of the occurrence of proton transfer for clusters comprising a larger number of water molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2013

Coherent Image Layout using an Adaptive Visual Vocabulary

When querying a huge image database containing millions of images, the result of the query may still contain many thousands of images that need to be presented to the user. We consider the problem of arranging such a large set of images into a visually coherent layout, one that places similar images next to each other. Image similarity is determined using a bag-of-features model, and the layout is constructed from a hierarchical clustering of the image set by mapping an in-order traversal of the hierarchy tree into a space-filling curve. This layout method provides strong locality guarantees so we are able to quantitatively evaluate performance using standard image retrieval benchmarks. Performance of the bag-of-features method is best when the vocabulary is learned on the image set being clustered. Because learning a large, discriminative vocabulary is a computationally demanding task, we present a novel method for efficiently adapting a generic visual vocabulary to a particular dataset. We evaluate our clustering and vocabulary adaptation methods on a variety of image datasets and show that adapting a generic vocabulary to a particular set of images improves performance on both hierarchical clustering and image retrieval tasks.

Multimedia Analytics, image clustering, content ba↗

NASA NTRS1983

An enhanced version of an implicit code for the Euler equations

A two-dimensional implicit finite-difference code is applied to the inviscid Euler equations to compute transonic flow past airfoils in order to provide well-documented standard test cases for the general user community. The code is an improved version of Steger's 1976 implicit code. Enhancements include the use of up-wind differencing in supersonic regions before shocks and a variable time step to accelerate convergence. An airfoil grid generation routine based on algebraic techniques is employed. The grids are clustered near shocks to improve resolution. Computed results are compared with other numerical results from the literature.

Pulliam, T. H.↗

DOE OSTI2024

Tensor Hypercontraction of Cluster Perturbation Theory: Quartic Scaling Perturbation Series for the Coupled Cluster Singles and Doubles Ground-State Energies

Even though Cluster Perturbation has been shown to be a robust non-iterative alternative to Coupled Cluster Theory, it is still plagued by high order polynomial computational scaling and the storage of higher order tensors. Here we present a proof-of-concept strategy for implementing Cluster Perturbation Theory ground state energy series for the coupled cluster singles and doubles energy with N 4 computational scaling using Tensor Hypercontraction (THC). The reduction in computational scaling by two orders is achieved by decomposing two electron repulsion integrals, doubles amplitudes and multipliers, as well as selected doubles intermediates to Tensor Hypercontraction format. Using the outlined strategy, we showcase that the Tensor Hypercontraction pilot implementations retain numerical accuracy to within 1 kcal/mol relative to corresponding conventional and density fitting implementations and we empirically verify the N 4 scaling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1992

On the performance of large Gaussian basis sets for the computation of total atomization energies

The total atomization energies of a number of molecules have been computed using an augmented coupled-cluster method and (5s4p3d2f1g) and 4s3p2d1f) atomic natural orbital (ANO) basis sets, as well as the correlation consistent valence triple zeta plus polarization (cc-pVTZ) correlation consistent valence quadrupole zeta plus polarization (cc-pVQZ) basis sets. The performance of ANO and correlation consistent basis sets is comparable throughout, although the latter can result in significant CPU time savings. Whereas the inclusion of g functions has significant effects on the computed Sigma D(e) values, chemical accuracy is still not reached for molecules involving multiple bonds. A Gaussian-1 (G) type correction lowers the error, but not much beyond the accuracy of the G1 model itself. Using separate corrections for sigma bonds, pi bonds, and valence pairs brings down the mean absolute error to less than 1 kcal/mol for the spdf basis sets, and about 0.5 kcal/mol for the spdfg basis sets. Some conclusions on the success of the Gaussian-1 and Gaussian-2 models are drawn.

Martin, J. M. L.↗

DOE OSTI2014

Structure and Stability of Lithium Superoxide Clusters and Relevance to LiO2 Batteries

The discharge mechanism of a Li-O-2 battery involves lithium superoxide (LiO2) radicals. In this Letter, we have performed high-level quantum chemical calculations (G4MP2) to investigate the structure and stability of LiO2 clusters. The clusters have planar ring-shaped structures, high spins, and are thermodynamically more stable than LiO2 dimer. The computed energy barrier for disproportionation of the larger clusters is also significantly higher than the corresponding barrier in the LiO2 dimer (1.0 eV vs 0.5 eV). This means that disproportionation rate should be much slower if the reaction involves LiO2 clusters other than the dimer. As a result, the clusters may survive long enough to be incorporated into the growing discharge product. These results are discussed in terms of recent experimental studies of the electronic structure and morphology of the discharge products in Li-air batteries.

Das, Ujjal↗

NASA NTRS1993

Distributed computing feasibility in a non-dedicated homogeneous distributed system

The low cost and availability of clusters of workstations have lead researchers to re-explore distributed computing using independent workstations. This approach may provide better cost/performance than tightly coupled multiprocessors. In practice, this approach often utilizes wasted cycles to run parallel jobs. The feasibility of such a non-dedicated parallel processing environment assuming workstation processes have preemptive priority over parallel tasks is addressed. An analytical model is developed to predict parallel job response times. Our model provides insight into how significantly workstation owner interference degrades parallel program performance. A new term task ratio, which relates the parallel task demand to the mean service demand of nonparallel workstation processes, is introduced. It was proposed that task ratio is a useful metric for determining how large the demand of a parallel applications must be in order to make efficient use of a non-dedicated distributed system.

Leutenegger, Scott T.↗

NASA NTRS1998

Approximation Of Multi-Valued Inverse Functions Using Clustering And Sugeno Fuzzy Inference

Finding the inverse of a continuous function can be challenging and computationally expensive when the inverse function is multi-valued. Difficulties may be compounded when the function itself is difficult to evaluate. We show that we can use fuzzy-logic approximators such as Sugeno inference systems to compute the inverse on-line. To do so, a fuzzy clustering algorithm can be used in conjunction with a discriminating function to split the function data into branches for the different values of the forward function. These data sets are then fed into a recursive least-squares learning algorithm that finds the proper coefficients of the Sugeno approximators; each Sugeno approximator finds one value of the inverse function. Discussions about the accuracy of the approximation will be included.

Walden, Maria A.↗

DOE OSTI2026

Cohort organized learning: clustering through agreement

In this article we describe cohort organized learning (CoOL), a method for clustering data without explicit distance or similarity computations. Herein, we will describe CoOL, derive the gradients determined by expectation maximization to train the networks, show how to monitor convergence during training and evaluate the clusters after training, and discuss a series of examples and use cases. We also discuss CoOL’s limitations and future prospects on related tasks. Because CoOL uses neural networks to estimate the clusters, it can be used to cluster any data that can be made compatible and we illustrate this on vector data and images.

clustering↗

DOE OSTI2012

NVMalloc: Exposing an Aggregate SSD Store as a Memory Partition in Extreme-Scale Machines

DRAM is a precious resource in extreme-scale machines and is increasingly becoming scarce, mainly due to the growing number of cores per node. On future multi-petaflop and exaflop machines, the memory pressure is likely to be so severe that we need to rethink our memory usage models. Fortunately, the advent of non-volatile memory (NVM) offers a unique opportunity in this space. Current NVM offerings possess several desirable properties, such as low cost and power efficiency, but suffer from high latency and lifetime issues. We need rich techniques to be able to use them alongside DRAM. In this paper, we propose a novel approach for exploiting NVM as a secondary memory partition so that applications can explicitly allocate and manipulate memory regions therein. More specifically, we propose an NVMalloc library with a suite of services that enables applications to access a distributed NVM storage system. We have devised ways within NVMalloc so that the storage system, built from compute node-local NVM devices, can be accessed in a byte-addressable fashion using the memory mapped I/O interface. Our approach has the potential to re-energize out-of-core computations on large-scale machines by having applications allocate certain variables through NVMalloc, thereby increasing the overall memory capacity available. Our evaluation on a 128-core cluster shows that NVMalloc enables applications to compute problem sizes larger than the physical memory in a cost-effective manner. It can bring more performance/efficiency gain with increased computation time between NVM memory accesses or increased data access locality. In addition, our results suggest that while NVMalloc enables transparent access to NVM-resident variables, the explicit control it provides is crucial to optimize application performance.

Computer Science↗

DOE OSTI2025

On the functional dependence of transition-potential coupled cluster

Orbital relaxation of the core region is a primary source of error in the computation of core ionization and core excitation energies. Recently, Transition-Potential Coupled Cluster (TP-CC) methods have been used to explicitly treat orbital relaxation using non-variational molecular orbitals determined by reoccupation of orbitals optimized for a fractional core occupation. The amount of fractional occupation is governed by parameter λ, and recommended values for accurate TP-CCSD and XTP-CCSD computations of carbon, nitrogen, oxygen, and fluorine K edges were previously determined. Herein, we explore the performance of several density functionals for generating the fractionally occupied orbitals used in TP-CCSD. These functionals include HF, BP86, BH&HLYP, B3LYP, M06-2X, and ωB97m-V. The fractionally occupied orbitals computed across the various functionals were subsequently employed as the initial orbitals for our TP-CCSD calculations of organic K-edge x-ray absorption and photoelectron spectra. Regardless of the functional used to generate the fractionally occupied orbitals, the TP-CCSD calculations yield accurate and comparable core ionization energies, core excitation energies, and oscillator strengths.

Coupled-cluster methods↗

DOE OSTI2026

Stochastic GW -GPU: Rapid Quasi-Particle Energies for Molecules beyond 10,000 Atoms

StochasticGW is a code for computing accurate quasi-particle (QP) energies of molecules and material systems in the GW approximation. StochasticGW utilizes the stochastic Resolution of the Identity (sROI) technique to enable a massively parallel implementation with computational costs that scale semilinearly with system size, allowing the method to access systems with tens of thousands of electrons. Here, we introduce a new implementation, StochasticGW-GPU, for which the main bottleneck steps have been ported to GPUs and give substantial performance improvements over previous versions of the code. We showcase the new code by computing band gaps of hydrogenated silicon clusters (Si x H y ) containing up to 10,001 atoms and 35,144 electrons, and we obtain individual QP energies with a statistical precision of better than ±0.03 eV with times-to-solution of less than 1 h.

Thomas, Phillip S. [Lawrence Berkeley National Lab↗

DOE OSTI2021

Accelerated, scalable and reproducible AI-driven gravitational wave detection

The development of reusable artificial intelligence (AI) models for wider use and rigorous validation by the community promises to unlock new opportunities in multi-messenger astrophysics. Here we develop a workflow that connects the Data and Learning Hub for Science, a repository for publishing AI models, with the Hardware-Accelerated Learning (HAL) cluster, using funcX as a universal distributed computing service. Using this workflow, an ensemble of four openly available AI models can be run on HAL to process an entire month's worth (August 2017) of advanced Laser Interferometer Gravitational-Wave Observatory data in just seven minutes, identifying all four binary black hole mergers previously identified in this dataset and reporting no misclassifications. This approach combines advances in AI, distributed computing and scientific data infrastructure to open new pathways to conduct reproducible, accelerated, data-driven discovery. By combining a repository for artificial intelligence models and a supercomputing cluster, an entire month's worth of advanced LIGO data is analysed in just 7 min, finding all binary black hole mergers previously identified in this dataset and reporting no misclassifications.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1973

Unsupervised spatial clustering with spectral discrimination

The development of a computer program is reported for extracting features from remotely sensed data presented in digital image form. This computer program requires no human supervision or prejudgment and operates unassisted on the raw digital data. A condensed general background is included on remote sensing of earth features and a short synopsis on some of the most commonly used types of feature extraction techniques. Results obtained from the unsupervised feature extraction computer program along with a description and listing of the computer program are presented.

Jayroe, R. R., Jr.↗

DOE OSTI2015

A Brief Summary on Formalizing Parallel Tensor Distributions, Redistributions, and Algorithm Derivations

Large-scale datasets in computational chemistry typically require distributed-memory parallel methods to perform a special operation known as tensor contraction. Tensors are multidimensional arrays, and a tensor contraction is akin to matrix multiplication with special types of permutations. Creating an efficient algorithm and optimized implementation in this domain is complex, tedious, and error-prone. To address this, we develop a notation to express data distributions so that we can apply use automated methods to find optimized implementations for tensor contractions. We consider the spin-adapted coupled cluster singles and doubles method from computational chemistry and use our methodology to produce an efficient implementation. Experiments per- formed on the IBM Blue Gene/Q and Cray XC30 demonstrate impact both improved performance and reduced memory consumption.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1993

An X-ray method for detecting substructure in galaxy clusters - Application to Perseus, A2256, Centaurus, Coma, and Sersic 40/6

We use the moments of the X-ray surface brightness distribution to constrain the dynamical state of a galaxy cluster. Using X-ray observations from the Einstein Observatory IPC, we measure the first moment FM, the ellipsoidal orientation angle, and the axial ratio at a sequence of radii in the cluster. We argue that a significant variation in the image centroid FM as a function of radius is evidence for a nonequilibrium feature in the intracluster medium (ICM) density distribution. In simple terms, centroid shifts indicate that the center of mass of the ICM varies with radius. This variation is a tracer of continuing dynamical evolution. For each cluster, we evaluate the significance of variations in the centroid of the IPC image by computing the same statistics on an ensemble of simulated cluster images. In producing these simulated images we include X-ray point source emission, telescope vignetting, Poisson noise, and characteristics of the IPC. Application of this new method to five Abell clusters reveals that the core of each one has significant substructure. In addition, we find significant variations in the orientation angle and the axial ratio for several of the clusters.

Mohr, Joseph J.↗

DOE OSTI2021

Analytic evaluation of energy first derivatives for spin–orbit coupled-cluster singles and doubles augmented with noniterative triples method: General formulation and an implementation for first-order properties

The paper reports a formulation of analytic energy first derivatives for the coupled-cluster singles and doubles augmented with noniterative triples [CCSD(T)] method with spin–orbit coupling included at the orbital level and an implementation for evaluation of first-order properties. Here, the new development extends the applicability of relativistic coupled cluster methods for heavy-element chemistry and spectroscopy. Benchmark calculations of first-order properties including dipole moments and electric-field gradients using the corresponding exact two-component property integrals are presented for heavy-element containing molecules to demonstrate the usefulness of the present analytic scheme.

97 MATHEMATICS AND COMPUTING↗