Tree analysis code /TRACE/ program E64106. NERVA program
Computer program for Monte Carlo simulation of fault trees in analysis of large complex systems
Tayama, H. R.↗
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.
TREETRAN - A FORTRAN 4 subroutine package for manipulation of rooted trees
TREETRAN subroutine package in FORTRAN 4 for manipulation of tree structured data
Pfaltz, J. L.↗
An evaluation of possible relationships between solar activity and tree-ring growth in western North America
Relationship between tree ring growth variations and solar activity since 1700 in western North America
Fritts, H. C.↗
The use of multispectral sensing techniques to detect ponderosa pine trees under stress from insect or pathogenic organisms
Application of multispectral sensors to detect insect and disease infestation of ponderosa pine trees
Heller, R. C.↗
Program listing for fault tree analysis of JPL technical report 32-1542
The computer program listing for the MAIN program and those subroutines unique to the fault tree analysis are described. Some subroutines are used for analyzing the reliability block diagram. The program is written in FORTRAN 5 and is running on a UNIVAC 1108.
Chelson, P. O.↗
Analog tree-organized multiplexer
An analog tree-organized multiplexer (ATOM) which is intended for use in the telemetry system of an interplanetary spacecraft is designed. The ATOM will be fabricated by a monolithic, dielectric isolation process, and will contain silicon junction field effect transistors (JFET) as the active elements. The effect of the radiation environment on the performance of the ATOM is analyzed. The result indicates that the expected radiation environment will cause only minor changes in the preradiation characteristics of ATOM. The JFET in the ATOM is designed to meet the electrical requirements when fabricated by either the double poly-dielectric isolation process or the raised dielectric isolation process. The effect of the heat treatment required for the dielectric isolation process on the diffusion profile of the JFET is described. The layout of the ATOM circuit for fabrication by either the double poly or raised dielectric isolation process is also given.
Crabbe, J. S.↗
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.↗
Radiocarbon content in the annual tree rings during last 150 years and time variation of cosmic rays
The results of the high accuracy measurements of radiocarbon abundance in precisely dated tree rings in the interval 1800 to 1950 yrs are discussed. Radiocarbon content caused by solar activity is established. The temporal dependence of cosmic rays is constructed, by use of radio abundance data.
Kocharov, G. E.↗
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↗