Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “trees (mathematics)”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

The Fault Tree Compiler (FTC): Program and mathematics

The Fault Tree Compiler Program is a new reliability tool used to predict the top-event probability for a fault tree. Five different gate types are allowed in the fault tree: AND, OR, EXCLUSIVE OR, INVERT, AND m OF n gates. The high-level input language is easy to understand and use when describing the system tree. In addition, the use of the hierarchical fault tree capability can simplify the tree description and decrease program execution time. The current solution technique provides an answer precisely (within the limits of double precision floating point arithmetic) within a user specified number of digits accuracy. The user may vary one failure rate or failure probability over a range of values and plot the results for sensitivity analyses. The solution technique is implemented in FORTRAN; the remaining program code is implemented in Pascal. The program is written to run on a Digital Equipment Corporation (DEC) VAX computer with the VMS operation system.

Butler, Ricky W.↗
NASA NTRS1982

An automated approach to the design of decision tree classifiers

An automated technique is presented for designing effective decision tree classifiers predicated only on a priori class statistics. The procedure relies on linear feature extractions and Bayes table look-up decision rules. Associated error matrices are computed and utilized to provide an optimal design of the decision tree at each so-called 'node'. A by-product of this procedure is a simple algorithm for computing the global probability of correct classification assuming the statistical independence of the decision rules. Attention is given to a more precise definition of decision tree classification, the mathematical details on the technique for automated decision tree design, and an example of a simple application of the procedure using class statistics acquired from an actual Landsat scene.

Argentiero, P.↗
NASA NTRS1986

Simplified Decoding of Convolutional Codes

Some complicated intermediate steps shortened or eliminated. Decoding of convolutional error-correcting digital codes simplified by new errortrellis syndrome technique. In new technique, syndrome vector not computed. Instead, advantage taken of newly-derived mathematical identities simplify decision tree, folding it back on itself into form called "error trellis." This trellis graph of all path solutions of syndrome equations. Each path through trellis corresponds to specific set of decisions as to received digits. Existing decoding algorithms combined with new mathematical identities reduce number of combinations of errors considered and enable computation of correction vector directly from data and check bits as received.

Truong, T. K.↗
NASA NTRS1993

Software For Fault-Tree Diagnosis Of A System

Fault Tree Diagnosis System (FTDS) computer program is automated-diagnostic-system program identifying likely causes of specified failure on basis of information represented in system-reliability mathematical models known as fault trees. Is modified implementation of failure-cause-identification phase of Narayanan's and Viswanadham's methodology for acquisition of knowledge and reasoning in analyzing failures of systems. Knowledge base of if/then rules replaced with object-oriented fault-tree representation. Enhancement yields more-efficient identification of causes of failures and enables dynamic updating of knowledge base. Written in C language, C++, and Common LISP.

Iverson, Dave↗
NASA NTRS2005

Faults Discovery By Using Mined Data

Fault discovery in the complex systems consist of model based reasoning, fault tree analysis, rule based inference methods, and other approaches. Model based reasoning builds models for the systems either by mathematic formulations or by experiment model. Fault Tree Analysis shows the possible causes of a system malfunction by enumerating the suspect components and their respective failure modes that may have induced the problem. The rule based inference build the model based on the expert knowledge. Those models and methods have one thing in common; they have presumed some prior-conditions. Complex systems often use fault trees to analyze the faults. Fault diagnosis, when error occurs, is performed by engineers and analysts performing extensive examination of all data gathered during the mission. International Space Station (ISS) control center operates on the data feedback from the system and decisions are made based on threshold values by using fault trees. Since those decision-making tasks are safety critical and must be done promptly, the engineers who manually analyze the data are facing time challenge. To automate this process, this paper present an approach that uses decision trees to discover fault from data in real-time and capture the contents of fault trees as the initial state of the trees.

Lee, Charles↗
NASA NTRS2013

Method and system for dynamic probabilistic risk assessment

The DEFT methodology, system and computer readable medium extends the applicability of the PRA (Probabilistic Risk Assessment) methodology to computer-based systems, by allowing DFT (Dynamic Fault Tree) nodes as pivot nodes in the Event Tree (ET) model. DEFT includes a mathematical model and solution algorithm, supports all common PRA analysis functions and cutsets. Additional capabilities enabled by the DFT include modularization, phased mission analysis, sequence dependencies, and imperfect coverage.

Dugan, Joanne Bechta↗
NASA NTRS2011

Graph Theory Roots of Spatial Operators for Kinematics and Dynamics

Spatial operators have been used to analyze the dynamics of robotic multibody systems and to develop novel computational dynamics algorithms. Mass matrix factorization, inversion, diagonalization, and linearization are among several new insights obtained using such operators. While initially developed for serial rigid body manipulators, the spatial operators and the related mathematical analysis have been shown to extend very broadly including to tree and closed topology systems, to systems with flexible joints, links, etc. This work uses concepts from graph theory to explore the mathematical foundations of spatial operators. The goal is to study and characterize the properties of the spatial operators at an abstract level so that they can be applied to a broader range of dynamics problems. The rich mathematical properties of the kinematics and dynamics of robotic multibody systems has been an area of strong research interest for several decades. These properties are important to understand the inherent physical behavior of systems, for stability and control analysis, for the development of computational algorithms, and for model development of faithful models. Recurring patterns in spatial operators leads one to ask the more abstract question about the properties and characteristics of spatial operators that make them so broadly applicable. The idea is to step back from the specific application systems, and understand more deeply the generic requirements and properties of spatial operators, so that the insights and techniques are readily available across different kinematics and dynamics problems. In this work, techniques from graph theory were used to explore the abstract basis for the spatial operators. The close relationship between the mathematical properties of adjacency matrices for graphs and those of spatial operators and their kernels were established. The connections hold across very basic requirements on the system topology, the nature of the component bodies, the indexing schemes, etc. The relationship of the underlying structure is intimately connected with efficient, recursive computational algorithms. The results provide the foundational groundwork for a much broader look at the key problems in kinematics and dynamics. The properties of general graphs and trees of nodes and edge were examined, as well as the properties of adjacency matrices that are used to describe graph connectivity. The nilpotency property of such matrices for directed trees was reviewed, and the adjacency matrices were generalized to the notion of block weighted adjacency matrices that support block matrix elements. This leads us to the development of the notion of Spatial Kernel Operator SKO kernels. These kernels provide the basis for the development of SKO resolvent operators.

Jain, Abhinandan↗
NASA NTRS1990

Scattering measurements on natural and model trees

The acoustical back scattering from a simple scale model of a tree has been experimentally measured. The model consisted of a trunk and six limbs, each with 4 branches; no foliage or twigs were included. The data from the anechoic chamber measurements were then mathematically combined to construct the effective back scattering from groups of trees. Also, initial measurements have been conducted out-of-doors on a single tree in an open field in order to characterize its acoustic scattering as a function of azimuth angle. These measurements were performed in the spring, prior to leaf development. The data support a statistical model of forest scattering; the scattered signal spectrum is highly irregular but with a remarkable general resemblance to the incident signal spectrum. Also, the scattered signal's spectra showed little dependence upon scattering angle.

Rogers, James C.↗
NASA NTRS1974

A stack algorithm for source coding with a fidelity criterion

Although coding of sources with respect to a fidelity criterion was first proposed by Shannon in 1959, only recently have effective schemes been developed. Another such algorithm based on a stack is described. Like the author's other algorithms (Jelinek and Anderson, 1971, 1973), this algorithm is conceived with tree codes in mind. It has various strengths and weaknesses relative to the earlier two, which are explored. By itself, the algorithm has an interesting mathematical analysis that yields insight into the faster-than-exponential behavior of tree variables and provides a new characterization of the rate-distortion function.

Anderson, J. B.↗
NASA NTRSDate not supplied

The Containment Assurance Risk Framework of the Mars Sample Return Program

The Mars Sample Return campaign aims at bringing rock and atmospheric samples from Mars to Earth through a series of robotic missions. These missions would collect the samples being cached and deposited on Martian soil by the Perseverance rover, place them in a container, and launch them into Martian orbit for subsequent capture by an orbiter that would bring them back. Given there exists a non-zero probability that the samples contain biological material, precautions are being taken to design systems that would break the chain of contact between Mars and Earth. These include techniques such as sterilization of Martian particles, redundant containment vessels, and a robust reentry capsule capable of accurate landings without a parachute. Requirements exist that the probability of containment not assured of Martian-contaminated material into Earth’s biosphere be less than one in a million. To demonstrate compliance with this strict requirement, a statistical framework was developed to assess the likelihood of containment loss during each sample return phase and make a statement about the total combined mission probability of containment not assured. The work presented here describes this framework, which considers failure modes or fault conditions that can initiate failure sequences ultimately leading to containment not assured. Reliability estimates are generated from databases, design heritage, component specifications, or expert opinion in the form of probability density functions or point estimates and provided as inputs to the mathematical models that simulate the different failure sequences. The probabilistic outputs are then combined following the logic of several fault trees to compute the ultimate probability of containment not assured. Given the multidisciplinary nature of the problem and the different types of mathematical models used, the statistical tools needed for analysis are required to be computationally efficient. While standard Monte Carlo approaches are used for fast models, a multi-fidelity approach to rare event probabilities is proposed for expensive models. In this paradigm, inexpensive low-fidelity models are developed for computational acceleration purposes while the expensive high-fidelity model is kept in the loop to retain accuracy in the results. This work presents an example of end-to-end application of this framework highlighting the computational benefits of a multi-fidelity approach.

Giuseppe Cataldo↗
NASA NTRS2011

Canopy Spectral Invariants. Part 1: A New Concept in Remote Sensing of Vegetation

The concept of canopy spectral invariants expresses the observation that simple algebraic combinations of leaf and canopy spectral reflectance become wavelength independent and determine two canopy structure specific variables the recollision and escape probabilities. These variables specify an accurate relationship between the spectral response of a vegetation canopy to incident solar radiation at the leaf and the canopy scale. They are sensitive to important structural features of the canopy such as forest cover, tree density, leaf area index, crown geometry, forest type and stand age. This paper presents the mathematical basis of the concept which is linked to eigenvalues and eigenvectors of the three-dimensional radiative transfer equation.

Knyazikhin, Yuri↗
NASA NTRS1975

Attitude dynamics simulation subroutines for systems of hinge-connected rigid bodies with nonrigid appendages

Three computer subroutines designed to solve the vector-dyadic differential equations of rotational motion for systems that may be idealized as a collection of hinge-connected rigid bodies assembled in a tree topology, with an optional flexible appendage attached to each body are reported. Deformations of the appendages are mathematically represented by modal coordinates and are assumed small. Within these constraints, the subroutines provide equation solutions for (1) the most general case of unrestricted hinge rotations, with appendage base bodies nominally rotating at a constant speed, (2) the case of unrestricted hinge rotations between rigid bodies, with the restriction that those rigid bodies carrying appendages are nominally nonspinning, and (3) the case of small hinge rotations and nominally nonrotating appendages. Sample problems and their solutions are presented to illustrate the utility of the computer programs.

Fleischer, G. E.↗
NASA NTRS1991

Software For Design Of Life-Support Systems

Design Assistant Workstation (DAWN) computer program is prototype of expert software system for analysis and design of regenerative, physical/chemical life-support systems that revitalize air, reclaim water, produce food, and treat waste. Incorporates both conventional software for quantitative mathematical modeling of physical, chemical, and biological processes and expert system offering user stored knowledge about materials and processes. Constructs task tree as it leads user through simulated process, offers alternatives, and indicates where alternative not feasible. Also enables user to jump from one design level to another.

Rudokas, Mary R.↗
NASA NTRS1989

A design philosophy for multi-layer neural networks with applications to robot control

A system is proposed which receives input information from many sensors that may have diverse scaling, dimension, and data representations. The proposed system tolerates sensory information with faults. The proposed self-adaptive processing technique has great promise in integrating the techniques of artificial intelligence and neural networks in an attempt to build a more intelligent computing environment. The proposed architecture can provide a detailed decision tree based on the input information, information stored in a long-term memory, and the adapted rule-based knowledge. A mathematical model for analysis will be obtained to validate the cited hypotheses. An extensive software program will be developed to simulate a typical example of pattern recognition problem. It is shown that the proposed model displays attention, expectation, spatio-temporal, and predictory behavior which are specific to the human brain. The anticipated results of this research project are: (1) creation of a new dynamic neural network structure, and (2) applications to and comparison with conventional multi-layer neural network structures. The anticipated benefits from this research are vast. The model can be used in a neuro-computer architecture as a building block which can perform complicated, nonlinear, time-varying mapping from a multitude of input excitory classes to an output or decision environment. It can be used for coordinating different sensory inputs and past experience of a dynamic system and actuating signals. The commercial applications of this project can be the creation of a special-purpose neuro-computer hardware which can be used in spatio-temporal pattern recognitions in such areas as air defense systems, e.g., target tracking, and recognition. Potential robotics-related applications are trajectory planning, inverse dynamics computations, hierarchical control, task-oriented control, and collision avoidance.

Vadiee, Nader↗
NASA NTRS1985

Boundary to Constructive Solid Geometry Mappings: a Focus on 2-D Issues

The problem of converting boundary representation (B-rep) to constructive solid geometry representation (CSG-rep) (and vice versa) is discussed in two phases. The first phase entails finding a CSG-rep that defines the region bounded by a polygonal profile curve. The second phase utilizes the results of the first phase to find a CSG-rep for many non-polygonal profile curves. A mathematically concise representation of a region bounded by a polygonal is presented. Namely, any polygonal region bounded by an n sided polygon may be represented by a binary tree which has at most n planar halfspaces as leaves. A structure for this representation and an algorithm for calculating is discussed.

Peterson, D. P.↗
NASA NTRS1983

Spectral radiance errors in remote sensing ground studies due to nearby objects

Attention is given to the error that can occur in all radiometric measurements owing to the presence of nearby objects. When a researcher positions himself on the side of a target point opposite the sun, his body gives rise to two erroneous effects. First, it blocks a portion of the incoming diffuse sky radiance to the target point, and second, it reflects incoming diffuse and direct solar irradiance and ground exitance onto the target point. It is noted that the same phenomenon occurs for any nearby object, whether it be a field truck, a building structure, or a row of trees. This error deriving from nearby objects is often not recognized by researchers or is considered insignificant with no knowledge of its magnitude. The approach taken here is to mathematically model the radiant transfers that take place between the global irradiance, panel, or scene and the object and to report the magnitude of this error for various solar zenith angles, wavelengths, size and distances of objects (steradian blockage), and spectral reflectances of the scene and object. The scene, object, and panel are assumed to be Lambertian, and the object is always located on the side of the target point opposite the sun.

Kimes, D. S.↗
NASA NTRS2002

Fluid Mechanics of Capillary-Elastic Instabilities in Microgravity Environment

The aim of this project is to investigate the closure and reopening of lung airways due to surface tension forces, coupled with airway elasticity. Airways are liquid-lined, flexible tubes and closure of airways can occur by a Rayleigh instability of the liquid lining, or an instability of the elastic support for the airway as the surface tension of the air-liquid interface pulls the tube shut, or both. Regardless of the mechanism, the airway is closed because the liquid lining has created a plug that prevents axial gas exchange. In the microgravity environment, surface tension forces dominate lung mechanics and would lead to more prevalent, and more uniformly distributed air-way closure, thereby creating a potential for respiratory problems for astronauts. Once closed the primary option for reopening an airway is by deep inspiration. This maneuver will pull the flexible airways open and force the liquid plug to flow distally by the incoming air stream. Airway reopening depends to a large extent on this plug flow and how it may lead to plug rupture to regain the continuity of gas between the environment and the alveoli. In addition to mathematical modeling of plug flows in liquid-lined, flexible tubes, this work has involved benchtop studies of propagating liquid plugs down tube networks that mimic the human airway tree. We have extended the work to involve animal models of liquid plug propagation in rat lungs. The liquid is radio-opaque and x-ray video imaging is used to ascertain the movement and distribution of the liquid plugs so that comparisons to theory may be made. This research has other uses, such as the delivery of liquids or drugs into the lung that may be used for surfactant replacement therapy or for liquid ventilation.

Grotberg, James B.↗
NASA NTRS1978

Monitoring the state of the human airways by analysis of respiratory sound

A mechanism whereby sound is generated by the motion of vortices in the human lung is described. This mechanism is believed to be responsible for most of the sound which is generated both on inspiration and expiration in normal lungs. Mathematical expressions for the frequencies of sound generated, which depend only upon the axial flow velocity and diameters of the bronchi, are derived. This theory allows the location within the bronchial tree from which particular sounds emanate to be determined. Redistribution of pulmonary blood volume following transition from earth gravity to the weightless state probably alters the caliber of certain airways and doubtless alters sound transmission properties of the lung. We believe that these changes can be monitored effectively and non-invasively by spectral analysis of pulmonary sound.

Hardin, J. C.↗