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

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↗

GPU acceleration of Swendsen–Wang dynamics

When simulating a lattice system near its critical temperature, local algorithms for modeling the system’s evolution can introduce very large autocorrelation times into sampled data. Here, this critical slowing down places restrictions on the analysis that can be completed in a timely manner of the behavior of systems around the critical point. Because it is often desirable to study such systems around this point, a new algorithm must be introduced. Therefore, we turn to cluster algorithms, such as the Swendsen–Wang algorithm and the Wolff clustering algorithm. They incorporate global updates which generate new lattice configurations with little correlation to previous states, even near the critical point. We look to accelerate the rate at which these algorithm are capable of running by implementing and benchmarking a parallel implementation of each algorithm designed to run on GPUs under NVIDIA’s CUDA framework. A 17 and 90 fold increase in the computational rate was, respectively, experienced when measured against the equivalent algorithm implemented in serial code.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Choreographing Couch and Collimator in Volumetric Modulated Arc Therapy

Purpose: To design and optimize trajectory-based, noncoplanar subarcs for volumetric modulated arc therapy (VMAT) deliverable on both Varian TrueBEAM system and traditional accelerators; and to investigate their potential advantages for treating central nervous system (CNS) tumors. Methods and Materials: To guide the computerized selection of beam trajectories consisting of simultaneous couch, gantry, and collimator motion, a score function was implemented to estimate the geometric overlap between targets and organs at risk for each couch/gantry angle combination. An initial set of beam orientations is obtained as a function of couch and gantry angle, according to a minimum search of the score function excluding zones of collision. This set is grouped into multiple continuous and extended subarcs subject to mechanical limitations using a hierarchical clustering algorithm. After determination of couch/gantry trajectories, a principal component analysis finds the collimator angle at each beam orientation that minimizes residual target-organ at risk overlaps. An in-house VMAT optimization algorithm determines the optimal multileaf collimator position and monitor units for control points within each subarc. A retrospective study of 10 CNS patients compares the proposed method of VMAT trajectory with dynamic gantry, leaves, couch, and collimator motion (Tra-VMAT); a standard noncoplanar VMAT with no couch/collimator motion within subarcs (Std-VMAT); and noncoplanar intensity-modulated radiotherapy (IMRT) plans that were clinically used. Results: Tra-VMAT provided improved target dose conformality and lowered maximum dose to brainstem, optic nerves, and chiasm by 7.7%, 1.1%, 2.3%, and 1.7%, respectively, compared with Std-VMAT. Tra-VMAT provided higher planning target volume minimum dose and reduced maximum dose to chiasm, optic nerves, and cochlea by 6.2%, 1.3%, 6.3%, and 8.4%, respectively, and reduced cochlea mean dose by 8.7%, compared with IMRT. Tra-VMAT averaged beam-on time was comparable to Std-VMAT but significantly (45%) less than IMRT. Conclusion: Optimized couch, gantry, and collimator trajectories may be integrated into VMAT with improved mechanical flexibility and may provide better dosimetric properties and improved efficiency in the treatment of CNS tumors.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Quantification of electron correlation for approximate quantum calculations

State-of-the-art many-body wave function techniques rely on heuristics to achieve high accuracy at an attainable computational cost to solve the many-body Schrödinger equation. By far, the most common property used to assess accuracy has been the total energy; however, total energies do not give a complete picture of electron correlation. In this work, we assess the von Neumann entropy of the one-particle reduced density matrix (1-RDM) to compare selected configuration interaction (CI), coupled cluster, variational Monte Carlo, and fixed-node diffusion Monte Carlo for benchmark hydrogen chains. A new algorithm, the circle reject method, is presented, which improves the efficiency of evaluating the von Neumann entropy using quantum Monte Carlo by several orders of magnitude. The von Neumann entropy of the 1-RDM and the eigenvalues of the 1-RDM are shown to distinguish between the dynamic correlation introduced by the Jastrow and the static correlation introduced by determinants with large weights, confirming some of the lore in the field concerning the difference between the selected CI and Slater–Jastrow wave functions.

Chemistry↗

A SYSTEMATIC ANALYSIS OF CAUSTIC METHODS FOR GALAXY CLUSTER MASSES

We quantify the expected observed statistical and systematic uncertainties of the escape velocity as a measure of the gravitational potential and total mass of galaxy clusters. We focus our attention on low redshift (z {<=}0.15) clusters, where large and deep spectroscopic datasets currently exist. Utilizing a suite of Millennium Simulation semi-analytic galaxy catalogs, we find that the dynamical mass, as traced by either the virial relation or the escape velocity, is robust to variations in how dynamical friction is applied to ''orphan'' galaxies in the mock catalogs (i.e., those galaxies whose dark matter halos have fallen below the resolution limit). We find that the caustic technique recovers the known halo masses (M{sub 200}) with a third less scatter compared to the virial masses. The bias we measure increases quickly as the number of galaxies used decreases. For N{sub gal} > 25, the scatter in the escape velocity mass is dominated by projections along the line-of-sight. Algorithmic uncertainties from the determination of the projected escape velocity profile are negligible. We quantify how target selection based on magnitude, color, and projected radial separation can induce small additional biases into the escape velocity masses. Using N{sub gal} = 150 (25), the caustic technique has a per cluster scatter in ln (M|M{sub 200}) of 0.3 (0.5) and bias 1% {+-} 3{r_brace} (16% {+-} 5{r_brace}) for clusters with masses >10{sup 14} M{sub Sun} at z < 0.15.

79 ASTRONOMY AND ASTROPHYSICS↗

Machine Learning-Guided Approach for Studying Solvation Environments

Molecular-level understanding and characterization of solvation environments are often needed across chemistry, biology, and engineering. Toward practical modeling of local solvation effects of any solute in any solvent, in this work, we report a static and all-quantum mechanics-based cluster-continuum approach for calculating single-ion solvation free energies. This approach uses a global optimization procedure to identify low-energy molecular clusters with different numbers of explicit solvent molecules and then employs the smooth overlap for atomic positions learning kernel to quantify the similarity between different low-energy solute environments. From these data, we use sketch maps, a nonlinear dimensionality reduction algorithm, to obtain a two-dimensional visual representation of the similarity between solute environments in differently sized microsolvated clusters. After testing this approach on different ions having charges 2+, 1+, 1–, and 2–, we find that the solvation environment around each ion can be seen to usually become more similar in hand with its calculated single-ion solvation free energy. Without needing either dynamics simulations or an a priori knowledge of local solvation structure of the ions, this approach can be used to calculate solvation free energies within 5% of experimental measurements for most cases, and it should be transferable for the study of other systems where dynamics simulations are not easily carried out.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A WIDE-FIELD PHOTOMETRIC SURVEY FOR EXTRATIDAL TAILS AROUND FIVE METAL-POOR GLOBULAR CLUSTERS IN THE GALACTIC HALO

Wide-field deep g'r'i' images obtained with the Megacam of the Canada-France-Hawaii Telescope are used to investigate the spatial configuration of stars around five metal-poor globular clusters M15, M30, M53, NGC 5053, and NGC 5466, in a field-of-view {approx}3 deg. Applying a mask filtering algorithm to the color-magnitude diagrams of the observed stars, we sorted cluster's member star candidates that are used to examine the characteristics of the spatial stellar distribution surrounding the target clusters. The smoothed surface density maps and the overlaid isodensity contours indicate that all of the five metal-poor globular clusters exhibit strong evidence of extratidal overdensity features over their tidal radii, in the form of extended tidal tails around the clusters. The orientations of the observed extratidal features show signatures of tidal tails tracing the clusters' orbits, inferred from their proper motions, and effects of dynamical interactions with the Galaxy. Our findings include detections of a tidal bridge-like feature and an envelope structure around the pair of globular clusters M53 and NGC 5053. The observed radial surface density profiles of target clusters have a deviation from theoretical King models, for which the profiles show a break at 0.5-0.7r{sub t} , extending the overdensity features out to 1.5-2r{sub t} . Both radial surface density profiles for different angular sections and azimuthal number density profiles confirm the overdensity features of tidal tails around the five metal-poor globular clusters. Our results add further observational evidence that the observed metal-poor halo globular clusters originate from an accreted satellite system, indicative of the merging scenario of the formation of the Galactic halo.

79 ASTRONOMY AND ASTROPHYSICS↗

Scalable Static and Dynamic Community Detection Using Grappolo

Graph clustering, popularly known as community detection, is a fundamental kernel for several applications of relevance to the Defense Advanced Research Projects Agency’s (DARPA) Hierarchical Identify Verify Exploit (HIVE) Pro- gram. Clusters or communities represent natural divisions within a network that are densely connected within a cluster and sparsely connected to the rest of the network. The need to compute clustering on large scale data necessitates the development of efficient algorithms that can exploit modern architectures that are fundamentally parallel in nature. How- ever, due to their irregular and inherently sequential nature, many of the current algorithms for community detection are challenging to parallelize. In response to the HIVE Graph Challenge, we present several parallelization heuristics for fast community detection using the Louvain method as the serial template. We implement all the heuristics in a software library called Grappolo. Using the inputs from the HIVE Challenge, we demonstrate superior performance and high quality solutions based on four parallelization heuristics. We use Grappolo on static graphs as the first step towards community detection on streaming graphs.

Community Detection↗

Diffusion Monte Carlo approaches for studying nuclear quantum effects in fluxional molecules

Abstract Diffusion quantum Monte Carlo (DMC) provides a powerful approach for obtaining the ground state energy and wave function of molecules, ions, and molecular clusters. The approach is uniquely well suited for studies of fluxional molecules, which undergo large amplitude vibrational motions even in their ground state. In contrast to the electronic structure problem, where the wave function must be antisymmetric with respect to exchange of any pair of electrons, the wave function for the ground vibrational state is nodeless. This greatly simplifies the application of DMC for vibrational problems. Because there is not a single potential function that can be used to describe the intramolecular and intermolecular interactions in all molecular systems, most methods that are used to describe nuclear quantum effects rely on a carefully chosen zero‐order description of the molecular vibrations. In contrast, DMC calculations can be performed in Cartesian coordinates, making the DMC algorithm easily transferable between different chemical systems. In this contribution, the theory that underlies DMC will be discussed along with important considerations for performing DMC calculations. Extensions for evaluating vibrationally excited states and molecular properties are also discussed. Insights that can be obtained from DMC calculations are illustrated in the context of the protonated water clusters. This article is categorized under: Molecular and Statistical Mechanics > Molecular Dynamics and Monte‐Carlo Methods Theoretical and Physical Chemistry > Spectroscopy

Chemistry↗

Nonradiative relaxation dynamics in the [Au 25- n Ag n (SH) 18 ] -1 ( n = 1, 12, 25) thiolate-protected nanoclusters

Evaluation of the electron-nuclear dynamics and relaxation mechanisms of gold and silver nanoclusters and their alloys is important for future photocatalytic, light harvesting, and photoluminescence applications of these systems. In this work, the effect of silver doping on the nonradiative excited state relaxation dynamics of the atomically precise thiolate-protected gold nanocluster [Au 25- n Ag n (SH) 18 ] –1 ( n = 1, 12, 25) is studied theoretically. Time-dependent density functional theory is used to study excited states lying in the energy range 0.0–2.5 eV. The fewest switches surface hopping method with decoherence correction was used to investigate the dynamics of these states. The HOMO–LUMO gap increases significantly upon doping of 12 silver atoms but decreases for the pure silver nanocluster. Doped clusters show a different response for ground state population increase lifetimes and excited state population decay times in comparison to the undoped system. The ground state recovery times of the S 1 –S 6 states in the first excited peak were found to be longer for [Au 13 Ag 12 (SH) 18 ] –1 than the corresponding recovery times of other studied nanoclusters, suggesting that this partially doped nanocluster is best for preserving electrons in an excited state. The decay time constants were in the range of 2.0–20 ps for the six lowest energy excited states. Among the higher excited states, S 7 has the slowest decay time constant although it occurs more quickly than S 1 decay. Overall, these clusters follow common decay time constant trends and relaxation mechanisms due to the similarities in their electronic structures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

iTOUGH2 v7.1

iTOUGH2 (inverse TOUGH2) provides inverse modeling capabilities for TOUGH2, a simulator for multi-dimensional, multi-phase, multi-component, non-isothermal flow and transport in fractured porous media. iTOUGH2 performs sensitivity analyses, data-worth analyses, parameter estimation, and uncertainty propagation analyses in geosciences and reservoir engineering and other application areas. iTOUGH2 supports a number of different combinations of fluids and components (equation-of-state (EOS) modules). In addition, the optimization routines implemented in iTOUGH2 can also be used for sensitivity analysis, automatic model calibration, and uncertainty quantification of any external code that uses text-based input and output files using the PEST protocol. iTOUGH2 solves the inverse problem by minimizing a non-linear objective function of the weighted differences between model output and the corresponding observations. Multiple minimization algorithms (derivative-free, gradient-based, and second-order; local and global) are available. iTOUGH2 also performs Latin Hypercube Monte Carlo simulations for uncertainty propagation analyses. A detailed residual and error analysis is provided. This upgrade includes (a) global sensitivity analysis methods, (b) dynamic memory allocation (c) additional input features and output analyses, (d) increased forward simulation capabilities, (e) parallel execution on multicore PCs and Linux clusters, and (f) bug fixes.

Finsterle, Stefan↗

Solutions of the two-dimensional Hubbard model: Benchmarks and results from a wide range of numerical algorithms

Numerical results for ground-state and excited-state properties (energies, double occupancies, and Matsubara-axis self-energies) of the single-orbital Hubbard model on a two-dimensional square lattice are presented, in order to provide an assessment of our ability to compute accurate results in the thermodynamic limit. Many methods are employed, including auxiliary-field quantum Monte Carlo, bare and bold-line diagrammatic Monte Carlo, method of dual fermions, density matrix embedding theory, density matrix renormalization group, dynamical cluster approximation, diffusion Monte Carlo within a fixed-node approximation, unrestricted coupled cluster theory, and multireference projected Hartree-Fock methods. Comparison of results obtained by different methods allows for the identification of uncertainties and systematic errors. The importance of extrapolation to converged thermodynamic-limit values is emphasized. Furthermore, cases where agreement between different methods is obtained establish benchmark results that may be useful in the validation of new approaches and the improvement of existing methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Influence of molecular clustering on the interpretation of diffractograms of hydrocarbon films from tokamak T-10

The influence of molecular clustering on the formerly suggested interpretation of diffraction patterns of hydrocarbon films formed in the vacuum vessel of the tokamak T-10 is analyzed numerically. The simulation of clustering of simple hydrocarbon molecules C(D, H){sub 4}, C{sub 2}(D, H){sub 4}, and C{sub 6}(D, H){sub 6} and molecules composed of curved graphene (fullerenes and toroidal nanotubes) is carried out with the rigid body molecular dynamics method. It is shown that formerly neglected atomic correlations C–C and C–D(H) in the amorphous hydrocarbon component decrease the calculated values of the scattered intensity in the range of scattering vector modulus 5 < q < 20 nm{sup –1} because of homogenization of scatters on the spatial scale of ∼1 nm. The allowance for these correlations does not change the diffraction patterns in the range q > 20 nm{sup –1}. The results suggest the necessity to introduce to the procedure of determining the structural content of the films, similar to those from the tokamak T-10, the clusters formed by the van der Waals adhesion of hydrocarbon molecules to “graphene” nanoparticles. This simplifies the mathematical optimization to the former level of complexity—but for an extended ensemble of objects—and makes it possible to calculate the diffraction patterns of these objects using the distributed computing resources. A modified algorithm of structural content identification on the basis of joint X-ray and neutron diffractometry is suggested.

36 MATERIALS SCIENCE↗

‘Flux+Mutability’: a conditional generative approach to one-class classification and anomaly detection

Abstract Anomaly Detection is becoming increasingly popular within the experimental physics community. At experiments such as the Large Hadron Collider, anomaly detection is growing in interest for finding new physics beyond the Standard Model. This paper details the implementation of a novel Machine Learning architecture, called Flux+Mutability, which combines cutting-edge conditional generative models with clustering algorithms. In the ‘flux’ stage we learn the distribution of a reference class. The ‘mutability’ stage at inference addresses if data significantly deviates from the reference class. We demonstrate the validity of our approach and its connection to multiple problems spanning from one-class classification to anomaly detection. In particular, we apply our method to the isolation of neutral showers in an electromagnetic calorimeter and show its performance in detecting anomalous dijets events from standard QCD background. This approach limits assumptions on the reference sample and remains agnostic to the complementary class of objects of a given problem. We describe the possibility of dynamically generating a reference population and defining selection criteria via quantile cuts. Remarkably this flexible architecture can be deployed for a wide range of problems, and applications like multi-class classification or data quality control are left for further exploration.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bayesian analysis of the dynamic cosmic web in the SDSS galaxy survey

Recent application of the Bayesian algorithm \textsc(borg) to the Sloan Digital Sky Survey (SDSS) main sample galaxies resulted in the physical inference of the formation history of the observed large-scale structure from its origin to the present epoch. In this work, we use these inferences as inputs for a detailed probabilistic cosmic web-type analysis. To do so, we generate a large set of data-constrained realizations of the large-scale structure using a fast, fully non-linear gravitational model. We then perform a dynamic classification of the cosmic web into four distinct components (voids, sheets, filaments, and clusters) on the basis of the tidal field. Our inference framework automatically and self-consistently propagates typical observational uncertainties to web-type classification. As a result, this study produces accurate cosmographic classification of large-scale structure elements in the SDSS volume. By also providing the history of these structure maps, the approach allows an analysis of the origin and growth of the early traces of the cosmic web present in the initial density field and of the evolution of global quantities such as the volume and mass filling fractions of different structures. For the problem of web-type classification, the results described in this work constitute the first connection between theory and observations at non-linear scales including a physical model of structure formation and the demonstrated capability of uncertainty quantification. A connection between cosmology and information theory using real data also naturally emerges from our probabilistic approach. Our results constitute quantitative chrono-cosmography of the complex web-like patterns underlying the observed galaxy distribution.

79 ASTRONOMY AND ASTROPHYSICS↗

An Advanced N -body Model for Interacting Multiple Stellar Systems

We construct an advanced model for interacting multiple stellar systems in which we compute all trajectories with a numerical N -body integrator, namely the Bulirsch–Stoer from the SWIFT package. We can then derive various observables: astrometric positions, radial velocities, minima timings (TTVs), eclipse durations, interferometric visibilities, closure phases, synthetic spectra, spectral energy distribution, and even complete light curves. We use a modified version of the Wilson–Devinney code for the latter, in which the instantaneous true phase and inclination of the eclipsing binary are governed by the N -body integration. If all of these types of observations are at one’s disposal, a joint χ {sup 2} metric and an optimization algorithm (a simplex or simulated annealing) allow one to search for a global minimum and construct very robust models of stellar systems. At the same time, our N -body model is free from artifacts that may arise if mutual gravitational interactions among all components are not self-consistently accounted for. Finally, we present a number of examples showing dynamical effects that can be studied with our code and we discuss how systematic errors may affect the results (and how to prevent this from happening).

79 ASTRONOMY AND ASTROPHYSICS↗

Data-driven cyber attack detection and mitigation for decentralized wide-area protection and control in smart grids

Modern power systems have already evolved into complicated cyber physical systems (CPS), often referred to as smart grids, due to the continuous expansion of the electrical infrastructure, the augmentation of the number of heterogeneous system components and players, and the consequential application of a diversity of information and telecommunication technologies to facilitate the Wide Area Monitoring, Protection and Control (WAMPAC) of the day-to-day power system operation. Because of the reliance on cyber technologies, WAMPAC, among other critical functions, is prone to various malicious cyber attacks. Successful cyber attacks, especially those sabotage the operation of Bulk Electric System (BES), can cause great financial losses and social panics. Application of conventional IT security solutions is indispensable, but it often turns out to be insufficient to mitigate sophisticated attacks that deploy zero-day vulnerabilities or social engineering tactics. To further improve the resilience of the operation of smart grids when facing cyber attacks, it is desirable to make the WAMPAC functions per se capable of detecting various anomalies automatically, carrying out adaptive activity adjustments in time and thus staying unimpaired even under attack. Most of the existing research efforts attempt to achieve this by adding novel functional modules, such as model-based anomaly detectors, to the legacy centralized WAMPAC functions. In contrast, this dissertation investigates the application of data-driven algorithms in cyber attack detection and mitigation within a decentralized architecture aiming at improving the situational awareness and self-adaptiveness of WAMPAC. First part of the research focuses on the decentralization of System Integrity Protection Scheme (SIPS) with Multi-Agent System (MAS), within which the data-driven anomaly detection and optimal adaptive load shedding are further explored. An algorithm named as Support Vector Machine embedded Layered Decision Tree (SVMLDT) is proposed for the anomaly detection, which provides satisfactory detection accuracy as well as decision-making interpretability. The adaptive load shedding is carried out by every agent individually with dynamic programming. The load shedding relies on the load profile propagation among peer agents and the attack adaptiveness is accomplished by maintaining the historical mean of load shedding proportion. Load shedding only takes place after the consensus pertaining to the anomaly detection is achieved among all interconnected agents and it serves the purpose of mitigating certain cyber attacks. The attack resilience of the decentralized SIPS is evaluated using IEEE 39 bus model. It is shown that, unlike the traditional centralized SIPS, the proposed solution is able to carry out the remedial actions under most Denial of Service (DoS) attacks. The second part investigates the clustering based anomalous behavior detection and peer-assisted mitigation for power system generation control. To reduce the dimensionality of the data, three metrics are designed to interpret the behavior conformity of generator within the same balancing area. Semi-supervised K-means clustering and a density sensitive clustering algorithm based on Hierarchical DBSCAN (HDBSCAN) are both applied in clustering in the 3D feature space. Aiming to mitigate the cyber attacks targeting the generation control commands, a peer-assisted strategy is proposed. When the control commands from control center is detected as anomalous, i.e. either missing or the payload of which have been manipulated, the generating unit utilizes the peer data to infer and estimate a new generation adjustment value as replacement. Linear regression is utilized to obtain the relation of control values received by different generating units, Moving Target Defense (MTD) is adopted during the peer selection and 1-dimensional clustering is performed with the inferred control values, which are followed by the final control value estimation. The mitigation strategy proposed requires that generating units can communicate with each other in a peer-to-peer manner. Evaluation results suggest the efficacy of the proposed solution in counteracting data availability and data integrity attacks targeting the generation controls. However, the strategy stays effective only if less than half of the generating units are compromised and it is not able to mitigate cyber attacks targeting the measurements involved in the generation control.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Mining data in a dynamic PRA framework

Computational (also known as Dynamic) Probabilistic Risk Assessment (PRA) methods employs system simulation codes coupled with stochastic analysis tools in order to determine probabilities of certain outcomes such as system failure. In contrast to classical PRA methods (i.e., Event-Tree and Fault-Tree) in which timing and sequencing of events is set by the analyst, accident progression is dictated by the system control logic and its interaction with system temporal evolution. Due to the nature of the problem, Simulation-Based PRA methods require large amount of computationally expensive simulation runs. In addition, these methods usually generate a large number of simulation runs (database storage may be on the order of gigabytes or higher). In this paper we investigate and apply several methods and algorithms to analyze these large amounts of time-dependent data. Furthermore, the scope of this article is to present a broad overview of methods and algorithms that can be used to improve data quality and to analyze and extract information from large data sets containing time dependent data. In this context, “extracting information” means constructing input-output correlations, finding commonalities, and identifying outliers.

97 MATHEMATICS AND COMPUTING↗