Search NASA⌕ Search

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.

At least 451 records · Page 25

EDNA: Expert fault digraph analysis using CLIPS

Traditionally fault models are represented by trees. Recently, digraph models have been proposed (Sack). Digraph models closely imitate the real system dependencies and hence are easy to develop, validate and maintain. However, they can also contain directed cycles and analysis algorithms are hard to find. Available algorithms tend to be complicated and slow. On the other hand, the tree analysis (VGRH, Tayl) is well understood and rooted in vast research effort and analytical techniques. The tree analysis algorithms are sophisticated and orders of magnitude faster. Transformation of a digraph (cyclic) into trees (CLP, LP) is a viable approach to blend the advantages of the representations. Neither the digraphs nor the trees provide the ability to handle heuristic knowledge. An expert system, to capture the engineering knowledge, is essential. We propose an approach here, namely, expert network analysis. We combine the digraph representation and tree algorithms. The models are augmented by probabilistic and heuristic knowledge. CLIPS, an expert system shell from NASA-JSC will be used to develop a tool. The technique provides the ability to handle probabilities and heuristic knowledge. Mixed analysis, some nodes with probabilities, is possible. The tool provides graphics interface for input, query, and update. With the combined approach it is expected to be a valuable tool in the design process as well in the capture of final design knowledge.

Dixit, Vishweshwar V.↗

(BOREAS) BOREAS TE-8 Aspen Bark Chemistry Data

The BOREAS TE-8 team collected pigment density data from aspen bark and leaves from four sites within the BOREAS SSA from 24-May-1994 to 16-Jun-1994 (IFC-1), 19-Jul-1994 to 08-Aug- 1994 (IFC-2), and 30-Aug-1994 to 19-Sep-1994 (IFC-3). One to nine trees from each site were sampled during the three IFCs. Each tree was sampled in five different locations for bark pigment properties: basal stem section, which was any bark sample taken below one-half the tree height; upper stem section, which was any bark sample taken from the main stem above one-half the tree height; bark taken from branches up to 3 years old; a 2-year-old branch segment, and a 1-year-old branch segment. Additionally, a limited number of leaves were collected. Bark samples were removed from the stem of the tree, placed in ziplock bags, and transported to UNH, where they were processed and analyzed by a spectrophotometer. In each data file, samples are identified by Site, Date, Tree#, and Sample Location (see I st paragraph above. Pigment density values are normalized to mg/m2. Density values for the following pigments are provided: Chi a, Chi b, Total Chi (Chi a+b), Carotenoids, Chi a to b ratio, and the Total Chi to carotenoids ratio. The data are stored in ASCII files. The data files are available on a CD-ROM (see document number 20010000884), or from the Oak Ridge National Laboratory (ORNL) Distrobuted Activity Archive Center (DAAC).

Hall, Forrest G.↗

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗

Wichita Climate: Using Satellite Data to Identify Neighborhoods Vulnerable to Extreme Heat for Equitable Climate Mitigation and Planning

Wichita, Kansas is facing a host of climate threats, one being extreme heat that is manifested through the urban heat island (UHI) effect. The uneven distribution of heat risk in Wichita across socioeconomic status is an environmental justice issue. We worked with the City of Wichita to map heat exposure, tree canopy, and heat risk in order to support the City's climate resilience initiatives. To visualize heat exposure, we quantified and mapped average summer heat from 2013–2021 using Landsat 8 Operational Land Imager (OLI) and Thermal Infrared Sensor (TIRS) Land Surface Temperature (LST) and Aqua Moderate Resolution Imaging Spectroradiometer (MODIS) night-time LST. To understand tree canopy cover gaps, we created a tree canopy map using 2021 PlanetScope imagery, which identified 20% more trees than the US Geological Survey’s (USGS) National Land Cover Database (NLCD) tree canopy coverage estimates for Wichita. To characterize high risk areas, we used socioeconomic census data and existing social vulnerability indices, highlighting populations that were exposed and vulnerable to extreme heat. The spatial analyses demonstrated that heat exposure is concentrated in the city center and southwest Wichita, areas that are also low in tree canopy coverage. The three census block groups and 17 census tracts with the highest heat risk primarily circle the city center, in areas home to more socially vulnerable populations and near enough to the dense urban center to feel significant urban heat island effects.

Brooke Laird↗

Wichita Climate: Using Satellite Data to Identify Neighborhoods Vulnerable to Extreme Heat for Equitable Climate Mitigation and Planning

Wichita, Kansas is facing a host of climate threats, one being extreme heat that is manifested through the urban heat island (UHI) effect. The uneven distribution of heat risk in Wichita across socioeconomic status is an environmental justice issue. We worked with the City of Wichita to map heat exposure, tree canopy, and heat risk in order to support the City's climate resilience initiatives. To visualize heat exposure, we quantified and mapped average summer heat from 2013–2021 using Landsat 8 Operational Land Imager (OLI) and Thermal Infrared Sensor (TIRS) Land Surface Temperature (LST) and Aqua Moderate Resolution Imaging Spectroradiometer (MODIS) night-time LST. To understand tree canopy cover gaps, we created a tree canopy map using 2021 PlanetScope imagery, which identified 20% more trees than the US Geological Survey’s (USGS) National Land Cover Database (NLCD) tree canopy coverage estimates for Wichita. To characterize high risk areas, we used socioeconomic census data and existing social vulnerability indices, highlighting populations that were exposed and vulnerable to extreme heat. The spatial analyses demonstrated that heat exposure is concentrated in the city center and southwest Wichita, areas that are also low in tree canopy coverage. The three census block groups and 17 census tracts with the highest heat risk primarily circle the city center, in areas home to more socially vulnerable populations and near enough to the dense urban center to feel significant urban heat island effects.

Brooke Laird↗

Reflectance Modeling

The main thrust of the work conducted is in the modeling of spectral responses of discontinuous conifer forest canopies, considered as collections of conical forms that are illuminated at an angle and cast shadows on contracting background. The three first-year objectives are: (1) modification of the variance-driven model to incorporate overlapping of shadows and crowns; (2) collection and analysis of photographic data to calibrate tree-spacing functions; and (3) collection of field data to determine height, spacing, and shape of conifers in open and closed stands in the Goosenest (California) test area. Modification of the invertible model uses a linear approximation to correct for the reduction in shadow and canopy area that occurs when shadows fall on crowns or tree crowns intersect. Comparison of the results of the approximation with a series of Monte Carlo simulations shows that the mean area covered by crowns or shadows is approximated quite accurately, but the variance calculated departs significantly from simulated values. The analysis of tree spacing patterns using air photos showed that spacing tended to be somewhat regular at a scale approximately equal to the average distance between trees, but at larger distance scales counts of trees in cells could be approximated acceptably by a Poisson (random) function.

Strahler, A. H.↗

AIDDE the Ames Interactive Dynamic Display Editor

This paper describes the design and development of the Ames Interactive Dynamic Display Editor language (AIDDE). AIDDE and its associated tools are a software system that facilitates the interactive creation and use of real-time displays. For the present purposes, real-time displays are pictures on a CRT that change over time to reflect the state of a system. A graphics tree describes a display. Display dynamics are specified by attaching expressions to the tree. Offline, AIDDE is used to draw displays, define display dynamics, and generate host computer source code and a representation of the tree convenient for use in a graphics device. At run time, the compiled host code passes the results of the expressions to a graphics device to modify the tree. The graphics processor repeatedly traverses the tree to draw a changing display on the CRT. Several real-time displays have been implemented using AIDDE with good results.

Globus, A.↗

Writing filter processes for the SAGA editor, appendix G

The SAGA editor provides a mechanism by which separate processes can be invoked during an editing session to traverse portions of the parse tree being edited. These processes, termed filter processes, read, analyze, and possibly transform the parse tree, returning the result to the editor. By defining new commands with the editor's user defined command facility, which invoke filter processes, authors of filter can provide complex operations as simple commands. A tree plotter, pretty printer, and Pascal tree transformation program were already written using this facility. The filter processes are introduced, parse tree structure is described and the library interface made available to the programmer. Also discussed is how to compile and run filter processes. Examples are presented to illustrate aspect of each of these areas.

Kirslis, Peter A.↗

Canopy reflectance modeling in a tropical wooded grassland

The Li-Strahler canopy reflectance model, driven by LANDSAT Thematic Mapper (TM) data, provided regional estimates of tree size and density in two bioclimatic zones in Africa. This model exploits tree geometry in an inversion technique to predict average tree size and density from reflectance data using a few simple patameters measured in the field and in the imagery. Reflectance properties of the trees were measured in the study sites using a pole-mounted radiometer. The measurements showed that the assumptions of the simple Li-Strahler model are reasonable for these woodlands. The field radiometer measurements were used to calculate the normalized difference vegetation index (NDVI), and the integrated NDVI over the canopy was related to crown volume. Predictions of tree size and density from the canopy model were used with allometric equations from the literature to estimate woody biomass and potential foliar biomass for the sites and for the regions. Estimates were compared with independent measurements made in the Sahelian sites, and to typical values from the literature for these regions and for similar woodlands. In order to apply the inversion procedure regionally, an area must first be stratified into woodland cover classes, and dry-season TM data were used to generate a stratum map of the study areas with reasonable accuracy. The method used was unsupervised classification of multi-data principal components images.

Simonett, David↗

Abstract Datatypes in PVS

PVS (Prototype Verification System) is a general-purpose environment for developing specifications and proofs. This document deals primarily with the abstract datatype mechanism in PVS which generates theories containing axioms and definitions for a class of recursive datatypes. The concepts underlying the abstract datatype mechanism are illustrated using ordered binary trees as an example. Binary trees are described by a PVS abstract datatype that is parametric in its value type. The type of ordered binary trees is then presented as a subtype of binary trees where the ordering relation is also taken as a parameter. We define the operations of inserting an element into, and searching for an element in an ordered binary tree; the bulk of the report is devoted to PVS proofs of some useful properties of these operations. These proofs illustrate various approaches to proving properties of abstract datatype operations. They also describe the built-in capabilities of the PVS proof checker for simplifying abstract datatype expressions.

Owre, Sam↗

Thigmomorphogenesis: field and laboratory studies of Abies fraseri in response to wind or mechanical perturbation

Field- and greenhouse-grown Abies fraseri (Pursh) Poir. (Fraser fir) were analyzed for wind- or mechanically-induced flexure changes. These changes included inhibition of stem and needle elongation, reinforcement of branch bases around the stem, and increased radial growth in the direction of the mechanical perturbation (MP). Mature trees exposed to high wind conditions were severely flag-formed. These modified tree crowns had a lower drag than crowns of non-flag formed trees in wind-tunnel tests. In both field-grown and greenhouse-grown A. fraseri, MP induced a decrease in flexibility and increased elasticity of the stems. The increased radial growth of the stems overrode the increase in elasticity, resulting in the overall decrease in flexibility. The increase in radial growth caused by wind or mechanical flexure was due to greater cell divisions of the vascular cambium, resulting in increased numbers of tracheids. The decrease in stem elongation in these trees was due, at least in part, to a decrease in tracheid length. The potential biological and mechanical significance of these induced growth changes in trees are addressed. The data support the thigmomorphogenetic theory, which states that plants respond to wind and other mechanical perturbations in a way that is favorable to the plant for continued survival in windy environments.

NASA Discipline Plant Biology↗

Adaptable Constrained Genetic Programming: Extensions and Applications

An evolutionary algorithm applies evolution-based principles to problem solving. To solve a problem, the user defines the space of potential solutions, the representation space. Sample solutions are encoded in a chromosome-like structure. The algorithm maintains a population of such samples, which undergo simulated evolution by means of mutation, crossover, and survival of the fittest principles. Genetic Programming (GP) uses tree-like chromosomes, providing very rich representation suitable for many problems of interest. GP has been successfully applied to a number of practical problems such as learning Boolean functions and designing hardware circuits. To apply GP to a problem, the user needs to define the actual representation space, by defining the atomic functions and terminals labeling the actual trees. The sufficiency principle requires that the label set be sufficient to build the desired solution trees. The closure principle allows the labels to mix in any arity-consistent manner. To satisfy both principles, the user is often forced to provide a large label set, with ad hoc interpretations or penalties to deal with undesired local contexts. This unfortunately enlarges the actual representation space, and thus usually slows down the search. In the past few years, three different methodologies have been proposed to allow the user to alleviate the closure principle by providing means to define, and to process, constraints on mixing the labels in the trees. Last summer we proposed a new methodology to further alleviate the problem by discovering local heuristics for building quality solution trees. A pilot system was implemented last summer and tested throughout the year. This summer we have implemented a new revision, and produced a User's Manual so that the pilot system can be made available to other practitioners and researchers. We have also designed, and partly implemented, a larger system capable of dealing with much more powerful heuristics.

Janikow, Cezary Z.↗

Systems Modeling to Implement Integrated System Health Management Capability

ISHM capability includes: detection of anomalies, diagnosis of causes of anomalies, prediction of future anomalies, and user interfaces that enable integrated awareness (past, present, and future) by users. This is achieved by focused management of data, information and knowledge (DIaK) that will likely be distributed across networks. Management of DIaK implies storage, sharing (timely availability), maintaining, evolving, and processing. Processing of DIaK encapsulates strategies, methodologies, algorithms, etc. focused on achieving high ISHM Functional Capability Level (FCL). High FCL means a high degree of success in detecting anomalies, diagnosing causes, predicting future anomalies, and enabling health integrated awareness by the user. A model that enables ISHM capability, and hence, DIaK management, is denominated the ISHM Model of the System (IMS). We describe aspects of the IMS that focus on processing of DIaK. Strategies, methodologies, and algorithms require proper context. We describe an approach to define and use contexts, implementation in an object-oriented software environment (G2), and validation using actual test data from a methane thruster test program at NASA SSC. Context is linked to existence of relationships among elements of a system. For example, the context to use a strategy to detect leak is to identify closed subsystems (e.g. bounded by closed valves and by tanks) that include pressure sensors, and check if the pressure is changing. We call these subsystems Pressurizable Subsystems. If pressure changes are detected, then all members of the closed subsystem become suspect of leakage. In this case, the context is defined by identifying a subsystem that is suitable for applying a strategy. Contexts are defined in many ways. Often, a context is defined by relationships of function (e.g. liquid flow, maintaining pressure, etc.), form (e.g. part of the same component, connected to other components, etc.), or space (e.g. physically close, touching the same common element, etc.). The context might be defined dynamically (if conditions for the context appear and disappear dynamically) or statically. Although this approach is akin to case-based reasoning, we are implementing it using a software environment that embodies tools to define and manage relationships (of any nature) among objects in a very intuitive manner. Context for higher level inferences (that use detected anomalies or events), primarily for diagnosis and prognosis, are related to causal relationships. This is useful to develop root-cause analysis trees showing an event linked to its possible causes and effects. The innovation pertaining to RCA trees encompasses use of previously defined subsystems as well as individual elements in the tree. This approach allows more powerful implementations of RCA capability in object-oriented environments. For example, if a pressurizable subsystem is leaking, its root-cause representation within an RCA tree will show that the cause is that all elements of that subsystem are suspect of leak. Such a tree would apply to all instances of leak-events detected and all elements in all pressurizable subsystems in the system. Example subsystems in our environment to build IMS include: Pressurizable Subsystem, Fluid-Fill Subsystem, Flow-Thru-Valve Subsystem, and Fluid Supply Subsystem. The software environment for IMS is designed to potentially allow definition of any relationship suitable to create a context to achieve ISHM capability.

Figueroa, Jorge F.↗

Forensic Analysis of Compromised Computers

Directory Tree Analysis File Generator is a Practical Extraction and Reporting Language (PERL) script that simplifies and automates the collection of information for forensic analysis of compromised computer systems. During such an analysis, it is sometimes necessary to collect and analyze information about files on a specific directory tree. Directory Tree Analysis File Generator collects information of this type (except information about directories) and writes it to a text file. In particular, the script asks the user for the root of the directory tree to be processed, the name of the output file, and the number of subtree levels to process. The script then processes the directory tree and puts out the aforementioned text file. The format of the text file is designed to enable the submission of the file as input to a spreadsheet program, wherein the forensic analysis is performed. The analysis usually consists of sorting files and examination of such characteristics of files as ownership, time of creation, and time of most recent access, all of which characteristics are among the data included in the text file.

Wolfe, Thomas↗

VESGEN Software for Mapping and Quantification of Vascular Regulators

VESsel GENeration (VESGEN) Analysis is an automated software that maps and quantifies effects of vascular regulators on vascular morphology by analyzing important vessel parameters. Quantification parameters include vessel diameter, length, branch points, density, and fractal dimension. For vascular trees, measurements are reported as dependent functions of vessel branching generation. VESGEN maps and quantifies vascular morphological events according to fractal-based vascular branching generation. It also relies on careful imaging of branching and networked vascular form. It was developed as a plug-in for ImageJ (National Institutes of Health, USA). VESGEN uses image-processing concepts of 8-neighbor pixel connectivity, skeleton, and distance map to analyze 2D, black-and-white (binary) images of vascular trees, networks, and tree-network composites. VESGEN maps typically 5 to 12 (or more) generations of vascular branching, starting from a single parent vessel. These generations are tracked and measured for critical vascular parameters that include vessel diameter, length, density and number, and tortuosity per branching generation. The effects of vascular therapeutics and regulators on vascular morphology and branching tested in human clinical or laboratory animal experimental studies are quantified by comparing vascular parameters with control groups. VESGEN provides a user interface to both guide and allow control over the users vascular analysis process. An option is provided to select a morphological tissue type of vascular trees, network or tree-network composites, which determines the general collections of algorithms, intermediate images, and output images and measurements that will be produced.

Parsons-Wingerter, Patricia A.↗

Evaluation of Sentinel-1A Data For Above Ground Biomass Estimation in Different Forests in India

Use of remote sensing data for mapping and monitoring of forest biomass across large spatial scales can aid in addressing uncertainties in carbon cycle. Earlier, several researchers reported on the use of Synthetic Aperture Radar (SAR) data for characterizing forest structural parameters and the above ground biomass estimation. However, these studies cannot be generalized and the algorithms cannot be applied to all types of forests without additional information on the forest physiognomy, stand structure and biomass characteristics. The radar backscatter signal also saturates as forest parameters such as biomass and the tree height increase. It is also not clear how different polarizations (VV versus VH) impact the backscatter retrievals in different forested regions. Thus, it is important to evaluate the potential of SAR data in different landscapes for characterizing forest structural parameters. In this study, the SAR data from Sentinel-1A has been used to characterize forest structural parameters including the above ground biomass from tropical forests of India. Ground based data on tree density, basal area and above ground biomass data from thirty-eight different forested sites has been collected to relate to SAR data. After the pre-processing of Sentinel 1-A data for radiometric calibration, geo-correction, terrain correction and speckle filtering, the variability in the backscatter signal in relation tree density, basal area and above biomass density has been investigated. Results from the curve fitting approach suggested exponential model between the Sentinel-1A backscatter versus tree density and above ground biomass whereas the relationship was almost linear with the basal area in the VV polarization mode. Of the different parameters, tree density could explain most of the variations in backscatter. Both VV and VH backscatter signals could explain only thirty and thirty three percent of variation in above biomass in different forest sites of India. Results also suggested saturation of the Sentinel-1A backscatter signal around hundred tonnes per hectare for VV polarization and one hundred and forty five tonnes per hectare for VH polarization. The presentation will highlight the above results in addition to potentials and limitations of Sentinel-1A data for retrieving forest structural parameters. Also, background information on different forest types of India, biomass variations and forest type mapping efforts in the region will be presented.

Data↗

Huntsville Urban Development II: Utilizing NASA Earth Observations to Map the Urban Heat Island and Evaluate Vulnerability in Huntsville, Alabama

Huntsville, Alabama has seen a boom in growth over recent years. One consequence of this urban expansion is the exacerbation of the Urban Heat Island (UHI) effect across the city. This project identified the areas within Huntsville the greatest potential for heat reduction and community health benefits from tree-planting efforts. The team created maps of land surface temperature (LST), the normalized difference vegetation index (NDVI), and the normalized difference built-up index (NDBI) over June through August from 2019 to 2022 using data from ECOsystem Spaceborne Thermal Radiometer Experiment on Space Station, Landsat 8 Operational Land Imager (OLI) and Thermal Infrared Sensor (TIRS), Landsat 9 OLI-2 and TIRS-2. The team identified areas with high LST, low NDVI, and high NDBI as areas with the greatest potential for heat reduction via tree-planting. Social factors relating to age, race, income, and self-reported health were adapted from Tree Equity Score to map community need for tree cover. When combining social with environmental factors, the team determined areas with the greatest potential for UHI mitigation: west-central and north downtown Huntsville. The team’s partner organization, the City of Huntsville, can use this priority map to guide their future tree-planting, and weigh the factors assessed according to their preference.

James Karroum↗