SEARCH · Search NASA
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.
Comparisons of various recently developed open-shell RHF perturbation theories will be presented. Among the aspects considered are spin-contamination, computational cost, and quality of numerical results. In addition, a new approach to avoid the disk storage and I/O bottlenecks in large scale coupled-cluster calculations will be discussed.
Irradiation creep and irradiation swelling are two of the lifetime limiting factors for structural materials in nuclear reactors. These mechanical effects are driven by irradiation defect evolution and the interaction of those defects with dislocations in the microstructure. We present here a coupled cluster dynamics – crystal plasticity approach to model irradiation swelling and creep behavior in 316 SS. The time-dependent evolution of irradiation defects is calculated with a cluster dynamics approach and passed to the crystal plasticity model to compute the dislocation evolution. We show the impact of the irradiation defect evolution on the stress state in the material, which drives inelastic deformation through dislocation motion. The inelastic deformation in the 316 SS is dependent on the dose rate, where the inelastic deformation driven by the early-stage irradiation defect evolution determines the mechanical behavior of the 316 SS.
As a first step toward the rational design of Co-based catalysts with a higher activity and selectivity, we determine how one can activate a C-O bond at the interface between a metal oxide cluster and a Co(0001) support. The hypothesis here is that the metal ions in metal oxide clusters on a Co(0001) support enhance the adsorption of CO and weaken the C-O bond strength, which can then facilitate the dissociation of the CO reactant. To test this hypothesis, we developed three computational models of Ti4O8/Co(0001), Zr4O8/Co(0001), and Mn8O8/Co(0001). We quantify the CO adsorption behavior at the interface sites between an oxide cluster and the Co(0001) support as well as the corresponding IR spectra. We correlate the computed CO stretch frequencies with their CO adsorption energies, as well as the CO stretch frequency with the C-O bond length, and related these findings to the changes in the chemical bonding in the bound CO. The interface is the most favorable site for CO adsorption. Adsorption results in an increase of the C-O bond length and a decrease in its vibrational frequency. From a chemical bonding analysis, the bond order in CO at this site drops from 3 (in the gas phase) to 1. This decrease in bond order is a necessary precursor stage for CO dissociation. The experimental measurements of the corresponding FTIR spectra support this point. The favorability of CO adsorption at the interface sites is due to an electron transfer from the metal ion in the metal oxide cluster to the O atom in CO. We establish a linear relationship between C-O bond length and CO frequency and this relationship is found to be independent of the support, type of metal oxide cluster, or the adsorption site.
A new numerical model of isothermal and non-isothermal first order phase transformations, such as the crystallization of liquids and glasses, is presented. This model computes directly the volume fraction transformed, taking into account time-dependent nucleation rates and cluster-size-dependent growth velocities. The model is applied to the crystallization of lithium disilicate glass, using the appropriate kinetic and thermodynamic parameters. The model is used (1) to determine the validity of common methods for computing the volume fraction transformed as a function of time in isothermal experiments when a time-dependent nucleation rate is expected, (2) to simulate non-isothermal differential scanning calorimetry (DSC) studies of glass devitrification as a function of scan rate, and (3) to compute the effect of preannealing on the DSC peak parameters. A novel behavior of the nucleation rate with scan rate is predicted, arising because the relaxation of the cluster distribution cannot be described by a single relaxation time. Comparisons of the calculations with experimental data on this glass demonstrate the validity of the model.
Magnetic contributions have the potential to significantly influence predicted phase stability within alloy and mineral mixing phase diagrams, yet have been historically challenging to incorporate due to a significant increase to phase space sampling. Here, in this work, we employ a computational protocol that includes spin orientation as an additional configurational component within multi-component cluster expansions between magnetic and non-magnetic metal oxide alloys [calculated using density functional theory (DFT) and the generalized gradient approximation]. This approach was used to determine the effect of magnetic contributions to corundum-eskolaite and corundum-hematite phase equilibria from first principles. Two-component cluster expansions of the magnetic components of eskolaite and hematite were first performed showing the ability of this method to properly calculate their respective magnetic properties. Two-component cluster expansions were then performed for non-magnetic Al(III) and ferromagnetic Cr(III) and Fe(III), and phase diagrams were calculated for later comparison. Finally, a non-magnetic Al(III) and “up” and “down” magnetic configurations for anti-ferromagnetic Cr(III) and Fe(III) were performed. Magnetic contributions to the calculated phase diagram for the corundumeskolaite system were shown to be inconsequential but are vital for accurate determination of the corundum-hematite solvus.
In 2005, Britto, Cachazo, Feng, and Witten gave a recurrence (now known as the BCFW recurrence) for computing scattering amplitudes in N = 4 super Yang–Mills theory. Arkani-Hamed and Trnka subsequently introduced the amplituhedron to give a geometric interpretation of the BCFW recurrence. Arkani-Hamed and Trnka conjectured that each way of iterating the BCFW recurrence gives a “triangulation” or “tiling” of the m=4 amplituhedron. In this article, we prove the BCFW tiling conjecture of Arkani-Hamed and Trnka. We also prove the cluster adjacency conjecture for BCFW tiles of the amplituhedron, which says that facets of tiles are cut out by collections of compatible cluster variables for the Grassmannian Gr4,n. Moreover we show that each BCFW tile is the subset of the Grassmannian where certain cluster variables have particular signs.
The CMS experiment at CERN employs a distributed computing infrastructure to satisfy its data processing and simulation needs. The CMS Submission Infrastructure team manages a dynamic HTCondor pool, aggregating mainly Grid clusters worldwide, but also HPC, Cloud and opportunistic resources. This CMS Global Pool, which currently involves over 70 computing sites worldwide and peaks at 350k CPU cores, is employed to successfully manage the simultaneous execution of up to 150k tasks. While the present infrastructure is sufficient to harness the current computing power scales, CMS latest estimates predict a noticeable expansion in the amount of CPU that will be required in order to cope with the massive data increase of the High-Luminosity LHC (HL-LHC) era, planned to start in 2027. This contribution presents the latest results of the CMS Submission Infrastructure team in exploring and expanding the scalability reach of our Global Pool, in order to preventively detect and overcome any barriers in relation to the HL-LHC goals, while maintaining high effciency in our workload scheduling and resource utilization.
The degrees of freedom that confer to strongly correlated systems their many intriguing properties also render them fairly intractable through typical perturbative treatments. For this reason, the mechanisms responsible for their technologically promising properties remain mostly elusive. Computational approaches have played a major role in efforts to fill this void. In particular, dynamical mean field theory and its cluster extension, the dynamical cluster approximation have allowed significant progress. However, despite all the insightful results of these embedding schemes, computational constraints, such as the minus sign problem in quantum Monte Carlo (QMC), and the exponential growth of the Hilbert space in exact diagonalization (ED) methods, still limit the length scale within which correlations can be treated exactly in the formalism. A recent advance aiming to overcome these difficulties is the development of multiscale many body approaches whereby this challenge is addressed by introducing an intermediate length scale between the short length scale where correlations are treated exactly using a cluster solver such QMC or ED, and the long length scale where correlations are treated in a mean field manner. At this intermediate length scale correlations can be treated perturbatively. This is the essence of multiscale many-body methods. Furthermore, we will review various implementations of these multiscale many-body approaches, the results they have produced, and the outstanding challenges that should be addressed for further advances.
Apache Spark is explored as a tool for analyzing large data sets from the magnetic fusion simulation code XGCI. Implementation details of Apache Spark on the NERSC Edison supercomputer are discussed, including binary file reading, and parameter setup. Here, an unsupervised machine learning algorithm, k-means clustering, is applied to XGCI particle distribution function data, showing that highly turbulent spatial regions do not have common coherent structures, but rather broad, ring-like structures in velocity space.
A new grid of standard (i.e., solar CNO/Fe, no core rotation, and including semiconvection) horizontal-branch evolutionary sequences are presented which extend the grid of Sweigart both by including the final phase of core helium exhaustion and by using a finer grid of compositions. These sequences were constructed specifically for the studies of the Sandage period-shift effect and the second parameter phenomenon among the Galactic globular clusters. The numerical results for the observable characteristics of the sequences are tabulated which can be directly used to synthesize the observed horizontal-branch distributions. The present computations suggest that the observed difference in period change of RR Lyrae stars in the globular clusters M3 and M15 could be attributed, at least in the mean, to stellar evolution.
A first European Conference on Computational Nanotoxicology, CompNanoTox, was held in November 2015 in Benahavís, Spain with the objectives to disseminate and integrate results from the European modeling and database projects (NanoPUZZLES, ModENPTox, PreNanoTox, MembraneNanoPart, MODERN, eNanoMapper and EU COST TD1204 MODENA) as well as to create synergies within the European NanoSafety Cluster. This conference was supported by the COST Action TD1204 MODENA on developing computational methods for toxicological risk assessment of engineered nanoparticles and provided a unique opportunity for crossfertilization among complementary disciplines. The efforts to develop and validate computational models crucially depend on high quality experimental data and relevant assays which will be the basis to identify relevant descriptors. The ambitious overarching goal of this conference was to promote predictive nanotoxicology, which can only be achieved by a close collaboration between the computational scientists (e.g. database experts, modeling experts for structure, (eco) toxicological effects, performance and interaction of nanomaterials) and experimentalists from different areas (in particular toxicologists, biologists, chemists and material scientists, among others). The main outcome and new perspectives of this conference are summarized here.
Abstract A high‐performance implementation of the coupled‐cluster singles, doubles, and perturbative triples [CCSD(T)] is developed in the Massively Parallel Quantum Chemistry program. Novel features include: (1) reduced memory requirements via a density‐fitting (DF) CCSD implementation utilizing distributed lazy evaluation for tensors with more than two unoccupied indices and (2) the ability to utilize efficiently many‐core nodes (Intel Xeon Phi) and heterogeneous nodes with multiple NVIDIA GPUs on each node. All data that are greater than quadratic in the system size are distributed among processes. Excellent strong scaling is observed on distributed‐memory computers equipped with conventional CPUs, Intel Xeon Phi processors, and heterogeneous nodes with multiple NVIDIA GPUs Canonical CCSD(T) energies can be evaluated for systems containing 200 electrons and 1000 basis functions in a few days using a small size commodity cluster, with even larger computations possible on leadership‐class computing resources.
Networks are one of the most common ways to represent biological systems as complex sets of binary interactions or relations between different bioentities. In this article, we discuss the basic graph theory concepts and the various graph types, as well as the available data structures for storing and reading graphs. In addition, we describe several network properties and we highlight some of the widely used network topological features. We briefly mention the network patterns, motifs and models, and we further comment on the types of biological and biomedical networks along with their corresponding computer- and human-readable file formats. Finally, we discuss a variety of algorithms and metrics for network analyses regarding graph drawing, clustering, visualization, link prediction, perturbation, and network alignment as well as the current state-of-the-art tools. We expect this review to reach a very broad spectrum of readers varying from experts to beginners while encouraging them to enhance the field further.
In plasma-driven solution electrolysis (PDSE), gas-phase plasma-produced species interact with an electrolytic solution to produce, for example, nanoparticles. An atmospheric pressure plasma jet (APPJ) directed onto a liquid solution containing a metallic salt will promote reduction of metallic ions in solution, generating metallic clusters that nucleate to form nanoparticles. In this article, results from a computational investigation are discussed of a PDSE process in which a radio-frequency APPJ sustained in helium impinges on a silver nitrate solution, resulting in growth of silver nanoparticles. A reaction mechanism was developed and implemented in a global plasma chemistry model to predict nanoparticle growth. To develop the reaction mechanism, density functional theory was used to generate probable silver growth pathways up to Ag 9 . Neutral clusters larger than Ag 9 were classified as nanoparticles. Kinetic reaction rate coefficients for thermodynamically favorable growth pathways were estimated based on an existing, empirically determined base reaction mechanism for smaller Ag particle interactions. These rates were used in conjunction with diffusion-controlled reaction rate coefficients that were calculated for other Ag species. The role of anions in reduction of Agn ions in forming nanoparticles is also discussed. Oxygen containing impurities or admixtures to the helium, air entrainment into the APPJ, and dissociation of saturated water vapor above the solution can produce additional reactive oxygen species in solution, resulting in the production of anions and O 2 – in particular. For a given molarity, delivering a sufficient fluence of reducing species will produce similar nanoparticle densities and sizes for all applied power levels. In conclusion, comparisons are made to alternate models for nanoparticle formation, including charged nanoparticles and use of direct current plasmas.
A system that detects object outlines in television images in real time is described. A high-speed pipeline processor transforms the raw image into an edge map and a microprocessor, which is integrated into the system, clusters the edges, and represents them as chain codes. Image statistics, useful for higher level tasks such as pattern recognition, are computed by the microprocessor. Peak intensity and peak gradient values are extracted within a programmable window and are used for iris and focus control. The algorithms implemented in hardware and the pipeline processor architecture are described. The strategy for partitioning functions in the pipeline was chosen to make the implementation modular. The microprocessor interface allows flexible and adaptive control of the feature extraction process. The software algorithms for clustering edge segments, creating chain codes, and computing image statistics are also discussed. A strategy for real time image analysis that uses this system is given.
Optimizing scientific applications on today’s accelerator-based high performance computing systems can be challenging, especially when multiple GPUs and CPUs with heterogeneous memories and persistent non-volatile memories are present. An example is Summit, an accelerator-based system at the Oak Ridge Leadership Computing Facility (OLCF) that is rated as the world’s fastest supercomputer to-date. New strategies are thus needed to expose the parallelism in legacy applications, while being amenable to efficient mapping to the underlying architecture.In this paper we discuss our experiences and strategies to port a scientific application, DCA++, to Summit. DCA++ is a highperformance research application that solves quantum manybody problems with a cutting edge quantum cluster algorithm, the dynamical cluster approximation.Our strategies aim to synergize the strengths of the different programming models in the code. These include: (a) streamlining the interactions between the CPU threads and the GPUs, (b) implementing computing kernels on the GPUs and decreasing CPU-GPU memory transfers, (c) allowing asynchronous GPU communications, and (d) increasing compute intensity by combining linear algebraic operations.Full-scale production runs using all 4600 Summit nodes attained a peak performance of 73.5 PFLOPS with a mixed precision implementation.We observed a perfect strong and weak scaling for the quantum Monte Carlo solver in DCA++, while encountering about 2× input/output (I/O) and MPI communication overhead on the time-to-solution for the full machine run. Our hardware agnostic optimizations are designed to alleviate the communication and I/O challenges observed, while improving the compute intensity and obtaining optimal performance on a complex, hybrid architecture like Summit.
The Cluster Compression Algorithm (CCA), which was developed to reduce costs associated with transmitting, storing, distributing, and interpreting LANDSAT multispectral image data is described. The CCA is a preprocessing algorithm that uses feature extraction and data compression to more efficiently represent the information in the image data. The format of the preprocessed data enables simply a look-up table decoding and direct use of the extracted features to reduce user computation for either image reconstruction, or computer interpretation of the image data. Basically, the CCA uses spatially local clustering to extract features from the image data to describe spectral characteristics of the data set. In addition, the features may be used to form a sequence of scalar numbers that define each picture element in terms of the cluster features. This sequence, called the feature map, is then efficiently represented by using source encoding concepts. Various forms of the CCA are defined and experimental results are presented to show trade-offs and characteristics of the various implementations. Examples are provided that demonstrate the application of the cluster compression concept to multi-spectral images from LANDSAT and other sources.
We present a novel computational method for automatic assignment of protein domains from structural data. At the core of our algorithm lies a recently proposed clustering technique that has been very successful for image-partitioning applications. This grap.,l-theory based clustering method uses the notion of a normalized cut to partition. an undirected graph into its strongly-connected components. Computer implementation of our method tested on the standard comparison set of proteins from the literature shows a high success rate (84%), better than most existing alternative In addition, several other features of our algorithm, such as reliance on few adjustable parameters, linear run-time with respect to the size of the protein and reduced complexity compared to other graph-theory based algorithms, would make it an attractive tool for structural biologists.