Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 955 records · Page 53

Photographic Remote Sensing of Sick Citrus Trees

Remote sensing with infrared color aerial photography (Kodak Ektachrome Infrared Aero 8443 film) for detecting citrus tree anomalies is described. Illustrations and discussions are given for detecting nutrient toxicity symptoms, for detecting foot rot and sooty mold fungal diseases, and for distinguishing among citrus species. Also, the influence of internal leaf structure on light reflectance, transmittance, and absorptance are considered; and physiological and environmental factors that affect citrus leaf light reflectance are reviewed briefly and illustrated.

Gausman, H. W.↗

Generalized m series in tree enumeration.

Consideration of a particular series formed by deleting certain branches of the complete graph K sub t with t vertices. A class of graphs which contains the m series as a special case is considered, and a new formula is given for the m series itself (an m series graph is obtained from K sub t by removing m branches forming a closed loop). A formula is derived for the number of labeled spanning trees in the graph obtained by deleting certain branches from K sub t.

O'Neil, P. V.↗

Tree-manipulating systems and Church-Rosser theorems.

Study of a broad class of tree-manipulating systems called subtree replacement systems. The use of this framework is illustrated by general theorems analogous to the Church-Rosser theorem and by applications of these theorems. Sufficient conditions are derived for the Church-Rosser property, and their applications to recursive definitions, the lambda calculus, and parallel programming are discussed. McCarthy's (1963) recursive calculus is extended by allowing a choice between call-by-value and call-by-name. It is shown that recursively defined functions are single-valued despite the nondeterminism of the evaluation algorithm. It is also shown that these functions solve their defining equations in a 'canonical' manner.

Rosen, B. K.↗

Tree encoding for symmetric sources with a distortion measure

A simple algorithm is developed for mapping the outputs of a source into a set of code sequences generated by a tree code. The algorithm is analyzed for the case of a source producing discrete independent equiprobable letters when the distortion measure satisfies a certain symmetry condition. It is shown that the algorithm is capable of achieving an average distortion as close as desired to the minimum average distortion for the code rate given by Shannon's rate-distortion theorem.

Gallager, R. G.↗

Computer storage and retrieval of coronary trees

Coronary cineangiography is a routine procedure for evaluation of the coronary circulation. From the biplane cineangiograms a visual representation of coronary perfusion was obtained. A collection of simple ideas and procedures to aid in the collection is described. The uses to which the tree data will be put include the evaluation of myocardial function and the formation of a library sufficiently large to enable some taxonomic classification of coronary artery patterns to be made.

Starmer, C. F.↗

Molecular phylogenetic trees - On the validity of the Goodman-Moore augmentation algorithm

A response is made to the reply of Nei and Tateno (1979) to the letter of Holmquist (1978) supporting the validity of the augmentation algorithm of Moore (1977) in reconstructions of nucleotide substitutions by means of the maximum parsimony principle. It is argued that the overestimation of the augmented numbers of nucleotide substitutions (augmented distances) found by Tateno and Nei (1978) is due to an unrepresentative data sample and that it is only necessary that evolution be stochastically uniform in different regions of the phylogenetic network for the augmentation method to be useful. The importance of the average value of the true distance over all links is explained, and the relative variances of the true and augmented distances are calculated to be almost identical. The effects of topological changes in the phylogenetic tree on the augmented distance and the question of the correctness of ancestral sequences inferred by the method of parsimony are also clarified.

Holmquist, R.↗

An enhanced Oct-tree data structure and operations for solid modeling

Oct-trees are enhanced to increase the processing efficiency of geometric operations for interactive CAD use. Further enhancement is made to combine them with surface models for more precise boundary specification as needed by tool path generation in CAM applications.

Fujimura, K.↗

Tree-oriented interactive processing with an application to theorem-proving, appendix E

The concept of unstructured structure editing and ted, an editor for unstructured trees, is described. Ted is used to manipulate hierarchies of information in an unrestricted manner. The tool was implemented and applied to the problem of organizing formal proofs. As a proof management tool, it maintains the validity of a proof and its constituent lemmas independently from the methods used to validate the proof. It includes an adaptable interface which may be used to invoke theorem provers and other aids to proof construction. Using ted, a user may construct, maintain, and verify formal proofs using a variety of theorem provers, proof checkers, and formatters.

Hammerslag, David↗

Fault tree safety analysis of a large Li/SOCl(sub)2 spacecraft battery

The results of the safety fault tree analysis on the eight module, 576 F cell Li/SOCl2 battery on the spacecraft and in the integration and test environment prior to launch on the ground are presented. The analysis showed that with the right combination of blocking diodes, electrical fuses, thermal fuses, thermal switches, cell balance, cell vents, and battery module vents the probability of a single cell or a 72 cell module exploding can be reduced to .000001, essentially the probability due to explosion for unexplained reasons.

Uy, O. Manuel↗

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↗