Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 451 records · Page 25

A survey of decision tree classifier methodology

Decision tree classifiers (DTCs) are used successfully in many diverse areas such as radar signal classification, character recognition, remote sensing, medical diagnosis, expert systems, and speech recognition. Perhaps the most important feature of DTCs is their capability to break down a complex decision-making process into a collection of simpler decisions, thus providing a solution which is often easier to interpret. A survey of current methods is presented for DTC designs and the various existing issues. After considering potential advantages of DTCs over single-state classifiers, subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed.

Safavian, S. R.↗

Diurnal water relations of walnut trees - Implications for remote sensing

Leaflet water content (WC), relative water content (RWC), and water potential, Phi(lf) were measured as indicators of diurnal change in tree water status in an experimental walnut orchard receiving two irrigation treatments: 100 and 33 percent of potential evapotranspiration (PET). Diurnal change was greatest in Phi(lf) throughout the experimental period, with minima occurring each day in early to mid-afternoon and maxima between midnight and sunrise. Leaflet WC and RWC were lower in the afternoon than at night, but had greater variability so that the diurnal pattern was not as clear. Comparison between the pattern of Phi(lf) and dielectric constants (DCs) measured from probes inserted 2 cm into a tree hole showed that both declined nearly in parallel in the morning. Phi(lf) recovered more rapidly than DC in the afternoon. This temporal discrepancy could be caused by cavitation of xylem elements in the vicinity of the DC probe. Microwave backscatter for L- and X-bands also measured diurnal variation that had local minima in the afternoon, but the pattern among wavelength and polarization signatures was complex.

Weber, James A.↗

Structural system reliability calculation using a probabilistic fault tree analysis method

The development of a new probabilistic fault tree analysis (PFTA) method for calculating structural system reliability is summarized. The proposed PFTA procedure includes: developing a fault tree to represent the complex structural system, constructing an approximation function for each bottom event, determining a dominant sampling sequence for all bottom events, and calculating the system reliability using an adaptive importance sampling method. PFTA is suitable for complicated structural problems that require computer-intensive computer calculations. A computer program has been developed to implement the PFTA.

Torng, T. Y.↗

Recursive optimal pruning with applications to tree structured vector quantizers

A pruning algorithm of Chou et al. (1989) for designing optimal tree structures identifies only those codebooks which lie on the convex hull of the original codebook's operational distortion rate function. The authors introduce a modified version of the original algorithm, which identifies a large number of codebooks having minimum average distortion, under the constraint that, in each step, only modes having no descendents are removed from the tree. All codebooks generated by the original algorithm are also generated by this algorithm. The new algorithm generates a much larger number of codebooks in the middle- and low-rate regions. The additional codebooks permit operation near the codebook's operational distortion rate function without time sharing by choosing from the increased number of available bit rates. Despite the statistical mismatch which occurs when coding data outside the training sequence, these pruned codebooks retain their performance advantage over full search vector quantizers (VQs) for a large range of rates.

Kiang, Shei-Zein↗

An improved classification tree analysis of high cost modules based upon an axiomatic definition of complexity

Identification of high cost modules has been viewed as one mechanism to improve overall system reliability, since such modules tend to produce more than their share of problems. A decision tree model was used to identify such modules. In this current paper, a previously developed axiomatic model of program complexity is merged with the previously developed decision tree process for an improvement in the ability to identify such modules. This improvement was tested using data from the NASA Software Engineering Laboratory.

Tian, Jianhui↗

An investigation of the relationship between tree water potential and dielectric constant

An experiment that has been performed to verify the relationship between the dielectric constant of several tree species and their respective water potentials is described. The water potential, xylem flow and dielectric properties of five tree species were continuously monitored while simultaneously manipulating canopy transpiration and water status. An analysis of the data recorded during these manipulations is presented. Results of this analysis demonstrate a clear coincidence of change in dielectric constant and water status. The implication of this relationship for the utilization of remotely sensed data to study canopy water relations is explored. Preliminary backscatter modeling results demonstrate that the changes in dielectric constant that occur as a result of changes in water status are significant enough to be observable with microwave radar.

Mcdonald, Kyle C.↗

Three-dimensional object recognition using similar triangles and decision trees

A system, TRIDEC, that is capable of distinguishing between a set of objects despite changes in the objects' positions in the input field, their size, or their rotational orientation in 3D space is described. TRIDEC combines very simple yet effective features with the classification capabilities of inductive decision tree methods. The feature vector is a list of all similar triangles defined by connecting all combinations of three pixels in a coarse coded 127 x 127 pixel input field. The classification is accomplished by building a decision tree using the information provided from a limited number of translated, scaled, and rotated samples. Simulation results are presented which show that TRIDEC achieves 94 percent recognition accuracy in the 2D invariant object recognition domain and 98 percent recognition accuracy in the 3D invariant object recognition domain after training on only a small sample of transformed views of the objects.

Spirkovska, Lilly↗

Canonical multi-valued input Reed-Muller trees and forms

There is recently an increased interest in logic synthesis using EXOR gates. The paper introduces the fundamental concept of Orthogonal Expansion, which generalizes the ring form of the Shannon expansion to the logic with multiple-valued (mv) inputs. Based on this concept we are able to define a family of canonical tree circuits. Such circuits can be considered for binary and multiple-valued input cases. They can be multi-level (trees and DAG's) or flattened to two-level AND-EXOR circuits. Input decoders similar to those used in Sum of Products (SOP) PLA's are used in realizations of multiple-valued input functions. In the case of the binary logic the family of flattened AND-EXOR circuits includes several forms discussed by Davio and Green. For the case of the logic with multiple-valued inputs, the family of the flattened mv AND-EXOR circuits includes three expansions known from literature and two new expansions.

Perkowski, M. A.↗

The explicit computation of integration algorithms and first integrals for ordinary differential equations with polynomials coefficients using trees

This note is concerned with the explicit symbolic computation of expressions involving differential operators and their actions on functions. The derivation of specialized numerical algorithms, the explicit symbolic computation of integrals of motion, and the explicit computation of normal forms for nonlinear systems all require such computations. More precisely, if R = k(x(sub 1),...,x(sub N)), where k = R or C, F denotes a differential operator with coefficients from R, and g member of R, we describe data structures and algorithms for efficiently computing g. The basic idea is to impose a multiplicative structure on the vector space with basis the set of finite rooted trees and whose nodes are labeled with the coefficients of the differential operators. Cancellations of two trees with r + 1 nodes translates into cancellation of O(N(exp r)) expressions involving the coefficient functions and their derivatives.

Crouch, P. E.↗

Microgravity Experiments Safety and Integration Requirements Document Tree

This report is a document tree of the safety and integration documents required to develop a space experiment. Pertinent document information for each of the top level (tier one) safety and integration documents, and their applicable and reference (tier two) documents has been identified. This information includes: document title, revision level, configuration management, electronic availability, listed applicable and reference documents, source for obtaining the document, and document owner. One of the main conclusions of this report is that no single document tree exists for all safety and integration documents, regardless of the Shuttle carrier. This document also identifies the need for a single point of contact for customers wishing to access documents. The data in this report serves as a valuable information source for the NASA Lewis Research Center Project Documentation Center, as well as for all developers of space experiments.

Hogan, Jean M.↗

Automated Monitoring Of Dielectric Properties Of Tree Trunks

Semiautomated instrumentation system called "dielectric monitoring system" (DMS) developed for measuring microwave permittivities of selected components of plants, in particular, of active xylems in tree trunks. System set up with coaxial probes inserted in tree trunks to measure dielectric properties. Can be left to operate unattended to gather data on permittivities as function of time.

Mcdonald, Kyle C.↗

Simultaneous measurements of L- and S-band tree shadowing for space-Earth communications

We present results from simultaneous L- and S-Band slant-path fade measurements through trees. One circularly-polarized antenna was used at each end of the dual-frequency link to provide information on the correlation of tree shadowing at 1620 and 2500 MHz. Fades were measured laterally in the shadow region with 5 cm spacing. Fade differences between L- and S-Band had a normal distribution with low means and standard deviations from 5.2 to 7.5 dB. Spatial variations occurred with periods larger than 1-2 wavelengths. Swept measurements over 160 MHz spans showed that the stdv. of power as function of frequency increased from approximately 1-6 dB at locations with mean fades of 4 and 20 dB, respectively. At a 5 dB fade, the central 90% of fade slopes were within a range of 0.7 (1.9) dB/MHz at L-(S-) Band.

Vogel, Wolfhard J.↗

Fault Tree Analysis: A Bibliography

Fault tree analysis is a top-down approach to the identification of process hazards. It is as one of the best methods for systematically identifying an graphically displaying the many ways some things can go wrong. This bibliography references 266 documents in the NASA STI Database that contain the major concepts. fault tree analysis, risk an probability theory, in the basic index or major subject terms. An abstract is included with most citations, followed by the applicable subject terms.

Source record↗

BOREAS TE-5 Tree Ring and Carbon Isotope Ratio Data

The BOREAS TE-5 team collected several data sets to investigate the vegetation-atmosphere CO2 and H2O exchange processes. These data include tree ring widths and cellulose carbon isotope data from coniferous trees collected at the BOREAS NSA and SSA in 1993 and 1994 by the BOREAS TE-5 team. Ring width data are provided for both Picea mariana and Pinus banksiana. The carbon isotope data are provided only for Pinus banksiana. The data are provided in tabular ASCII files. The data files are available on a CD-ROM (see document number 20010000884), or from the Oak Ridge National Laboratory (ORNL) Distributed Active Archive Center (DAAC).

Hall, Forrest G.↗

Isosurface Extraction in Time-Varying Fields Using a Temporal Hierarchical Index Tree

Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to large-scale time-varying fields, the storage overhead incurred from storing the search index often becomes overwhelming. this paper proposes an algorithm for locating isosurface cells in time-varying fields. We devise a new data structure, called Temporal Hierarchical Index Tree, which utilizes the temporal coherence that exists in a time-varying field and adoptively coalesces the cells' extreme values over time; the resulting extreme values are then used to create the isosurface cell search index. For a typical time-varying scalar data set, not only does this temporal hierarchical index tree require much less storage space, but also the amount of I/O required to access the indices from the disk at different time steps is substantially reduced. We illustrate the utility and speed of our algorithm with data from several large-scale time-varying CID simulations. Our algorithm can achieve more than 80% of disk-space savings when compared with the existing techniques, while the isosurface extraction time is nearly optimal.

Shen, Han-Wei↗

Rooting the archaebacterial tree: the pivotal role of Thermococcus celer in archaebacterial evolution

The sequence of the 16S ribosomal RNA gene from the archaebacterium Thermococcus celer shows the organism to be related to the methanogenic archaebacteria rather than to its phenotypic counterparts, the extremely thermophilic archaebacteria. This conclusion turns on the position of the root of the archaebacterial phylogenetic tree, however. The problems encountered in rooting this tree are analyzed in detail. Under conditions that suppress evolutionary noise both the parsimony and evolutionary distance methods yield a root location (using a number of eubacterial or eukaryotic outgroup sequences) that is consistent with that determined by an "internal rooting" method, based upon an (approximate) determination of relative evolutionary rates.

Non-NASA Center↗

Interpreting the universal phylogenetic tree

The universal phylogenetic tree not only spans all extant life, but its root and earliest branchings represent stages in the evolutionary process before modern cell types had come into being. The evolution of the cell is an interplay between vertically derived and horizontally acquired variation. Primitive cellular entities were necessarily simpler and more modular in design than are modern cells. Consequently, horizontal gene transfer early on was pervasive, dominating the evolutionary dynamic. The root of the universal phylogenetic tree represents the first stage in cellular evolution when the evolving cell became sufficiently integrated and stable to the erosive effects of horizontal gene transfer that true organismal lineages could exist.

Non-NASA Center↗

Pattern Matcher for Trees Constructed from Lists

A software library has been developed that takes a high-level description of a pattern to be satisfied and applies it to a target. If the two match, it returns success; otherwise, it indicates a failure. The target is semantically a tree that is constructed from elements of terminal and non-terminal nodes represented through lists and symbols. Additionally, functionality is provided for finding the element in a set that satisfies a given pattern and doing a tree search, finding all occurrences of leaf nodes that match a given pattern. This process is valuable because it is a new algorithmic approach that significantly improves the productivity of the programmers and has the potential of making their resulting code more efficient by the introduction of a novel semantic representation language. This software has been used in many applications delivered to NASA and private industry, and the cost savings that have resulted from it are significant.

James, Mark↗