Search NASA⌕ Search

SEARCH · Search NASA

Results for “leaf nodes”

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.

System for solving diagnosis and hitting set problems

The diagnosis problem arises when a system's actual behavior contradicts the expected behavior, thereby exhibiting symptoms (a collection of conflict sets). System diagnosis is then the task of identifying faulty components that are responsible for anomalous behavior. To solve the diagnosis problem, the present invention describes a method for finding the minimal set of faulty components (minimal diagnosis set) that explain the conflict sets. The method includes acts of creating a matrix of the collection of conflict sets, and then creating nodes from the matrix such that each node is a node in a search tree. A determination is made as to whether each node is a leaf node or has any children nodes. If any given node has children nodes, then the node is split until all nodes are leaf nodes. Information gathered from the leaf nodes is used to determine the minimal diagnosis set.

Fijany, Amir↗

Decision-Tree Formulation With Order-1 Lateral Execution

A compact symbolic formulation enables mapping of an arbitrarily complex decision tree of a certain type into a highly computationally efficient multidimensional software object. The type of decision trees to which this formulation applies is that known in the art as the Boolean class of balanced decision trees. Parallel lateral slices of an object created by means of this formulation can be executed in constant time considerably less time than would otherwise be required. Decision trees of various forms are incorporated into almost all large software systems. A decision tree is a way of hierarchically solving a problem, proceeding through a set of true/false responses to a conclusion. By definition, a decision tree has a tree-like structure, wherein each internal node denotes a test on an attribute, each branch from an internal node represents an outcome of a test, and leaf nodes represent classes or class distributions that, in turn represent possible conclusions. The drawback of decision trees is that execution of them can be computationally expensive (and, hence, time-consuming) because each non-leaf node must be examined to determine whether to progress deeper into a tree structure or to examine an alternative. The present formulation was conceived as an efficient means of representing a decision tree and executing it in as little time as possible. The formulation involves the use of a set of symbolic algorithms to transform a decision tree into a multi-dimensional object, the rank of which equals the number of lateral non-leaf nodes. The tree can then be executed in constant time by means of an order-one table lookup. The sequence of operations performed by the algorithms is summarized as follows: 1. Determination of whether the tree under consideration can be encoded by means of this formulation. 2. Extraction of decision variables. 3. Symbolic optimization of the decision tree to minimize its form. 4. Expansion and transformation of all nested conjunctive-disjunctive paths to a flattened conjunctive form composed only of equality checks when possible. If each reduced conjunctive form contains only equality checks and all of these forms use the same variables, then the decision tree can be reduced to an order-one operation through a table lookup. The speedup to order one is accomplished by distributing each decision variable over a surface of a multidimensional object by mapping the equality constant to an index

James, Mark↗

Comparison of axillary bud growth and patatin accumulation in potato leaf cuttings as assays for tuber induction

Single-node leaf cuttings from potatoes (Solanum tuberosum L.) cvs. Norland, Superior, Norchip, and Kennebec, were used to assess tuber induction in plants grown under 12, 16, and 20 h daily irradiation (400 micromol s-1 m-2 PPF). Leaf cuttings were taken from plants at four, six and 15 weeks after planting and cultured for 14 d in sand trays in humid environments. Tuber induction was determined by visually rating the type of growth at the attached axillary bud, and by measuring the accumulation of the major tuber protein, patatin, in the base of the petioles. Axillary buds from leaf cuttings of plants grown under the 12 h photoperiod consistently formed round, sessile tubers at the axils for all four cultivars at all harvests. Buds from cuttings of plants grown under the 16 and 20 h photoperiods exhibited mixed tuber, stolon, and leafy shoot growth. Patatin accumulation was highest in petioles of cuttings taken from 12 h plants for all cultivars at all harvests, with levels in 16 and 20 h cuttings approx. one-half that of the 12 h cuttings. Trends, both in visual ratings of axillary buds and in petiole patatin accumulation, followed the harvest index (ratio of tuber to total plant dry matter), suggesting that either method is an acceptable assay for tuber induction in the potato.

NASA Discipline Number 61-10↗

Understanding the Scalability of Bayesian Network Inference Using Clique Tree Growth Curves

One of the main approaches to performing computation in Bayesian networks (BNs) is clique tree clustering and propagation. The clique tree approach consists of propagation in a clique tree compiled from a Bayesian network, and while it was introduced in the 1980s, there is still a lack of understanding of how clique tree computation time depends on variations in BN size and structure. In this article, we improve this understanding by developing an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN s non-root nodes to the number of root nodes, and (ii) the expected number of moral edges in their moral graphs. Analytically, we partition the set of cliques in a clique tree into different sets, and introduce a growth curve for the total size of each set. For the special case of bipartite BNs, there are two sets and two growth curves, a mixed clique growth curve and a root clique growth curve. In experiments, where random bipartite BNs generated using the BPART algorithm are studied, we systematically increase the out-degree of the root nodes in bipartite Bayesian networks, by increasing the number of leaf nodes. Surprisingly, root clique growth is well-approximated by Gompertz growth curves, an S-shaped family of curves that has previously been used to describe growth processes in biology, medicine, and neuroscience. We believe that this research improves the understanding of the scaling behavior of clique tree clustering for a certain class of Bayesian networks; presents an aid for trade-off studies of clique tree clustering using growth curves; and ultimately provides a foundation for benchmarking and developing improved BN inference and machine learning algorithms.

Mengshoel, Ole J.↗

Pattern Matcher for Trees Constructed from Lists

A software library has been developed that takes a high-level description of a pattern to be satisfied and applies it to a target. If the two match, it returns success; otherwise, it indicates a failure. The target is semantically a tree that is constructed from elements of terminal and non-terminal nodes represented through lists and symbols. Additionally, functionality is provided for finding the element in a set that satisfies a given pattern and doing a tree search, finding all occurrences of leaf nodes that match a given pattern. This process is valuable because it is a new algorithmic approach that significantly improves the productivity of the programmers and has the potential of making their resulting code more efficient by the introduction of a novel semantic representation language. This software has been used in many applications delivered to NASA and private industry, and the cost savings that have resulted from it are significant.

James, Mark↗

Efficient algorithms for dilated mappings of binary trees

The problem is addressed to find a 1-1 mapping of the vertices of a binary tree onto those of a target binary tree such that the son of a node on the first binary tree is mapped onto a descendent of the image of that node in the second binary tree. There are two natural measures of the cost of this mapping, namely the dilation cost, i.e., the maximum distance in the target binary tree between the images of vertices that are adjacent in the original tree. The other measure, expansion cost, is defined as the number of extra nodes/edges to be added to the target binary tree in order to ensure a 1-1 mapping. An efficient algorithm to find a mapping of one binary tree onto another is described. It is shown that it is possible to minimize one cost of mapping at the expense of the other. This problem arises when designing pipelined arithmetic logic units (ALU) for special purpose computers. The pipeline is composed of ALU chips connected in the form of a binary tree. The operands to the pipeline can be supplied to the leaf nodes of the binary tree which then process and pass the results up to their parents. The final result is available at the root. As each new application may require a distinct nesting of operations, it is useful to be able to find a good mapping of a new binary tree over existing ALU tree. Another problem arises if every distinct required binary tree is known beforehand. Here it is useful to hardwire the pipeline in the form of a minimal supertree that contains all required binary trees.

Iqbal, M. Ashraf↗

NETRA: A parallel architecture for integrated vision systems. 1: Architecture and organization

Computer vision is regarded as one of the most complex and computationally intensive problems. An integrated vision system (IVS) is considered to be a system that uses vision algorithms from all levels of processing for a high level application (such as object recognition). A model of computation is presented for parallel processing for an IVS. Using the model, desired features and capabilities of a parallel architecture suitable for IVSs are derived. Then a multiprocessor architecture (called NETRA) is presented. This architecture is highly flexible without the use of complex interconnection schemes. The topology of NETRA is recursively defined and hence is easily scalable from small to large systems. Homogeneity of NETRA permits fault tolerance and graceful degradation under faults. It is a recursively defined tree-type hierarchical architecture where each of the leaf nodes consists of a cluster of processors connected with a programmable crossbar with selective broadcast capability to provide for desired flexibility. A qualitative evaluation of NETRA is presented. Then general schemes are described to map parallel algorithms onto NETRA. Algorithms are classified according to their communication requirements for parallel processing. An extensive analysis of inter-cluster communication strategies in NETRA is presented, and parameters affecting performance of parallel algorithms when mapped on NETRA are discussed. Finally, a methodology to evaluate performance of algorithms on NETRA is described.

Choudhary, Alok N.↗

Some practicable applications of quadtree data structures/representation in astronomy

Development of quadtree as hierarchical data structuring technique for representing spatial data (like points, regions, surfaces, lines, curves, volumes, etc.) has been motivated to a large extent by storage requirements of images, maps, and other multidimensional (spatially structured) data. For many spatial algorithms, time-efficiency of quadtrees in terms of execution may be as important as their space-efficiency concerning storage conditions. Briefly, the quadtree is a class of hierarchical data structures which is based on the recursive partition of a square region into quadrants and sub-quadrants until a predefined limit. Beyond the wide applicability of quadtrees in image processing, spatial information analysis, and building digital databases (processes becoming ordinary for the astronomical community), there may be numerous further applications in astronomy. Some of these practicable applications based on quadtree representation of astronomical data are presented and suggested for further considerations. Examples are shown for use of point as well as region quadtrees. Statistics of different leaf and non-leaf nodes (homogeneous and heterogeneous sub-quadrants respectively) at different levels may provide useful information on spatial structure of astronomical data in question. By altering the principle guiding the decomposition process, different types of spatial data may be focused on. Finally, a sampling method based on quadtree representation of an image is proposed which may prove to be efficient in the elaboration of sampling strategy in a region where observations were carried out previously either with different resolution or/and in different bands.

Pasztor, L.↗

Initial Kernel Timing Using a Simple PIM Performance Model

This presentation will describe some initial results of paper-and-pencil studies of 4 or 5 application kernels applied to a processor-in-memory (PIM) system roughly similar to the Cascade Lightweight Processor (LWP). The application kernels are: * Linked list traversal * Sun of leaf nodes on a tree * Bitonic sort * Vector sum * Gaussian elimination The intent of this work is to guide and validate work on the Cascade project in the areas of compilers, simulators, and languages. We will first discuss the generic PIM structure. Then, we will explain the concepts needed to program a parallel PIM system (locality, threads, parcels). Next, we will present a simple PIM performance model that will be used in the remainder of the presentation. For each kernel, we will then present a set of codes, including codes for a single PIM node, and codes for multiple PIM nodes that move data to threads and move threads to data. These codes are written at a fairly low level, between assembly and C, but much closer to C than to assembly. For each code, we will present some hand-drafted timing forecasts, based on the simple PIM performance model. Finally, we will conclude by discussing what we have learned from this work, including what programming styles seem to work best, from the point-of-view of both expressiveness and performance.

BRIEFING CHARTS↗

Microbiological Horticultural Internship Final Abstract

GMO dwarf plum (Prunus domestica) is being evaluated as a candidate food crop for long duration space flight missions. A project was undertaken to develop a protocol for transferring selected genetic lines of GMO plum (previously maintained in pots and propagated by cuttings at NASA's Kennedy Space Center in Florida) into in vitro tissue culture. In vitro culture may reduce the space, materials, and labor required to maintain the current lines of GMO plum and better preserve them for future study. Fresh plant material from three selected GMO plum lines (NASA-5, NASA-10, and NASA-11) and a non-modified control line (Control-5) were processed aseptically into in vitro culture on four separate occasions. The impact of multiple treatments on the successful growth of GMO plum tissue in vitro were tested: Parent explant tissue type (leaf petioles, stem nodes containing buds and internodes without buds), tissue sterilization method [soaking in 10 bleach only (5 min for petioles or 10 min for nodesinternodes), or soaking in 70 EtOH (30 sec) followed by 10 bleach (5 min for petioles and 10 min for nodesinternodes)], and media type [three Murashige and Skoog-based medias (SGM, SRM, and SRM+2,4-D) and one recipe containing woody plant media (WPM)]. 22.2 of the plates containing tissue sterilized with bleach alone developed microbial contamination after two weeks, while only 11.8 of plates containing tissue sterilized sequentially with EtOH and bleach developed contamination. Node bud tissue from all four genetic lines of plum produced leafy plantlets on SGM and SRM media after 4-6 weeks. The most numerous and well-developed plantlets were present on SGM. Upon reaching suitable size, plantlets were transferred to larger media containers for further growth. Some node bud growth occurred on SRM+2,4-D and WPM 2.5 weeks after plating, however as of yet no pieces on SRM+2,4-D have adequate development for transferring. Tissue pieces from NASA-5 plated on WPM are developing leaves and will be ready for transferring soon. Petioles and internode tissue lacking bud meristem failed to produce any plantlets on any plates, however petioles developed large masses of undifferentiated callus tissue on SRM+2,4-D media. These callused pieces were then transferred to SRM+TDZ media, which resulted in even larger callus growth but no differentiation. All four selected plum lines were successfully transitioned into in vitro culture. Nodes from NASA-5 and NASA-10 lines produced the most numerous and well-developed leafy plantlets in vitro, while those from NASA-11 and Control-5 were generally smaller, slower growing and less numerous. The best method overall was to use young stem node tissue with buds, surface sterilize the pieces sequentially with 70 EtOH and 10 bleach, and then plate them onto SGM media. Future areas of study will include introducing additional genetic lines of GMO plum into in vitro culture, attempting to induce shoot growth in petiole callus tissue, testing methods (such as cold storage) that extend the time interval between transferring explants into new media, and testing viability of plantlets transferred from in vitro culture back to traditional pot culture.

bioregenerative life support↗

Elongation growth of the leaf sheath base of Avena sativa seedlings: regulation by hormones and sucrose

The leaf sheath base of the seedling of Avena sativa was characterized for growth response to hormones and sucrose. Six day old plants, raised under a 10:14 hr light:dark cycle, were excised at the coleoptilar node and 1 cm above the node for treatment. The growth of the leaf sheath base was promoted by gibberellic acid (GA3) and this response was dose dependent. The lag to response initiation was approximately 4 hr. Growth with or without GA3 (10 micromoles) was transient, diminishing appreciably after 48 hr. The addition of 10 mM sucrose greatly prolonged growth; the effect of GA3 and sucrose was additive. Neither indole-3-acetic acid (IAA) nor the cytokinin N6-benzyladenine (BA), alone or in combination, promoted the growth of leaf sheath bases. However, both significantly inhibited the action of GA3. The inhibitory effect of IAA was dose dependent and was not affected by the addition of BA or sucrose. These results indicate that the growth of leaf sheath bases of Avena sativa is promoted specifically by gibberellin, that this action depends on the availability of carbohydrates from outside of the leaf sheath base, and that the promotional effect of GA3 can be modified by either auxins or cytokinins.

NASA Discipline Number 40-50↗

Parallel VLSI architecture emulation and the organization of APSA/MPP

The Applicative Programming System Architecture (APSA) combines an applicative language interpreter with a novel parallel computer architecture that is well suited for Very Large Scale Integration (VLSI) implementation. The Massively Parallel Processor (MPP) can simulate VLSI circuits by allocating one processing element in its square array to an area on a square VLSI chip. As long as there are not too many long data paths, the MPP can simulate a VLSI clock cycle very rapidly. The APSA circuit contains a binary tree with a few long paths and many short ones. A skewed H-tree layout allows every processing element to simulate a leaf cell and up to four tree nodes, with no loss in parallelism. Emulation of a key APSA algorithm on the MPP resulted in performance 16,000 times faster than a Vax. This speed will make it possible for the APSA language interpreter to run fast enough to support research in parallel list processing algorithms.

Odonnell, John T.↗

Growth reponses of eggplant and soybean seedlings to mechanical stress in greenhouse and outdoor environments

Eggplant (Solanum melongena L. var. esculentum 'Burpee's Black Beauty') and soybean [Glycine max (L.) Merr. 'Wells II'] seedlings were assigned to a greenhouse or a windless or windy outdoor environment. Plants within each environment received either periodic seismic (shaking) or thigmic (flexing or rubbing) treatment, or were left undisturbed. Productivity (dry weight) and dimensional (leaf area and stem length) growth parameters generally were reduced more by mechanical stress in the greenhouse (soybean) or outdoor-windless environment (eggplant) than in the outdoor windy environment. Outdoor exposure enhanced both stem and leaf specific weights, whereas mechanical stress enhanced only leaf specific weight. Although both forms of controlled mechanical stress tended to reduce node and internode diameters of soybean, outdoor exposure increased stem diameter.

NASA Discipline Number 61-10↗

Thigmomorphogenesis: anatomical, morphological and mechanical analysis of genetically different sibs of Pinus taeda in response to mechanical perturbation

Twenty-three open pollinated families (half-sibs) and four controlled pollinated families (full-sibs) of Pinus taeda L. (loblolly pine) were grown in a greenhouse and analyzed for changes induced by mechanical perturbation (MP). These changes included inhibition of stem and needle elongation, bracing of branch nodes, and increased radial growth in the direction of the MP. Inhibition of stem elongation was the least variable feature measured. Leaf extension and stem diameter were highly variable between half-sibs. MP induced increased drag in greenhouse grown P. taeda in wind-tunnel tests. In P. taeda, MP induced decreased flexibility and increased elasticity and plasticity of the stem. The increased radial growth of the stems overrode the increase in elasticity, resulting in an overall decrease in flexibility. MP trees had a higher rupture point than non-MP controls. Increased radial growth is a result of more rapid cell divisions of the vascular cambium, resulting in increased numbers of tracheids. The decreased leader growth is partly due to a decreased tracheid length in response to MP.

Non-NASA Center↗

Cloud Classification in Polar and Desert Regions and Smoke Classification from Biomass Burning Using a Hierarchical Neural Network

This research focuses on a new neural network scene classification technique. The task is to identify scene elements in Advanced Very High Resolution Radiometry (AVHRR) data from three scene types: polar, desert and smoke from biomass burning in South America (smoke). The ultimate goal of this research is to design and implement a computer system which will identify the clouds present on a whole-Earth satellite view as a means of tracking global climate changes. Previous research has reported results for rule-based systems (Tovinkere et at 1992, 1993) for standard back propagation (Watters et at. 1993) and for a hierarchical approach (Corwin et al 1994) for polar data. This research uses a hierarchical neural network with don't care conditions and applies this technique to complex scenes. A hierarchical neural network consists of a switching network and a collection of leaf networks. The idea of the hierarchical neural network is that it is a simpler task to classify a certain pattern from a subset of patterns than it is to classify a pattern from the entire set. Therefore, the first task is to cluster the classes into groups. The switching, or decision network, performs an initial classification by selecting a leaf network. The leaf networks contain a reduced set of similar classes, and it is in the various leaf networks that the actual classification takes place. The grouping of classes in the various leaf networks is determined by applying an iterative clustering algorithm. Several clustering algorithms were investigated, but due to the size of the data sets, the exhaustive search algorithms were eliminated. A heuristic approach using a confusion matrix from a lightly trained neural network provided the basis for the clustering algorithm. Once the clusters have been identified, the hierarchical network can be trained. The approach of using don't care nodes results from the difficulty in generating extremely complex surfaces in order to separate one class from all of the others. This approach finds pairwise separating surfaces and forms the more complex separating surface from combinations of simpler surfaces. This technique both reduces training time and improves accuracy over the previously reported results. Accuracies of 97.47%, 95.70%, and 99.05% were achieved for the polar, desert and smoke data sets.

Alexander, June↗