Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “TREES”

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 739 records · Page 41

Cherokee Water Resources - Mapping Hemlock Tree Composition and Health in the Southern Appalachians Using NASA Earth Observations to Enhance Drought and Watershed Health-Related Forest Management for the Eastern Band of the Cherokee Indians

The Eastern Band of Cherokee Indians (EBCI) owns and manages more than 55,000 acres of land in the Southern Appalachian Mountains of western North Carolina. Most of these lands reside within the Oconaluftee River watershed. In this region and watershed, hemlock trees are a culturally significant foundation species that contribute to habitat biodiversity, regulate temperature and evapotranspiration of riparian environments, and provide economic value for tourism and recreation. The hemlock woolly adelgid (HWA), an invasive insect, has caused widespread hemlock mortality in recent decades, raising concerns about hemlock decline. Hemlock mortality leads to standing dead trees and increased evapotranspiration which can abet the spread of wildfires, especially during periods of drought. The DEVELOP team used satellite imagery from Landsat 5 Thematic Mapper (TM) to quantify and map possible hemlock decline by comparing changes in the normalized difference vegetation index (NDVI) values of winter season between 2003 and 2010. The project utilized the Shuttle Radar Topography Mission (SRTM) along with imagery from Landsat 8 Operational Land Imager (OLI) to create a weighted suitability analysis that maps topographic and environmental conditions favorable for hemlock habitat. This study found that 67% of evergreen and mixed forest cover in the Oconaluftee River valley exhibited a decrease in winter NDVI from 2003 to 2010. Additionally, the two-example weighted suitability analyses showed 4.5-9.5% of hemlock suitable land in 2018 in the Oconaluftee. The partners of this project can use the outputs to identify the extent of potential hemlock decline in the Oconaluftee and establish benchmark metrics for assessing changes in hemlock suitable areas over time.

Richard Murray↗

Los Angeles Urban Development Utilizing Nasa Earth Observations to Evaluate the Impact of Tree Coverage on Urban Heat Mitigation

In recent decades, Los Angeles, California has experienced an increase in summer temperatures that has intensified the urban heat island effect. The expansion of developed areas has contributed significantly to this phenomenon by trapping and reradiating heat, posing dangerous health risks to residents. To mitigate this problem, organizations including City Plants and the L.A.’s Office of City Forest Management have implemented initiatives to promote urban greening and tree planting, which help cool down vulnerable communities. In collaboration with these partners, NASA DEVELOP has undertaken a study to investigate the role of trees in urban environments and their effectiveness in reducing local urban heat islands.

Leyla Namazie↗

CubeSAT Security Attack Tree Analysis

Once a novelty, small satellites, often referred to as CubeSats, have become important tools for a variety of space activities ranging from exploration to defense. Their relative affordability and short development timeline have made them attractive options to complement larger space vehicles, conduct reconnaissance and other finite tasks. The specialized nature of many CubeSat missions do not make their security any less important as their missions could easily be matters of national security. This paper demonstrates the use of attack tree analysis to assess vulnerabilities of a CubeSat. First, we abstract and build an architectural model of an operational CubeSat. We then create a series of attack trees for the abstracted architecture to illustrate a series of potential attack vectors for small satellites. We conclude by discussing some strategies that could be employed to improve CubeSat resilience.

Santangelo, Andrew↗

Monte Carlo Tree Search for Integrated Planning, Learning, and Execution in Nondeterministic Python

We present a novel use of Monte Carlo Tree Search (MCTS),adapted to explore a search space produced by the choice points embedded in Python code. The choice points are non-deterministic assignment statements and subroutine calls. We present MCTS extensions required for doing tree search in this context which includes control constructs like hierarchical decomposition (subroutine calls), iterative while loops and conditional statements. We demonstrate how the system works in a simulated rideshare scenario in an urban setting, and present preliminary experiments as a proof of concept.

Automatic planning↗

San José Urban Development: Quantifying Canopy Cover and Land Surface Temperature in San José to Identify Future Tree Planting Sites

The urban heat island effect refers to the phenomenon of substantially increased temperatures in urban areas compared to their surrounding suburban or rural counterparts. The City of San José’s Department of Parks, Recreation and Neighborhood Services (PRNS) and Department of Transportation (DOT) work to mitigate the UHI effect through urban forestry initiatives. The PRNS and DOT partnered with NASA DEVELOP to identify areas in need of tree plantings. We examined land surface temperature (LST) throughout the city using data from the Thermal Infrared Sensor (TIRS) and TIRS-2 on NASA’s Landsat 8 and 9 satellites from 2013 to 2024. We also assessed canopy cover in parks using LiDAR data collected in 2020 for the United States Geological Survey’s 3D Elevation Program, and measured vegetation greenness using the Normalized Difference Vegetation Index (NDVI) with PlanetScope imagery from 2018 to 2024. We evaluated social and environmental factors that influence the distribution of heat event impacts by creating a heat vulnerability index. We found that heat is concentrated in urban areas and that poor vegetation health is associated with high LST. We also found that socially vulnerable communities are disproportionately located in areas of high environmental risk. These analyses allow the partners to prioritize tree plantings in parks near areas of high social and environmental risk. We determined that Earth observations can be used to inform urban forestry decision making, but because methodologies for using LiDAR to assess canopy cover vary greatly, it is difficult to make comparisons across different canopy cover assessments.

land surface temperature↗

Parallel Algorithms for Graph Optimization using Tree Decompositions

Although many NP-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of required dynamic programming tables and excessive running times of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree-decomposition based approach to solve maximum weighted independent set. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

Weerapurage, Dinesh P↗

Watershed Merge Tree Classification for Electron Microscopy Image Segmentation

Automated segmentation of electron microscopy (EM) images is a challenging problem. In this paper, we present a novel method that utilizes a hierarchical structure and boundary classification for 2D neuron segmentation. With a membrane detection probability map, a watershed merge tree is built for the representation of hierarchical region merging from the watershed algorithm. A boundary classifier is learned with non-local image features to predict each potential merge in the tree, upon which merge decisions are made with consistency constraints in the sense of optimization to acquire the final segmentation. Independent of classifiers and decision strategies, our approach proposes a general framework for efficient hierarchical segmentation with statistical learning. We demonstrate that our method leads to a substantial improvement in segmentation accuracy.

Liu, TIng↗

Distributed Merge Trees

Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges.

97 MATHEMATICS AND COMPUTING↗

ADAPT (Analysis of Dynamic Accident Progression Trees) Beta Version 0.9

The purpose of the ADAPT code is to generate Dynamic Event Trees (DET) using a user specified simulator. ADAPT can utilize any simulation tool which meets a minimal set of requirements. ADAPT is based on the concept of DET which use explicit modeling of the deterministic dynamic processes that take place during a nuclear reactor plant system evolution along with stochastic modeling. When DET are used to model different aspects of Probabilistic Risk Assessment (PRA), all accident progression scenarios starting from an initiating event are considered simultaneously. The DET branching occurs at user specified times and/or when an action is required by the system and/or the operator. These outcomes then decide how the dynamic system variables will evolve in time for each DET branch. Since two different outcomes at a DET branching may lead to completely different paths for system evolution, the next branching for these paths may occur not only at different times, but can be based on different branching criteria. The computational infrastructure allows for flexibility in ADAPT to link with different system simulation codes, parallel processing of the scenarios under consideration, on-line scenario management (initiation as well as termination) and user friendly graphical capabilities. The ADAPT system is designed for a distributed computing environment; the scheduler can track multiple concurrent branches simultaneously. The scheduler is modularized so that the DET branching strategy can be modified (e.g. biasing towards the worse case scenario/event). Independent database systems store data from the simulation tasks and the DET structure so that the event tree can be constructed and analyzed later. ADAPT is provided with a user-friendly client which can easily sort through and display the results of an experiment, precluding the need for the user to manually inspect individual simulator runs.

Kunsman, David↗

A Low Power, High Speed Readout for Pixel Detectors Based on an Arbitration Tree

A low-power, high-speed arbitration tree for pixel detector readout is presented. The synchronized, binary tree priority encoder establishes a position dependent priority list at the start of every time frame. Pixels that indicate the presence of data for readout, are sequentially granted access to a shared bus for data transfer to the periphery, without the use of an additional global strobe signal. It can be used for either full frame imaging or zero-suppressed readout, in which case it can simultaneously generate the pixel address. To increase the readout frame rate, the pixel array is subdivided into two halves, which allows interleaved latching of data at the output serializer. The design was implemented in a 65 nm LP-CMOS process for the readout of a 64 x 64 pixel array. Measurement results demonstrate a deadtime-less, full frame imaging rate of ~50 kfps, achieved with a dedicated output for every (32 x 32) 1024 pixels and for a pixel data packet of 11 bits, with no bit errors detected over 1000 frames. The measured energy per bit is 0.94 pJ.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Constructing and proving the ground state of a generalized Ising model by the cluster tree optimization algorithm

Generalized Ising models, also known as cluster expansions, are an important tool in many areas of condensed-matter physics and materials science, as they are often used in the study of lattice thermodynamics, solid-solid phase transitions, magnetic and thermal properties of solids, and fluid mechanics. However, the problem of finding the global ground state of generalized Ising model has remained unresolved, with only a limited number of results for simple systems known. We propose a method to efficiently find the periodic ground state of a generalized Ising model of arbitrary complexity by a new algorithm which we term cluster tree optimization. Importantly, we are able to show that even in the case of an aperiodic ground state, our algorithm produces a sequence of states with energy converging to the true ground state energy, with a provable bound on error. Compared to the current state-of-the-art polytope method, this algorithm eliminates the necessity of introducing an exponential number of variables to counter frustration, and thus significantly improves tractability. We believe that the cluster tree algorithm offers an intuitive and efficient approach to finding and proving ground states of generalized Ising Hamiltonians of arbitrary complexity, which will help validate assumptions regarding local vs. global optimality in lattice models, as well as offer insights into the low-energy behavior of highly frustrated systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Using Boosted Decision Trees to Select High Quality Measurements in the Mu2e Experiment at Fermilab

This thesis presents the implementation and evaluation of a Boosted Decision Tree (BDT) model to improve the selection of high-quality track measurements in the Mu2e experiment at Fermilab. The Mu2e experiment is a high-energy physics experiments seeking to observe a rare theoretical physics process known as Charged Lepton Flavor Violation. A significant challenge faced by the Mu2e experiment are so-called background events, which are events whose data mimics that of the rare physics process the experiment seeks to observe. Without a mechanism to reduce background, it would be impossible to know whether Charged Lepton Flavor Violation occurred or not. To this end, high-quality track measurements must be distinguished from low-quality track measurements. A track can be conceived of as the reconstructed path of a particle that traveled through the Mu2e detector. In addition to other data, data about such tracks is stored using a C++-based framework, specific to the domain of high-energy physics, known as ROOT. A boosted decision tree model was trained using ROOT’s Toolkit For Multivariate Analysis by leveraging variables ancillary to track quality. In evaluation, the BDT achieves a ROC-AUC of 0.927 in discriminating good-quality tracks from poor-quality tracks. Such a score is indicative of both strong discrimination and strong generalization. Subsequently, it is shown that applying a BDT-based quality cut to the distribution of particle momenta significantly enhances the signal-to-background distinction for signal electrons, paving the way for improved sensitivity to Charged Lepton Flavor Violation.

Mullany, Brendan T. [Drew U.] (ORCID:0009000818888↗

EVENT TREE ANALYSIS AT THE SAVANNAH RIVER SITE: A CASE HISTORY

At the Savannah River Site (SRS), a Department of Energy (DOE) installation in west-central South Carolina there is a unique geologic stratum that exists at depth that has the potential to cause surface settlement resulting from a seismic event. In the past the particular stratum in question has been remediated via pressure grouting, however the benefits of remediation have always been debatable. Recently the SRS has attempted to frame the issue in terms of risk via an event tree or logic tree analysis. This paper describes that analysis, including the input data required.

58 GEOSCIENCES↗

Maximizing Adaptivity in Hierarchical Topological Models Using Cancellation Trees

We present a highly adaptive hierarchical representation of the topology of functions defined over two-manifold domains. Guided by the theory of Morse-Smale complexes, we encode dependencies between cancellations of critical points using two independent structures: a traditional mesh hierarchy to store connectivity information and a new structure called cancellation trees to encode the configuration of critical points. Cancellation trees provide a powerful method to increase adaptivity while using a simple, easy-to-implement data structure. The resulting hierarchy is significantly more flexible than the one previously reported. In particular, the resulting hierarchy is guaranteed to be of logarithmic height.

99 GENERAL AND MISCELLANEOUS↗

Measurement of single top quark production in the tau+jets channnel using boosted decision trees at D0

The top quark is the heaviest known matter particle and plays an important role in the Standard Model of particle physics. At hadron colliders, it is possible to produce single top quarks via the weak interaction. This allows a direct measurement of the CKM matrix element V tb and serves as a window to new physics. The first direct measurement of single top quark production with a tau lepton in the final state (the tau+jets channel) is presented in this thesis. The measurement uses 4.8 fb -1 of Tevatron Run II data in p$\bar{p}$ collisions at √s = 1.96 TeV acquired by the D0 experiment. After selecting a data sample and building a background model, the data and background model are in good agreement. A multivariate technique, boosted decision trees, is employed in discriminating the small single top quark signal from a large background. The expected sensitivity of the tau+jets channel in the Standard Model is 1.8 standard deviations. Using a Bayesian statistical approach, an upper limit on the cross section of single top quark production in the tau+jets channel is measured as 7.3 pb at 95% confidence level, and the cross section is measured as 3.4 -1.8 +2.0 pb. The result of the single top quark production in the tau+jets channel is also combined with those in the electron+jets and muon+jets channels. The expected sensitivity of the electron, muon and tau combined analysis is 4.7 standard deviations, to be compared to 4.5 standard deviations in electron and muon alone. The measured cross section in the three combined final states is σ(p$\bar{p}$ → tb + X,tqb + X) = 3.84 -0.83 +0.89 pb. A lower limit on |V tb | is also measured in the three combined final states to be larger than 0.85 at 95% confidence level. These results are consistent with Standard Model expectations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Network Scale Ubiquitous Volume Estimation Using Tree-Based Ensemble Learning Methods

Currently real-time, ubiquitous volume data for roadway networks remains the key missing dimension in traffic operations. Most volume data are average annual daily traffic (AADT) measures derived from the Highway Performance Monitoring System (HPMS). Although methods to factor the AADT to hourly averages for typical day of week exist, actual volume data is limited to a sparse collection of locations in which volumes are continuously recorded. This paper explores the use of state-of-art machine learning techniques to estimate accurate real-time volume measures that span the highway network providing ubiquitous coverage in space, and point-in-time measures for a specific date and time. Three tree-based ensemble learning models, random forest (RF), gradient boost machine (GBM), and extreme gradient boost (XGBoost), were tested for volume estimation by learning from combined dataset of commercial probe data provided by TomTom, the FHWA's Travel Monitoring Analysis System (TMAS) data, and other infrastructure attributes such as number of lanes, speed limit, and weather. The methods were tested on major corridors and freeways in the metropolitan area of Denver. All three machine learning methods were able to provide hourly volume estimates 24 hours a day, 7 days a week, and 365 days a year with around 18% mean absolute error to true volume and about 5% of error with respect to roadway capacity. The low error measures allow the potential application by transportation agencies.

33 ADVANCED PROPULSION SYSTEMS↗

Identification of potential CO 2 leakage pathways and mechanisms in oil reservoirs using fault tree analysis

Geological storage of CO 2 technologies has become an important and effective way to reduce the greenhouse gas emissions, especially when it is combined with CO 2 enhanced oil recovery (EOR), which can not only trap CO 2 but also enhance oil recovery. However, the risk of CO 2 leakage has always been a prominent issue. In this paper, the mechanisms and pathways of CO 2 leakage during geological storage in oil reservoirs were analyzed using fault tree analysis (FTR). Besides, monitoring technologies were discussed and deployed in a CO 2 EOR demonstration project. The analysis results showed that the sealing failures of oil producer and CO2 injector wells, like well cement failure and casing failure, are the main reasons for the CO 2 leakage, which has been observed in the oil field monitoring project. The monitoring results indicated that there is no large-scale CO 2 leakage, while relatively high and abnormal CO 2 concentration in soil gas near some wellbores are observed, which indicates there is some leakage of CO 2 through incomplete cement ring and well casing string. FTR results provide guidelines for monitoring and preventing of CO 2 leakage during geological storage in oil reservoirs. Finally, the near-surface monitoring methods, especially the soil gas monitoring technologies, can effectively detect the leakage of CO 2 , and are a proper method for CO 2 leakage monitoring.

58 GEOSCIENCES↗

Hyperplane decision trees as piecewise linear surrogate models for chemical process design

Recent trends in chemical engineering research point towards an increasing reliance on data-driven modeling approaches. Neural networks, for instance, have proven to be accurate when data is plentiful and high-dimensional, but in many cases, they require computationally-intensive training procedures. Here, in this work, we describe hyperplane decision trees (HT) as a highly expressive and low-compute machine learning model architecture. These models are locally linear and have linear decision boundaries, resulting in a piecewise linear model of the data. This property allows them to be converted into mixed-integer linear constraints which can be globally optimized. Our open-source PyTorch implementation of this method is a fast, flexible, and accessible way to build accurate piecewise linear models of data.

Decision trees↗