Engineering Papers⌕ Search

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.

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

At least 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
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.↗
DOE OSTI2021

MUSiC: a model-unspecific search for new physics in proton–proton collisions at $\sqrt{s} = 13\,\text {TeV} $

Results of the Model Unspecific Search in CMS (MUSiC), using proton–proton collision data recorded at the LHC at a centre-of-mass energy of 13TeV, corresponding to an integrated luminosity of 35.9 fb -1 , are presented. The MUSiC analysis searches for anomalies that could be signatures of physics beyond the standard model. The analysis is based on the comparison of observed data with the standard model prediction, as determined from simulation, in several hundred final states and multiple kinematic distributions. Events containing at least one electron or muon are classified based on their final state topology, and an automated search algorithm surveys the observed data for deviations from the prediction. The sensitivity of the search is validated using multiple methods. No significant deviations from the predictions have been observed. For a wide range of final state topologies, agreement is found between the data and the standard model simulation. This analysis complements dedicated search analyses by significantly expanding the range of final states covered using a model independent approach with the largest data set to date to probe phase space regions beyond the reach of previous general searches.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

ND 2 AV: N-dimensional data analysis and visualization analysis for the National Ignition Campaign

Here, one of the biggest challenges in high-energy physics is to analyze a complex mix of experimental and simulation data to gain new insights into the underlying physics. Currently, this analysis relies primarily on the intuition of trained experts often using nothing more sophisticated than default scatter plots. Many advanced analysis techniques are not easily accessible to scientists and not flexible enough to explore the potentially interesting hypotheses in an intuitive manner. Furthermore, results from individual techniques are often difficult to integrate, leading to a confusing patchwork of analysis snippets too cumbersome for data exploration. This paper presents a case study on how a combination of techniques from statistics, machine learning, topology, and visualization can have a significant impact in the field of inertial confinement fusion. We present the $\mathrm{ND}^2\mathrm{AV}$: N-dimensional data analysis and visualization framework, a user-friendly tool aimed at exploiting the intuition and current workflow of the target users. The system integrates traditional analysis approaches such as dimension reduction and clustering with state-of-the-art techniques such as neighborhood graphs and topological analysis, and custom capabilities such as defining combined metrics on the fly. All components are linked into an interactive environment that enables an intuitive exploration of a wide variety of hypotheses while relating the results to concepts familiar to the users, such as scatter plots. $\mathrm{ND}^2\mathrm{AV}$ uses a modular design providing easy extensibility and customization for different applications. $\mathrm{ND}^2\mathrm{AV}$ is being actively used in the National Ignition Campaign and has already led to a number of unexpected discoveries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Parallel peak pruning for scalable SMP contour tree computation

As data sets grow to exascale, automated data analysis and visualisation are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. Here in this paper, we report the first shared SMP algorithm for fully parallel contour tree computation, withfor-mal guarantees of O(lgnlgt) parallel steps and O(n lgn) work, and implementations with up to 10x parallel speed up in OpenMP and up to 50x speed up in NVIDIA Thrust.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Analyzing simulation-based PRA data through traditional and topological clustering: A BWR station blackout case study

Here, dynamic probabilistic risk assessment (DPRA) methodologies couple system simulator codes (e.g., RELAP and MELCOR) with simulation controller codes (e.g., RAVEN and ADAPT). Whereas system simulator codes model system dynamics deterministically, simulation controller codes introduce both deterministic (e.g., system control logic and operating procedures) and stochastic (e.g., component failures and parameter uncertainties) elements into the simulation. Typically, a DPRA is performed by sampling values of a set of parameters and simulating the system behavior for that specific set of parameter values. For complex systems, a major challenge in using DPRA methodologies is to analyze the large number of scenarios generated, where clustering techniques are typically employed to better organize and interpret the data. In this paper, we focus on the analysis of two nuclear simulation datasets that are part of the risk-informed safety margin characterization (RISMC) boiling water reactor (BWR) station blackout (SBO) case study. We provide the domain experts a software tool that encodes traditional and topological clustering techniques within an interactive analysis and visualization environment, for understanding the structures of such high-dimensional nuclear simulation datasets. We demonstrate through our case study that both types of clustering techniques complement each other for enhanced structural understanding of the data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Double-differential Measurements of Mesonless Charged-current Muon Neutrino Interactions on Argon with Final-State Protons using the MicroBooNE Detector

This note reports the first double-differential measurements of charged-current $ν_µ$ scattering on argon leading to final states containing zero mesons and one or more protons. This event topology (hereafter abbreviated as CC0$πNp$) is the most common at the neutrino energies typically produced by the Fermilab Booster Neutrino Beam. A detailed understanding of neutrino-argon scattering in the CC0$πNp$ channel is therefore crucial for the success of the precision neutrino oscillation analyses planned for the Short-Baseline Neutrino (SBN) program. This remains true for the upcoming Deep Underground Neutrino Experiment (DUNE), but the higher mean neutrino energy used there will ensure that more inelastic reaction modes, such as single pion production, will also play a major role. The analysis described in this note builds on a previous MicroBooNE study of the CC0$πNp$ channel which obtained the first single-differential cross-section measurements on an argon target. Since that foundational work, significant improvements have been made to MicroBooNE’s simulation software, event reconstruction algorithms, and procedure for calculating systematic uncertainties. When combined with a larger dataset (corresponding to a beam exposure of 6.79 × 10 20 protons-on-target versus 1.60 × 10 20 in Ref. [3]), these enhancements allow the important CC0$πNp$ channel to be studied in more detail. This note begins with a description of the data and simulation samples used as input to the analysis. Section 3 then defines the CC0$πNp$ signal event topology, and Section 4 describes a set of selection criteria designed to identify these events in MicroBooNE data. Binning schemes are then defined in Section 5 for two double-differential measurements of event rates. The first of these considers the momentum and scattering cosine of the outgoing muon, while the second reports the same observables for the leading proton, i.e., the final-state proton with the largest momentum. After a discussion of systematic uncertainties in Section 6, the note concludes by comparing the predictions of MicroBooNE Monte Carlo (MC) simulations to the measured double-differential distributions. These results will form the basis for a future extraction of flux-averaged double-differential CC0$πNp$ cross sections that will be immediately comparable to the theoretical predictions of multiple neutrino event generators. The selection described herein may also be used to study various other observables in CC0$πNp$ events, including those which are sensitive to correlations between leptonic and hadronic kinematics in the final state.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2016

URBAN-NET: A Network-based Infrastructure Monitoring and Analysis System for Emergency Management and Public Safety

Abstract Critical Infrastructures (CIs) such as energy, water, and transportation are complex networks that are crucial for sustaining day-to-day commodity flows vital to national security, economic stability, and public safety. The nature of these CIs is such that failures caused by an extreme weather event or a man-made incident can trigger widespread cascading failures, sending ripple effects at regional or even national scales. To minimize such effects, it is critical for emergency responders to identify existing or potential vulnerabilities within CIs during such stressor events in a systematic and quantifiable manner and take appropriate mitigating actions. We present here a novel critical infrastructure monitoring and analysis system named URBAN-NET. The system includes a software stack and tools for monitoring CIs, pre-processing data, interconnecting multiple CI datasets as a heterogeneous network, identifying vulnerabilities through graph-based topological analysis, and predicting consequences based on what-if simulations along with visualization. As a proof-of-concept, we present several case studies to show the capabilities of our system. We also discuss remaining challenges and future work.

Lee, Sangkeun↗
NASA NTRS2013

Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network

A large-scale network that supports a large number of users can have an aggregate data rate of hundreds of Mbps at any time. High-fidelity simulation of a large-scale network might be too complicated and memory-intensive for typical commercial-off-the-shelf (COTS) tools. Unlike a large commercial wide-area-network (WAN) that shares diverse network resources among diverse users and has a complex topology that requires routing mechanism and flow control, the ground communication links of a space network operate under the assumption of a guaranteed dedicated bandwidth allocation between specific sparse endpoints in a star-like topology. This work solved the network design problem of estimating the bandwidths of a ground network architecture option that offer different service classes to meet the latency requirements of different user data types. In this work, a top-down analysis and simulation approach was created to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. These techniques were used to estimate the WAN bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network. A new analytical approach, called the "leveling scheme," was developed to model the store-and-forward mechanism of the network data flow. The term "leveling" refers to the spreading of data across a longer time horizon without violating the corresponding latency requirement of the data type. Two versions of the leveling scheme were developed: 1. A straightforward version that simply spreads the data of each data type across the time horizon and doesn't take into account the interactions among data types within a pass, or between data types across overlapping passes at a network node, and is inherently sub-optimal. 2. Two-state Markov leveling scheme that takes into account the second order behavior of the store-and-forward mechanism, and the interactions among data types within a pass. The novelty of this approach lies in the modeling of the store-and-forward mechanism of each network node. The term store-and-forward refers to the data traffic regulation technique in which data is sent to an intermediate network node where they are temporarily stored and sent at a later time to the destination node or to another intermediate node. Store-and-forward can be applied to both space-based networks that have intermittent connectivity, and ground-based networks with deterministic connectivity. For groundbased networks, the store-and-forward mechanism is used to regulate the network data flow and link resource utilization such that the user data types can be delivered to their destination nodes without violating their respective latency requirements.

Cheung, Kar-Ming↗
NASA NTRS1983

Further analysis of a recent cosmic-ray antiproton experiment

Reference is made to the measurements of a cosmic ray antiproton flux at a few hundred MeV reported by Buffington et al. (1981), noting that one of the final background processes to be removed by the data analysis in that study was helium-induced events which satisfied the criteria for topology and timing. The response in the third scintillator S3 was used to identify and remove these events. For the top two scintillators S1 and S2, pulse size information was lost during the data-taking. A method is reported here for the partial retrieval of pulse size information for the scintillator S2. This is possible because a portion of this signal was subtracted from the Cerenkov response before trigger discrimination and data recording to remove scintillation from the Cerenkov response. For separating protons from more highly charged particles, the method is considered sufficient. It is pointed out that the sample of events identified as antiprotons, for which the method can be applied, has the expected unit charge in scintillator S2.

Buffington, A.↗
NASA NTRS1992

Visualization of second order tensor fields and matrix data

We present a study of the visualization of 3-D second order tensor fields and matrix data. The general problem of visualizing unsymmetric real or complex Hermitian second order tensor fields can be reduced to the simultaneous visualization of a real and symmetric second order tensor field and a real vector field. As opposed to the discrete iconic techniques commonly used in multivariate data visualization, the emphasis is on exploiting the mathematical properties of tensor fields in order to facilitate their visualization and to produce a continuous representation of the data. We focus on interactively sensing and exploring real and symmetric second order tensor data by generalizing the vector notion of streamline to the tensor concept of hyperstreamline. We stress the importance of a structural analysis of the data field analogous to the techniques of vector field topology extraction in order to obtain a unique and objective representation of second order tensor fields.

Delmarcelle, Thierry↗
NASA NTRS1990

Surface representations of two- and three-dimensional fluid flow topology

We discuss our work using critical point analysis to generate representations of the vector field topology of numerical flow data sets. Critical points are located and characterized in a two-dimensional domain, which may be either a two-dimensional flow field or the tangential velocity field near a three-dimensional body. Tangent curves are then integrated out along the principal directions of certain classes of critical points. The points and curves are linked to form a skeleton representing the two-dimensional vector field topology. When generated from the tangential velocity field near a body in a three-dimensional flow, the skeleton includes the critical points and curves which provide a basis for analyzing the three-dimensional structure of the flow separation. The points along the separation curves in the skeleton are used to start tangent curve integrations to generate surfaces representing the topology of the associated flow separations.

Helman, James L.↗
DOE OSTI2026

A Joint Search for Muon Neutrino Disappearance with the Short-Baseline Neutrino Program Using the SPINE Deep Learning-Based Reconstruction Package

We present the status of a joint search for muon neutrino disappearance in the Booster Neutrino Beam at Fermilab using the Short-Baseline Neutrino (SBN) Program's two-detector configuration, SBND and ICARUS. Charged-current interactions consistent with muon neutrinos and containing only a muon and at least one proton in the final state are reconstructed and selected using the SPINE deep learning-based particle reconstruction package. To exploit proton multiplicity information and enhance sensitivity to modeling effects, the selected sample is partitioned into exclusive channels with exactly one reconstructed proton and with more than one reconstructed proton. Comprehensive systematic uncertainties from the neutrino flux, interaction, and detector response are incorporated into the analysis, and the coverage of these systematic uncertainty models is validated using data from both detectors, including checks of near-far consistency in key kinematic and topology-sensitive observables. This analysis is intended for inclusion in SBN's first oscillation result.

Mueller, Justin [Fermilab]↗
DOE OSTI2016

Visual Data-Analytics of Large-Scale Parallel Discrete-Event Simulations

Parallel discrete-event simulation (PDES) is an important tool in the codesign of extreme-scale systems because PDES provides a cost-effective way to evaluate designs of highperformance computing systems. Optimistic synchronization algorithms for PDES, such as Time Warp, allow events to be processed without global synchronization among the processing elements. A rollback mechanism is provided when events are processed out of timestamp order. Although optimistic synchronization protocols enable the scalability of large-scale PDES, the performance of the simulations must be tuned to reduce the number of rollbacks and provide an improved simulation runtime. To enable efficient large-scale optimistic simulations, one has to gain insight into the factors that affect the rollback behavior and simulation performance. We developed a tool for ROSS model developers that gives them detailed metrics on the performance of their large-scale optimistic simulations at varying levels of simulation granularity. Model developers can use this information for parameter tuning of optimistic simulations in order to achieve better runtime and fewer rollbacks. In this work, we instrument the ROSS optimistic PDES framework to gather detailed statistics about the simulation engine. We have also developed an interactive visualization interface that uses the data collected by the ROSS instrumentation to understand the underlying behavior of the simulation engine. The interface connects real time to virtual time in the simulation and provides the ability to view simulation data at different granularities. We demonstrate the usefulness of our framework by performing a visual analysis of the dragonfly network topology model provided by the CODES simulation framework built on top of ROSS. The instrumentation needs to minimize overhead in order to accurately collect data about the simulation performance. To ensure that the instrumentation does not introduce unnecessary overhead, we perform a scaling study that compares instrumented ROSS simulations with their noninstrumented counterparts in order to determine the amount of perturbation when running at different simulation scales.

Ross, Caitlin↗
NASA NTRS2001

Homology and the optimization of DNA sequence data

Three methods of nucleotide character analysis are discussed. Their implications for molecular sequence homology and phylogenetic analysis are compared. The criterion of inter-data set congruence, both character based and topological, are applied to two data sets to elucidate and potentially discriminate among these parsimony-based ideas. c2001 The Willi Hennig Society.

Non-NASA Center↗
NASA NTRS1994

Topological analysis of chaotic orbits: Revisiting Hyperion

There is emerging interest in the possibility of chaotic evolution in astrophysical systems. To mention just one example, recent well-sampled ground-based observations of the Saturian satellite Hyperion strongly suggest that it is exhibiting chaotic behavior. We present a general technique, the method of close returns, for the analysis of data from astronomical objects believed to be exhibiting chaotic motion. The method is based on the extraction of pieces of the evolution that exhibit nearly periodic behavior-episodes during which the object stays near in phase space to some unstable periodic orbit. Such orbits generally act as skeletal features, tracing the topological organization of the manifold on which the chaotic dynamics takes place. This method does not require data sets as lengthy as other nonlinear analysis techniques do and is therefore well suited to many astronomical observing programs. Well sampled data covering between twenty and forty characteristic periods of the system have been found to be sufficient for the application of this technique. Additional strengths of this method are its robustness in the presence of noise and the ability for a user to clearly distinguish between periodic, random, and chaotic behavior by inspection of the resulting two-dimensional image. As an example of its power, we analyze close returns in a numerically generated data set, based on a model for Hyperion extensively studied in the literature, corresponding to nightly observations of the satellite. We show that with a small data set, embedded unstable periodic orbits can be extracted and that these orbits can be responsible for nearly periodic behavior lasting a substantial fraction of the observing run.

Boyd, Patricia T.↗
DOE OSTI2025

Enriched immersed finite element and isogeometric analysis: algorithms and data structures

Immersed finite element methods provide a convenient analysis framework for problems involving geometrically complex domains, such as those found in topology optimization and microstructures for engineered materials. However, their implementation remains a major challenge due to, among other things, the need to apply nontrivial stabilization schemes and generate custom quadrature rules. This article introduces the robust and computationally efficient algorithms and data structures comprising an immersed finite element preprocessing framework. The input to the preprocessor consists of a background mesh and one or more geometries defined on its domain. The output is structured into groups of elements with custom quadrature rules formatted such that common finite element assembly routines may be used without or with only minimal modifications. The key to the preprocessing framework is the construction of material topology information, concurrently with the generation of a quadrature rule, which is then used to perform enrichment and generate stabilization rules. While the algorithmic framework applies to a wide range of immersed finite element methods using different types of meshes, integration, and stabilization schemes, the preprocessor is presented within the context of the extended isogeometric analysis. This method utilizes a structured B-spline mesh, a generalized Heaviside enrichment strategy considering the material layout within individual basis functions’ supports, and face-oriented ghost stabilization. Using a set of examples, the effectiveness of the enrichment and stabilization strategies is demonstrated alongside the preprocessor’s robustness in geometric edge cases. Additionally, the performance and parallel scalability of the implementation are evaluated.

Computer implementation↗