Search NASA⌕ Search

SEARCH · Search NASA

Results for “Persistent homology”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2017

Performance Enhancement of a Computational Persistent Homology Package

In recent years, persistent homology has become an attractive method for data analysis. It captures topological features, such as connected components, holes, voids, etc., from a point cloud by finding out when these features appear and disappear in the filtration sequence. In this project, we focus on improving the performance of Eirene, a fancy computational persistent homology package. Eirene is a 5000-line opensource software implemented by using the dynamic programming language Julia. We use the Julia profiling tools to identify the performance bottlenecks and develop different methods to manage the bottlenecks, including the parallelization of some time-consuming functions on the multicore/manycore hardware. The empirical results show that the performance can be greatly improved.

Profiling↗
NASA NTRS2019

Tuning the Performance of a Computational Persistent Homology Package

In recent years, persistent homology has become an attractive method for data analysis. It captures topological features, such as connected components, holes, and voids from point cloud data and summarizes the way in which these features appear and disappear in a filtration sequence. In this project, we focus on improving the performanceof Eirene, a computational package for persistent homology. Eirene is a 5000-line open-source software library implemented in the dynamic programming language Julia. We use the Julia profiling tools to identify performance bottlenecks and develop novel methods to manage them, including the parallelization of some time-consuming functions on multicore/manycore hardware. Empirical results show that performance can be greatly improved.

Persistent Homology↗
DOE OSTI2025

Dark Energy Survey Year 3 results: $w$CDM cosmology from simulation-based inference with persistent homology on the sphere

We present cosmological constraints from Dark Energy Survey Year 3 (DES Y3) weak lensing data using persistent homology, a topological data analysis technique that tracks how features like clusters and voids evolve across density thresholds. For the first time, we apply spherical persistent homology to galaxy survey data through the algorithm TopoS2, which is optimized for curved-sky analyses and HEALPix compatibility. Employing a simulation-based inference framework with the Gower Street simulation suite, specifically designed to mimic DES Y3 data properties, we extract topological summary statistics from convergence maps across multiple smoothing scales and redshift bins. After neural network compression of these statistics, we estimate the likelihood function and validate our analysis against baryonic feedback effects, finding minimal biases (under $0.3σ$) in the $Ω_\mathrm{m}-S_8$ plane. Assuming the $w$CDM model, our combined Betti numbers and second moments analysis yields $S_8 = 0.821 \pm 0.018$ and $Ω_\mathrm{m} = 0.304\pm0.037$-constraints 70% tighter than those from cosmic shear two-point statistics in the same parameter plane. Our results demonstrate that topological methods provide a powerful and robust framework for extracting cosmological information, with our spherical methodology readily applicable to upcoming Stage IV wide-field galaxy surveys.

Prat, J. [Nordita; Royal Inst. Tech., Sodertalje; ↗
DOE OSTI2024

Tusqh

SAND2025-00675O Tusqh is a software tool that generates cubical meshes in 2D and 3D and computes the homology of these meshes using persistent homology. It includes a grid cell in the output if its volume-fraction is above a selectable threshold, estimated by sampling points within the cell. Tusqh incorporates anti-aliasing algorithms to mitigate grid orientation and scale effects. It is designed for creating finite element meshes for simulations and can be used in various applications such as heat diffusion, mechanical simulations, and computer graphics rendering. The software outputs meshes in an open format compatible with downstream software. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗
NASA NTRS2022

A Survey of Mathematical Structures for Lunar Networks

To sustain the current and increasing accessibility of space, a scalable communications infrastructure (i.e. the Solar System Internet, SSI) is necessary. The goal of this paper is to begin the discovery of the fundamental underlying mathematical structure of space networks to help the research community harness these structures for algorithm development and optimization. To ensure the applicability of the research, the approaches are considered through the lens of simulated scenarios inspired by the Artemis Back-to-the-Moon mission set for 2024. We note that any approach to an SSI must fit under the umbrella of Delay Tolerant Networking (DTN), due to celestial mobility, high link latencies, high variance in link latencies, disconnections, lack of end-to-end paths, and so on. These difficulties are exacerbated by the fact that the underlying structure of a space network is a time-evolving network and may experience multiple discontinuities in its topology. In this paper we propose several novel approaches to a mathematical foundation for Delay Tolerant Networking Theory that fall outside the traditional scope of temporal network theory. These techniques include methods from Topological Data Analysis, Dynamic Graph Analysis, Applied Algebraic Geometry, Probability Theory, and Game Theory. Some of these methods include tools adapted to the study of dynamic metric spaces, such as zigzag persistent homology and their higher parameter analogs. We find that several of these methods target desired engineering outcomes such as discovery and automatic sub-netting. While each approach is theoretical, they are also algorithmic in nature and offer immediate practical applications. The paper concludes with comparisons of the various methods along with suggestions for future work.

Delay tolerant networking↗
DOE OSTI2025

Topological Signatures of Adversaries in Multimodal Alignments

Topological Data Analysis for Adversarial Detection (LANL O4937) - Detects adversarial examples in vision-language models using persistent homology and two-sample testing. Combines TDA features from CLIP embeddings with statistical methods (ME, SCF, SAMMD, C2ST) for robust detection across ImageNet, CIFAR-10/100.

Bhattarai, Manish↗
NASA NTRS2019

Statistical Hypothesis Testing in Wavelet Analysis: Theoretical Developments and Applications to Indian Rainfall

Statistical hypothesis tests in wavelet analysis are methods that assess the degree to which a wavelet quantity(e.g., power and coherence) exceeds background noise. Commonly, a point-wise approach is adopted in which a wavelet quantity at every point in a wavelet spectrum is individually compared to the critical level of the point-wise test. However, because adjacent wavelet coefficients are correlated and wavelet spectra often contain many wavelet quantities, the point-wise test can produce many false positive results that occur in clusters or patches. To circumvent the point-wise test drawbacks, it is necessary to implement the recently developed area-wise, geometric, cumulative area-wise, and topological significance tests, which are reviewed and developed in this paper. To improve the computational efficiency of the cumulative area-wise test, a simplified version of the testing procedure is created based on the idea that its output is the mean of individual estimates of statistical significance calculated from the geometric test applied at a set of point-wise significance levels. Ideal examples are used to show that the geometric and cumulative area-wise tests are unable to differentiate wavelet spectral features arising from singularity-like structures from those associated with periodicities. A cumulative arc-wise test is therefore developed to strictly test for periodicities by using normalized arc length, which is defined as the number of points composing a cross section of a patch divided by the wavelet scale in question. A previously proposed topological significance test is formalized using persistent homology profiles (PHPs) measuring the number of patches and holes corresponding to the set of all point-wise significance values. Ideal examples show that the PHPs can be used to distinguish time series containing signal components from those that are purely noise. To demonstrate the practical uses of the existing and newly developed statistical methodologies, a first comprehensive wavelet analysis of Indian rainfall is also provided. An R software package has been written by the author to implement the various testing procedures.

Wind speed↗
NASA NTRS2021

TLife-LSTM: Forecasting Future COVID-19 Progression with Topological Signatures of Atmospheric Conditions

Understanding the impact of atmospheric conditions on SARS-CoV2 is critical to model COVID-19 dynamics and sheds a light on the future spread around the world. Furthermore, geographic distri- butions of expected clinical severity of COVID-19 may be closely linked to prior history of respiratory diseases and changes in humidity, tem- perature, and air quality. In this context, we postulate that by tracking topological features of atmospheric conditions over time, we can provide a quanti?able structural distribution of atmospheric changes that are likely to be related to COVID-19 dynamics. As such, we apply the machinery of persistence homology on time series of graphs to extract topological signatures and to follow geographical changes in relative humidity and temperature. We develop an integrative machine learning framework named Topological Lifespan LSTM (TLife-LSTM) and test its predictive capabilities on forecasting the dynamics of SARS-CoV2 cases. We validate our framework using the number of con?rmed cases and hospitalization rates recorded in the states of Washington and California in the USA. Our results demonstrate the predictive potential of TLife-LSTM in forecasting the dynamics of COVID-19 and modeling its complex spatio-temporal spread dynamics.

Gel, Yulia R.↗
NASA NTRSDate not supplied

Multi-Domain Routing in Delay Tolerant Networks

The goal of Delay Tolerant Networking (DTN) is to provide the missing ingredient for the ever-growing collection of communicating nodes in our solar system to become a Solar System Internet (SSI). Great strides have been made in modeling particular types of DTNs, such as schedule- or discovery-based. Now, analogously to the Internet, these smaller DTNs can be considered routing domains which must be stitched together to form the overall SSI. In this paper, we propose a framework for cross-domain routing in DTNs as well as methodologies for detecting these sub-domains. Example time-varying networks are given to demonstrate the techniques proposed. A basic component is the mathematical theory of sheaves, which unifies the underlying model of DTN routing algorithms, by giving rise to routing sheaves – these can be defined for the dynamic and scheduled networks as noted above, and can also be used to define the interfaces between these domains in order to route across them. An immediate application would be routing across discovery-based networks connected by scheduled networks. These DTN subdomains remain elusive, however, and need to become well-defined and properly sized for tractable computability. In particular, a balance must be determined between areas that are too large (i.e. large matrix computations) versus areas that are too small (i.e. “many” single-noded domains). Moreover, the connections between the domains should, at least locally, be chosen to optimize data flow and connectivity: we address this in three ways. First, tools from persistent homology are given to understand underlying structures, reminiscent of hierarchies in the Internet Protocol (IP) addressing. Second, we construct a notion of temporal graph curvature based on network geometry to analyze flows induced by dynamical processes on these networks. Finally, Schrodinger Bridges, a tool arising from statistical physics, are proposed as a method of constructing flows on time-evolving networks with desirable properties such as speed, robustness, and load sensitivity. We construct an approach to temporal hypergraphs to simultaneously model unicast, multicast, and broadcast, using the language of scheme theory, and then consider DTN network coding as a way to achieve network-level computation and organization. The paper concludes with a discussion and ideas for future work.

Alan Hylton↗
DOE OSTI2026

A Fast Algorithm for Computing Zigzag Representatives

Zigzag filtrations of simplicial complexes generalize the usual filtrations by allowing simplex deletions in addition to simplex insertions. The barcodes computed from zigzag filtrations encode the evolution of homological features. Although one can locate a particular feature at any index in the filtration using existing algorithms, the resulting representatives may not be compatible with the zigzag: a representative cycle at one index may not map into a representative cycle at its neighbor. For this, one needs to compute compatible representative cycles along each bar in the barcode. It is known that the barcode for a zigzag filtration with m insertions and deletions can be computed $O(m^ω)$ in time, where $ω < 2.373$ is the matrix multiplication exponent. However, it is not known how to compute the compatible representatives so efficiently. For a non-zigzag filtration, the classical matrix-based algorithm provides representatives in $O(m^3)$ time, which can be improved to $O(m^ω)$. However, no known algorithm for zigzag filtrations computes the representatives with the $O(m^3)$ time bound. We present an $O(m^3 n)$ time algorithm for this problem, where $n ≤ m$ is the size of the largest complex in the filtration.

Persistent homology↗
DOE OSTI2024

Tracking the topology of neural manifolds across populations

Neural manifolds summarize the intrinsic structure of the information encoded by a population of neurons. Advances in experimental techniques have made simultaneous recordings from multiple brain regions increasingly commonplace, raising the possibility of studying how these manifolds relate across populations. However, when the manifolds are nonlinear and possibly code for multiple unknown variables, it is challenging to extract robust and falsifiable information about their relationships. We introduce a framework, called the method of analogous cycles, for matching topological features of neural manifolds using only observed dissimilarity matrices within and between neural populations. We demonstrate via analysis of simulations and in vivo experimental data that this method can be used to correctly identify multiple shared circular coordinate systems across both stimuli and inferred neural manifolds. Conversely, the method rejects matching features that are not intrinsic to one of the systems. Further, as this method is deterministic and does not rely on dimensionality reduction or optimization methods, it is amenable to direct mathematical investigation and interpretation in terms of the underlying neural activity. We thus propose the method of analogous cycles as a suitable foundation for a theory of cross-population analysis via neural manifolds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Cadmus v1.0

This software package is for distributed computation of persistent (co)homology. It is primarily intended for Topological Data Analysis (TDA) audience and scientists who use TDA methods and apply them to datasets that are too big to handle on a single machine. There are very few codes available for this; Cadmus outperforms DIPHA, if the user is interested in cohomology. The accompanying paper explaining the algorithm was accepted to ALENEX 26.

Nigmetov, Arnur [Lawrence Berkeley National Labora↗
DOE OSTI2024

Microbial species and intraspecies units exist and are maintained by ecological cohesiveness coupled to high homologous recombination

Abstract Recent genomic analyses have revealed that microbial communities are predominantly composed of persistent, sequence-discrete species and intraspecies units (genomovars), but the mechanisms that create and maintain these units remain unclear. By analyzing closely-related isolate genomes from the same or related samples and identifying recent recombination events using a novel bioinformatics methodology, we show that high ecological cohesiveness coupled to frequent-enough and unbiased (i.e., not selection-driven) horizontal gene flow, mediated by homologous recombination, often underlie these diversity patterns. Ecological cohesiveness was inferred based on greater similarity in temporal abundance patterns of genomes of the same vs. different units, and recombination was shown to affect all sizable segments of the genome (i.e., be genome-wide) and have two times or greater impact on sequence evolution than point mutations. These results were observed in bothSalinibacter ruber, an environmental halophilic organism, andEscherichia coli, the model gut-associated organism and an opportunistic pathogen, indicating that they may be more broadly applicable to the microbial world. Therefore, our results represent a departure compared to previous models of microbial speciation that invoke either ecology or recombination, but not necessarily their synergistic effect, and answer an important question for microbiology: what a species and a subspecies are.

Science & Technology - Other Topics↗
NASA NTRS2002

Expression of the ctenophore Brain Factor 1 forkhead gene ortholog (ctenoBF-1) mRNA is restricted to the presumptive mouth and feeding apparatus: implications for axial organization in the Metazoa

Ctenophores are thoroughly modern animals whose ancestors are derived from a separate evolutionary branch than that of other eumetazoans. Their major longitudinal body axis is the oral-aboral axis. An apical sense organ, called the apical organ, is located at the aboral pole and contains a highly innervated statocyst and photodetecting cells. The apical organ integrates sensory information and controls the locomotory apparatus of ctenophores, the eight longitudinal rows of ctene/comb plates. In an effort to understand the developmental and evolutionary organization of axial properties of ctenophores we have isolated a forkhead gene from the Brain Factor 1 (BF-1) family. This gene, ctenoBF-1, is the first full-length nuclear gene reported from ctenophores. This makes ctenophores the most basal metazoan (to date) known to express definitive forkhead class transcription factors. Orthologs of BF-1 in vertebrates, Drosophila, and Caenorhabditis elegans are expressed in anterior neural structures. Surprisingly, in situ hybridizations with ctenoBF-1 antisense riboprobes show that this gene is not expressed in the apical organ of ctenophores. CtenoBF-1 is expressed prior to first cleavage. Transcripts become localized to the aboral pole by the 8-cell stage and are inherited by ectodermal micromeres generated from this region at the 16- and 32-cell stages. Expression in subsets of these cells persists and is seen around the edge of the blastopore (presumptive mouth) and in distinct ectodermal regions along the tentacular poles. Following gastrulation, stomodeal expression begins to fade and intense staining becomes restricted to two distinct domains in each tentacular feeding apparatus. We suggest that the apical organ is not homologous to the brain of bilaterians but that the oral pole of ctenophores corresponds to the anterior pole of bilaterian animals.

Non-NASA Center↗
DOE OSTI2024

Reactive oxygen species control protein degradation at the mitochondrial import gate

While reactive oxygen species (ROS) have long been known to drive aging and neurodegeneration, their persistent depletion below basal levels also disrupts organismal function. Cells counteract loss of basal ROS via the reductive stress response, but the identity and biochemical activity of ROS sensed by this pathway remain unknown. Here, we show that the central enzyme of the reductive stress response, the E3 ligase Cullin 2-FEM1 homolog B (CUL2 FEM1B ), specifically acts at mitochondrial TOM complexes, where it senses ROS produced by complex III of the electron transport chain (ETC). ROS depletion during times of low ETC activity triggers the localized degradation of CUL2 FEM1B substrates, which sustains mitochondrial import and ensures the biogenesis of the rate-limiting ETC complex IV. As complex III yields most ROS when the ETC outpaces metabolic demands or oxygen availability, basal ROS are sentinels of mitochondrial activity that help cells adjust their ETC to changing environments, as required for cell differentiation and survival.

FEM1B↗
NASA NTRS2007

Involvement of DNA-PK(sub cs) in DSB Repair Following Fe-56 Ion Irradiation

When cells are exposed to radiation, cellular lesions are induced in the DNA including double strand breaks (DSBs), single strand breaks and clustered DNA damage, which if not repaired with high fidelity may lead to detrimental biological consequences. Complex DSBs are induced by ionizing radiation and characterized by the presence of base lesions close to the break termini. They are believed to be one of the major causes of the biological effects of IR. The complexity of DSBs increases with the ionization density of the radiation and these complex DSBs are distinct from the damage induced by sparsely ionizing gamma-radiation. It has been hypothesized that complex DSBs produced by heavy ions in space pose problems to the DNA repair machinery. We have used imm uno-cyto-chemical staining of phosphorylated histone H2AX (gamma-H2AX) foci, as a marker of DSBs. We have investigated the formation and loss of gamma-H2AX foci and RAD51 foci (a protein involved in the homologous recombination pathway) in mammalian cells induced by low fluences of low-LET gamma-radiation and high-LET Fe-56 ions (1GeV/n, 151 keV/micron LET). M059J and M059K cells, which are deficient and proficient in DNA-PK(sub cs) activity respectively, were used to examine the role of DNA-PK(sub cs), a key protein in the non-homologous end joining (NHEJ) pathway of DSB repair, along with HF19 human fibroblasts. Followi ng irradiation with Fe-56 ions the rate of repair was slower in M059J cells compared with that in M059K, indicating a role for DNA-PK(sub cs) in the repair of DSB induced by Fe-56 ions. However a small percentage of DSBs induced are rejoined within 5 h although many DSBs still persist up to 24 h. When RAD51 was examined in M059J/K cells, RAD51 foci are visible 24 hours after irradiation in approximately 40% of M059J cells compared with <5% of M059K cells indicating that persistent DSBs or those formed at stalled replication forks recruit RAD51 in DNA-PK(sub cs) deficient cells. Following 1 Gy gamma-radiation the induction of gamma-H2AX foci is similar in M059J and M059K cells. However, the repair rate of DSBs is slower in M059J cells than in M059K as shown previously but faster than seen with DSB induced by 56Fe ions. Vanillin, an inhibitor of DNA-PK(sub cs), reduces significantly the rate of DSB repair in HF19 cells following 1 Gy gamma-radiation but at 0.25 Gy gamma-irradiation the rate of DSB repair is similar in the presence or absence vanillin, thus suggesting the repair of a sub-set of DSBs induced by low dose, low-LET radiation does not require DNA-PK(sub cs). This sub-set of DSBs is formed in lower yield with high LET radiation. T he complexity of DNA DSBs induced by HZE radiation will be discussed in terms of reduced repair efficiency and provide scope to model different sub-classes of DSBs as precursors that may lead to the detrimental health effects of HZE radiation.

O'Neill, Peter↗