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
NASA NTRS2004

Cloud Detection from Satellite Imagery: A Comparison of Expert-Generated and Automatically-Generated Decision Trees

Automated cloud detection and tracking is an important step in assessing global climate change via remote sensing. Cloud masks, which indicate whether individual pixels depict clouds, are included in many of the data products that are based on data acquired on- board earth satellites. Many cloud-mask algorithms have the form of decision trees, which employ sequential tests that scientists designed based on empirical astrophysics studies and astrophysics simulations. Limitations of existing cloud masks restrict our ability to accurately track changes in cloud patterns over time. In this study we explored the potential benefits of automatically-learned decision trees for detecting clouds from images acquired using the Advanced Very High Resolution Radiometer (AVHRR) instrument on board the NOAA-14 weather satellite of the National Oceanic and Atmospheric Administration. We constructed three decision trees for a sample of 8km-daily AVHRR data from 2000 using a decision-tree learning procedure provided within MATLAB(R), and compared the accuracy of the decision trees to the accuracy of the cloud mask. We used ground observations collected by the National Aeronautics and Space Administration Clouds and the Earth s Radiant Energy Systems S COOL project as the gold standard. For the sample data, the accuracy of automatically learned decision trees was greater than the accuracy of the cloud masks included in the AVHRR data product.

Shiffman, Smadar↗
NASA NTRS2000

A systematic risk management approach employed on the CloudSat project

The CloudSat Project has developed a simplified approach for fault tree analysis and probabilistic risk assessment. A system-level fault tree has been constructed to identify credible fault scenarios and failure modes leading up to a potential failure to meet the nominal mission success criteria.

risk management fault tree analysis probabilistic ↗
NASA NTRS1986

Constructing a working taxonomy of functional Ada software components for real-time embedded system applications

A major impediment to a systematic attack on Ada software reusability is the lack of an effective taxonomy for software component functions. The scope of all possible applications of Ada software is considered too great to allow the practical development of a working taxonomy. Instead, for the purposes herein, the scope of Ada software application is limited to device and subsystem control in real-time embedded systems. A functional approach is taken in constructing the taxonomy tree for identified Ada domain. The use of modular software functions as a starting point fits well with the object oriented programming philosophy of Ada. Examples of the types of functions represented within the working taxonomy are real time kernels, interrupt service routines, synchronization and message passing, data conversion, digital filtering and signal conditioning, and device control. The constructed taxonomy is proposed as a framework from which a need analysis can be performed to reveal voids in current Ada real-time embedded programming efforts for Space Station.

Wallace, Robert↗
NASA NTRS1978

Evolution of early life inferred from protein and ribonucleic acid sequences

The chemical structures of ferredoxin, 5S ribosomal RNA, and c-type cytochrome sequences have been employed to construct a phylogenetic tree which connects all major photosynthesizing organisms: the three types of bacteria, blue-green algae, and chloroplasts. Anaerobic and aerobic bacteria, eukaryotic cytoplasmic components and mitochondria are also included in the phylogenetic tree. Anaerobic nonphotosynthesizing bacteria similar to Clostridium were the earliest organisms, arising more than 3.2 billion years ago. Bacterial photosynthesis evolved nearly 3.0 billion years ago, while oxygen-evolving photosynthesis, originating in the blue-green algal line, came into being about 2.0 billion years ago. The phylogenetic tree supports the symbiotic theory of the origin of eukaryotes.

Dayhoff, M. O.↗
NASA NTRS1991

Logic flowgraph methodology - A tool for modeling embedded systems

The logic flowgraph methodology (LFM), a method for modeling hardware in terms of its process parameters, has been extended to form an analytical tool for the analysis of integrated (hardware/software) embedded systems. In the software part of a given embedded system model, timing and the control flow among different software components are modeled by augmenting LFM with modified Petrinet structures. The objective of the use of such an augmented LFM model is to uncover possible errors and the potential for unanticipated software/hardware interactions. This is done by backtracking through the augmented LFM mode according to established procedures which allow the semiautomated construction of fault trees for any chosen state of the embedded system (top event). These fault trees, in turn, produce the possible combinations of lower-level states (events) that may lead to the top event.

Muthukumar, C. T.↗
NASA NTRS1997

Sulfur in Cometary Dust

The computer-intensive project consisted of the analysis and synthesis of existing data on composition of comet Halley dust particles. The main objective was to obtain a complete inventory of sulfur containing compounds in the comet Halley dust by building upon the existing classification of organic and inorganic compounds and applying a variety of statistical techniques for cluster and cross-correlational analyses. A student hired for this project wrote and tested the software to perform cluster analysis. The following tasks were carried out: (1) selecting the data from existing database for the proposed project; (2) finding access to a standard library of statistical routines for cluster analysis; (3) reformatting the data as necessary for input into the library routines; (4) performing cluster analysis and constructing hierarchical cluster trees using three methods to define the proximity of clusters; (5) presenting the output results in different formats to facilitate the interpretation of the obtained cluster trees; (6) selecting groups of data points common for all three trees as stable clusters. We have also considered the chemistry of sulfur in inorganic compounds.

Fomenkova, M. N.↗
NASA NTRS1989

Binary space partitioning trees and their uses

Binary Space Partitioning (BSP) trees have some qualities that make them useful in solving many graphics related problems. The purpose is to describe what a BSP tree is, and how it can be used to solve the problem of hidden surface removal, and constructive solid geometry. The BSP tree is based on the idea that a plane acting as a divider subdivides space into two parts with one being on the positive side and the other on the negative. A polygonal solid is then represented as the volume defined by the collective interior half spaces of the solid's bounding surfaces. The nature of how the tree is organized lends itself well for sorting polygons relative to an arbitrary point in 3 space. The speed at which the tree can be traversed for depth sorting is fast enough to provide hidden surface removal at interactive speeds. The fact that a BSP tree actually represents a polygonal solid as a bounded volume also makes it quite useful in performing the boolean operations used in constructive solid geometry. Due to the nature of the BSP tree, polygons can be classified as they are subdivided. The ability to classify polygons as they are subdivided can enhance the simplicity of implementing constructive solid geometry.

Bell, Bradley N.↗
NASA NTRS1989

An O(log sup 2 N) parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

An O(log sup 2 N) parallel algorithm is presented for computing the eigenvalues of a symmetric tridiagonal matrix using a parallel algorithm for computing the zeros of the characteristic polynomial. 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 exact behavior of the polynomials at the interval endpoints is used to eliminate the usual problems induced by finite precision arithmetic.

Swarztrauber, Paul N.↗
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.↗
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.↗
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↗
NASA NTRS1990

Scattering measurements on natural and model trees

The acoustical back scattering from a simple scale model of a tree has been experimentally measured. The model consisted of a trunk and six limbs, each with 4 branches; no foliage or twigs were included. The data from the anechoic chamber measurements were then mathematically combined to construct the effective back scattering from groups of trees. Also, initial measurements have been conducted out-of-doors on a single tree in an open field in order to characterize its acoustic scattering as a function of azimuth angle. These measurements were performed in the spring, prior to leaf development. The data support a statistical model of forest scattering; the scattered signal spectrum is highly irregular but with a remarkable general resemblance to the incident signal spectrum. Also, the scattered signal's spectra showed little dependence upon scattering angle.

Rogers, James C.↗
NASA NTRS2009

Deriving Safety Cases from Automatically Constructed Proofs

Formal proofs provide detailed justification for the validity of claims and are widely used in formal software development methods. However, they are often complex and difficult to understand, because the formalism in which they are constructed and encoded is usually machine-oriented, and they may also be based on assumptions that are not justified. This causes concerns about the trustworthiness of using formal proofs as arguments in safety-critical applications. Here, we present an approach to develop safety cases that correspond to formal proofs found by automated theorem provers and reveal the underlying argumentation structure and top-level assumptions. We concentrate on natural deduction style proofs, which are closer to human reasoning than resolution proofs, and show how to construct the safety cases by covering the natural deduction proof tree with corresponding safety case fragments. We also abstract away logical book-keeping steps, which reduces the size of the constructed safety cases. We show how the approach can be applied to the proofs found by the Muscadet prover.

Basir, Nurlida↗