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

A new self-adaptive reconstruction method to identify defects through Wigner–Seitz approach

A new self-adaptive reconstruction method based on local atomic structure at any given molecular dynamics (MD) step has been developed in this article. The method can be used in Wigner–Seitz defect analysis approach to correctly and efficiently explore the information of both point defects and complex defect clusters (e.g. dislocation loops and voids) formed after a displacement cascade where the cascade interacts with grain boundaries and/or dislocations. The algorithm and validation are provided in detail. Results for identification of radiation defects during and after cascades interacting with a dislocation network show that the new method can well recognize all simple and complex defects and defect clusters. Thus, this new method provides a totally new way to explore the density and size of radiation defects at atomic scale after complex MD evolution processes, providing correct information to understand and predict radiation damage in materials through atomic simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Dynamic Time-Variant Connection Management for PGAS Models on InfiniBand

InfiniBand (IB) has established itself as a promising network infrastructure for high-end cluster computing systems as evidenced by its usage in the Top500 supercomputers today. While the IB standard describes multiple communication models (including reliable-connection (RC), and unreliable datagram (UD)), most of its promising features such as remote direct memory access (RDMA), hardware atomics and network fault tolerance are only available for the RC model which requires connections between communicating process pairs. In the past, several researchers have proposed on-demand connection management techniques that establish connections when there is a need to communicate, and not before. While such techniques work well for algorithms and applications that only communicate with a small set of processes in their life-time, there exists a broad set of applications that do not follow this trend. For example, applications that perform dynamic load balancing and adaptive work stealing have a small set of communicating neighbors at any given time, but over time the total number of neighbors can be very high; in some cases, equal to the entire system size. In this paper, we present a dynamic time-variant connection management approach that establishes connections on-demand like previous approaches, but further intelligently tears down some of the unused connections as well. While connection tear-down itself is relevant for any programming model, different models have different complexities. In this paper, we study the Global Arrays (GA) PGAS model for two reasons: (1) the simple one-sided communication primitives provided by GA and other PGAS models ensure that connection requests are always initiated by the origin process without explicit synchronization with the target process---this makes connection tear-down simpler to handle; and (2) GA supports several applications that demonstrate this behavior making it an obvious first target for the proposed enhancements. We evaluate our proposed approach using several micro-benchmarks as well as the NWChem computational chemistry application on more than 6000 processes, and show that our approach can significantly reduce the memory requirements of the communication library while maintaining its performance. To the best of our knowledge, this is the first design, implementation and evaluation of connection tear-down protocols over InfiniBand.

99 GENERAL AND MISCELLANEOUS↗

Computational Particle Dynamic Simulations on Multicore Processors (CPDMu) Final Report Phase I

Statement of Problem - Department of Energy has many legacy codes for simulation of computational particle dynamics and computational fluid dynamics applications that are designed to run on sequential processors and are not easily parallelized. Emerging high-performance computing architectures employ massively parallel multicore architectures (e.g., graphics processing units) to increase throughput. Parallelization of legacy simulation codes is a high priority, to achieve compatibility, efficiency, accuracy, and extensibility. General Statement of Solution - A legacy simulation application designed for implementation on mainly-sequential processors has been represented as a graph G. Mathematical transformations, applied to G, produce a graph representation {und G} for a high-performance architecture. Key computational and data movement kernels of the application were analyzed/optimized for parallel execution using the mapping G {yields} {und G}, which can be performed semi-automatically. This approach is widely applicable to many types of high-performance computing systems, such as graphics processing units or clusters comprised of nodes that contain one or more such units. Phase I Accomplishments - Phase I research decomposed/profiled computational particle dynamics simulation code for rocket fuel combustion into low and high computational cost regions (respectively, mainly sequential and mainly parallel kernels), with analysis of space and time complexity. Using the research team's expertise in algorithm-to-architecture mappings, the high-cost kernels were transformed, parallelized, and implemented on Nvidia Fermi GPUs. Measured speedups (GPU with respect to single-core CPU) were approximately 20-32X for realistic model parameters, without final optimization. Error analysis showed no loss of computational accuracy. Commercial Applications and Other Benefits - The proposed research will constitute a breakthrough in solution of problems related to efficient parallel computation of particle and fluid dynamics simulations. These problems occur throughout DOE, military and commercial sectors: the potential payoff is high. We plan to license or sell the solution to contractors for military and domestic applications such as disaster simulation (aerodynamic and hydrodynamic), Government agencies (hydrological and environmental simulations), and medical applications (e.g., in tomographic image reconstruction). Keywords - High-performance Computing, Graphic Processing Unit, Fluid/Particle Simulation. Summary for Members of Congress - Department of Energy has many simulation codes that must compute faster, to be effective. The Phase I research parallelized particle/fluid simulations for rocket combustion, for high-performance computing systems.

97 MATHEMATICS AND COMPUTING↗

Quantum-information analysis of electronic states of different molecular structures

We have studied transition metal clusters from a quantum information theory perspective using the density-matrix renormalization group (DMRG) method. We demonstrate the competition between entanglement and interaction localization and discuss the application of the configuration interaction-based dynamically extended active space procedure, which significantly reduces the effective system size and accelerates the speed of convergence for complicated molecular electronic structures. Our results indicate the importance of taking entanglement among molecular orbitals into account in order to devise an optimal DMRG orbital ordering and carry out efficient calculations on transition metal clusters. Apart from these algorithmic observations, which lead to a recipe for black-box DMRG calculations, our work provides physical understanding of electron correlation in molecular and cluster structures in terms of entropy measures of relevance also to recent work on tensor-network representations of electronic states. We also identify those molecular orbitals which are highly entangled and discuss the consequences for chemical bonding and for the structural transition from an dioxygen binding copper cluster to an bis-oxygen-bridged system with broken O-O bond.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse Reconstruction of the Merging A520 Cluster System

Merging galaxy clusters present a unique opportunity to study the properties of dark matter in an astrophysical context. These are rare and extreme cosmic events in which the bulk of the baryonic matter becomes displaced from the dark matter halos of the colliding subclusters. Since all mass bends light, weak gravitational lensing is a primary tool to study the total mass distribution in such systems. Combined with X-ray and optical analyses, mass maps of cluster mergers reconstructed from weak-lensing observations have been used to constrain the self-interaction cross-section of dark matter. The dynamically complex Abell 520 (A520) cluster is an exceptional case, even among merging systems: multi-wavelength observations have revealed a surprising high mass-to-light concentration of dark mass, the interpretation of which is difficult under the standard assumption of effectively collisionless dark matter. We revisit A520 using a new sparsity-based mass-mapping algorithm to independently assess the presence of the puzzling dark core. We obtain high-resolution mass reconstructions from two separate galaxy shape catalogs derived from Hubble Space Telescope observations of the system. Our mass maps agree well overall with the results of previous studies, but we find important differences. In particular, although we are able to identify the dark core at a certain level in both data sets, it is at much lower significance than has been reported before using the same data. As we cannot confirm the detection in our analysis, we do not consider A520 as posing a significant challenge to the collisionless dark matter scenario.

79 ASTRONOMY AND ASTROPHYSICS↗

Decentralised optimisation of cogeneration in virtual power plants

Within several projects we investigated grid structures and management strategies for active grids with high penetration of renewable energy resources and distributed generation (RES and DG). Those ''smart grids'' should be designed and managed by model based methods, which are elaborated within these projects. Cogeneration plants (CHP) can reduce the greenhouse gas emissions by locally producing heat and electricity. The integration of thermal storage devices is suitable to get more flexibility for the cogeneration operation. If several power plants are bound to centrally managed clusters, it is called ''virtual power plant''. To operate smart grids optimally, new optimisation and model reduction techniques are necessary to get rid with the complexity. There is a great potential for the optimised management of CHPs, which is not yet used. Due to the fact that electrical and thermal demands do not occur simultaneously, a thermally driven CHP cannot supply electrical peak loads when needed. With the usage of thermal storage systems it is possible to decouple electric and thermal production. We developed an optimisation method based on mixed integer linear programming (MILP) for the management of local heat supply systems with CHPs, heating boilers and thermal storages. The algorithm allows the production of thermal and electric energy with a maximal benefit. In addition to fuel and maintenance costs it is assumed that the produced electricity of the CHP is sold at dynamic prices. This developed optimisation algorithm was used for an existing local heat system with 5 CHP units of the same type. An analysis of the potential showed that about 10% increase in benefit is possible compared to a typical thermally driven CHP system under current German boundary conditions. The quality of the optimisation result depends on an accurate prognosis of the thermal load which is realised with an empiric formula fitted with measured data by a multiple regression method. The key functionality of a virtual power plant is to increase the value of the produced power by clustering different plants. The first step of the optimisation concerns the local operation of the individual power generator, the second step is to calculate the contribution to the virtual power plant. With small extensions the suggested MILP algorithm can be used for an overall EEX (European Energy Exchange) optimised management of clustered CHP systems in form of the virtual power plant. This algorithm has been used to control cogeneration plants within a distribution grid. (author)

20 FOSSIL-FUELED POWER PLANTS↗

Density fields and halo mass functions in the geometrical adhesion toy model

In dimension 2 and above, the Burgers dynamics, the so-called 'adhesion model' in cosmology, can actually give rise to several dynamics in the inviscid limit. We investigate here the statistical properties of the density field when it is defined by a 'geometrical model' associated with this Burgers velocity field and where the matter distribution is fully determined, at each time step, by geometrical constructions. Our investigations are based on a set of numerical experiments that make use of an improved algorithm, for which the geometrical constructions are efficient and robust. In this work we focus on Gaussian initial conditions with power-law power spectra of slope n in the range -3<n<1, where a self-similar evolution develops, and we compute the behavior of power spectra, density probability distributions and mass functions. As expected for such dynamics, the density power spectra show universal high-k tails that are governed by the formation of pointlike masses. The two other statistical indicators however show the same qualitative properties as those observed for 3D gravitational clustering. In particular, the mass functions obey a Press-Schechter like scaling up to a very good accuracy in 1D, and to a lesser extent in 2D. Our results suggest that the 'geometrical adhesion model', whose solution is fully known at all times, provides a precious tool to understand some of the statistical constructions frequently used to study the development of mass halos in gravitational clustering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Exploring network structure, dynamics, and function using NetworkX

NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package provides data structures for representing many types of networks, or graphs, including simple graphs, directed graphs, and graphs with parallel edges and self loops. The nodes in NetworkX graphs can be any (hashable) Python object and edges can contain arbitrary data; this flexibility mades NetworkX ideal for representing networks found in many different scientific fields. In addition to the basic data structures many graph algorithms are implemented for calculating network properties and structure measures: shortest paths, betweenness centrality, clustering, and degree distribution and many more. NetworkX can read and write various graph formats for eash exchange with existing data, and provides generators for many classic graphs and popular graph models, such as the Erdoes-Renyi, Small World, and Barabasi-Albert models, are included. The ease-of-use and flexibility of the Python programming language together with connection to the SciPy tools make NetworkX a powerful tool for scientific computations. We discuss some of our recent work studying synchronization of coupled oscillators to demonstrate how NetworkX enables research in the field of computational networks.

99 GENERAL AND MISCELLANEOUS↗

Regional Source-Type Discrimination Using Nonlinear Alignment Algorithms

The discrimination problem in seismology aims to accurately classify different underground source types based on local, regional, and/or teleseismic observations of ground motion. Typical discriminant approaches are rooted in fundamental, physics-based differences in radiation pattern or wave excitation, which can be frequency-dependent and may not make use of the full waveform. In this article, we explore whether phase and amplitude distances derived from dynamic time warping (DTW) and elastic shape analysis (ESA) can inform event discrimination. We demonstrate the ability to distinguish underground point sources using synthetic waveforms calculated for a 1D Earth model and various source mechanisms. We then apply the method to recorded data from events in the Korean Peninsula, which includes declared nuclear explosions, a collapse event, and naturally occurring earthquakes. Phase and amplitude distances derived from DTW and ESA are then used to classify the event types via dendrogram and k-nearest-neighbor clustering analyses. Using information from the full waveform, we show how different underground sources can be distinguished at regional distances. We highlight the potential of these nonlinear alignment algorithms for discrimination and comment on ways we can extend the framework presented here.

58 GEOSCIENCES↗

Pruning of Discrete Dynamic Event Trees Using Density Peaks and Dynamic Time Warping

Discrete Dynamic Event Trees (DDETs) are used in probabilistic risk assessment (PRA) to determine the risk associated with complex systems, such as nuclear power plants, where accident scenarios need to be realistically modeled. One of the most challenging aspects of the DDET method is that a large number of branches are produced for each initiating event. This can result in data that is difficult to organize and time consuming to analyze. As the number of uncertain parameters increases, so does the complexity of the event tree. An event tree often has nodes that do not contribute to the overall results and predictive capabilities; therefore, we suggest a pre-pruning algorithm that can work to remove these nodes, and consequently, reduce the complexity of the tree. Sandia National Laboratories (SNL) is currently working on a two year dynamic cyber-risk informed project to assess cyber failure in a nuclear power plant. This will be achieved by coupling SNL's dynamic scheduler known as Analysis of Dynamic Accident Progression Trees (ADAPT) with MELCOR, a reactor accident simulator, and a System for Circuit Evaluation and Prediction of Transient Radiation Effects (SCEPTRE), a cyber Emulytics code. This paper will discuss the preliminary results of a feasibility study for using density peaks (DP) clustering with dynamic time warping (DTW) to prune branches that are formed from large DDETs, like the ones that will be produced throughout SNL's project. Papers from the project that are submitted to this conference discuss the following: - The MELCOR model for a Pressurized Water Reactor that uses a digital instrumentation and control system. - Proposed generic cyber exploits for the above reactor. - Modifications to ADAPT to extend the framework for multiple simulators, incorporate importance measures into DDET analysis, as well as sort and reduce DDETs based on inputs to or outputs from the tree. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Multi-scale coarse-graining of non-conservative interactions in molecular liquids

A new bottom-up procedure for constructing non-conservative (dissipative and stochastic) interactions for dissipative particle dynamics (DPD) models is described and applied to perform hierarchical coarse-graining of a polar molecular liquid (nitromethane). The distant-dependent radial and shear frictions in functional-free form are derived consistently with a chosen form for conservative interactions by matching two-body force-velocity and three-body velocity-velocity correlations along the microscopic trajectories of the centroids of Voronoi cells (clusters), which represent the dissipative particles within the DPD description. The Voronoi tessellation is achieved by application of the K-means clustering algorithm at regular time intervals. Consistently with a notion of many-body DPD, the conservative interactions are determined through the multi-scale coarse-graining (MS-CG) method, which naturally implements a pairwise decomposition of the microscopic free energy. A hierarchy of MS-CG/DPD models starting with one molecule per Voronoi cell and up to 64 molecules per cell is derived. The radial contribution to the friction appears to be dominant for all models. As the Voronoi cell sizes increase, the dissipative forces rapidly become confined to the first coordination shell. For Voronoi cells of two and more molecules the time dependence of the velocity autocorrelation function becomes monotonic and well reproduced by the respective MS-CG/DPD models. A comparative analysis of force and velocity correlations in the atomistic and CG ensembles indicates Markovian behavior with as low as two molecules per dissipative particle. The models with one and two molecules per Voronoi cell yield transport properties (diffusion and shear viscosity) that are in good agreement with the atomistic data. The coarser models produce slower dynamics that can be appreciably attributed to unaccounted dissipation introduced by regular Voronoi re-partitioning as well as by larger numerical errors in mapping out the dissipative forces. The framework presented herein can be used to develop computational models of real liquids which are capable of bridging the atomistic and mesoscopic scales.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On Cold Pool Collisions in Tropical Boundary Layers

Collisions between cold pools are generally acknowledged to be important processes through which new convective cells are triggered. Yet relatively little has been done to characterize these processes in detail, quantify their impact on the life cycle of cold pools, and include them in convective parameterizations. We use a combination of Eulerian and Lagrangian models to investigate how much cold pools are affected by collisions. Results from simulations in radiative-convective equilibrium suggest that collisions represent a first-order process in the dynamics of cold pools, the median time of first collision being under 10 min since cold pool birth. Through a Lagrangian tracking algorithm, it is also shown that cold pools are significantly deformed by collisions and lose the circular shapes they would have if in isolation only a few minutes after birth. Finally, it is suggested that cold pools happen in clusters, and associated spatial and temporal scales are presented.

58 GEOSCIENCES↗

Decomposition of Nonlinear Dynamical Systems Using Koopman Gramians

In this paper we propose a new Koopman operator approach for nonlinear model decomposition using Koopman gramians. We introduce Koopman operators and discuss the notion of a input-Koopman operator. We show how input-Koopman operators can be used to cast a nonlinear system into the classical state-space form, as well as conditions under which input and state observable functions are well separated. We extend an existing method of dynamic mode decomposition for learning Koopman operators from data known as deep dynamic mode decomposition, for systems with control or disturbances. We illustrate the accuracy of the method on learning an input-state separable Koopman operator for an example system, even when the underlying system exhibits mixed state-input terms. Finally, we introduce a nonlinear decomposition algorithm, based on Koopman gramians, that maximizes internal subsystem observability and disturbance rejection from unwanted noise in other subsystems. To relieve the NP-hardness of the decomposition problem, we derive a relaxation based on Koopman gramians and multi-way partitioning. We illustrate our algorithm on a swing dynamics model for a IEEE 39 bus and discuss our findings.

Learning, Control, Distributed Control, koopman op↗

Performance modeling of microsecond scale biological molecular dynamics simulations on heterogeneous architectures

Performance improvements in biomolecular simulations based on molecular dynamics (MD) codes are widely desired. Unfortunately, the factors, which allowed past performance improvements, particularly the microprocessor clock frequencies, are no longer increasing. Hence, novel software and hardware solutions are being explored for accelerating performance of widely used MD codes. In this paper, we describe our efforts on porting, optimizing and tuning of Large-scale Atomic/Molecular Massively Parallel Simulator, a popular MD framework, on heterogeneous architectures: multi-core processors with graphical processing unit (GPU) accelerators. Our implementation is based on accelerating the most computationally expensive non-bonded interaction terms on the GPUs and overlapping the computation on the CPU and GPUs. This functionality is built on top of message passing interface that allows multi-level parallelism to be extracted even at the workstation level with the multi-core CPUs and allows extension of the implementation on GPU-enabled clusters. We hypothesize that the optimal benefit of heterogeneous architectures for applications will come by utilizing all possible resources (for example, CPU-cores and GPU devices on GPU-enabled clusters). Benchmarks for a range of biomolecular system sizes are provided, and an analysis is performed on four generations of NVIDIA's GPU devices. On GPU-enabled Linux clusters, by overlapping and pipelining computation and communication, we observe up to 10-folds application acceleration in multi-core and multi-GPU environments illustrating significant performance improvements. Detailed analysis of the implementation is presented that allows identification of bottlenecks in algorithm, indicating that code optimization and improvements on GPUs could allow microsecond scale simulation throughput on workstations and inexpensive GPU clusters, putting widely desired biologically relevant simulation time-scales within reach of a large user community. In order to systematically optimize simulation throughput and to enable performance prediction, we have developed a parameterized performance model that will allow developers and users to explore the performance potential of future heterogeneous systems for biological simulations.

Agarwal, Pratul K.↗

Insights into the origin of halo mass profiles from machine learning

ABSTRACT The mass distribution of dark matter haloes is the result of the hierarchical growth of initial density perturbations through mass accretion and mergers. We use an interpretable machine-learning framework to provide physical insights into the origin of the spherically-averaged mass profile of dark matter haloes. We train a gradient-boosted-trees algorithm to predict the final mass profiles of cluster-sized haloes, and measure the importance of the different inputs provided to the algorithm. We find two primary scales in the initial conditions (ICs) that impact the final mass profile: the density at approximately the scale of the haloes’ Lagrangian patch RL ($R\sim 0.7\, R_L$) and that in the large-scale environment (R ∼ 1.7 RL). The model also identifies three primary time-scales in the halo assembly history that affect the final profile: (i) the formation time of the virialized, collapsed material inside the halo, (ii) the dynamical time, which captures the dynamically unrelaxed, infalling component of the halo over its first orbit, (iii) a third, most recent time-scale, which captures the impact on the outer profile of recent massive merger events. While the inner profile retains memory of the ICs, this information alone is insufficient to yield accurate predictions for the outer profile. As we add information about the haloes’ mass accretion history, we find a significant improvement in the predicted profiles at all radii. Our machine-learning framework provides novel insights into the role of the ICs and the mass assembly history in determining the final mass profile of cluster-sized haloes.

79 ASTRONOMY AND ASTROPHYSICS↗

Bounded motion design in the Earth zonal problem using differential algebra based normal form methods

Establishing long-term relative bounded motion between orbits in perturbed dynamics is a key challenge in astrodynamics to enable cluster flight with minimum propellant expenditure. Herein, we present an approach that allows for the design of long-term relative bounded motion considering a zonal gravitational model. Entire sets of orbits are obtained via high-order Taylor expansions of Poincarè return maps about reference fixed points. The high-order normal form algorithm is used to determine a change in expansion variables of the map into normal form space, in which the phase space behavior is circular and can be easily parameterized by action–angle coordinates. The action–angle representation of the normal form coordinates is then used to parameterize the original Poincarè return map and average it over a full phase space revolution by a path integral along the angle parameterization. As a result, the averaged nodal period and drift in the ascending node are obtained, for which the bounded motion conditions are straightforwardly imposed. Sets of highly accurate bounded orbits are obtained, extending over several thousand kilometers, and valid for decades.

79 ASTRONOMY AND ASTROPHYSICS↗

Robust clustering of the local Milky Way stellar kinematic substructures with Gaia eDR3

Understanding local stellar kinematic substructures in the solar neighbourhood helps build a complete picture of the formation of the Milky Way, as well as an empirical phase space distribution of dark matter that would inform detection experiments. We apply the clustering algorithm HDBSCAN on the Gaia early third data release to identify a list of stable clusters in velocity space and action-angle space by taking into account the measurement uncertainties and studying the stability of the clustering results. We find 1405 (497) stars in 23 (6) robust clusters in velocity space (action-angle space) that are consistently not associated with noise. We discuss the kinematic properties of these structures and study whether many of the small clusters belong to a similar larger cluster based on their chemical abundances. They are attributed to the known structures: the Gaia Sausage-Enceladus, the Helmi Stream, and globular cluster NGC 3201 are found in both spaces, while NGC 104 and the thick disc (Sequoia) are identified in velocity space (action-angle space). Although we do not identify any new structures, we find that the HDBSCAN member selection of already known structures is unstable to input kinematics of the stars when resampled within their uncertainties. We therefore present the stable subset of local kinematic structures, which are consistently identified by the clustering algorithm, and emphasize the need to take into account error propagation during both the manual and automated identification of stellar structures, both for existing ones as well as future discoveries.

79 ASTRONOMY AND ASTROPHYSICS↗