Search NASA⌕ Search

SEARCH · Search NASA

Results for “Constructive Tree”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Thioredoxin and evolution

Comparisons of primary structure have revealed significant homology between the m type thioredoxins of chloroplasts and the thioredoxins from a variety of bacteria. Chloroplast thioredoxin f, by comparison, remains an enigma: certain residues are invariant with those of the other thioredoxins, but a phylogenetic relationship to bacterial or m thioredoxins seems distant. Knowledge of the evolutionary history of thioredoxin f is, nevertheless, of interest because of its role in photosynthesis. Therefore, we have attempted to gain information on the evolutionary history of chloroplast thioredoxin f, as well as m. Our goal was first to establish the utility of thioredoxin as a phylogenetic marker, and, if found suitable, to deduce the evolutionary histories of the chloroplast thioredoxins. To this end, we have constructed phylogenetic (minimal replacement) trees using computer analysis. The results show that the thioredoxins of bacteria and animals fall into distinct phylogenetic groups - the bacterial group resembling that derived from earlier 16s RNA analysis and the animal group showing a cluster consistent with known relationships. The chloroplast thioredoxins show a novel type of phylogenetic arrangement: one m type aligns with its counterpart of eukaryotic algae, cyanobacteria and other bacteria, whereas the second type (f type) tracks with animal thioredoxin. The results give new insight into the evolution of photosynthesis.

Buchanan, B. B.↗
NASA NTRS1993

A parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

A parallel algorithm, called polysection, is presented for computing the eigenvalues of a symmetric tridiagonal matrix. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The signs of the polynomials at the interval endpoints are determined a priori and used to guarantee that all zeros are found. The use of finite-precision arithmetic may result in multiple zeros; however, in this case, the intervals coalesce and their number determines exactly the multiplicity of the zero. For an N x N matrix the eigenvalues can be determined in O(log-squared N) time with N-squared processors and O(N) time with N processors. The method is compared with a parallel variant of bisection that requires O(N-squared) time on a single processor, O(N) time with N processors, and O(log N) time with N-squared processors.

Swarztrauber, Paul N.↗
DOE OSTI2025

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗
DOE OSTI2022

Computing a Stable Distance on Merge Trees

Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological summaries cannot and 2) to still be robust to perturbations in the dataset. The combination of these two properties, known respectively as stability and discriminativity, has led to theoretical distances which are either thought to be or shown to be computationally complex and thus their implementations have been scarce. In order to design similarity measures on merge trees which are computationally feasible for more complex merge trees, many researchers have elected to loosen the restrictions on at least one of these two properties. The question still remains, however, if there are practical situations where trading these desirable properties is necessary. Here we construct a distance between merge trees which is designed to retain both discriminativity and stability. While our approach can be expensive for large merge trees, we illustrate its use in a setting where the number of nodes is small. This setting can be made more practical since we also provide a proof that persistence simplification increases the outputted distance by at most half of the simplified value. As a result, we demonstrate our distance measure on applications in shape comparison and on detection of periodicity in the von Kármán vortex street.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

ArborX

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, it uses linear BVH for its low construction cost and sufficient quality. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase. ArborX also implements several advanced algorithms using geometric search, such as density-based clustering algorithm DBSCAN.

ECP↗
DOE OSTI2019

Geometric Estimation of Multivariate Dependency

This paper proposes a geometric estimator of dependency between a pair of multivariate random variables. The proposed estimator of dependency is based on a randomly permuted geometric graph (the minimal spanning tree) over the two multivariate samples. This estimator converges to a quantity that we call the geometric mutual information (GMI), which is equivalent to the Henze–Penrose divergence. between the joint distribution of the multivariate samples and the product of the marginals. The GMI has many of the same properties as standard MI but can be estimated from empirical data without density estimation; making it scalable to large datasets. The proposed empirical estimator of GMI is simple to implement, involving the construction of an minimal spanning tree (MST) spanning over both the original data and a randomly permuted version of this data. We establish asymptotic convergence of the estimator and convergence rates of the bias and variance for smooth multivariate density functions belonging to a Hölder class. We demonstrate the advantages of our proposed geometric dependency estimator in a series of experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

An automated procedure built on MTEX for reconstructing deformation twin hierarchies from electron backscattered diffraction datasets of heavily twinned microstructures

Here we present a set of algorithms built on the MTEX and MATLAB graph toolboxes for automatic reconstruction of deformation twin hierarchies from Electron Backscatter Diffraction (EBSD) datasets with a focus on developing methods for heavily twinned microstructures (twin fractions >0.5). The algorithms address key issues arising at large strains, mainly: missing twin relationships, grouping of heavily deformed grain fragments into families of similar orientation originating from a single initial grain, identification of parent fragments for large twin volume fractions, and classification of families having twin relationships with multiple families. To facilitate the development of these algorithms, large-grained ultra-high purity α-Ti deformed in compression along two directions is investigated. Graphs are utilized to handle non-local geometric merging and to represent relationships throughout the reconstruction process. When determining if a grain fragment is from the undeformed microstructure, the combined metrics of the fragment's orientation volume fraction in the initial texture and the directed graph centrality measure of out-closeness (the number of nodes reached in a graph from a given node) are essential. To address automation in reconstructing the sequence of twinning and relating fragments originating from a single grain in the initial microstructure, the twin family tree is formulated as a minimum spanning tree emanating from the initial grain family. A scheme constructing the distances associated with twin relationship comprising the spanning tree is developed, and a novel quasi-directional Prim spanning tree algorithm is used to determine the twin family tree. The procedure is demonstrated to significantly improve the level of automation in reconstructing twin hierarchies in heavily twinned microstructure compared to other methodologies in literature. The procedure can readily be applied to analyses of twinning in metals, as well as provide an approach for routinely extracting twin statistics at larger deformation levels than previously possible. Significantly, the procedure is demonstrated to be capable of identifying third generation twinning in α-Ti microstructures.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Efficient and Flexible Hierarchical Data Layouts for a Unified Encoding of Scalar Field Precision and Resolution

To address the problem of ever-growing scientific data sizes making data movement a major hindrance to analysis, we introduce a novel encoding for scalar fields: a unified tree of resolution and precision, specifically constructed so that valid cuts correspond to sensible approximations of the original field in the precision-resolution space. Furthermore, we introduce a highly flexible encoding of such trees that forms a parameterized family of data hierarchies. We discuss how different parameter choices lead to different trade-offs in practice, and show how specific choices result in known data representation schemes such as zfp[52], idx[58], and jpeg2000 [76]. Lastly, we provide system-level details and empirical evidence on how such hierarchies facilitate common approximate queries with minimal data movement and time, using real-world data sets ranging from a few gigabytes to nearly a terabyte in size. Experiments suggest that our new strategy of combining reductions in resolution and precision is competitive with state-of-the-art compression techniques with respect to data quality, while being significantly more flexible and orders of magnitude faster, and requiring significantly reduced resources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Detection of topological materials with machine learning

Databases compiled using ab initio and symmetry-based calculations now contain tens of thousands of topological insulators and topological semimetals. This makes the application of modern machine learning methods to topological materials possible. Using gradient boosted trees, we show how to construct a machine learning model which can predict the topology of a given existent material with an accuracy of 90%. Such predictions are orders of magnitude faster than actual ab initio calculations. In this work, we use machine learning models to probe how different material properties affect topological features. Notably, we observe that topology is mostly determined by the “coarse-grained” chemical composition and crystal symmetry and depends little on the particular positions of atoms in the crystal lattice. We identify the sources of our model's errors and we discuss approaches to overcome them.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Eureka: Enabling Fine-Grained Access and Range Queries on Compressed Scientific Data via Data-Index Co-Compression

Handling large-scale scientific data in high-performance computing (HPC) environments poses significant challenges, including excessive I/O, high storage costs, and slow query performance. Traditional approaches often require full data decompression and scans, making them impractical for real-time or interactive analysis. To address these limitations, we introduce Eureka, a unified data-index co-compression framework that enables fine-grained access and efficient range queries on compressed scientific datasets. Eureka integrates spatial domain decomposition with block-wise error-bounded lossy compression to support selective decompression. It constructs a hierarchical AVL-tree index during compression to capture block-level value ranges, enabling fast pruning during query execution. To reduce metadata overhead, the index itself is also compressed while ensuring recall-preserving results. Experiments on six diverse HPC simulation datasets show that Eureka achieves up to 25x data compression and over 300x index compression, surpassing state-of-the-art compressors such as SZ3 and ZFP in rate-distortion performance. Additionally, Eureka delivers over 30x speedup for low-selectivity range queries, making it a scalable and efficient solution for modern scientific data analysis.

Yan, Ning↗
NASA NTRS2004

Shortcomings with Tree-Structured Edge Encodings for Neural Networks

In evolutionary algorithms a common method for encoding neural networks is to use a tree structured assembly procedure for constructing them. Since node operators have difficulties in specifying edge weights and these operators are execution-order dependent, an alternative is to use edge operators. Here we identify three problems with edge operators: in the initialization phase most randomly created genotypes produce an incorrect number of inputs and outputs; variation operators can easily change the number of input/output (I/O) units; and units have a connectivity bias based on their order of creation. Instead of creating I/O nodes as part of the construction process we propose using parameterized operators to connect to preexisting I/O units. Results from experiments show that these parameterized operators greatly improve the probability of creating and maintaining networks with the correct number of I/O units, remove the connectivity bias with I/O units and produce better controllers for a goal-scoring task.

Hornby, Gregory S.↗
NASA NTRS2006

Trade Studies of Space Launch Architectures using Modular Probabilistic Risk Analysis

A top-down risk assessment in the early phases of space exploration architecture development can provide understanding and intuition of the potential risks associated with new designs and technologies. In this approach, risk analysts draw from their past experience and the heritage of similar existing systems as a source for reliability data. This top-down approach captures the complex interactions of the risk driving parts of the integrated system without requiring detailed knowledge of the parts themselves, which is often unavailable in the early design stages. Traditional probabilistic risk analysis (PRA) technologies, however, suffer several drawbacks that limit their timely application to complex technology development programs. The most restrictive of these is a dependence on static planning scenarios, expressed through fault and event trees. Fault trees incorporating comprehensive mission scenarios are routinely constructed for complex space systems, and several commercial software products are available for evaluating fault statistics. These static representations cannot capture the dynamic behavior of system failures without substantial modification of the initial tree. Consequently, the development of dynamic models using fault tree analysis has been an active area of research in recent years. This paper discusses the implementation and demonstration of dynamic, modular scenario modeling for integration of subsystem fault evaluation modules using the Space Architecture Failure Evaluation (SAFE) tool. SAFE is a C++ code that was originally developed to support NASA s Space Launch Initiative. It provides a flexible framework for system architecture definition and trade studies. SAFE supports extensible modeling of dynamic, time-dependent risk drivers of the system and functions at the level of fidelity for which design and failure data exists. The approach is scalable, allowing inclusion of additional information as detailed data becomes available. The tool performs a Monte Carlo analysis to provide statistical estimates. Example results of an architecture system reliability study are summarized for an exploration system concept using heritage data from liquid-fueled expendable Saturn V/Apollo launch vehicles.

Mathias, Donovan L.↗
DOE OSTI2023

Color-kinematics dual representations of one-loop matrix elements in the open-superstring effective action

Abstract Theα ′ -expansion of string theory provides a rich set of higher-dimension operators, indexed byζvalues, which can be used to study color-kinematics duality and the double copy. These two powerful properties, actually first noticed in tree-level string amplitudes, simplify the construction of both gauge and gravity amplitudes. However, their applicability and limitations are not fully understood. We attempt to construct a set of color-kinematics dual numerators at one loop and four points for insertions of operator combinations corresponding to the lowest fourζ 2 -free operator insertions from the open superstring:ζ 3 ,ζ 5 ,$$ {\zeta}_3^2 $$ ζ 3 2 , andζ 7 . We succeed in finding a representation for the first three in terms of box, triangle, and bubble numerators. In the case ofζ 7 we find an obstruction to a fully color-dual representation related to the bubble-on-external-leg type diagrams. We discuss two paths around this obstruction, both of which signal an incompatability between color-kinematics duality and manifesting certain desired properties. Using the constructed color-dual numerators, we find two different Bern-Carrasco-Johansson double copies that produce candidate closed-string-insertion numerators. Both approaches to the double copy match the kinematics of the cuts, with relative normalization set by either summing over both double copies including degeneracy or by including an explicit prefactor on the double-copy numerator definitions.

Physics↗
DOE OSTI2021

Scattering amplitudes for all masses and spins

We introduce a formalism for describing four-dimensional scattering amplitudes for particles of any mass and spin. This naturally extends the familiar spinor-helicity formalism for massless particles to one where these variables carry an extra SU(2) little group index for massive particles, with the amplitudes for spin Sparticles transforming as symmetric rank 2S tensors. We systematically characterise all possible three particle amplitudes compatible with Poincare symmetry. Unitarity, in the form of consistent factorization, imposes algebraic conditions that can be used to construct all possible four-particle tree amplitudes. This also gives us a convenient basis in which to expand all possible four-particle amplitudes in terms of what can be called “spinning polynomials”. Many general results of quantum field theory follow the analysis of four-particle scattering, ranging from the set of all possible consistent theories for massless particles, to spin-statistics, and the Weinberg-Witten theorem. We also find a transparent understanding for why massive particles of sufficiently high spin cannot be “elementary”. The Higgs and Super-Higgs mechanisms are naturally discovered as an infrared unification of many disparate helicity amplitudes into a smaller number of massive amplitudes, with a simple understanding for why this can’t be extended to Higgsing for gravitons. We illustrate a number of applications of the formalism at one-loop, giving few-line computations of the electron (g - 2) as well as the beta function and rational terms in QCD. “Off-shell” observables like correlation functions and form-factors can be thought of as scattering amplitudes with external “probe” particles of general mass and spin, so all these objects — amplitudes, form factors and correlators, can be studied from a common on-shell perspective.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1993

Santa Barbara microwave backscattering model for woodlands

The Santa Barbara microwave backscattering model for woodland vegetation with discontinuous tree canopies is described, with an emphasis on the construction of the model from probability-weighted sub-components. The modelling approach is to treat individual tree crowns as scatterers and attenuators, using the probabilities of scattering and attenuation to compute total backscatter. Four major model components are defined: surface backscattering, crown volume scattering, multi-path interactions between crown and ground, and double-bounce trunk-ground interactions. Each component is divided into subcomponents having distinct scattering and attenuation paths. The scattering of each subcomponent is computed and weighted by the probability of its occurrence. Total backscatter from a simulated woodland stand is computed by incoherent summation of the components. Recent revisions to the model have modified the subcomponent definitions and improved the probability formulation.

Wang, Y.↗
NASA NTRS1998

Monitoring of Volcanogenic CO2-Induced Tree Kills with AVIRIS Image Data at Mammoth Mountain, California

Elevated cold CO2 emissions from the flank of Mammoth Mountain volcano on the southwest rim of the Long Valley Caldera, eastern California, have been the cause of over 100 acres of dead trees in that area since 1990. The source of the CO2 gas is thought to be from one or more magmatic intrusion(s) beneath Mammoth Mountain and is probably related to a period of seismic unrest that began in 1989. The gas rises to the surface probably from depths of a few kilometers, along faults and fracture zones. The gas is at ambient temperature and diffuses from the soil rather than discharging from distinct vents. Typically, soil gas concentrations in tree-kill areas range from 10% to over 90% CO2 by volume, as compared to normal background of < 1% in healthy forest. The gas composition is predominantly CO2 mixed with air (sulfur gases are not elevated), and C and He isotopic ratios are consistent with a magmatic origin for the gas. The total CO2 emission has been estimated at 1200 tons/day, comparable to the emissions at Kilauea. Some of the dead trees are as old as 250 years, suggesting that similar anomalous gas discharge has not occurred over the previous few hundred years. The delta C-13/12 ratio in the Mammoth Mountain CO2 emission averages about -4.5 (PDB standard). This is consistent with a mantle source for the carbon. However, the large volume of the emission suggests that not all of the CO2 is necessarily being generated from the 1989 intrusion. The voluminous gas could be leaking from a vapor-rich zone, capped by an impermeable layer, that was supplied CO2 from degassing of many small magma bodies that intruded beneath the mountain over a period of decades or centuries. Earthquakes in 1989 could have fractured the capping layer and provided pathways for the escape Of CO2 to the surface. Alternatively, some of the CO2 could be derived from contact metamorphism of carbonate rocks intruded by magma. Carbonate-bearing Paleozoic roof pendents crop out in close proximity to Mammoth Mountain. It is possible that similar rocks could occur at depth beneath Mammoth Mountain, and could have contributed CO2 from thermal decomposition caused from recent intrusions. We hope to determine the C-13/12 ratio of a suite of samples to demonstrate if the carbonate rocks could be the source of at least part of the 1990-97 CO2 emission. To better understand the behavior of the CO2 gas, we have used hyperspectral imagery data of Mammoth Mountain acquired from the Airborne Visual/Infrared Imaging Spectrometer (AVIRIS) to map out areas of dead trees. The areas of tree kill have increased in size from about 50 acres in 1994 to about 100 acres in 1997. Tree kill is the major surface manifestation of the carbon dioxide flux at Mammoth Mountain, is widely dispersed, and has been cursorily mapped by regular field mapping techniques in the area. Initial investigations using airborne digital imagery from the Thematic Mapper Simulator (NS001) and AVIRIS instruments have shown extremely encouraging results for complete delineation of the vegetation anomalies. The most successful maps (when compared with ground truth) were developed using AVIRIS data with spectral angle mapper and matched filter algorithms with a data set that was reduced to maximum variance via the minimum noise fraction transformation. The result of this work is a series of maps that show the tree kill areas occurring in an halo-pattern surrounding the base of Mammoth Mountain. We are applying these same techniques to earlier AVIRIS images of Mammoth Mountain to examine the progression of the tree kill areas over time. Temporal maps of the tree kill areas may assist in constructing a picture of the structure beneath Mammoth Mountain.

Hausback, Brian P.↗
NASA NTRS1992

The Extrapolation of Elementary Sequences

We study sequence extrapolation as a stream-learning problem. Input examples are a stream of data elements of the same type (integers, strings, etc.), and the problem is to construct a hypothesis that both explains the observed sequence of examples and extrapolates the rest of the stream. A primary objective -- and one that distinguishes this work from previous extrapolation algorithms -- is that the same algorithm be able to extrapolate sequences over a variety of different types, including integers, strings, and trees. We define a generous family of constructive data types, and define as our learning bias a stream language called elementary stream descriptions. We then give an algorithm that extrapolates elementary descriptions over constructive datatypes and prove that it learns correctly. For freely-generated types, we prove a polynomial time bound on descriptions of bounded complexity. An especially interesting feature of this work is the ability to provide quantitative measures of confidence in competing hypotheses, using a Bayesian model of prediction.

Laird, Philip↗
NASA NTRS1991

Bialgebra deformations and algebras of trees

Let A denote a bialgebra over a field k and let A sub t = A((t)) denote the ring of formal power series with coefficients in A. Assume that A is also isomorphic to a free, associative algebra over k. A simple construction is given which makes A sub t a bialgebra deformation of A. In typical applications, A sub t is neither commutative nor cocommutative. In the terminology of Drinfeld, (1987), A sub t is a quantum group. This construction yields quantum groups associated with families of trees.

Grossman, Robert↗