Search NASA⌕ Search

SEARCH · Search NASA

Results for “trees”

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 379 records · Page 21

Propagation effects by roadside trees measured at UHF and L-band for mobile satellite systems

Propagation field tests were performed in Central Maryland and involved a helicopter and mobile van as the source and receiving platforms, respectively. Tests were implemented at both UHF (870 MHz) and L-band (1.5 GHz) during a period in which the trees were in full blossom and contained maximum moisture. Cumulative fade distributions were determined from the data for various fixed elevation angles, side of the road driving, and road types for both worst and best case path geometries and for overall average road conditions.

Goldhirsh, Julius↗

Hierarchical Poly Tree computer architectures defined by computational multidisciplinary mechanics

This paper will develop an alternative computer architecture called the Poly Tree. Based on the requirements of computational mechanics and the concept of hierarchical substructuring, the paper will explore the development of problem-dependent parallel networks of processors which will enable significant, often superlinear, speed enhancements; provide a logical/efficient framework for linear/nonlinear and transient structural mechanics problems; and provide a logical framework from which to apply model reduction procedures. In addition, the paper will explore optimal processor arrangements which define the overall system granularity. Consideration will also be given to system I/O requirements.

Padovan, Joe↗

Fault trees and imperfect coverage

A new algorithm is presented for solving the fault tree. The algorithm includes the dynamic behavior of the fault/error handling model but obviates the need for the Markov chain solution. As the state space is expanded in a breadth-first search (the same is done in the conversion to a Markov chain), the state's contribution to each future state is calculated exactly. A dynamic state truncation technique is also presented; it produces bounds on the unreliability of the system by considering only part of the state space. Since the model is solved as the state space is generated, the process can be stopped as soon as the desired accuracy is reached.

Dugan, Joanne B.↗

Trees, bialgebras and intrinsic numerical algorithms

Preliminary work about intrinsic numerical integrators evolving on groups is described. Fix a finite dimensional Lie group G; let g denote its Lie algebra, and let Y(sub 1),...,Y(sub N) denote a basis of g. A class of numerical algorithms is presented that approximate solutions to differential equations evolving on G of the form: dot-x(t) = F(x(t)), x(0) = p is an element of G. The algorithms depend upon constants c(sub i) and c(sub ij), for i = 1,...,k and j is less than i. The algorithms have the property that if the algorithm starts on the group, then it remains on the group. In addition, they also have the property that if G is the abelian group R(N), then the algorithm becomes the classical Runge-Kutta algorithm. The Cayley algebra generated by labeled, ordered trees is used to generate the equations that the coefficients c(sub i) and c(sub ij) must satisfy in order for the algorithm to yield an rth order numerical integrator and to analyze the resulting algorithms.

Crouch, Peter↗

Tree canopy radiance measurement system

A system is described for obtaining both an estimate of the spatial mean bidirectional reflectance factor (BRF) for a tree canopy (displaying a horizontally heterogeneous foliage distribution) and the statistical significance of that estimate. The system includes a manlift supporting a horizontal beam 7 m long on which are mounted four radiometers. These radiometers may be pointed, and radiance data acquired, in any of 11 view directions in the principal plane of the sun. A total of 80 data points, acquired in 3 min, were used to estimate the BRF of a walnut orchard 5 m tall and detect true differences of 12 percent of the mean approximately 90 percent of the time.

Caldwell, William↗

The polarization phase difference of orchard trees

An image obtained by the Jet Propulsion Laboratory's airborne L-band polarimeter (SAR) over an agricultural area near Fresno, California, was analyzed for the signatures of polarization phase difference (PPD). The PPD of orchard trees was found to be distinctly different from that of bare fields or fields covered with other crops. Thus the PPD signatures obtained from a polarimeter may be useful in the understanding of the radar remote sensing of the earth's surface.

Wang, James R.↗

A computer vision system for the recognition of trees in aerial photographs

Increasing problems of forest damage in Central Europe set the demand for an appropriate forest damage assessment tool. The Vision Expert System (VES) is presented which is capable of finding trees in color infrared aerial photographs. Concept and architecture of VES are discussed briefly. The system is applied to a multisource test data set. The processing of this multisource data set leads to a multiple interpretation result for one scene. An integration of these results will provide a better scene description by the vision system. This is achieved by an implementation of Steven's correlation algorithm.

Pinz, Axel J.↗

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↗

LinkFinder: An expert system that constructs phylogenic trees

An expert system has been developed using the C Language Integrated Production System (CLIPS) that automates the process of constructing DNA sequence based phylogenies (trees or lineages) that indicate evolutionary relationships. LinkFinder takes as input homologous DNA sequences from distinct individual organisms. It measures variations between the sequences, selects appropriate proportionality constants, and estimates the time that has passed since each pair of organisms diverged from a common ancestor. It then designs and outputs a phylogenic map summarizing these results. LinkFinder can find genetic relationships between different species, and between individuals of the same species, including humans. It was designed to take advantage of the vast amount of sequence data being produced by the Genome Project, and should be of value to evolution theorists who wish to utilize this data, but who have no formal training in molecular genetics. Evolutionary theory holds that distinct organisms carrying a common gene inherited that gene from a common ancestor. Homologous genes vary from individual to individual and species to species, and the amount of variation is now believed to be directly proportional to the time that has passed since divergence from a common ancestor. The proportionality constant must be determined experimentally; it varies considerably with the types of organisms and DNA molecules under study. Given an appropriate constant, and the variation between two DNA sequences, a simple linear equation gives the divergence time.

Inglehart, James↗

Fault tree analysis: NiH2 aerospace cells for LEO mission

The Fault Tree Analysis (FTA) is one of several reliability analyses or assessments applied to battery cells to be utilized in typical Electric Power Subsystems for spacecraft in low Earth orbit missions. FTA is generally the process of reviewing and analytically examining a system or equipment in such a way as to emphasize the lower level fault occurrences which directly or indirectly contribute to the major fault or top level event. This qualitative FTA addresses the potential of occurrence for five specific top level events: hydrogen leakage through either discrete leakage paths or through pressure vessel rupture; and four distinct modes of performance degradation - high charge voltage, suppressed discharge voltage, loss of capacity, and high pressure.

Klein, Glenn C.↗

The symbolic computation of series solutions to ordinary differential equations using trees (extended abstract)

Algorithms previously developed by the author give formulas which can be used for the efficient symbolic computation of series expansions to solutions of nonlinear systems of ordinary differential equations. As a by product of this analysis, formulas are derived which relate to trees to the coefficients of the series expansions, similar to the work of Leroux and Viennot, and Lamnabhi, Leroux and Viennot.

Grossman, Robert↗

Radar measurement of L-band signal fluctuations caused by propagation through trees

Fluctuations of an L-band, horizontally polarized signal that was transmitted from the ground through a coniferous forest canopy to an airborne radar are examined. The azimuth synthetic aperture radar (SAR) impulse response in the presence of the measured magnitude fluctuations shows increased sidelobes over the case with no trees. Statistics of the observed fluctuations are similar to other observations.

Durden, Stephen L.↗

Diurnal change in trees as observed by optical and microwave sensors - The EOS Synergism Study

The EOS (Earth Observing System) Synergism Study examined the temporal variability of the optical and microwave backscatter due to diurnal change in canopy properties of interest to ecosystem modelers. The experiment was designed to address diurnal changes in canopy water status that relate to transpiration. Multispectral optical and multifrequency, multipolarization microwave measurements were acquired using boom-truck-based systems over a two-week period. Sensor and canopy properties were collected around the clock. The canopy studied was a walnut orchard in the San Joaquin Valley of California. The results demonstrate a large diurnal variation in the dielectric properties of the tree that in turn produces significant diurnal changes in the microwave backscatter. The results suggest that permanently orbiting spaceborne sensors such as those on EOS should be placed in orbits that are optimized for the individual sensor and need not be tied together by a tight simultaneity requirement on the order of minutes to hours for the purpose of monitoring ecosystem properties.

Way, Jobea↗

Fault tree models for fault tolerant hypercube multiprocessors

Three candidate fault tolerant hypercube architectures are modeled, their reliability analyses are compared, and the resulting implications of these methods of incorporating fault tolerance into hypercube multiprocessors are discussed. In the course of performing the reliability analyses, the use of HARP and fault trees in modeling sequence dependent system behaviors is demonstrated.

Boyd, Mark A.↗

Recognition and characterization of hierarchical interstellar structure. II - Structure tree statistics

A new method of image analysis is described, in which images partitioned into 'clouds' are represented by simplified skeleton images, called structure trees, that preserve the spatial relations of the component clouds while disregarding information concerning their sizes and shapes. The method can be used to discriminate between images of projected hierarchical (multiply nested) and random three-dimensional simulated collections of clouds constructed on the basis of observed interstellar properties, and even intermediate systems formed by combining random and hierarchical simulations. For a given structure type, the method can distinguish between different subclasses of models with different parameters and reliably estimate their hierarchical parameters: average number of children per parent, scale reduction factor per level of hierarchy, density contrast, and number of resolved levels. An application to a column density image of the Taurus complex constructed from IRAS data is given. Moderately strong evidence for a hierarchical structural component is found, and parameters of the hierarchy, as well as the average volume filling factor and mass efficiency of fragmentation per level of hierarchy, are estimated. The existence of nested structure contradicts models in which large molecular clouds are supposed to fragment, in a single stage, into roughly stellar-mass cores.

Houlahan, Padraig↗

Hierarchical Poly Tree Configurations for the Solution of Dynamically Refined Finte Element Models

This paper demonstrates how a multilevel substructuring technique, called the Hierarchical Poly Tree (HPT), can be used to integrate a localized mesh refinement into the original finite element model more efficiently. The optimal HPT configurations for solving isoparametrically square h-, p-, and hp-extensions on single and multiprocessor computers is derived. In addition, the reduced number of stiffness matrix elements that must be stored when employing this type of solution strategy is quantified. Moreover, the HPT inherently provides localize 'error-trapping' and a logical, efficient means with which to isolate physically anomalous and analytically singular behavior.

Gute, G. D.↗

Automatic cataloguing and characterization of Earth science data using SE-trees

In the future, NASA's Earth Observing System (EOS) platforms will produce enormous amounts of remote sensing image data that will be stored in the EOS Data Information System. For the past several years, the Intelligent Data Management group at Goddard's Information Science and Technology Office has been researching techniques for automatically cataloguing and characterizing image data (ADCC) from EOS into a distributed database. At the core of the approach, scientists will be able to retrieve data based upon the contents of the imagery. The ability to automatically classify imagery is key to the success of contents-based search. We report results from experiments applying a novel machine learning framework, based on Set-Enumeration (SE) trees, to the ADCC domain. We experiment with two images: one taken from the Blackhills region in South Dakota; and the other from the Washington DC area. In a classical machine learning experimentation approach, an image's pixels are randomly partitioned into training (i.e. including ground truth or survey data) and testing sets. The prediction model is built using the pixels in the training set, and its performance is estimated using the testing set. With the first Blackhills image, we perform various experiments achieving an accuracy level of 83.2 percent, compared to 72.7 percent using a Back Propagation Neural Network (BPNN) and 65.3 percent using a Gaussain Maximum Likelihood Classifier (GMLC). However, with the Washington DC image, we were only able to achieve 71.4 percent, compared with 67.7 percent reported for the BPNN model and 62.3 percent for the GMLC.

Rymon, Ron↗

An N-body Tree Algorithm for the Cray T3D

We describe in this paper an algorithm for solving the gravitational N-body problem using tree data structures on the Cray T3D parallel supercomputer. This implementation is an adaptation of previous work where this problem was solved using an SIMD, fine-grained parallel computer. We show here that this approach lends itself, with small modifications, to more coarse-grained parallelism as well. We also show that the performance of the algorithm on the Cray T3D parallel architecture scales adequately with the number of processors (up to 256). Specific levels to be reached using the Cray T3D parallel architecture. A peak performance level of 9.6 Gflop/s is reached on 256 processors for the time critical gravity computation.

Olson, Kevin M.↗