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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 433 records · Page 24

All sources NASA NTRS DOE OSTI

NASA NTRS1971

Fault tree applications within the safety program of Idaho Nuclear Corporation

Computerized fault tree analyses are used to obtain both qualitative and quantitative information about the safety and reliability of an electrical control system that shuts the reactor down when certain safety criteria are exceeded, in the design of a nuclear plant protection system, and in an investigation of a backup emergency system for reactor shutdown. The fault tree yields the modes by which the system failure or accident will occur, the most critical failure or accident causing areas, detailed failure probabilities, and the response of safety or reliability to design modifications and maintenance schemes.

W. E. Vesely↗

NASA NTRS1972

Remote sensing of changes in morphology and physiology of trees under stress

Previsual detection of Fomes annosus in pine plantations was studied. Detailed analyses of photographic imagery obtained over the Ann Arbor Test Site during 1969 and 1970 reveal that the Ektachrome Infrared film was superior to Ektachrome Aerographic, Infrared Aerographic, or Plus-X Aerographic films for detecting Fomes annosus damage. Of far more significance in controlling the accuracy of damage detection, however, was the experience of the photo interpreter. Ratio-processing of multispectral scanner data was investigated with data collected in June of 1970 and in June of 1972. Ratioing of the 1.5-1.8 and 1.0-1.4 micrometer channels gave good results at detecting openings in the crown canopy and adjacent infected trees. Combined level slicing of the 1.5-1.8 micrometer channel and the 1.5-1.8 to 1.0-1.4 micrometer ratio permitted separation and recognition of forest litter in the openings and stressed trees adjacent ot the openings.

Olson, C. F., Jr.↗

NASA NTRS1973

On the error probability of general tree and trellis codes with applications to sequential decoding

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random binary tree codes is derived and shown to be independent of the length of the tree. An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n is derived which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence. This implication is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication and further suggest an empirical formula for the true undetected decoding error probability with sequential decoding.

Johannesson, R.↗

NASA NTRS1975

Point-connected rigid bodies in a topological tree

The purpose of the present paper is to explore the applicability of several methods of analytical mechanics to the modern problem of formulating generic equations of motion of a point-connected set of rigid bodies in a topological tree, in order to compare the results of the previously published Hooker-Margulies/Hooker equations. The unexpected result of the inquiry is the discovery that with the substitution of a key kinematical identity from the Hooker and Margulies vector-dyadic equations for the multiple-rigid-body tree, identical equations emerge from each of four quite different derivation procedures.

Likins, P. W.↗

NASA NTRS1976

Seasonal variations of the microwave scattering properties of deciduous trees as measured in the 1-18 GHz spectral range

The author has identified the following significant results. Employing two FM-CW radar spectrometers, scattering data were acquired from stands of deciduous trees during the spring and autumn. The data suggest that the trees act as a volume scatter target particularly in the 7-18 GHz region. A comparison of data collected in spring and autumn indicates that the radar scattering coefficient, sigma deg, as measured in spring can be substantially larger (as much as 10 dB) than sigma deg as measured in the autumn.

Ulaby, F. T.↗

NASA NTRS1978

An algorithm for generating an m-ary summation tree

An algorithm is presented for generating an m-ary summation tree. The algorithm is completely general and may be applied to any length input string. For an N length sequence summed in groups of m sub l at each level l a maximum of 3L - 2 storage is required. A special case of the general m-ary tree where all m sub l are equal is used to smooth data in a radio frequency interference experiment. The maximum storage required when m l sub l = m for all l reduces to the closed form 3 log m N - 2.

Sievers, M.↗

NASA NTRS1979

Development of a tree classifier for discrimination of surface mine activity from Landsat digital data

In a cooperative project with the Geological Survey of Alabama, the Mississippi State Remote Sensing Applications Program has developed a single purpose, decision-tree classifier using band-ratioing techniques to discriminate various stages of surface mining activity. The tree classifier has four levels and employs only two channels in classification at each level. An accurate computation of the amount of disturbed land resulting from the mining activity can be made as a product of the classification output. The utilization of Landsat data provides a cost-efficient, rapid, and accurate means of monitoring surface mining activities.

Solomon, J. L.↗

NASA NTRS1981

Maximum likelihood clustering with dependent feature trees

The decomposition of mixture density of the data into its normal component densities is considered. The densities are approximated with first order dependent feature trees using criteria of mutual information and distance measures. Expressions are presented for the criteria when the densities are Gaussian. By defining different typs of nodes in a general dependent feature tree, maximum likelihood equations are developed for the estimation of parameters using fixed point iterations. The field structure of the data is also taken into account in developing maximum likelihood equations. Experimental results from the processing of remotely sensed multispectral scanner imagery data are included.

Chittineni, C. B.↗

NASA NTRS1984

Dynamics of flexible bodies in tree topology - A computer oriented approach

An approach suited for automatic generation of the equations of motion for large mechanical systems (i.e., large space structures, mechanisms, robots, etc.) is presented. The system topology is restricted to a tree configuration. The tree is defined as an arbitrary set of rigid and flexible bodies connected by hinges characterizing relative translations and rotations of two adjoining bodies. The equations of motion are derived via Kane's method. The resulting equation set is of minimum dimension. Dynamical equations are imbedded in a computer program called TREETOPS. Extensive control simulation capability is built in the TREETOPS program. The simulation is driven by an interactive set-up program resulting in an easy to use analysis tool.

Singh, R. P.↗

NASA NTRS1983

11-year cycle solar modulation of cosmic ray intensity inferred from C-14 content variation in dated tree rings

A liquid scintillation-photomultiplier tube counter system was used to measure the Delta-C-14 values of 60 tree rings, dating from 1866 to 1925, that were taken from a white spruce grown in Canada at 68 deg N, 130 deg W. A 10-percent variation is found which is anticorrelated with sunspot numbers, although the amplitude of the variation is 2-3 times higher than expected in trees grown at lower latitudes. A large dip in the data at about 1875 suggests an anomalously large modulation of cosmic ray intensity during the 1867-1878 AD solar cycle, which was the most active of the 19th century.

Fan, C. Y.↗

NASA NTRS1989

Reliability database development for use with an object-oriented fault tree evaluation program

A description is given of the development of a fault-tree analysis method using object-oriented programming. In addition, the authors discuss the programs that have been developed or are under development to connect a fault-tree analysis routine to a reliability database. To assess the performance of the routines, a relational database simulating one of the nuclear power industry databases has been constructed. For a realistic assessment of the results of this project, the use of one of existing nuclear power reliability databases is planned.

Heger, A. Sharif↗

NASA NTRS1990

Centrifugal Barrel Finishing Of Turbine-Blade "Fir Trees"

Modified centrifugal barrel-finishing machine imparts desired residual compressive stresses to "fir trees" of turbine blades. Centrifugal forces generate compressive stresses, which are transmitted to turbine blades through abrasive slurries in which suspended. Eliminates need for shot peening, rounding of edges and burrs caused by shot peening and, consequently, need for mass finishing operations to remove burrs. Improves surface finish of "fir trees".

Mandel, Johnny L.↗

NASA NTRS1990

Using decision-tree classifier systems to extract knowledge from databases

One difficulty in applying artificial intelligence techniques to the solution of real world problems is that the development and maintenance of many AI systems, such as those used in diagnostics, require large amounts of human resources. At the same time, databases frequently exist which contain information about the process(es) of interest. Recently, efforts to reduce development and maintenance costs of AI systems have focused on using machine learning techniques to extract knowledge from existing databases. Research is described in the area of knowledge extraction using a class of machine learning techniques called decision-tree classifier systems. Results of this research suggest ways of performing knowledge extraction which may be applied in numerous situations. In addition, a measurement called the concept strength metric (CSM) is described which can be used to determine how well the resulting decision tree can differentiate between the concepts it has learned. The CSM can be used to determine whether or not additional knowledge needs to be extracted from the database. An experiment involving real world data is presented to illustrate the concepts described.

St.clair, D. C.↗

NASA NTRS1990

Using minimal spanning trees to compare the reliability of network topologies

Graph theoretic methods are applied to compute the reliability for several types of networks of moderate size. The graph theory methods used are minimal spanning trees for networks with bi-directional links and the related concept of strongly connected directed graphs for networks with uni-directional links. A comparison is conducted of ring networks and braided networks. The case is covered where just the links fail and the case where both links and nodes fail. Two different failure modes for the links are considered. For one failure mode, the link no longer carries messages. For the other failure mode, the link delivers incorrect messages. There is a description and comparison of link-redundancy versus path-redundancy as methods to achieve reliability. All the computations are carried out by means of a fault tree program.

Leister, Karen J.↗

NASA NTRS1990

Multi-level Hierarchical Poly Tree computer architectures

Based on the concept of hierarchical substructuring, this paper develops an optimal multi-level Hierarchical Poly Tree (HPT) parallel computer architecture scheme which is applicable to the solution of finite element and difference simulations. Emphasis is given to minimizing computational effort, in-core/out-of-core memory requirements, and the data transfer between processors. In addition, a simplified communications network that reduces the number of I/O channels between processors is presented. HPT configurations that yield optimal superlinearities are also demonstrated. Moreover, to generalize the scope of applicability, special attention is given to developing: (1) multi-level reduction trees which provide an orderly/optimal procedure by which model densification/simplification can be achieved, as well as (2) methodologies enabling processor grading that yields architectures with varying types of multi-level granularity.

Padovan, Joe↗

NASA NTRS1990

Optimal parallel evaluation of AND trees

A quantitative analysis based on both preemptive and nonpreemptive critical-path scheduling algorithms is presently conducted for the optimal degree of parallelism required in evaluating a given AND tree. The optimal degree of parallelism is found to depend on problem complexity, precedence-graph shape, and task-time distribution along each path. In addition to demonstrating the optimality of the preemptive critical-path scheduling algorithm for evaluating an arbitrary AND tree on a fixed number of processors, the possibility of efficiently ascertaining tight bounds on the number of processors for optimal processor-time efficiency is illustrated.

Wah, Benjamin W.↗

NASA NTRS1990

A survey of decision tree classifier methodology

Decision Tree Classifiers (DTC's) 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 DTC's 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 issue. After considering potential advantages of DTC's over single stage classifiers, subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed.

Safavian, S. Rasoul↗

NASA NTRS1992

Object-Oriented Algorithm For Evaluation Of Fault Trees

Algorithm for direct evaluation of fault trees incorporates techniques of object-oriented programming. Reduces number of calls needed to solve trees with repeated events. Provides significantly improved software environment for such computations as quantitative analyses of safety and reliability of complicated systems of equipment (e.g., spacecraft or factories).

Patterson-Hine, F. A.↗