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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Failure Mechanism Traceability and Application in Human System Interface of Nuclear Power Plants using RESHA

In recent years, there has been considerable effort to modernize existing and new nuclear power plants with digital instrumentation and control systems (DI&C). However, there has also been considerable concern both by industry and regulatory bodies for the risk and consequence analysis of these systems. Of particular concern are digital common cause failures (CCFs) specifically related to software defects. These “misbehaviors” by the software can occur in both the control and monitoring of a system. While many new methods have been proposed to identify potential software failure modes, such as Systems-theoretic Process Analysis (STPA), Hazard and Consequence Analysis for Digital Systems (HAZCADS), etc., these methods are focused primarily on the control action pathway of a system. In contrast, the information feedback pathway lacks unsafe control actions (UCAs), which are typically related to software basic events; thus, assessment of software basic events in such systems is unclear. In this work, we present the idea of intermediate processors and unsafe information flow (UIF) to help safety analysts trace failure mechanisms in the feedback pathway and how they can be integrated into a fault tree for improved assessment capability. The concepts presented are demonstrated in two comprehensive case studies, a smart sensor integrated platform for unmanned autonomous vehicles and another on a representative advanced human system interface (HSI) for safety critical plant monitoring. The qualitative software basic events are identified, and a fault tree analysis is conducted based on a modified Redundancy-guided Systems-theoretic Hazard Analysis (RESHA) methodology. The case studies demonstrate the use of UIF and intermediate processors in the fault tree to improve traceability of software failures in highly complex digital instrumentation feedback. The improved method can also clarify fault tree construction when multiple component dependencies are present in the system.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Failure Mechanism Traceability and Application in Human System Interface of Nuclear Power Plants using RESHA

In recent years, there has been considerable effort to modernize existing and new nuclear power plants with digital instrumentation and control systems (DI&C). However, there has also been considerable concern both by industry and regulatory bodies for the risk and consequence analysis of these systems. Of particular concern are digital common cause failures (CCFs) specifically related to software defects. These “misbehaviors” by the software can occur in both the control and monitoring of a system. While many new methods have been proposed to identify potential software failure modes, such as Systems-theoretic Process Analysis (STPA), Hazard and Consequence Analysis for Digital Systems (HAZCADS), etc., these methods are focused primarily on the control action pathway of a system. In contrast, the information feedback pathway lacks unsafe control actions (UCAs), which are typically related to software basic events; thus, assessment of software basic events in such systems is unclear. In this work, we present the idea of intermediate processors and unsafe information flow (UIF) to help safety analysts trace failure mechanisms in the feedback pathway and how they can be integrated into a fault tree for improved assessment capability. The concepts presented are demonstrated in two comprehensive case studies, a smart sensor integrated platform for unmanned autonomous vehicles and another on a representative advanced human system interface (HSI) for safety critical plant monitoring. The qualitative software basic events are identified, and a fault tree analysis is conducted based on a modified Redundancy-guided Systems-theoretic Hazard Analysis (RESHA) methodology. The case studies demonstrate the use of UIF and intermediate processors in the fault tree to improve traceability of software failures in highly complex digital instrumentation feedback. The improved method can also clarify fault tree construction when multiple component dependencies are present in the system.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS1987

Automatic creation of object hierarchies for ray tracing

Various methods for evaluating generated trees are proposed. The use of the hierarchical extent method of Rubin and Whitted (1980) to find the objects that will be hit by a ray is examined. This method employs tree searching; the construction of a tree of bounding volumes in order to determine the number of objects that will be hit by a ray is discussed. A tree generation algorithm, which uses a heuristic tree search strategy, is described. The effects of shuffling and sorting on the input data are investigated. The cost of inserting an object into the hierarchy during the construction of a tree algorithm is estimated. The steps involved in estimating the number of intersection calculations are presented.

Goldsmith, Jeffrey↗
DOE OSTI2020

Leveraging Machine Learning Capabilities for the Characterization of Irradiated Uranium: A Case Study of Analysis Methods for Nuclear Safeguards and Nuclear Forensics

Nondestructively determining the initial enrichment of irradiated uranium is a complex and laborious multivariable problem due to the presence of fission products. This work demonstrates the capabilities of machine learning to analyze gamma-ray spectral data to determine initial enrichment without knowledge of the decay time of the sample. The approach developed is agnostic to the particular scenario and is applicable to a wide variety of applications in nuclear forensics and nuclear safeguards. We irradiated 5 mg uranium standard reference materials at discrete enrichment values ranging from 0.02% to 97% 235 U (weight percent) in UT Austin’s Nuclear Engineering Teaching Laboratory TRIGA Mark II 1.1 MW research reactor, allowed each to decay for 8 hours, and then measured each sample via gamma-ray spectrometry for 50 hours post-irradiation yielding 1,400 individual gamma-ray spectra discretized into 8,192 energy bins. We then trained decision trees models to analyze individual gamma-ray spectra and estimate the associated initial enrichment without knowledge of the time since end of irradiation. We evaluated the performance of the models with a reserved test set not used for training or calibrating the model. A decision tree model constructed with this procedure achieved a mean absolute error in initial enrichment determination of 2.3% (weight percent 235 U). Next, we implemented a principal component analysis pre-processing routine of the gamma-ray spectrometry data to reduce the dimensionality of the dataset from 8,192 channels in the spectrum to 10 principal components while retaining over 99% of the inherent variance in the data. Decision tree models constructed with these data demonstrated decreased mean absolute error in enrichment determination, reduced computational time, and decreased complexity. A single decision tree model constructed with this procedure achieved a mean absolute error in initial enrichment determination of 0.05% (weight percent 235 U). Furthermore, we analyzed these models with learning curves to ensure that overfitting did not occur. The capabilities provided by these models can be naturally extended to other application-focused measurements in the fields of nuclear safeguards, nuclear forensics, and nuclear non-proliferation.

Drescher, Adam↗
DOE OSTI2024

Poplar

SAND2025-00683O Poplar is a software tool that generates a phylogenetic tree from input gene and genome sequences. It integrates established tools to identify genes within genomes, group sequences, construct gene trees, and infer a species tree. Poplar processes nucleotide sequences, identifies similar sequences using Nucleotide BLAST, groups them with DBSCAN, aligns sequences with MAFFT, constructs gene trees with RAxML-NG, and infers a species tree using ASTRAL-Pro3. This pipeline provides a structured approach to phylogenetic analysis, facilitating the study of evolutionary relationships among species. 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.

Krishnakumar, Raga↗
DOE OSTI2022

Constructing high-fidelity halo merger trees in abacussummit

ABSTRACT Tracking the formation and evolution of dark matter haloes is a critical aspect of any analysis of cosmological N-body simulations. In particular, the mass assembly of a halo and its progenitors, encapsulated in the form of its merger tree, serves as a fundamental input for constructing semi-analytic models of galaxy formation and, more generally, for building mock catalogues that emulate galaxy surveys. We present an algorithm for constructing halo merger trees from abacussummit, the largest suite of cosmological N-body simulations performed to date consisting of nearly 60 trillion particles, and which has been designed to meet the Cosmological Simulation Requirements of the Dark Energy Spectroscopic Instrument (DESI) survey. Our method tracks the cores of haloes to determine associations between objects across multiple time slices, yielding lists of halo progenitors and descendants for the several tens of billions of haloes identified across the entire suite. We present an application of these merger trees as a means to enhance the fidelity of abacussummit halo catalogues by flagging and ‘merging’ haloes deemed to exhibit non-monotonic past merger histories. We show that this cleaning technique identifies portions of the halo population that have been deblended due to choices made by the halo finder, but which could have feasibly been part of larger aggregate systems. We demonstrate that by cleaning halo catalogues in this post-processing step, we remove potentially unphysical features in the default halo catalogues, leaving behind a more robust halo population that can be used to create highly accurate mock galaxy realizations from abacussummit.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

The zinc-finger transcription factor BcMF20 and its orthologs in Cruciferae which are required for pollen development

Highlights: • BcMF20 was a three-fingered protein and close to the four-fingered proteins of petunia. • The inhibition of BcMF20 led to fewer and lower rate in pollen germination. • The inhibition of BcMF20 led to lower rate in fruit setting. • BcMF20 may work in genetic pathways to act on proliferation of tapetal cells. • BcMF20 helps keep the normal development of pollens. Brassica campestris Male Fertility 20 (BcMF20) is a typical zinc-finger transcription factor that was previously isolated from flower buds of Chinese cabbage (Brassica campestris ssp. chinensis). By applying expression pattern analysis, it can be known that BcMF20 was specifically and strongly expressed in tapetum and pollen, beginning from the uninucleate stage, and was maintained during the mature-pollen stage. As BcMF20 was highly conserved in Cruciferae, it can be indicated that this zinc-finger transcription factor is important during the growth of Cruciferae. In this study, 12 C2H2-type zinc-finger TFs which shared high homology with BcMF20 were found from NCBI via BLAST. A new molecular phylogenetic tree was constructed by the comparison between BcMF20 and these 12 C2H2-type zinc-finger TFs with NJ method. By analyzing this phylogenetic tree, the evolution of BcMF20 was discussed. Then, antisense RNA technology was applied in the transgenesis of Arabidopsis thaliana to get the deletion mutants of BcMF20, so that its function during the pollen development can be identified. The results showed: BcMF20 are in the same clade with three genes from Arabidopsis. The inhibition of BcMF20 expression led to smaller amounts of and lower rate in germination of pollen and lower rate in fruit setting in certain transgenetic plants. This also led to the complete collapse of pollen grains. By SEM and TEM, pollen morphology and anther development processes were observed. In the middle uninucleate microspore stage, a relatively thin or even no primexine was formed in microspores. This may result in the malformation of the pollen wall and finally cause the deformity of pollens. Above all, it can be indicated that BcMF20 may act as a part of regulation mechanisms of TAZ1 and MS1. Together they play a role in a genetic pathway in the tapetum to act on proliferation of tapetal cells and keep the normal development of pollens.

60 APPLIED LIFE SCIENCES↗
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 OSTI2017

Tree tensor network approach to simulating Shor's algorithm

Constructively simulating quantum systems furthers our understanding of qualitative and quantitative features which may be analytically intractable. In this paper, we directly simulate and explore the entanglement structure present in the paradigmatic example for exponential quantum speedups: Shor's algorithm. To perform our simulation, we construct a dynamic tree tensor network which manifestly captures two salient circuit features for modular exponentiation. These are the natural two-register bipartition and the invariance of entanglement with respect to permutations of the top-register qubits. Our construction help identify the entanglement entropy properties, which we summarize by a scaling relation. Further, the tree network is efficiently projected onto a matrix product state from which we efficiently execute the quantum Fourier transform. In conclusion, future simulation of quantum information states with tensor networks exploiting circuit symmetries is discussed.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1977

Satellite solar power - Will it pay off

A cost analysis is presented for front-end investments required for the development of a satellite solar power system. The methodology used makes use of risk analysis techniques to quantify the present state of knowledge relevant to the construction and operation of a satellite solar power station 20 years in the future. Results are used to evaluate the 'expected value' of a three-year research program providing additional information which will be used as a basis for a decision to either continue development of the concept at an increasing funding level or to terminate or drastically alter the program. The program is costed phase by phase, and a decision tree is constructed. The estimated probability of success for the research and studies phase is .540. The expected value of a program leading to the construction of 120 systems at a rate of four per year is 12.433 billion dollars.

Hazelrigg, G. A., Jr.↗
DOE OSTI2020

A quantum algorithm to efficiently sample from interfering binary trees

Quantum computers provide an opportunity to efficiently sample from probability distributions that include non-trivial interference effects between amplitudes. Using a simple process wherein all possible state histories can be specified by a binary tree, we construct an explicit quantum algorithm that runs in polynomial time to sample from the process once. The corresponding naive Markov Chain algorithm does not produce the correct probability distribution and an explicit classical calculation of the full distribution requires exponentially many operations. Finally, the problem can be reduced to a system of two qubits with repeated measurements, shedding light on a quantum-inspired efficient classical algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Decision-tree structures utilizing a phase-transition material

The rich internal physics due to competing electronic phases present in phase-transition materials such as VO2 offer the potential for compact building block design for emerging non-von Neumann computing technologies. Here, based on the relaxation dynamics of an insulator-metal phase transition, we demonstrate experimentally a decision-tree classifier embedded within a single volatile resistive switching device. The tree is constructed by the combination of the voltage pulse and relaxation time and can adapt to different tasks. We use machine learning to analyze the relaxation process, enabling a predictive voltage-relaxation time phase diagram for the electrical resistance state. Classification of the etiology of the chronic cough is presented as a proof-of-principle use case. Further, our approach can be generalized to broader classes of solid-state and solid-liquid interfacial systems that demonstrate a variety of phase relaxations.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Momentum shift and on-shell constructible massive amplitudes

We construct tree-level amplitude for massive particles using on-shell recursion relations based on two classes of momentum shifts: an all-line transverse shift that deforms momentum by its transverse polarization vector, and a massive Britto-Cachazo-Feng-Witten-type shift. We illustrate that these shifts allow us to correctly calculate four-point and five-point amplitudes in massive QED, without an ambiguity associated with the contact terms that may arise from a simple “gluing” of lower-point on-shell amplitudes. We discuss various aspects and applicability of the two shifts, including the large-z behavior and complexity scaling. We show that there exists a “good” all-line transverse shift for all possible little group configurations of the external particles, which can be extended to a broader class of theories with massive particles such as massive QCD and theories with massive spin-1 particles. The massive Britto-Cachazo-Feng-Witten-type shift enjoys more simplicity, but a “good” shift does not exist for all the spin states due to the specific choice of spin axis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1991

Software For Design Of Life-Support Systems

Design Assistant Workstation (DAWN) computer program is prototype of expert software system for analysis and design of regenerative, physical/chemical life-support systems that revitalize air, reclaim water, produce food, and treat waste. Incorporates both conventional software for quantitative mathematical modeling of physical, chemical, and biological processes and expert system offering user stored knowledge about materials and processes. Constructs task tree as it leads user through simulated process, offers alternatives, and indicates where alternative not feasible. Also enables user to jump from one design level to another.

Rudokas, Mary R.↗