SEARCH · Engineering Papers

Results for “topological data analysis”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

DOE OSTI2015

Multiresolution persistent homology for excessively large biomolecular datasets

Although persistent homology has emerged as a promising tool for the topological simplification of complex data, it is computationally intractable for large datasets. We introduce multiresolution persistent homology to handle excessively large datasets. We match the resolution with the scale of interest so as to represent large scale datasets with appropriate resolution. We utilize flexibility-rigidity index to access the topological connectivity of the data set and define a rigidity density for the filtration analysis. By appropriately tuning the resolution of the rigidity density, we are able to focus the topological lens on the scale of interest. The proposed multiresolution topological analysis is validated by a hexagonal fractal image which has three distinct scales. We further demonstrate the proposed method for extracting topological fingerprints from DNA molecules. In particular, the topological persistence of a virus capsid with 273 780 atoms is successfully analyzed which would otherwise be inaccessible to the normal point cloud method and unreliable by using coarse-grained multiscale persistent homology. The proposed method has also been successfully applied to the protein domain classification, which is the first time that persistent homology is used for practical protein domain analysis, to our knowledge. The proposed multiresolution topological method has potential applications in arbitrary data sets, such as social networks, biological networks, and graphs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1984

Topological grid structure - A data structure for earth science modeling

The automated analysis of land surface features is increasingly important to earth scientists. User-friendly algorithms for studying these features can be integrated into geographic information systems through the use of topological grid structure, which maintains the simplicity and transportability of standard grid structure while providing the essential capability to treat groups of contiguous, identically-classified pixels (corresponding to lakes, forests, fields, etc.) as distinct spatial entities.

Goldberg, M.↗

DOE OSTI2013

One-point remapping of Lagrangian perturbation theory in the mildly non-linear regime of cosmic structure formation

On the smallest scales, three-dimensional large-scale structure surveys contain a wealth of cosmological information which cannot be trivially extracted due to the non-linear dynamical evolution of the density field. Lagrangian perturbation theory (LPT) is widely applied to the generation of mock halo catalogs and data analysis. In this work, we compare topological features of the cosmic web such as voids, sheets, filaments and clusters, in the density fields predicted by LPT and full numerical simulation of gravitational large-scale structure formation. We propose a method designed to improve the correspondence between these density fields, in the mildly non-linear regime. We develop a computationally fast and flexible tool for a variety of cosmological applications. Our method is based on a remapping of the approximately-evolved density field, using information extracted from N-body simulations. The remapping procedure consists of replacing the one-point distribution of the density contrast by one which better accounts for the full gravitational dynamics. As a result, we obtain a physically more pertinent density field on a point-by-point basis, while also improving higher-order statistics predicted by LPT. We quantify the approximation error in the power spectrum and in the bispectrum as a function of scale and redshift. Our remapping procedure improves one-, two- and three-point statistics at scales down to 8 Mpc/h.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2013

Exploration of high-dimensional scalar function for nuclear reactor safety analysis and visualization

The next generation of methodologies for nuclear reactor Probabilistic Risk Assessment (PRA) explicitly accounts for the time element in modeling the probabilistic system evolution and uses numerical simulation tools to account for possible dependencies between failure events. The Monte-Carlo (MC) and the Dynamic Event Tree (DET) approaches belong to this new class of dynamic PRA methodologies. A challenge of dynamic PRA algorithms is the large amount of data they produce which may be difficult to visualize and analyze in order to extract useful information. We present a software tool that is designed to address these goals. We model a large-scale nuclear simulation dataset as a high-dimensional scalar function defined over a discrete sample of the domain. First, we provide structural analysis of such a function at multiple scales and provide insight into the relationship between the input parameters and the output. Second, we enable exploratory analysis for users, where we help the users to differentiate features from noise through multi-scale analysis on an interactive platform, based on domain knowledge and data characterization. Our analysis is performed by exploiting the topological and geometric properties of the domain, building statistical models based on its topological segmentations and providing interactive visual interfaces to facilitate such explorations. We provide a user's guide to our software tool by highlighting its analysis and visualization capabilities, along with a use case involving data from a nuclear reactor safety simulation. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2020

Geometry-Driven Detection, Tracking and Visual Analysis of Viscous and Gravitational Fingers

Viscous and gravitational flow instabilities cause a displacement front to break up into finger-like fluids. The detection and evolutionary analysis of these fingering instabilities are critical in multiple scientific disciplines such as fluid mechanics and hydrogeology. However, previous detection methods of the viscous and gravitational fingers are based on density thresholding, which provides limited geometric information of the fingers. The geometric structures of fingers and their evolution are important yet little studied in the literature. In this work, we explore the geometric detection and evolution of the fingers in detail to elucidate the dynamics of the instability. Additionally, we propose a ridge voxel detection method to guide the extraction of finger cores from three-dimensional (3D) scalar fields. After skeletonizing finger cores into skeletons, we design a spanning tree based approach to capture how fingers branch spatially from the finger skeletons. Finally, we devise a novel geometric-glyph augmented tracking graph to study how the fingers and their branches grow, merge, and split over time. Feedback from earth scientists demonstrates the usefulness of our approach to performing spatio-temporal geometric analyses of fingers.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Measurement of energy resolution with the NEXT-White silicon photomultipliers

The NEXT-White detector, a high-pressure gaseous xenon time projection chamber, demonstrated the excellence of this technology for future neutrinoless double beta decay searches using photomultiplier tubes (PMTs) to measure energy and silicon photomultipliers (SiPMs) to extract topology information. This analysis uses $^{83m}$Kr data from the NEXT-White detector to measure and understand the energy resolution that can be obtained with the SiPMs, rather than with PMTs. The energy resolution obtained of (10.9 ± 0.6)%, full-width half-maximum, is slightly larger than predicted based on the photon statistics resulting from very low light detection coverage of the SiPM plane in the NEXT-White detector. The difference in the predicted and measured resolution is attributed to poor corrections, which are expected to be improved with larger statistics. Furthermore, the noise of the SiPMs is shown to not be a dominant factor in the energy resolution and may be negligible when noise subtraction is applied appropriately, for high-energy events or larger SiPM coverage detectors. These results, which are extrapolated to estimate the response of large coverage SiPM planes, are promising for the development of future, SiPM-only, readout planes that can offer imaging and achieve similar energy resolution to that previously demonstrated with PMTs.[graphic not available: see fulltext]

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

NASA NTRS1989

Automated analysis for fluid flow topology

A new approach for visualizing vector data sets was developed by reducing the original vector field to a set of critical points and their connections, and was applied to fluid flow data sets. The critical point representation allows for considerable reduction in the data complexity. The representations are displayed as surfaces which are much simpler than the original data set, yet retain all the pertinent flow topology information. It is suggested that topological representations may be useful for database comparison.

Helman, James↗

DOE OSTI2013

Exploratory Nuclear Reactor Safety Analysis and Visualization via Integrated Topological and Geometric Techniques

A recent trend in the nuclear power engineering field is the implementation of heavily computational and time consuming algorithms and codes for both design and safety analysis. In particular, the new generation of system analysis codes aim to embrace several phenomena such as thermo-hydraulic, structural behavior, and system dynamics, as well as uncertainty quantification and sensitivity analyses. The use of dynamic probabilistic risk assessment (PRA) methodologies allows a systematic approach to uncertainty quantification. Dynamic methodologies in PRA account for possible coupling between triggered or stochastic events through explicit consideration of the time element in system evolution, often through the use of dynamic system models (simulators). They are usually needed when the system has more than one failure mode, control loops, and/or hardware/process/software/human interaction. Dynamic methodologies are also capable of modeling the consequences of epistemic and aleatory uncertainties. The Monte-Carlo (MC) and the Dynamic Event Tree (DET) approaches belong to this new class of dynamic PRA methodologies. The major challenges in using MC and DET methodologies (as well as other dynamic methodologies) are the heavier computational and memory requirements compared to the classical ET analysis. This is due to the fact that each branch generated can contain time evolutions of a large number of variables (about 50,000 data channels are typically present in RELAP) and a large number of scenarios can be generated from a single initiating event (possibly on the order of hundreds or even thousands). Such large amounts of information are usually very difficult to organize in order to identify the main trends in scenario evolutions and the main risk contributors for each initiating event. This report aims to improve Dynamic PRA methodologies by tackling the two challenges mentioned above using: 1) adaptive sampling techniques to reduce computational cost of the analysis and 2) topology-based methodologies to interactively visualize multidimensional data and extract risk-informed insights. Regarding item 1) we employ learning algorithms that aim to infer/predict simulation outcome and decide the coordinate in the input space of the next sample that maximize the amount of information that can be gained from it. Such methodologies can be used to both explore and exploit the input space. The later one is especially used for safety analysis scopes to focus samples along the limit surface, i.e. the boundaries in the input space between system failure and system success. Regarding item 2) we present a software tool that is designed to analyze multi-dimensional data. We model a large-scale nuclear simulation dataset as a high-dimensional scalar function defined over a discrete sample of the domain. First, we provide structural analysis of such a function at multiple scales and provide insight into the relationship between the input parameters and the output. Second, we enable exploratory analysis for users, where we help the users to differentiate features from noise through multi-scale analysis on an interactive platform, based on domain knowledge and data characterization. Our analysis is performed by exploiting the topological and geometric properties of the domain, building statistical models based on its topological segmentations and providing interactive visual interfaces to facilitate such explorations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2013

Topology for Statistical Modeling of Petascale Data

Many commonly used algorithms for mathematical analysis do not scale well enough to accommodate the size or complexity of petascale data produced by computational simulations. The primary goal of this project is to develop new mathematical tools that address both the petascale size and uncertain nature of current data. At a high level, the approach of the entire team involving all three institutions is based on the complementary techniques of combinatorial topology and statistical modelling. In particular, we use combinatorial topology to filter out spurious data that would otherwise skew statistical modelling techniques, and we employ advanced algorithms from algebraic statistics to efficiently find globally optimal fits to statistical models. The overall technical contributions can be divided loosely into three categories: (1) advances in the field of combinatorial topology, (2) advances in statistical modelling, and (3) new integrated topological and statistical methods. Roughly speaking, the division of labor between our 3 groups (Sandia Labs in Livermore, Texas A&M in College Station, and U Utah in Salt Lake City) is as follows: the Sandia group focuses on statistical methods and their formulation in algebraic terms, and finds the application problems (and data sets) most relevant to this project, the Texas A&M Group develops new algebraic geometry algorithms, in particular with fewnomial theory, and the Utah group develops new algorithms in computational topology via Discrete Morse Theory. However, we hasten to point out that our three groups stay in tight contact via videconference every 2 weeks, so there is much synergy of ideas between the groups. The following of this document is focused on the contributions that had grater direct involvement from the team at the University of Utah in Salt Lake City.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Search for neutrinoless β + EC decay of Te 120 with CUORE-0

Here, we have performed a search for neutrinoless $\beta^{+}\hspace{-0.2em}EC$ decay of $^{120}$Te using the final CUORE-0 data release. We describe a new analysis method for the simultaneous fit of signatures with different event topology, and of data subsets with different signal efficiency, obtaining a limit on the half-life of the decay of $T_{1/2}>1.6\cdot10^{21}$ yr at $90\%$ CI. Combining this with results from Cuoricino, a predecessor experiment, we obtain the strongest limit to date, corresponding to $T_{1/2}>2.7\cdot10^{21}$ yr at $90\%$ CI.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2017

Alternative High-Performance Motors with Non-Rare Earth Materials, Final Publishable Report

Electric drive systems, which include electric machines and power electronics, are a key enabling technology for advanced vehicle propulsion systems that reduce the petroleum dependence of the transportation sector. To have significant effect, electric drive technologies must be economical in terms of cost, weight, and size while meeting performance and reliability expectations. The goal of the project is to develop traction motors that reduce or eliminate the use of rare-earth materials and meet the DoE specifications for such a traction motor. This is accomplished by evaluating and developing multiple motor topologies in conjunction with advanced materials. Eight non-permanent magnet motor topologies and two reduced or non-rare earth motor topologies are analyzed and compared using a common set of requirements. Five of the motors are built and tested to validate the analysis. This paper provides a detailed quantitative comparison of the different machine topologies that reduce or eliminate rare-earth materials. Conclusions are drawn from the analysis and test data to show the tradeoffs related to selecting each of the motor topologies with the hope of providing practicing engineers and researchers in the field enough guidelines for choosing the “optimum” machine topology that suits their applications and set of performance requirements. Four materials technologies were investigated for their ability to enable a reduced rare earth electric motor. Two of the technologies were soft magnetic materials, one was a non-rare-earth containing permanent magnet technology, and the last was an insulation material. These processing and performance of these materials were first demonstrated in small coupons. The coupon tests justified proceeding to larger scale processing for two of the materials technologies: 1) a dual-phase soft magnetic material for use in rotor laminates and 2) a high temperature insulation material for use as a slot liner in the stator. The dual phase soft magnetic material was produced at a scale sufficient to build and test a sub-scale motor prototype. The high temperature insulation material was first evaluated in a series of “statorettes” before being demonstrated in the stator of one of the full-scale motor prototypes. Testing of the dual phase material revealed issues with process variability in larger production volumes that are being addressed in a subsequent project. The performance of the high-temperature slot liner insulation was demonstrated during the operation of a full-scale prototype. Furthermore, the insulation material was shown to survive aging tests of 2000 hours and 280 °C and 800 hours at 300 °C. This program provides analysis and data to accelerate the introduction of hybrid electric vehicles into the U.S. road vehicle fleet and bring the added benefits of reduced fuel consumption and environmental impacts

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2016

Topological analysis of void space in phosphate frameworks: Assessing storage properties for the environmentally important guest molecules and ions: CO 2 , H 2 O, UO 2 , PuO 2 , U, Pu, Sr 2+ , Cs + , CH 4 , and H 2

The entrapment of environmentally important materials to enable containment of polluting wastes from industry or energy production, storage of alternative fuels, or water sanitation, is of vital and immediate importance. Many of these materials are small molecules or ions that can be encapsulated via their adsorption into framework structures to create a host-guest complex. This is an ever-growing field of study and, as such, the search for more suitable porous materials for environmental applications is fundamental to progress. However, many industrial areas that require the use of adsorbents are fraught with practical challenges such as high temperatures, rapid gas expansion, radioactivity, or repetitive gas cycling, that the host material must withstand. Inorganic phosphates have a proven history of rigid structures, thermal stability, and are suspected to possess good resistance to radiation over geologic time scales. Furthermore, various experimental studies have established their ability to adsorb small molecules, such as water. In light of this, all known crystal structures of phosphate frameworks with meta- (P 3 O 9 ) or ultra- (P 5 O 14 ) stoichiometries are combined in a data-mining survey together with all theoretically possible structures of Ln a P b O c (where a, b, c are any integer, and Ln = La, Ce, Pr, Nd, Sm, Eu, Gd, Tb, Dy, Ho, Er, or Tm) that are statistically likely to form. Topological patterns within these framework structures are used to assess their suitability for hosting a variety of small guest molecules or ions that are important for environmental applications: CO 2 , H 2 O, UO 2 , PuO 2 , U, Pu, Sr 2+ , Cs + , CH 4 and H 2 . A range of viable phosphate-based host-guest complexes are identified from this data-mining and pattern-based structural analysis. Moreover, distinct topological preferences for hosting such guests are found, and metaphosphate stoichiometries are generally preferred over ultraphosphate configurations.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2013

Adaptive Sampling Algorithms for Probabilistic Risk Assessment of Nuclear Simulations

Nuclear simulations are often computationally expensive, time-consuming, and high-dimensional with respect to the number of input parameters. Thus exploring the space of all possible simulation outcomes is infeasible using finite computing resources. During simulation-based probabilistic risk analysis, it is important to discover the relationship between a potentially large number of input parameters and the output of a simulation using as few simulation trials as possible. This is a typical context for performing adaptive sampling where a few observations are obtained from the simulation, a surrogate model is built to represent the simulation space, and new samples are selected based on the model constructed. The surrogate model is then updated based on the simulation results of the sampled points. In this way, we attempt to gain the most information possible with a small number of carefully selected sampled points, limiting the number of expensive trials needed to understand features of the simulation space. We analyze the specific use case of identifying the limit surface, i.e., the boundaries in the simulation space between system failure and system success. In this study, we explore several techniques for adaptively sampling the parameter space in order to reconstruct the limit surface. We focus on several adaptive sampling schemes. First, we seek to learn a global model of the entire simulation space using prediction models or neighborhood graphs and extract the limit surface as an iso-surface of the global model. Second, we estimate the limit surface by sampling in the neighborhood of the current estimate based on topological segmentations obtained locally. Our techniques draw inspirations from topological structure known as the Morse-Smale complex. We highlight the advantages and disadvantages of using a global prediction model versus local topological view of the simulation space, comparing several different strategies for adaptive sampling in both contexts. One of the most interesting models we propose attempt to marry the two by obtaining a coarse global representation using prediction models, and a detailed local representation based on topology. Our methods are validated on several analytical test functions as well as a small nuclear simulation dataset modeled after a simplified Pressurized Water Reactor.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Classification of (2 + 1) D invertible fermionic topological phases with symmetry

Here we provide a classification of invertible topological phases of interacting fermions with symmetry in two spatial dimensions for general fermionic symmetry groups G f and general values of the chiral central charge c - . Here G f is a central extension of a bosonic symmetry group G b by fermion parity, (-1) F , specified by a second cohomology class [ω 2 ]∈ $\mathscr{H}^2$(Gb,$\mathbb{Z}_2$). Our approach proceeds by gauging fermion parity and classifying the resulting G b symmetry-enriched topological orders while keeping track of certain additional data and constraints. We perform this analysis through two perspectives, using G-crossed braided tensor categories and Spin(2c - ) 1 Chern-Simons theory coupled to a background G gauge field. These results give a way to characterize and classify invertible fermionic topological phases in terms of a concrete set of data and consistency equations, which is more physically transparent and computationally simpler than the more abstract methods using cobordism theory and spectral sequences. Our results also generalize and provide a different approach to the recent classification of fermionic symmetry-protected topological phases by Wang and Gu, which have chiral central charge c - = 0. We show how the tenfold way classification of topological insulators and superconductors fits into our scheme, along with general nonperturbative constraints due to certain choices of c - and G f . Mathematically, our results also suggest an explicit general parametrization of deformation classes of (2 + 1)D invertible topological quantum field theories with G f symmetry.

36 MATERIALS SCIENCE↗

DOE OSTI2013

Analyzing Dynamic Probabilistic Risk Assessment Data through Topology-Based Clustering

We investigate the use of a topology-based clustering technique on the data generated by dynamic event tree methodologies. The clustering technique we utilizes focuses on a domain-partitioning algorithm based on topological structures known as the Morse-Smale complex, which partitions the data points into clusters based on their uniform gradient flow behavior. We perform both end state analysis and transient analysis to classify the set of nuclear scenarios. We demonstrate our methodology on a dataset generated for a sodium-cooled fast reactor during an aircraft crash scenario. The simulation tracks the temperature of the reactor as well as the time for a recovery team to fix the passive cooling system. Combined with clustering results obtained previously through mean shift methodology, we present the user with complementary views of the data that help illuminate key features that may be otherwise hidden using a single methodology. By clustering the data, the number of relevant test cases to be selected for further analysis can be drastically reduced by selecting a representative from each cluster. Identifying the similarities of simulations within a cluster can also aid in the drawing of important conclusions with respect to safety analysis.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Improving ProtoDUNE pion cross-section measurements with NuGraph Michel-electron tagging

Understanding hadron-argon interactions is essential for precise neutrino energy reconstruction and final-state interaction modeling in liquid-argon time projection chamber (LArTPC) experiments such as DUNE. In particular, pion absorption and charge-exchange processes constitute significant sources of systematic uncertainty in neutrino oscillation measurements. ProtoDUNE-SP, a large-scale LArTPC prototype operated at the CERN Neutrino Platform and exposed to charged-particle test beams in the few-GeV range, enables direct measurements of these processes. This work focuses on the measurement of differential cross sections for pion absorption and charge exchange using the 2 GeV/c pion beam data from the ProtoDUNE-SP run. A key component of this analysis is the identification of Michel electrons from $\pi \rightarrow \mu \rightarrow e$ decay chains, which helps separate different interaction topologies and improves background rejection. Michel electron identification will also assist in reliably calibrating the electromagnetic response in ProtoDUNE-SP data and for the future DUNE detectors. In this analysis, we apply NuGraph to identify Michel electrons. NuGraph is a graph neural network that models detector hits as nodes connected by spatial and temporal edges for particle and topology classification in LArTPC detectors. We first benchmark NuGraph’s Michel electron classification performance using ICEBERG data, a small-scale LArTPC prototype used for DUNE electronics and reconstruction development, and then transfer the approach to ProtoDUNE-SP. This poster presents the analysis strategy, NuGraph-based classification studies, and discusses how these developments are expected to improve the pion cross-section measurement.

Razafinime, Soamasina Herilala [Cincinnati U.] (OR↗

NASA NTRS1974

Sneak circuit analysis of instrumentation and control systems

The evolvement and implementation is presented of a systematic means for detecting the sneak prone designs of an electrical system which could result in such unplanned modes so that they can be prevented prior to occurrence. Sneak circuit analysis is shown to be a formalized approach based upon topological techniques. The trees employed are produced from manufacturing detail data processed by a computer to orderly completion. The analysis techniques applied on a variety of NASA programs are shown to be particularly applicable to industrial instrumentation and control systems.

Rankin, J. P.↗