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 1,801 records · Page 100

Recursive Hierarchical Image Segmentation by Region Growing and Constrained Spectral Clustering

This paper describes an algorithm for hierarchical image segmentation (referred to as HSEG) and its recursive formulation (referred to as RHSEG). The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HS WO) approach to region growing, which seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing. In addition, HSEG optionally interjects between HSWO region growing iterations merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the segmentation results, especially for larger images, it also significantly increases HSEG's computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) has been devised and is described herein. Included in this description is special code that is required to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. Implementations for single processor and for multiple processor computer systems are described. Results with Landsat TM data are included comparing HSEG with classic region growing. Finally, an application to image information mining and knowledge discovery is discussed.

Tilton, James C.↗

High Speed Networking and Large-scale Simulation in Geodynamics

Large-scale numerical simulation has been one of the most important approaches for understanding global geodynamical processes. In this approach, peta-scale floating point operations (pflops) are often required to carry out a single physically-meaningful numerical experiment. For example, to model convective flow in the Earth's core and generation of the geomagnetic field (geodynamo), simulation for one magnetic free-decay time (approximately 15000 years) with a modest resolution of 150 in three spatial dimensions would require approximately 0.2 pflops. If such a numerical model is used to predict geomagnetic secular variation over decades and longer, with e.g. an ensemble Kalman filter assimilation approach, approximately 30 (and perhaps more) independent simulations of similar scales would be needed for one data assimilation analysis. Obviously, such a simulation would require an enormous computing resource that exceeds the capacity of a single facility currently available at our disposal. One solution is to utilize a very fast network (e.g. 10Gb optical networks) and available middleware (e.g. Globus Toolkit) to allocate available but often heterogeneous resources for such large-scale computing efforts. At NASA GSFC, we are experimenting with such an approach by networking several clusters for geomagnetic data assimilation research. We shall present our initial testing results in the meeting.

Kuang, Weijia↗

Research on Spectroscopy, Opacity, and Atmospheres

I propose to continue providing observers with basic data for interpreting spectra from stars, novas, supernovas, clusters, and galaxies. These data will include allowed and forbidden line lists, both laboratory and computed, for the first five to ten ions of all atoms and for all relevant diatomic molecules. I will eventually expand to all ions of the first thirty elements to treat far UV and X-ray spectra, and for envelope opacities. I also include triatomic molecules provided by other researchers. I have also made CDs with Partridge and Schwenke's water data for work on UV stars. The line data also serve as input to my model atmosphere and synthesis programs that generate energy distributions, photometry, limb darkening, and spectra that can be used for planning observations and for fitting observed spectra. The spectrum synthesis programs produce detailed plots with the lines identified. Grids of stellar spectra can be used for radial velocity-, rotation-, or abundance templates and for population synthesis. I am fitting spectra of bright stars to test the data and to produce atlases to guide observers. For each star the whole spectrum is computed from the UV to the far IR. The line data, opacities, models, spectra, and programs are freely distributed on CDs and on my Web site and represent a unique resource for many NASA programs. I am now in full production of new line lists for atoms. I am computing all ions of all elements from H to Zn and the first 5 ions of all the heavier elements, about 800 ions. For each ion I treat as many as 61 even and 61 odd configurations, computing all energy levels and eigenvectors. The Hamiltonian is determined from a scaled-Hartree-Fock starting guess by least squares fitting the observed energy levels. The average energy of each configuration is used in computing scaled-Thomas-Fermi-Dirac wavefunctions for each configuration which in turn are used to compute allowed and forbidden transition integrals. These are multiplied into the LS allowed and forbidden transition arrays. The transition arrays are transformed to the observed coupling to yield the allowed and forbidden line lists. Results are put on the web as they are finished. Provided I get funding,there will be more than 500 million lines. I will then compare ion by ion, to all the laboratory and computed data in the literature and make up a working line list for spectrum synthesis and opacity calculations with the best available data. As the laboratory spectrum analyses are improved, I will redo the calculations with the new energy levels. My original plan when I started the new calculations was to run through all the atoms using my old Cray programs from the 1980's that were limited to 1100 x 1100 arrays in the Hamiltonian for each J. Then I would go back and rerun the more complicated cases with 3000 x 3000 arrays so that I could include many more configurations and more configuration interactions. At present I am limited to 61 even and 61 odd configurations and I try to include everything up through n = 9. The current program runs on Alpha workstations. I decided to test the big program on Fe I and Fe II to see whether there was any great difference in the low configurations compared to those from the Cray program. Besides increasing the number of E1 lines by a factor of 6 to 7.7 million, there was an unexpected result: the electric quadrupole transitions were 10 times stronger than before because the transition integrals are weighted by r(exp 2) ---they become very large for high n, and because there are numerous configuration interactions that mix the low and high configurations. As a check I was able to reproduce Carstang's (1962) lower results by running his three configurations with my program. Since my model atom is still only a subset of a real Fe II ion, the true quadrupole A values are probably larger than mine. The magnetic dipole lines are affected by the mixing but the overall scale does not change. Because of this scovery I decided that there was no point in computing the small array cases. I have been running with as many configurations as I can and with thousands of parameters in the Hamiltonian. The computer runs take much longer to set up and produce than I had expected. I have concentrated on redoing the low iron group spectra, especially to get data for supernova modelers. I have done only Ca I -- Zn I, Ca II -- Zn II, CU I -- Cu XXIX, Zn I - Zn XXX, for practice at high stages of ionization, C I, C II, S I, and CL I and Ag I for people who were working on the laboratory spectra. Check my web site kurucz.harvard.edu for current additions. My latest calculations have been for carbon I and sulphur I, and silicon I is under way using the same elaborate approach as for C I, which took many months to do. These line lists greatly increase the number of lines in the ultraviolet, in the visible, and especially in the infrared. They will increase the opacity in A, F, and G stars. They will account for many unidentified lines in the sun.

Kurucz, Robert L.↗

Onboard Algorithms for Data Prioritization and Summarization of Aerial Imagery

Many current and future NASA missions are capable of collecting enormous amounts of data, of which only a small portion can be transmitted to Earth. Communications are limited due to distance, visibility constraints, and competing mission downlinks. Long missions and high-resolution, multispectral imaging devices easily produce data exceeding the available bandwidth. To address this situation computationally efficient algorithms were developed for analyzing science imagery onboard the spacecraft. These algorithms autonomously cluster the data into classes of similar imagery, enabling selective downlink of representatives of each class, and a map classifying the terrain imaged rather than the full dataset, reducing the volume of the downlinked data. A range of approaches was examined, including k-means clustering using image features based on color, texture, temporal, and spatial arrangement

Chien, Steve A.↗

Localized High-Concentration Electrolytes Get More Localized

Liquid electrolytes in batteries are typically treated as macroscopically homogeneous ionic transport media, despite having complex chemical composition and atomistic solvation structures, thus leaving a knowledge gap of microstructural characteristics. A promising electrolyte system design has recently been developed with the title of a localized high-concentration electrolyte (LHCE). These electrolytes are a summation of three components – a charge-carrying salt, a solvent that solvates the salt, and a diluent that is sparingly interactive with the salt in terms of ion solvation. This creates the perception of a high-concentration electrolyte (HCE) with high anion-cation interactions that supports a salt-derived, stable solid-electrolyte interphase, while an LHCE improves bulk electrolyte properties, such as ionic conductivity and viscosity, when compared to an HCE. Much trial by error design of this LHCE concept has been supported by simulations to confirm ionic interactions, cycling data to confirm cell stability, and post-mortem analysis to provide evidence of mechanisms. However, a systematic design to extend the capabilities of LHCEs is still to be desired. Here, we analyzed a specific LHCE mixture to dictate the best viable mixture that extends the localization of solvation structures while maintaining viable cell-level capabilities. We seek to observe and understand solvent-to-salt interactions that impact electrolyte performance. These interactions range from single-ion solvation, multidentate interactions (i.e., solvation-driven clustering), to more widespread network-level interactions. With the support of both experimental and computational analysis of different electrolyte features, we have begun a methodology of formulating the most ideal LHCE mixtures for improving the cyclability of high-capacity battery chemistries.

25 ENERGY STORAGE↗

Scalable probabilistic estimates of electric vehicle charging given observed driver behavior

To prepare for rapid growth in global electric vehicle adoption, grid and policy planners depend on detailed forecasts of future charging demand. In this paper we propose a novel holistic, scalable, probabilistic framework to produce large-scale estimates of electric vehicle charging load for long-term planning that capture real drivers’ charging patterns. Our framework captures the uncertainty and stochasticity in charging demand by taking a graphical modeling approach. It has three core elements: driver groups, charging segment choices, and charging session time and energy requirements. The framework uses hierarchical clustering to group drivers by their charging histories, capturing their heterogeneous behaviors and preferences across different segments or types of charging. The framework uses probabilistic mixture models for each driver group’s sessions to identify the unique charging behaviors observed within each segment. We illustrate its application with a large data set from California, profiling the charging patterns and unique driver clusters it identifies. Using the model knobs representing drivers’ battery capacities, behavior, and segment access we present scenarios for California’s charging demand in 2030 with 8 million passenger electric vehicles. Peak charging demand ranged from 3.3 to 8.7 GW across scenarios. Furthermore, each was calculated in under 45 s on a laptop computer.

33 ADVANCED PROPULSION SYSTEMS↗

Method for discovering relationships in data by dynamic quantum clustering

Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Method for discovering relationships in data by dynamic quantum clustering

Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Dispersion-enhanced sequential batch sampling for adaptive contour estimation

In computer simulation and optimal design, sequential batch sampling offers an appealing way to iteratively stipulate optimal sampling points based upon existing selections and efficiently construct surrogate modeling. Nonetheless, the issue of near duplicates poses tremendous quandary for sequential learning. It refers to the situation that selected critical points cluster together in each sampling batch, which are individually but not collectively informative towards the optimal design. Near duplicates severely diminish the computational efficiency as they barely contribute extra information towards update of the surrogate. To address this issue, we impose a dispersion criterion on concurrent selection of sampling points, which essentially forces a sparse distribution of critical points in each batch, and demonstrate the effectiveness of this approach in adaptive contour estimation. Specifically, we adopt Gaussian process surrogate to emulate the simulator, acquire variance reduction of the critical region from new sampling points as a dispersion criterion, and combine it with the modified expected improvement (EI) function for critical batch selection. The critical region here is the proximity of the contour of interest. This proposed approach is vindicated in numerical examples of a two-dimensional four-branch function, a four-dimensional function with a disjoint contour of interest and a time-delay dynamic system.

97 MATHEMATICS AND COMPUTING↗

Sequential geophysical and flow inversion to characterize fracture networks in subsurface systems

Subsurface applications, including geothermal, geological carbon sequestration, and oil and gas, typically involve maximizing either the extraction of energy or the storage of fluids. Fractures form the main pathways for flow in these systems, and locating these fractures is critical for predicting flow. However, fracture characterization is a highly uncertain process, and data from multiple sources, such as flow and geophysical are needed to reduce this uncertainty. We present a nonintrusive, sequential inversion framework for integrating data from geophysical and flow sources to constrain fracture networks in the subsurface. In this framework, we first estimate bounds on the statistics for the fracture orientations using microseismic data. These bounds are estimated through a combination of a focal mechanism (physics-based approach) and clustering analysis (statistical approach) of seismic data. Then, the fracture lengths are constrained using flow data. In conclusion, the efficacy of this inversion is demonstrated through a representative example.

97 MATHEMATICS AND COMPUTING↗

Local Embedding and Effective Downfolding in the Auxiliary-Field Quantum Monte Carlo Method

A local embedding and effective downfolding scheme has been developed and implemented in the auxiliary-field quantum Monte Carlo (AFQMC) method. A local cluster in which electrons are fully correlated is defined, and the frozen orbital method is used on the remainder of the system to construct an effective Hamiltonian, which operates within the local cluster. Local embedding, which involves only the occupied sector, has previously been employed in the context of Co/graphene. Here, the methodology is extended in order to allow for effective downfolding of the virtual sector, thus allowing for significant reduction in the computational effort required for AFQMC calculations. The system size, which can be feasibly treated with AFQMC, is therefore greatly extended as only a single local cluster is explicitly correlated at the AFQMC level of theory. The approximation is controlled by the separate choice of the spatial size of the active occupied region (Ro) and of the active virtual region (Rv). In conclusion, the systematic dependence of the AFQMC energy on Ro and Rv is investigated, and it is found that relative AFQMC energies of physical and chemical interest converge rapidly to the full AFQMC treatment (i.e., using no embedding or downfolding).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The matryoshka run: A Eulerian refinement strategy to study the statistics of turbulence in virialized cosmic structures

We study the statistical properties of turbulence driven by structure formation in a massive merging galaxy cluster at redshift z = 0. The development of turbulence is ensured as the largest eddy turnover time is much shorter than the Hubble time independent of mass and redshift. We achieve a large dynamic range of spatial scales through a novel Eulerian refinement strategy where the cluster volume is refined with progressively finer uniform nested grids during gravitational collapse. This provides an unprecedented resolution of 7.3 h {sup –1} kpc across the virial volume. The probability density functions of various velocity-derived quantities exhibit the features characteristic of fully developed compressible turbulence observed in dedicated periodic-box simulations. Shocks generate only 60% of the total vorticity within the R {sub vir}/3 region and 40% beyond that. We compute second- and third-order longitudinal and transverse structure functions for both solenoidal and compressional components in the cluster core, virial region, and beyond. The structure functions exhibit a well-defined inertial range of turbulent cascade. The injection scale is comparable to the virial radius but increases toward the outskirts. Within R {sub vir}/3, the spectral slope of the solenoidal component is close to Kolmogorov's, but for the compressional component is substantially steeper and close to Burgers's; the flow is mostly solenoidal and statistically rigorously, which is consistent with fully developed homogeneous and isotropic turbulence. Small-scale anisotropy appears due to numerical artifact. Toward the virial region, the flow becomes increasingly compressional, the structure functions become flatter, and modest genuine anisotropy appear particularly close to the injection scale. In comparison, mesh adaptivity based on Lagrangian refinement and the same finest resolution leads to a lack of turbulent power on a small scales, an excess thereof on large scales, and unreliable density-weighted structure functions.

79 ASTRONOMY AND ASTROPHYSICS↗

Arrested-motility states in populations of shape-anisotropic active Janus particles

The emergence of large-scale collective phenomena from simple interactions between individual units is a hallmark of active matter systems. Active colloids with alignment-dominated interparticle interactions tend to develop orientational order and form motile coherent states, such as flocks and swarms. Alternatively, a combination of self-propulsion and excluded-volume interactions results in self-trapping and active phase separation into dense clusters. Here, we reveal unconventional arrested-motility states in ensembles of active discoidal particles powered by induced-charge electrophoresis. Combining experiments and computational modeling, we demonstrate that the shape asymmetry of the particles promotes the hydrodynamically assisted formation of active particles’ bound states in a certain range of excitation parameters, ultimately leading to a spontaneous collective state with arrested motility. Unlike the jammed clusters obtained through self-trapping, the arrested-motility phase remains sparse, dynamic, and reconfigurable. The demonstrated mechanism of phase separation seeded by bound state formation in ensembles of oblate active particles is generic and should be applicable to other active colloidal systems.

42 ENGINEERING↗

Qualitative mechanism models and the rationalization of procedures

A qualitative, cluster-based approach to the representation of hydraulic systems is described and its potential for generating and explaining procedures is demonstrated. Many ideas are formalized and implemented as part of an interactive, computer-based system. The system allows for designing, displaying, and reasoning about hydraulic systems. The interactive system has an interface consisting of three windows: a design/control window, a cluster window, and a diagnosis/plan window. A qualitative mechanism model for the ORS (Orbital Refueling System) is presented to coordinate with ongoing research on this system being conducted at NASA Ames Research Center.

Farley, Arthur M.↗

Highly active Au/δ-MoC and Au/β-Mo 2 C catalysts for the low-temperature water gas shift reaction: effects of the carbide metal/carbon ratio on the catalyst performance

In this paper, the water gas shift (WGS) reaction catalyzed by orthorhombic β-Mo 2 C and cubic δ-MoC surfaces with and without Au clusters supported thereon has been studied by means of a combination of sophisticated experiments and state-of-the-art computational modeling. Experiments evidence the importance of the metal/carbon ratio on the performance of these systems, where Au/δ-MoC is presented as a suitable catalyst for WGS at low temperatures owing to its high activity, selectivity (only CO 2 and H 2 are detected), and stability (oxycarbides are not observed). Periodic density functional theory-based calculations show that the supported Au clusters and the Au/δ-MoC interface do not take part directly in water dissociation but their presence is crucial to switch the reaction mechanism, drastically decreasing the effect of the reverse WGS reaction and favoring the WGS products desorption, thus leading to an increase in CO 2 and H 2 production. Finally, the present results clearly display the importance of the Mo/C ratio and the synergy with the admetal clusters in tuning the activity and selectivity of the carbide substrate.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computational Nuclear Physics and Post Hartree-Fock Methods

We present a computational approach to infinite nuclear matter employing Hartree-Fock theory, many-body perturbation theory and coupled cluster theory. These lectures are closely linked with those of chapters 9, 10 and 11 and serve as input for the correlation functions employed in Monte Carlo calculations in chapter 9, the in-medium similarity renormalization group theory of dense fermionic systems of chapter 10 and the Green's function approach in chapter 11. We provide extensive code examples and benchmark calculations, allowing thereby an eventual reader to start writing her/his own codes. We start with an object-oriented serial code and end with discussions on strategies for porting the code to present and planned high-performance computing facilities.

Lietz, Justin↗

A Novel Vertex Affinity for Community Detection

We propose a novel vertex affinity measure in this paper. The new vertex affinity quantifies the proximity between two vertices in terms of their clustering strength and is ideal for such graph analytics applications as community detection. We also developed a framework that combines simple graph searches and resistance circuit formulas to compute the vertex affinity efficiently. We study the properties of the new affinity measure empirically in comparison to those of other popular vertex proximity metrics. Our results show that the existing metrics are ill-suited for community detection due to their lack of fundamental properties that are essential for correctly capturing inter- and intra-cluster vertex proximity.

97 MATHEMATICS AND COMPUTING↗

Force-Free Identification of Minimum-Energy Pathways and Transition States for Stochastic Electronic Structure Theories

Here, the accurate mapping of potential energy surfaces (PESs) is crucial to our understanding of the numerous physical and chemical processes mediated by atomic rearrangements, such as conformational changes and chemical reactions, and the thermodynamic and kinetic feasibility of these processes. Stochastic electronic structure theories, e.g., Quantum Monte Carlo (QMC) methods, enable highly accurate total energy calculations that in principle can be used to construct the PES. However, their stochastic nature poses a challenge to the computation and use of forces and Hessians, which are typically required in algorithms for minimum-energy pathway (MEP) and transition state (TS) identification, such as the nudged elastic band (NEB) algorithm and its climbing image formulation. Here, we present strategies that utilize the surrogate Hessian line-search method, previously developed for QMC structural optimization, to efficiently identify MEP and TS structures without requiring force calculations at the level of the stochastic electronic structure theory. By modifying the surrogate Hessian algorithm to operate in path-orthogonal subspaces and at saddle points, we show that it is possible to identify MEPs and TSs by using a force-free QMC approach. We demonstrate these strategies via two examples, the inversion of the ammonia (NH 3 ) molecule and the nucleophilic substitution (S N 2) reaction F – + CH 3 F → FCH 3 + F – . We validate our results using Density Functional Theory (DFT)- and Coupled Cluster (CCSD, CCSD(T))-based NEB calculations. We then introduce a hybrid DFT-QMC approach to compute thermodynamic and kinetic quantities, free energy differences, rate constants, and equilibrium constants that incorporates stochastically optimized structures and their energies, and show that this scheme improves upon DFT accuracy. Our methods generalize straightforwardly to other systems and other high-accuracy theories that similarly face challenges computing energy gradients, paving the way for highly accurate PES mapping, transition state determination, and thermodynamic and kinetic calculations at significantly reduced computational expense.

Iyer, Gopal R.↗

Refine your search to explore more results.