Search NASA⌕ Search

SEARCH · Search NASA

Results for “Dynamic clustering algorithm”

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 145 records · Page 8

ADEPT: a domain independent sequence alignment strategy for gpu architectures

Bioinformatic workflows frequently make use of automated genome assembly and protein clustering tools. At the core of most of these tools, a significant portion of execution time is spent in determining optimal local alignment between two sequences. This task is performed with the Smith-Waterman algorithm, which is a dynamic programming based method. With the advent of modern sequencing technologies and increasing size of both genome and protein databases, a need for faster Smith-Waterman implementations has emerged. Multiple SIMD strategies for the Smith-Waterman algorithm are available for CPUs. However, with the move of HPC facilities towards accelerator based architectures, a need for an efficient GPU accelerated strategy has emerged. Existing GPU based strategies have either been optimized for a specific type of characters (Nucleotides or Amino Acids) or for only a handful of application use-cases. In this paper, we present ADEPT, a new sequence alignment strategy for GPU architectures that is domain independent, supporting alignment of sequences from both genomes and proteins. Our proposed strategy uses GPU specific optimizations that do not rely on the nature of sequence. We demonstrate the feasibility of this strategy by implementing the Smith-Waterman algorithm and comparing it to similar CPU strategies as well as the fastest known GPU methods for each domain. ADEPT’s driver enables it to scale across multiple GPUs and allows easy integration into software pipelines which utilize large scale computational systems. We have shown that the ADEPT based Smith-Waterman algorithm demonstrates a peak performance of 360 GCUPS and 497 GCUPs for protein based and DNA based datasets respectively on a single GPU node (8 GPUs) of the Cori Supercomputer. Overall ADEPT shows 10x faster performance in a node-to-node comparison against a corresponding SIMD CPU implementation. ADEPT demonstrates a performance that is either comparable or better than existing GPU strategies. We demonstrated the efficacy of ADEPT in supporting existing bionformatics software pipelines by integrating ADEPT in MetaHipMer a high-performance denovo metagenome assembler and PASTIS a high-performance protein similarity graph construction pipeline. Our results show 10% and 30% boost of performance in MetaHipMer and PASTIS respectively.

59 BASIC BIOLOGICAL SCIENCES↗

Scalable molecular dynamics on CPU and GPU architectures with NAMD

NAMD is a molecular dynamics program designed for high-performance simulations of very large biological objects on CPU- and GPU-based architectures. NAMD offers scalable performance on petascale parallel supercomputers consisting of hundreds of thousands of cores, as well as on inexpensive commodity clusters commonly found in academic environments. It is written in C++ and leans on Charm++ parallel objects for optimal performance on low-latency architectures. NAMD is a versatile, multipurpose code that gathers state-of-the-art algorithms to carry out simulations in apt thermodynamic ensembles, using the widely popular CHARMM, AMBER, OPLS, and GROMOS biomolecular force fields. Here, we review the main features of NAMD that allow both equilibrium and enhanced-sampling molecular dynamics simulations with numerical efficiency. We describe the underlying concepts utilized by NAMD and their implementation, most notably for handling long-range electrostatics; controlling the temperature, pressure, and pH; applying external potentials on tailored grids; leveraging massively parallel resources in multiple-copy simulations; and hybrid quantum-mechanical/molecular-mechanical descriptions. We detail the variety of options offered by NAMD for enhanced-sampling simulations aimed at determining free-energy differences of either alchemical or geometrical transformations and outline their applicability to specific problems. Last, we discuss the roadmap for the development of NAMD and our current efforts toward achieving optimal performance on GPU-based architectures, for pushing back the limitations that have prevented biologically realistic billion-atom objects to be fruitfully simulated, and for making large-scale simulations less expensive and easier to set up, run, and analyze. NAMD is distributed free of charge with its source code at www.ks.uiuc.edu.

high-performance computing↗

Neuromorphic learning with Mott insulator NiO

Habituation and sensitization (nonassociative learning) are among the most fundamental forms of learning and memory behavior present in organisms that enable adaptation and learning in dynamic environments. Emulating such features of intelligence found in nature in the solid state can serve as inspiration for algorithmic simulations in artificial neural networks and potential use in neuromorphic computing. In this work, we demonstrate nonassociative learning with a prototypical Mott insulator, nickel oxide (NiO), under a variety of external stimuli at and above room temperature. Similar to biological species such as Aplysia, habituation and sensitization of NiO possess time-dependent plasticity relying on both strength and time interval between stimuli. A combination of experimental approaches and first-principles calculations reveals that such learning behavior of NiO results from dynamic modulation of its defect and electronic structure. An artificial neural network model inspired by such nonassociative learning is simulated to show advantages for an unsupervised clustering task in accuracy and reducing catastrophic interference, which could help mitigate the stability–plasticity dilemma. Mott insulators can therefore serve as building blocks to examine learning behavior noted in biology and inspire new learning algorithms for artificial intelligence.

42 ENGINEERING↗

Anomalously high elastic modulus of a poly(ethylene oxide)-based composite electrolyte

The practical use of lithium metal anodes in solid-state batteries requires a polymer membrane with high lithium-ion conductivity, thermal/electrochemical stability, and mechanical strength. The primary challenge is to effectively decouple the ionic conductivity and mechanical strength of the polymer electrolytes. We report a remarkably facile single step synthetic strategy based on in-situ crosslinking of poly(ethylene oxide) (xPEO) in the presence of a woven glass fiber (GF). Such a simple method yields composite polymer electrolytes (CPE) of anomalously high elastic modulus up to 2.5 GPa over a broad temperature range (20 °C – 245 °C) that has never been previously documented. An unsupervised machine learning algorithm, K-mean clustering analysis, was implemented on the hyperspectral Raman mapping at the xPEO/GF interface. Using such a unique means, we show for the first time that the promoted mechanical strength originates from xPEO and GF interactions through dynamic hydrogen and ionic bonding. High ionic conductivity is achieved by the addition plasticizer (e.g. tetraglyme), where trifluoromethanesulfonate anions are tethered to the xPEO matrix and Li + cations are favorably transported through coordination with the plasticizer. Further, stringent galvanostatic cycling tests indicates the CPE can be stably cycled for >3000 h in a Li-metal symmetric cell at a moderate temperature (nearly 1500 Coulombs/cm 2 Li equivalents), outperforming most of the PEO-based electrolytes. The GF reinforced CPE reported here has multifunctional uses, such as solid electrolytes for all solid-state batteries and membranes for redox-flow batteries. Although the focus of this study is on lithium-based batteries, the results are equally promising for other alkali metal based batteries such as sodium and potassium.

25 ENERGY STORAGE↗

First-Principles Grand-Canonical Simulations of Water Adsorption in Proton-Exchanged Zeolites

Water appears by design or as impurities in many important reactive systems. For those catalyzed by porous solid acids, such as widely used zeolites, experimentally quantifying the amount or elucidating the structure of adsorbed water clusters at reaction conditions is challenging, while computational studies (e.g., first-principles molecular dynamics simulations) often need to assume the loading to examine solvation effects. Furthermore, we perform first-principles grand-canonical simulations to predict water adsorption to H-ZSM-5 zeolites under specified experimental conditions. Presampling with inexpensive force fields and a pool-based parallelization algorithm are used to improve simulation efficiency, while molecular dynamics is used to sample configurations involving hydronium species. We observe that H + exchange dramatically increases the hydrophilicity of zeolite MFI and an appreciable amount of water is present at very low relative humidities. At all conditions examined, the zeolitic protons are found to dissociate readily from the surface basic sites and become mobile by participating in the hydrogen-bonded chains of adsorbed water molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Structures cluster

The objective of this program is to develop technology needed for structural evaluation of alternative space construction concepts. Those concepts are as follows: interactive effects on dynamic performance of various environment and self-generated disturbance; new materials concepts, failure mechanisms, and non-destructive evaluation/failure detection; develop stable control algorithms and design effective combination of hierarchical and adaptive controls; and assess control-structure integrated performance and stability.

Datta, Subhendu K.↗

Automated identification of dominant physical processes

The identification of processes that locally and approximately dominate dynamical system behavior has enabled significant advances in understanding and modeling nonlinear differential dynamical systems. Conventional methods of dominant process identification involve piecemeal and ad hoc (non-rigorous, informal) scaling analyses to identify dominant balances of governing equation terms and to delineate the spatiotemporal boundaries (boundaries in space and/or time) of each dominant balance. For the first time, we present an objective global measure of the fit of dominant balances to observations, which is desirable for automation, and was previously undefined. Furthermore, we propose a formal definition of the dominant balance identification problem in the form of an optimization problem. Here, we show that the optimization can be performed by various machine learning algorithms, enabling the automatic identification of dominant balances. Our method is algorithm agnostic and it eliminates reliance upon expert knowledge to identify dominant balances which are not known beforehand.

42 ENGINEERING↗

A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks

This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining tasks in a distributed environment such as clustering, anomaly detection, target tracking to name a few. This technology is crucial for many emerging peer-to-peer applications for bioinformatics, astronomy, social networking, sensor networks and web mining. Centralizing all or some of the data for building global models is impractical in such peer-to-peer environments because of the large number of data sources, the asynchronous nature of the peer-to-peer networks, and dynamic nature of the data/network. The distributed algorithm we have developed in this paper is provably-correct i.e. it converges to the same result compared to a similar centralized algorithm and can automatically adapt to changes to the data and the network. We show that the communication overhead of the algorithm is very low due to its local nature. This monitoring algorithm is then used as a feedback loop to sample data from the network and rebuild the model when it is outdated. We present thorough experimental results to verify our theoretical claims.

Bhaduri, Kanishka↗

Temporal feedback control of high-intensity laser pulses to optimize ultrafast heating of atomic clusters

We describe how active feedback routines can be applied at a limited repetition rate (5 Hz) to optimize high-power (>10 TW) laser interactions with clustered gases. Optimization of x-ray production from an argon cluster jet, using a genetic algorithm, approximately doubled the measured energy through temporal modification of the 150 mJ driving laser pulse. This method achieved an increased radiation yield through exploration of a multi-dimensional parameter space, without requiring detailed a priori knowledge of the complex cluster dynamics. The optimized laser pulses exhibited a slow rising edge to the intensity profile, which enhanced the laser energy coupling into the cluster medium, compared to the optimally compressed FWHM pulse (40 fs). This report suggests that this technique can be more widely utilized for control of intense pulsed secondary radiation from petawatt-class laser systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

BD-CATS-IO

Modern cosmology and plasma physics codes are now capable of simulating trillions of particles on petascale systems. Each timestep output from such simulations is on the order of 10s of TBs. Summarizing and visualizing raw particle data is challenging, and scientists often focus on density structures, whether in the real 3D space, or a high-dimensional phase space. In this work, code was developed for reading 10s of terabytes of data and for writing the resultant cluster IDs for each particle. This code will be part of a highly scalable version of the clustering algorithm DBSCAN, and apply it to the largest datasets produced by state-of-the-art codes. The overall function of BD-CATS (Big Data Clustering at Trillion Particles Scale) is to perform end-to-end analysis: loading the data, dynamic partitioning, computing kdtrees, performing clustering analysis, and storing the results. BD-CATS-IO provides the functionality of loading the data and storing the results.

Byna, Surendra↗

Optical galaxy cluster detection across a wide redshift range

The past decade is one of the most exciting period in the history of physics and astronomy. The discovery of cosmic acceleration dramatically changed our understanding about the evolution and constituents of the Universe. To accommodate the new acceleration phase into our well established Big Bang cosmological scenario under the frame work of General Relativity, there must exist a very special substance that has negative pressure and make up about 73% of the total energy density in our Universe. It is called Dark Energy. For the first time people realized that the vast majority of our Universe is made of things that are totally different from the things we are made of. Therefore, one of the major endeavors in physics and astronomy in the coming years is trying to understand, if we can, the nature of dark energy. Understanding dark energy cannot be achieved from pure logic. We need empirical evidence to finally determine about what is dark energy. The better we can constrain the energy density and evolution of the dark energy, the closer we will get to the answer. There are many ways to constrain the energy density and evolution of dark energy, each of which leads to degeneracy in certain directions in the parameter space. Therefore, a combination of complimentary methods will help to reduce the degeneracies and give tighter constraints. Dark energy became dominate over matter in the Universe only very recently (at about z ~ 1.5) and will affect both the cosmological geometry and large scale structure formation. Among the various experiments, some of them constrain the dark energy mainly via geometry (such as CMB, Supernovae) while some others provides constraints from both structures and geometry (such as BAO, Galaxy Clusters) Galaxy clusters can be used as a sensitive probe for cosmology. A large cluster catalog that extends to high redshift with well measured masses is indispensable for precisely constraining cosmological parameters. Detecting clusters in optical bands is very efficient. Multi-color CCD photometry allows combined detection and redshift estimation for clusters across broad redshift ranges. However, the lack of precise information about galaxy positions along the line of sight leads to contamination by projection, which plagues both cluster detection and the measurement of their properties. The dominance of red sequence galaxies, tightly clustered along the E/S0 ridgeline, provides a powerful method for de-projecting field galaxies. We developed an Error Corrected Gaussian Mixture Model to fit the galaxies color distribution around clusters by taking into account the measurement errors. By this technique, we can detect the red sequence color clustering and extract unbiased information about the evolution of the red sequence ridgeline and its width. Precision measurements of ridgelines yields better estimates of cluster richness and possibly their dynamical state, leading to better estimates of cluster mass. By using the red sequence clustering in color space identified from the Error Corrected Gaussian Mixture Model, together with the projected NFW filter in the projected RA/DEC plane, we developed a new and efficient cluster finding algorithm that can reliably detect galaxy clusters across the redshift range from 0.1 to 1.4. We have also run the cluster finder on legacy SDSS DR7 data and assembled an approximately volume limited cluster catalog across redshifts from 0.1 to 0.5. The algorithm has been tested against a Monte Carlo mock catalog, showing the identified clusters are highly complete and pure. With the completion of this thesis, we build the first and essential step towards precision cluster cosmology. Meanwhile, the large optical cluster catalog across a wide redshift range makes possible the systematic and detailed investigation of cluster formation and evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Observing flow of He II with unsupervised machine learning

Abstract Time dependent observations of point-to-point correlations of the velocity vector field (structure functions) are necessary to model and understand fluid flow around complex objects. Using thermal gradients, we observed fluid flow by recording fluorescence of $${\text{He}}_{2}^{*}$$ He 2 ∗ excimers produced by neutron capture throughout a ~ cm 3 volume. Because the photon emitted by an excited excimer is unlikely to be recorded by the camera, the techniques of particle tracking (PTV) and particle imaging (PIV) velocimetry cannot be applied to extract information from the fluorescence of individual excimers. Therefore, we applied an unsupervised machine learning algorithm to identify light from ensembles of excimers (clusters) and then tracked the centroids of the clusters using a particle displacement determination algorithm developed for PTV.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Characterizing and Modeling Cloud Applications/Jobs on a Google Data Center

In this paper, we characterize and model Google applications and jobs, based on a 1-month Google trace from a large-scale Google data center. We address four contributions: (1) we compute the valuable statistics about task events and resource utilization for Google applications, based on various types of resources and execution types; (2) we analyze the classification of applications via a K-means clustering algorithm with optimized number of sets, based on task events and resource usage; (3) we study the correlation of Google application properties and running features (e.g., job priority and scheduling class); (4) we finally build a model that can simulate Google jobs/tasks and dynamic events, in accordance with Google trace. Experiments show that the tasks simulated based on our model exhibit fairly analogous features with those in Google trace. 95+ % of tasks' simulation errors are 20 %, confirming a high accuracy of our simulation model.

Di, Sheng↗

Parallel algorithms for hyperdynamics and local hyperdynamics

Hyperdynamics (HD) is a method for accelerating the timescale of standard molecular dynamics (MD). It can be used for simulations of systems with an energy potential landscape that is a collection of basins, separated by barriers, where transitions between basins are infrequent. HD enables the system to escape from a basin more quickly while enabling a statistically accurate renormalization of the simulation time, thus effectively boosting the timescale of the simulation. In [Kim, Perez, Voter, J Chem Phys, 139:144110, 2013)1, a local version of HD was formulated, which exploits the intrinsic locality characteristic typical of most systems to mitigate the poor scaling properties of standard HD as the system size is increased. In this paper, we discuss how both HD and local HD can be formulated to run efficiently in parallel. We have implemented these ideas in the LAMMPS MD code, which means HD can be used with any interatomic potential LAMMPS supports. Together, these parallel methods allow simulations of any size to achieve the time acceleration offered by HD (which can be orders of magnitude), at a cost 3-5x that of standard MD. As examples, we performed two simulations of a million-atom system to model the diffusion and clustering of Pt adatoms on a large patch of Pt(100) surface for 80 and 160 μs.

74 ATOMIC AND MOLECULAR PHYSICS↗

GenomeFace v1.0

GenomeFace is meta-genome binning software. Metagenomic binning, the process of grouping DNA sequences into taxonomic units, is critical for understanding the functions, interactions, and evolutionary dynamics of microbial communities. We propose a deep learning approach to binning using two neural networks, one based on composition and another on environmental abundance, dynamically weighting the contribution of each based on characteristics of the input data. Trained on over 43,000 prokaryotic genomes, our network for composition-based binning is inspired by metric learning techniques used for facial recognition. Using a task-specific, multi-GPU accelerated algorithm to cluster the embeddings produced by our network, our binner leverages marker genes observed to be universally present in nearly all taxa to grade and select optimal clusters of sequences from a hierarchy of candidates. We evaluate our approach on four simulated datasets with known ground truth. Our linear time integration of marker genes recovers more near complete genomes than state of the art but computationally infeasible solutions using them, while being over an order of magnitude faster. Finally, we demonstrate the scalability and acuity of our approach by testing it on three of the largest metagenome assemblies ever performed. Compared to other binners, we produced 47%-183% more near complete genomes. From these datasets, we find over the genomes of over 3000 new candidate species which have never been previously cataloged, representing a potential 4% expansion of the known bacterial tree of life.

Lettich, Richard [Lawrence Berkeley National Labor↗

Local packing modulates diversity of iron pathways and cooperative behavior in eukaryotic and prokaryotic ferritins

Ferritin-like molecules show a remarkable combination of the evolutionary conserved activity of iron uptake and release that engage different pores in the conserved ferritin shell. It was hypothesized that pore selection and iron traffic depend on dynamic allostery with no conformational changes in the backbone. In this study, we detect the allosteric networks in Pseudomonas aeruginosa bacterioferritin (BfrB), bacterial ferritin (FtnA), and bullfrog M and L ferritins (Ftns) by a network-weaving algorithm (NWA) that passes threads of an allosteric network through highly correlated residues using hierarchical clustering. The residue-residue correlations are calculated in the packing-on elastic network model that introduces atom packing into the common packing-off model. Applying NWA revealed that each of the molecules has an extended allosteric network mostly buried inside the ferritin shell. The structure of the networks is consistent with experimental observations of iron transport: The allosteric networks in BfrB and FtnA connect the ferroxidase center with the 4-fold pores and B-pores, leaving the 3-fold pores unengaged. In contrast, the allosteric network directly links the 3-fold pores with the 4-fold pores in M and L Ftns. The majority of the network residues are either on the inner surface or buried inside the subunit fold or at the subunit interfaces. We hypothesize that the ferritin structures evolved in a way to limit the influence of functionally unrelated events in the cytoplasm on the allosteric network to maintain stability of the translocation mechanisms. We showed that the residue-residue correlations and the resultant long-range cooperativity depend on the ferritin shell packing, which, in turn, depends on protein sequence composition. Switching from the packing-on to the packing-off model reduces correlations by 35%–38% so that no allosteric network can be found. The influence of the side-chain packing on the allosteric networks explains the diversity in mechanisms of iron traffic suggested by experimental approaches.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NMR_DIFFSIM v. 1.0

The software generates and analyzes nuclear magnetic resonance spin diffusion simulations for the purpose of measuring domain sizes or spin diffusion constants in a heterogenous sample. Its primary capabilities are: 1. It solves the spin magnetization diffusion equation to simulate the results of a spin diffusion experiment using any structural input geometry, including structure models generated by molecular dynamics or other computational or experimental methods. 2. It compares the results of simulations on an input structure to experimental data, providing a data fitting algorithm to extract physical information from the experimental data via the simulation. 3. It can provide statistical measures to compare correlations between structural models, to determine domain clustering and connectedness, and to provide goodness-of-fit measures including chord length distributions, chi-squared values, Pearson coefficients and pair correlation functions. 4. It provides output reports, data files, and movies to visualize simulation results.

Sorte, Eric↗

Coherent correlation imaging for resolving fluctuating states of matter

Fluctuations and stochastic transitions are ubiquitous in nanometre-scale systems, especially in the presence of disorder. However, their direct observation has so far been impeded by a seemingly fundamental, signal-limited compromise between spatial and temporal resolution. Here we develop coherent correlation imaging (CCI) to overcome this dilemma. Our method begins by classifying recorded camera frames in Fourier space. Contrast and spatial resolution emerge by averaging selectively over same-state frames. Temporal resolution down to the acquisition time of a single frame arises independently from an exceptionally low misclassification rate, which we achieve by combining a correlation-based similarity metric with a modified, iterative hierarchical clustering algorithm. We apply CCI to study previously inaccessible magnetic fluctuations in a highly degenerate magnetic stripe domain state with nanometre-scale resolution. We uncover an intricate network of transitions between more than 30 discrete states. Our spatiotemporal data enable us to reconstruct the pinning energy landscape and to thereby explain the dynamics observed on a microscopic level. CCI massively expands the potential of emerging high-coherence X-ray sources and paves the way for addressing large fundamental questions such as the contribution of pinning and topology in phase transitions and the role of spin and charge order fluctuations in high-temperature superconductivity.

36 MATERIALS SCIENCE↗