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 163 records · Page 9

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↗

Implementing Molecular Dynamics on Hybrid High Performance Computers - Particle-Particle Particle-Mesh

The use of accelerators such as graphics processing units (GPUs) has become popular in scientific computing applications due to their low cost, impressive floating-point capabilities, high memory bandwidth, and low electrical power requirements. Hybrid high-performance computers, machines with nodes containing more than one type of floating-point processor (e.g. CPU and GPU), are now becoming more prevalent due to these advantages. In this paper, we present a continuation of previous work implementing algorithms for using accelerators into the LAMMPS molecular dynamics software for distributed memory parallel hybrid machines. In our previous work, we focused on acceleration for short-range models with an approach intended to harness the processing power of both the accelerator and (multi-core) CPUs. To augment the existing implementations, we present an efficient implementation of long-range electrostatic force calculation for molecular dynamics. Specifically, we present an implementation of the particle-particle particle-mesh method based on the work by Harvey and De Fabritiis. We present benchmark results on the Keeneland InfiniBand GPU cluster. We provide a performance comparison of the same kernels compiled with both CUDA and OpenCL. We discuss limitations to parallel efficiency and future directions for improving performance on hybrid or heterogeneous computers.

97 MATHEMATICS AND COMPUTING↗

ReaxFF molecular dynamics simulations of electrolyte–water systems at supercritical temperature

We have performed ReaxFF molecular dynamics simulations of alkali metal–chlorine pairs in different water densities at supercritical temperature (700 K) to elucidate the structural and dynamical properties of the system. The radial distribution function and the angular distribution function explain the inter-ionic structural and orientational arrangements of atoms during the simulation. The coordination number of water molecules in the solvation shell of ions increases with an increase in the radius of ions. We find that the self-diffusion coefficient of metal ions increases with a decrease in density under supercritical conditions due to the formation of voids within the system. The hydrogen bond dynamics has been interpreted by the residence time distribution of various ions, which shows Li+ having the highest water retaining capability. The void distribution within the system has been analyzed by using the Voronoi polyhedra algorithm providing an estimation of void formation within the system at high temperatures. We observe the formation of salt clusters of Na+ and K+ at low densities due to the loss of dielectric constants of ions. The diffusion of ions gets altered dramatically due to the formation of voids and nucleation of ions in the system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs

DBSCAN is a well-known density-based clustering algorithm to discover arbitrary shape clusters. While conceptually simple in serial, the algorithm is challenging to efficiently parallelize on manycore GPU architectures. Common pitfalls, such as asynchronous range query calls, result in high thread execution divergence in many implementations. In this paper, we propose a new framework for GPU-accelerated DBSCAN, and describe two tree-based algorithms within that framework. Both algorithms fuse the search for neighbors with updating cluster information, but differ in their treatment of dense regions of the data. We show that the time taken to compute clusters is at most twice that of determination of the neighbors. We compare the proposed algorithms with existing CPU and GPU implementations, and demonstrate their competitiveness and performance using a fast traversal structure (bounding volume hierarchy) for low dimensional data. We also show that the memory usage can be reduced by processing object neighbors dynamically without storing them.

Prokopenko, Andrey↗

Numerical Simulations of High Enthalpy Pulse Facilities

Axisymmetric flows within shock tubes and expansion tubes are simulated including the effects of finite rate chemistry and both laminar and turbulent boundary layers. The simulations demonstrate the usefulness of computational fluid dynamics for characterizing the flows in high enthalpy pulse facilities. The modeling and numerical requirements necessary to simulate these flows accurately are also discussed. Although there is a large body of analysis which explains and quantifies the boundary layer growth between the shock and the interface in a shock tube, there is a need for more detailed solutions. Phenomena such as thermochemical nonequilibrium. or turbulent transition behind the shock are excluded in the assumptions of Mirels' analysis. Additionally there is inadequate capability to predict the influence of the boundary layer on the expanded gas behind the interface. Quantifying the gas in this region is particularly important in expansion tubes because it is the location of the test gas. Unsteady simulations of the viscous flow in shock tubes are computationally expensive because they must follow features such as a shock wave over the length of the facility and simultaneously resolve the small length scales within the boundary layer. As a result, efficient numerical algorithms are required. The numerical approach of the present work is to solve the axisymmetric gas dynamic equations using an finite-volume formulation where the inviscid fluxes are computed with a upwind TVD scheme. Multiple species equations are included in the formulation so that finite-rate chemistry can be modeled. The simulations cluster grid points at the shock and interface and translate this clustered grid with these features to minimize numerical errors. The solutions are advanced at a CFL number of less than one based on the inviscid gas dynamics. To avoid limitations on the time step due to the viscous terms, these terms are treated implicitly. This requires a block tri-diagonal matrix inversion along each line of cells normal to the wall. The cost of this inversion is more than offset by the larger allowable time step. The source terms representing the finite-rate chemical kinetics are also treated implicitly. An algebraic turbulence model for compressible flow is used. The flow in a low pressure shock tube is computed and the results are compared with Mirels'analysis. The driven gas is nitrogen at 70 Pa, and the incident shock speed is approximately 2.9 km/sec so that there is little dissociation. The simulations include a laminar boundary layer and are run until the limiting flow regime is achieved. At this limit, the shock and interface travel at the same velocity because the amount of driven gas between these two features remains the same: the mass flow across the shock is equal to the mass of gas being entrained at the interface by the boundary layer. Simulations with several grids are presented to establish the grid independence of the solution, Good agreement is achieved between Mirels' correlations and the computations. This is expected since the flow conditions are chosen to be consistent with the assumptions used in Mirels' analysis. This comparison adds credibility to the numerical approach and highlights some of the differences between the theory and the detailed simulations. In addition, simulations of the HYPULSE expansion tube are presented for two operating conditions and the computations are compared to experimental data. The operating gas for both cases is nitrogen. One test condition is at a total enthalpy of 15.2 MJ/Kg and a relatively low pressure of 2 kPa. This case is characterized by a laminar boundary layer and significant chemical nonequilibrium. in the acceleration gas. The second test condition is at a total enthalpy of 10.2 MJ/Kg and a pressure of 38 kPa and is characterized by a turbulent boundary layer. The simulations compare well with experiment and reveal that the nonuniformity in pressure observed during the test time is related to variations in the boundary layer displacement thickness.

Wilson, Gregory J.↗

Automated Knowledge Discovery From Simulators

A computational method, SimLearn, has been devised to facilitate efficient knowledge discovery from simulators. Simulators are complex computer programs used in science and engineering to model diverse phenomena such as fluid flow, gravitational interactions, coupled mechanical systems, and nuclear, chemical, and biological processes. SimLearn uses active-learning techniques to efficiently address the "landscape characterization problem." In particular, SimLearn tries to determine which regions in "input space" lead to a given output from the simulator, where "input space" refers to an abstraction of all the variables going into the simulator, e.g., initial conditions, parameters, and interaction equations. Landscape characterization can be viewed as an attempt to invert the forward mapping of the simulator and recover the inputs that produce a particular output. Given that a single simulation run can take days or weeks to complete even on a large computing cluster, SimLearn attempts to reduce costs by reducing the number of simulations needed to effect discoveries. Unlike conventional data-mining methods that are applied to static predefined datasets, SimLearn involves an iterative process in which a most informative dataset is constructed dynamically by using the simulator as an oracle. On each iteration, the algorithm models the knowledge it has gained through previous simulation trials and then chooses which simulation trials to run next. Running these trials through the simulator produces new data in the form of input-output pairs. The overall process is embodied in an algorithm that combines support vector machines (SVMs) with active learning. SVMs use learning from examples (the examples are the input-output pairs generated by running the simulator) and a principle called maximum margin to derive predictors that generalize well to new inputs. In SimLearn, the SVM plays the role of modeling the knowledge that has been gained through previous simulation trials. Active learning is used to determine which new input points would be most informative if their output were known. The selected input points are run through the simulator to generate new information that can be used to refine the SVM. The process is then repeated. SimLearn carefully balances exploration (semi-randomly searching around the input space) versus exploitation (using the current state of knowledge to conduct a tightly focused search). During each iteration, SimLearn uses not one, but an ensemble of SVMs. Each SVM in the ensemble is characterized by different hyper-parameters that control various aspects of the learned predictor - for example, whether the predictor is constrained to be very smooth (nearby points in input space lead to similar output predictions) or whether the predictor is allowed to be "bumpy." The various SVMs will have different preferences about which input points they would like to run through the simulator next. SimLearn includes a formal mechanism for balancing the ensemble SVM preferences so that a single choice can be made for the next set of trials.

Burl, Michael↗

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↗

Proceedings from the 2nd International Symposium on Formation Flying Missions and Technologies

Topics discussed include: The Stellar Imager (SI) "Vision Mission"; First Formation Flying Demonstration Mission Including on Flight Nulling; Formation Flying X-ray Telescope in L2 Orbit; SPECS: The Kilometer-baseline Far-IR Interferometer in NASA's Space Science Roadmap Presentation; A Tight Formation for Along-track SAR Interferometry; Realization of the Solar Power Satellite using the Formation Flying Solar Reflector; SIMBOL-X : Formation Flying for High-Energy Astrophysics; High Precision Optical Metrology for DARWIN; Close Formation Flight of Micro-Satellites for SAR Interferometry; Station-Keeping Requirements for Astronomical Imaging with Constellations of Free-Flying Collectors; Closed-Loop Control of Formation Flying Satellites; Formation Control for the MAXIM Mission; Precision Formation Keeping at L2 Using the Autonomous Formation Flying Sensor; Robust Control of Multiple Spacecraft Formation Flying; Virtual Rigid Body (VRB) Satellite Formation Control: Stable Mode-Switching and Cross-Coupling; Electromagnetic Formation Flight (EMFF) System Design, Mission Capabilities, and Testbed Development; Navigation Algorithms for Formation Flying Missions; Use of Formation Flying Small Satellites Incorporating OISL's in a Tandem Cluster Mission; Semimajor Axis Estimation Strategies; Relative Attitude Determination of Earth Orbiting Formations Using GPS Receivers; Analysis of Formation Flying in Eccentric Orbits Using Linearized Equations of Relative Motion; Conservative Analytical Collision Probabilities for Orbital Formation Flying; Equations of Motion and Stability of Two Spacecraft in Formation at the Earth/Moon Triangular Libration Points; Formations Near the Libration Points: Design Strategies Using Natural and Non-Natural Ares; An Overview of the Formation and Attitude Control System for the Terrestrial Planet Finder Formation Flying Interferometer; GVE-Based Dynamics and Control for Formation Flying Spacecraft; GNC System Design for a New Concept of X-Ray Distributed Telescope; GNC System for the Deployment and Fine Control of the DARWIN Free-Flying Interferometer; Formation Algorithm and Simulation Testbed; and PLATFORM: A Formation Flying, RvD and Robotic Validation Test-bench.

Source record↗

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↗