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 541 records · Page 30

Post-processing interstitialcy diffusion from molecular dynamics simulations

An algorithm to rigorously trace the interstitialcy diffusion trajectory in crystals is developed. The algorithm incorporates unsupervised learning and graph optimization which obviate the need to input extra domain specific information depending on crystal or temperature of the simulation. The algorithm is implemented in a flexible framework as a post-processor to molecular dynamics (MD) simulations. We describe in detail the reduction of interstitialcy diffusion into known computational problems of unsupervised clustering and graph optimization. We also discuss the steps, computational efficiency and key components of the algorithm. Using the algorithm, thermal interstitialcy diffusion from low to near-melting point temperatures is studied. We encapsulate the algorithms in a modular framework with functionality to calculate diffusion coefficients, migration energies and other trajectory properties. The study validates the algorithm by establishing the conformity of output parameters with experimental values and provides detailed insights for the interstitialcy diffusion mechanism. The algorithm along with the help of supporting visualizations and analysis gives convincing details and a new approach to quantifying diffusion jumps, jump-lengths, time between jumps and to identify interstitials from lattice atoms. -- Graphical abstract:.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Technologies for node-degree based clustering of data sets

Technologies for node-degree based clustering include a computing device to construct a graph that includes multiple vertices corresponding to the data points of a data set. The computing device inserts an edge between each pair of vertices that has a corresponding similarity metric that meets a predetermined threshold similarity metric. The computing device determines a node degree for each vertex in the graph and initializes a cutoff node degree as the lowest node degree of the vertices. The computing device selects a test subset of the graph that includes vertices having a node degree less than or equal to the cutoff node degree. The computing device determines whether the test subset covers the graph and if not increases the cutoff node degree. If the test subset covers the graph, the data points corresponding to the vertices of the test subset are the representative cluster. Other embodiments are described and claimed.

Sitik, Ahmet Can↗

Automated Classification of Vehicle Movements at Signalized Intersections Using Vehicle Trajectories

Accurate vehicle movement classification through signalized intersections is of paramount importance to the analysis of intersection performance and the optimization of traffic control strategies. Conventional techniques for tracking vehicle turning movements depend on infrastructure-based strategies like human counts, loop detectors, and video analytics, all of which are costly, prone to errors, and spatially constrained. High-frequency trajectory data can be utilized to determine vehicle movement patterns in a scalable and infrastructure-independent method due to the adoption of connected vehicles (CVs). In recent years, several studies have utilized connected vehicle data to generate performance measures. Most of the trajectory-based performance measures approaches, however, require map matching-i.e., extracting geospatial references from maps to identify the movements that individual vehicles make at a signalized intersection. These approaches are often time-consuming and hinder scalability since geographic features need to be provided for an analysis to be conducted. Map matching methods are prone to errors as different map versions change these geographic features. This research presents a novel automatic classification pipeline that uses CV trajectory data to classify vehicle movements at signalized crossings, specifically pass-through left-turn and right-turn maneuvers. The process starts by filtering trips that cross a spatial bounding box that has been defined at the target intersection. Approach and departure headings for each trajectory crossing the boundary are computed and are clustered together to identify dominant movements. The proposed algorithm is used to classify the movement of vehicles at 10 intersections in the state of California, and the results indicate that the algorithm can classify movements at these intersections with varying traffic volumes and road network configurations, all in a map-less framework with no need for conflation of vehicle trajectories to a digital base map.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Reduced‐cost sparsity‐exploiting algorithm for solving coupled‐cluster equations

We present an algorithm for reducing the computational work involved in coupled‐cluster (CC) calculations by sparsifying the amplitude correction within a CC amplitude update procedure. We provide a theoretical justification for this approach, which is based on the convergence theory of inexact Newton iterations. We demonstrate by numerical examples that, in the simplest case of the CCD equations, we can sparsify the amplitude correction by setting, on average, roughly 90% nonzero elements to zeros without a major effect on the convergence of the inexact Newton iterations.

Brabec, Jiri↗

An ab initio exciton model for singlet fission

Here we present an ab initio exciton model that extends the Frenkel exciton model and includes valence, charge-transfer, and multiexcitonic excited states. It serves as a general, parameter-free, yet computationally efficient and scalable approach for simulation of singlet fission processes in multichromophoric systems. A comparison with multiconfigurational methods confirms that our exciton model predicts consistent energies and couplings for the pentacene dimer and captures the correct physics. Calculations of larger pentacene clusters demonstrate the computational scalability of the exciton model and suggest that the mixing between local and charge-transfer excitations narrows the gap between singlet and multiexcitonic states. Local vibrations of pentacene molecules are found to facilitate singlet–multiexcitonic state-crossing and hence are important for understanding singlet fission. The exciton model developed in this work also sets the stage for further implementation of the nuclear gradients and nonadiabatic couplings needed for first principles nonadiabatic quantum molecular dynamics simulations of singlet fission.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Experiences using OpenMP based on Computer Directed Software DSM on a PC Cluster

In this work we report on our experiences running OpenMP programs on a commodity cluster of PCs running a software distributed shared memory (DSM) system. We describe our test environment and report on the performance of a subset of the NAS Parallel Benchmarks that have been automaticaly parallelized for OpenMP. We compare the performance of the OpenMP implementations with that of their message passing counterparts and discuss performance differences.

Hess, Matthias↗

Superfluid response of two-dimensional parahydrogen clusters in confinement

We study by computer simulations the effect of confinement on the superfluid properties of small two-dimensional (2D) parahydrogen clusters. For clusters of fewer than twenty molecules, the superfluid response in the low temperature limit is found to remain comparable in magnitude to that of free clusters, within a rather wide range of depth and size of the confining well. The resilience of the superfluid response is attributable to the “supersolid” character of these clusters. We investigate the possibility of establishing a bulk 2D superfluid “cluster crystal” phase of p-H{sub 2}, in which a global superfluid response would arise from tunnelling of molecules across adjacent unit cells. The computed energetics suggests that for clusters of about ten molecules, such a phase may be thermodynamically stable against the formation of the equilibrium insulating crystal, for values of the cluster crystal lattice constant possibly allowing tunnelling across adjacent unit cells.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Collaborative Clustering for Sensor Networks

Traditionally, nodes in a sensor network simply collect data and then pass it on to a centralized node that archives, distributes, and possibly analyzes the data. However, analysis at the individual nodes could enable faster detection of anomalies or other interesting events, as well as faster responses such as sending out alerts or increasing the data collection rate. There is an additional opportunity for increased performance if individual nodes can communicate directly with their neighbors. Previously, a method was developed by which machine learning classification algorithms could collaborate to achieve high performance autonomously (without requiring human intervention). This method worked for supervised learning algorithms, in which labeled data is used to train models. The learners collaborated by exchanging labels describing the data. The new advance enables clustering algorithms, which do not use labeled data, to also collaborate. This is achieved by defining a new language for collaboration that uses pair-wise constraints to encode useful information for other learners. These constraints specify that two items must, or cannot, be placed into the same cluster. Previous work has shown that clustering with these constraints (in isolation) already improves performance. In the problem formulation, each learner resides at a different node in the sensor network and makes observations (collects data) independently of the other learners. Each learner clusters its data and then selects a pair of items about which it is uncertain and uses them to query its neighbors. The resulting feedback (a must and cannot constraint from each neighbor) is combined by the learner into a consensus constraint, and it then reclusters its data while incorporating the new constraint. A strategy was also proposed for cleaning the resulting constraint sets, which may contain conflicting constraints; this improves performance significantly. This approach has been applied to collaborative clustering of seismic and infrasonic data collected by the Mount Erebus Volcano Observatory in Antarctica. Previous approaches to distributed clustering cannot readily be applied in a sensor network setting, because they assume that each node has the same view of the data set. A view is the set of features used to represent each object. When a single data set is partitioned across several computational nodes, distributed clustering works; all objects have the same view. But when the data is collected from different locations, using different sensors, a more flexible approach is needed. This approach instead operates in situations where the data collected at each node has a different view (e.g., seismic vs. infrasonic sensors), but they observe the same events. This enables them to exchange information about the likely cluster membership relations between objects, even if they do not use the same features to represent the objects.

Wagstaff. Loro :/↗

Dynamic Load-Balancing for Distributed Heterogeneous Computing of Parallel CFD Problems

The developed methodology is aimed at improving the efficiency of executing block-structured algorithms on parallel, distributed, heterogeneous computers. The basic approach of these algorithms is to divide the flow domain into many sub- domains called blocks, and solve the governing equations over these blocks. Dynamic load balancing problem is defined as the efficient distribution of the blocks among the available processors over a period of several hours of computations. In environments with computers of different architecture, operating systems, CPU speed, memory size, load, and network speed, balancing the loads and managing the communication between processors becomes crucial. Load balancing software tools for mutually dependent parallel processes have been created to efficiently utilize an advanced computation environment and algorithms. These tools are dynamic in nature because of the chances in the computer environment during execution time. More recently, these tools were extended to a second operating system: NT. In this paper, the problems associated with this application will be discussed. Also, the developed algorithms were combined with the load sharing capability of LSF to efficiently utilize workstation clusters for parallel computing. Finally, results will be presented on running a NASA based code ADPAC to demonstrate the developed tools for dynamic load balancing.

Ecer, A.↗

The extinction law in the open cluster NGC 457 and the intrinsic energy distribution of Phi Cassiopeiae (F0 Ia)

Five early B-type stars near the main-sequence turnoff in NGC 457 have been observed at low dispersion with the short-wavelength prime and the long-wavelength redundant cameras of the IUE satellite. The equivalent widths of spectral features that are particularly strong and sensitive to temperature and luminosity were computed in the cluster stars and in 20 lightly reddened stars of types O9-B3 and luminosity classes III-V. The comparison of the equivalent widths provides a reliable method for finding matching pairs. Having identified the best comparison star for each program star, binned fluxes were used to determine the mean extinction curve. In order to cover the visible region, monochromatic fluxes of Phi Cas were derived from observations with the intensified Reticon scanner mounted on the No. 2 0.9 m telescope of KPNO, and they were dereddened with the mean extinction curve of Savage and Mathis. Thus, the intrinsic energy distribution of Phi Cas were determined from 1500 to 5800 A for use in a detailed model-atmosphere analysis.

Rosenzweig, P.↗

DNA Break Clustering as a Predictor of Cell Death across Various Radiation Qualities: Influence of Cell Size, Cell Asymmetry, and Beam Orientation

Cosmic radiation, composed of high charge and energy (HZE) particles, causes cellular DNA damage that can result in cell death or mutation that can evolve into cancer. In this work, a cell death model is applied to several cell lines exposed to HZE ions spanning a broad range of linear energy transfer (LET) values. We hypothesize that chromatin movement leads to the clustering of multiple double strand breaks (DSB) within one radiation-induced foci (RIF). The survival probability of a cell population is determined by averaging the survival probabilities of individual cells, which is function of the number of pairwise DSB interactions within RIF. The simulation code RITCARD was used to compute DSB. Two clustering approaches were applied to determine the number of RIF per cell. RITCARD outputs were combined with experimental data from four normal human cell lines to derive the model parameters and expand its predictions in response to ions with LET ranging from ∼0.2keV/μmto∼3000keV/μm. Spherical and ellipsoidal nuclear shapes and two ion beam orientations were modeled to assess the impact of geometrical properties on cell death. The calculated average number of RIF per cell reproduces the saturation trend for high doses and high-LET values that is usually experimentally observed. The cell survival model generates the recognizable bell shape of LET dependence for the relative biological effectiveness (RBE). At low LET, smaller nuclei have lower survival due to increased DNA density and DSB clustering. At high LET, nuclei with a smaller irradiation area either because of a smaller size or a change in beam orientation have a higher survival rate due to a change in the distribution of DSB/RIF per cell. If confirmed experimentally, the geometric characteristics of cells would become a significant factor in predicting radiation-induced biological effects.

cell survival↗

Spin–spin interactions in defects in solids from mixed all-electron and pseudopotential first-principles calculations

Abstract Understanding the quantum dynamics of spin defects and their coherence properties requires an accurate modeling of spin-spin interaction in solids and molecules, for example by using spin Hamiltonians with parameters obtained from first principles calculations. We present a real-space approach based on density functional theory for the calculation of spin-Hamiltonian parameters, where only selected atoms are treated at the all-electron level, while the rest of the system is described with the pseudopotential approximation. Our approach permits calculations for systems containing more than 1000 atoms, as demonstrated for defects in diamond and silicon carbide. We show that only a small number of atoms surrounding the defect needs to be treated at the all-electron level, in order to obtain an overall all-electron accuracy for hyperfine and zero-field splitting tensors. We also present results for coherence times, computed with the cluster correlation expansion method, highlighting the importance of accurate spin-Hamiltonian parameters for quantitative predictions of spin dynamics.

36 MATERIALS SCIENCE↗

Recent Advances on Computational Modeling of Supported Single-Atom and Cluster Catalysts: Characterization, Catalyst–Support Interaction, and Active Site Heterogeneity

To satisfy the need for catalyst materials with high activity, selectivity, and stability for energy conversion, material design and discovery guided by theoretical insights are a necessity. In the past decades, the rise in theoretical investigations into the properties of catalyst materials, reaction mechanisms, and catalyst design principles has shed light on the catalysis field. Quantitative structure–activity relationships have been developed through incorporating spectroscopic simulations, electronic structure calculations, and reaction mechanistic studies. Here, in this review, we report the state-of-the-art computational approaches to catalyst materials characterization for supported single-atom and cluster catalysts utilizing spectroscopic simulations, i.e., XANES simulation, and material properties investigation via electronic-structure calculations. Furthermore, approaches regarding reaction mechanisms, focusing on active site heterogeneity, are also discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Electronic Structure Theory Calculations Using Modern Architectures: KNL vs Haswell

The time to solution and parallel efficiency of several commonly used electronic structure methods (Hartree–Fock, density functional theory, second order perturbation theory, resolution of the identity second order perturbation theory, coupled cluster) are evaluated on both the Intel Xeon Haswell and the Intel Xeon Phi Knights Landing (KNL) architectures. The Haswell completes the benchmark calculations with a faster time to solution than the KNL for all molecules and methods tested. While the Haswell exhibits an average speedup of at least 3.5 relative to the KNL for all nonthreaded computations, the KNL has a better parallel efficiency than the Haswell with increasing core counts. The architectures are further tested using a more computationally costly coupled cluster method on a transition state reaction. The Haswell appears to be the best choice to minimize the time to solution, though for very large systems and high levels of theory that require memory intensive processes the superior memory hierarchy and larger on node memory of the KNL can make it a better choice. These results are used to showcase aspects of novel architectures that will increase efficiency for quantum chemistry applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computational Study of the Resonance Enhancement of Raman Signals of Ligands Adsorbed to CdSe Clusters through Photoexcitation of the Cluster

This paper describes density-functional-theory-based computations of resonance Raman (RR) spectra of ligand molecules adsorbed to the surface of a Cd 16 Se 13 cluster. Signals from asymmetric vibrational modes of ligand binding groups, such as the asymmetric O–C–O stretching modes of carboxylates, are enhanced relative to the symmetric vibrational modes when the excitation energy is on-resonance with the excitonic energy of the cluster. Certain ligand molecules have frontier orbitals with the correct energies and symmetries to mix with the orbitals of the CdSe cluster, and as a result, the wave functions of the electron and the hole delocalize from the cluster onto the ligand molecules; experimentally, this delocalization results in a bathochromic shift of the band edge excitonic absorption. Increased excitonic delocalization results in greater vibronic coupling between the exciton and the ligand vibrations and, on average, preferential enhancements in the RR signals of those vibrations. This work suggests that the use of exciton-delocalizing ligands to optimize electronic coupling between neighboring CdSe nanoparticles may, at the same time, enhance the rates of nonradiative exciton decay by coupling the exciton and ligand vibrational modes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Poplar: a phylogenomics pipeline

Motivation Generating phylogenomic trees from the genomic data is essential in understanding biological systems. Each step of this complex process has received extensive attention and has been significantly streamlined over the years. Given the public availability of data, obtaining genomes for a wide selection of species is straightforward. However, analyzing that data to generate a phylogenomic tree is a multistep process with legitimate scientific and technical challenges, often requiring a significant input from a domain-area scientist. Results We present Poplar, a new, streamlined computational pipeline, to address the computational logistical issues that arise when constructing the phylogenomic trees. It provides a framework that runs state-of-the-art software for essential steps in the phylogenomic pipeline, beginning from a genome with or without an annotation, and resulting in a species tree. Running Poplar requires no external databases. In the execution, it enables parallelism for execution for clusters and cloud computing. The trees generated by Poplar match closely with state-of-the-art published trees. The usage and performance of Poplar is far simpler and quicker than manually running a phylogenomic pipeline. Availability and implementation Freely available on GitHub at https://github.com/sandialabs/poplar. Implemented using Python and supported on Linux.

Koning, Elizabeth [Sandia National Laboratories (S↗

Pressure Effects on the Relaxation of an Excited Ethane Molecule in High-Pressure Bath Gases

Here, we use molecular dynamics to calculate the rotational and vibrational energy relaxation of C 2 H 6 in Ar, Kr, and Xe bath gases over a pressure range of 10 to 400 atm and at temperatures of 300 K and 800 K. The C 2 H 6 is instantaneously excited by 80 kcal/mol randomly distributed into both vibrational and rotational modes. The computed relaxation rates show little sensitivity to the identity of the noble gas in the bath. Vibrational relaxation rates show a non-linear pressure dependence at 300 K. At 800 K the reduced range of bath gas densities covered by the range of pressures do not yet show any non-linearity in the pressure dependence. Rotational relaxation is characterized with two relaxation rates. The slower rate is comparable to the vibrational relaxation rate. The faster rate has a linear pressure dependence at 300 K but an irregular, nonlinear pressure dependence at 800 K. To understand this, a model was developed based on approximating the periodic box used in the molecular dynamics simulations by an equal-volume collection of cubes where each cube is sized to allow only single occupancy by the noble gas or the molecule. Combinatorial statistics then leads to a pressure and temperature dependent analytic distribution of the bath gas species the molecule encounters in a collision. This distribution, the dissociation energy of molecule/bath gas complexes and bath gas clusters, and the computed energy release per collision combine to show that only at 300 K is the energy release sufficient to dissociate likely complexes and clusters. This suggests that persistent and pressure-dependent clusters and complexes at 800 K may be responsible for the non-linear pressure dependence of rotational relaxation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Detecting CAN Masquerade Attacks with Signal Clustering Similarity

Vehicular Controller Area Networks (CANs) are susceptible to cyber attacks of different levels of sophistication. Fabrication attacks are the easiest to administer—an adversary simply sends (extra) frames on a CAN—but also the easiest to detect because they disrupt frame frequency. To overcome time-based detection methods, adversaries must administer masquerade attacks by sending frames in lieu of (and therefore at the expected time of) benign frames but with malicious payloads. Research efforts have proven that CAN attacks, and masquerade attacks in particular, can affect vehicle functionality. Examples include causing unintended acceleration, deactivation of vehicle’s brakes, as well as steering the vehicle. We hypothesize that masquerade attacks modify the nuanced correlations of CAN signal time series and how they cluster together. Therefore, changes in cluster assignments should indicate anomalous behavior. We confirm this hypothesis by leveraging our previously developed capability for reverse engineering CAN signals (i.e., CAN-D [Controller Area Network Decoder]) and focus on advancing the state of the art for detecting masquerade attacks by analyzing time series extracted from raw CAN frames. Specifically, we demonstrate that masquerade attacks can be detected by computing time series clustering similarity using hierarchical clustering on the vehicle’s CAN signals (time series) and comparing the clustering similarity across CAN captures with and without attacks. We test our approach in a previously collected CAN dataset with masquerade attacks (i.e., the ROAD dataset) and develop a forensic tool as a proof of concept to demonstrate the potential of the proposed approach for detecting CAN masquerade attacks.

Moriano Salazar, Pablo↗