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 991 records · Page 55

Arizona Water Resources: Utilizing Aerial Imagery and NASA Earth Observations to Assess Pinyon-Juniper Tree Mortality in Flagstaff, AZ

Pinyon-juniper woodlands (PJW) are a vital habitat and food source for several wildlife species and a source of both utility and cultural importance for Indigenous groups. In 2021, amidst a decades-long drought, an extensive juniper mortality event occurred at Wupatki National Monument (WNM) in Arizona. In response, the National Park Service (NPS) is evaluating which land management practices will be beneficial. In partnership with the NPS, the NASA DEVELOP team used remote sensing data to map PJW mortality and analyze the relation of tree mortality to stand density, climate, and topography in north-central Arizona from 2015 to 2021. To identify the extent of PJW, the team performed an unsupervised classification using National Agricultural Imagery Program (NAIP) data with validation sources including NPS-created land cover maps, Landscape Fire and Resource Management Planning Tools (LANDFIRE), NPS and United States Forest Service (USFS) vegetation maps, and Landsat 8 Operational Land Imager (OLI) and Thermal Infrared Sensor (TIRS) data. Terra Moderate Resolution Imaging Spectroradiometer (MODIS), Global Precipitation Measurement (GPM) Integrated Multi-satellite Retrievals for GPM (IMERG), Soil Moisture Active Passive (SMAP), Shuttle Radar Topography Mission (SRTM), and Landsat 8-derived Normalized Difference Vegetation Index (NDVI) and Normalized Difference Moisture Index (NDMI) were used to analyze factors contributing to pinyon-juniper mortality. Although no relationships were found in the broader study region, PJW mortality was weakly correlated to elevation, soil moisture, and land surface temperature within WNM. Results from this study can inform NPS vegetation management that best protects natural and cultural resources.

Margaret Jaenicke↗

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Monte Carlo Tree Search Approach

Numerous unmanned aircraft systems operating at low altitudes to deliver goods and services may one day become ubiquitous in our cities. In the Unmanned Aircraft Systems (UAS) Traffic Management (UTM) framework, such a concept is envisioned, where aerial vehicles operate beyond visual line of sight (BVLOS) within specifically reserved and time stamped “corridors” in the airspace. For example, these corridors or operational intent volumes can connect an aerial vehicle’s origin site to its destination site for package delivery operations. There may also be more than one corridor available for an aerial vehicle to choose from and often different corridors may intersect with one another. Thus, it is imperative to ensure flight trajectories belonging to different aerial vehicles are not in conflict. Per the UTM CONOPs, we assume that a vehicle almost always stays inside its corridor or operational volume. This work provides a framework for strategic deconfliction of UTM or package delivery drones, where we schedule the departure time of all vehicles subject to various temporal constraints (including the corridor deconfliction at the intersections). We present the “multi-route weighted package delivery problem” which serves as an exemplifying model for strategic deconfliction in UTM. In the multi-route weighted package delivery problem, a graph network is given which consists of a set of depots (source) and drop-off (destination) nodes, with multiple routes (defined as a sequence of waypoints) connecting the depots to drop-off nodes. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is for a known set of aerial vehicles to depart from the depots, choose a route and take off time, while avoiding conflicts with other aerial vehicles, and minimizing both risk and distance traveled. We provide a mixed integer linear programming (MILP) formulation of the problem, as well as a heuristic solution based on Monte Carlo Tree Search (MCTS) – a method used in game theory and artificial intelligence – to overcome limitations inherent to optimal solvers. Computational results show the advantages of using MCTS over the MILP formulation; the former can provide a sub-optimal solution quickly, and may sometimes even reach an optimal solution, whereas the latter may not even produce a solution in reasonable time. Furthermore, results from both the MILP formulation and MCTS methods were validated using a preliminary agent-based simulator implementing the UTM concept of operations. Thus, the MCTS method can be seen as a scalable solution to the complex multi-route weighted package delivery problem and may possibly be extended to similar complex optimization problems.

Kenny Chour↗

Lila: Optimal Dispatching in Probabilistic Temporal Networks using Monte Carlo Tree Search

Executing a Probabilistic Simple Temporal Network (PSTN) amounts at scheduling, i.e. \textit{dispatch}, a set of events under time uncertainty. This constitutes a NP-hard online optimization problem. The right execution time must be dynamically assigned to each event of the PSTN such that the temporal constraints are met, whereas activity durations are progressively observed as the execution unfolds. We propose a dispatching algorithm based on Monte Carlo Tree Search, called Lila, with the following characteristics: (i) it is an anytime algorithm, both offline and online, proven asymptotically optimal; (ii) it returns the current probability of success, either before or at any moment during operations; (iii) it handles any possible continuous or discrete, even non-parametric, probability distributions, as well as inter-dependencies between random variables, exogenous and endogenous uncertainty; and (iv) can be easily extended to handle probabilistic external events, PSTNs with resources, PSTNs with cutoff times and precondition chains, etc. Lila is universal in the sense that it can handle any dispatching protocol, simply by specifying it to the algorithm. It has the unlimited flexibility offered by the simulation paradigm, whilst it asymptotically converges to optimal decisions and/or robustness approximations.

Chien, Steve A.↗

Monte Carlo Tree Search Methods for the Earth-Observing Satellite Scheduling Problem

This work explores on-board planning for the single spacecraft, multiple ground station Earth-observing satellite scheduling problem through artificial neural network function approximation of state–action value estimates generated by Monte Carlo tree search (MCTS). An extensive hyperparameter search is conducted for MCTS on the basis of performance, safety, and downlink opportunity utilization to determine the best hyperparameter combination for data generation. A hyperparameter search is also conducted on neural network architectures. The learned behavior of each network is explored, and each network architecture’s robustness to orbits and epochs outside of the training distributions is investigated. Furthermore, each algorithm is compared with a genetic algorithm, which serves to provide a baseline for optimality. MCTS is shown to compute near-optimal solutions in comparison to the genetic algorithm. The state–action value networks are shown to match or exceed the performance of MCTS in six orders of magnitude less execution time, showing promise for execution on board spacecraft.

Adam P. Herrmann↗

Effects of Water Limitation and Competition on Tree Carbon Allocation in an Earth System Modeling Framework

Earth system models (ESMs) have a limited capacity to represent plant functional diversity and shifts in trait distributions. Approaches to improving the representation of this complexity in ESMs include (i) optimality-based approaches that predict trait–environment responses and (ii) explicitly modelling coexistence and community assembly. These approaches are expected to converge only when optimality-based approaches identify competitively dominant strategies, which often differ from strategies that maximize ecosystem functioning or fitness components in monoculture. We used two models, LM3-PPA (a vegetation demographic model designed as an ESM component) and BiomeE (a computationally efficient analog for LM3-PPA), to explore how water limitation affects carbon allocation strategies of canopy trees. We compared competitive allocation strategies and those that maximize biomass or productivity in monoculture. We did not explicitly model coexistence or community assembly. Rather, we used model experiments to identify competitive and maximizing strategies in a two-dimensional trait space under different precipitation and mortality scenarios. At 10 eastern US locations, we simulated historical, wet and dry climate scenarios, novel drought and three different mortality scenarios (low, medium or high sensitivity to water deficit). For each site and scenario, we identified the competitive strategy and three maximizing strategies (maximum biomass, productivity or drought-tolerance). Root: leaf ratios tended to increase and leaf area tended to decrease with increasing water stress (increasing water limitation and its effects on mortality). However, relative to maximizing strategies, competitive strategies shifted towards greater allocation to roots and leaves with increasing water stress. Competitive overinvestments (greater allocation to roots and leaves by competitive strategies compared with maximizing strategies) were robust across different modelling contexts, including vegetation parameter sets (Acer vs. Populus), models (LM3-PPA vs. BiomeE) and uncalibrated vs. calibrated BiomeE versions. Synthesis: The theoretical prediction that competitive and maximizing allocation strategies differ under water limitation is confirmed for a demographic model designed as an ESM component. Optimality-based trait predictions can simplify representing trait diversity in ESMs but do not always correspond to competitive outcomes. Explicitly modelling coexistence and community assembly in ESMs is challenging but is likely the most general approach to representing trait diversity.

vegetation demographic model↗

Fully automated segmentation and characterization of the dendritic trees of retinal horizontal neurons

We introduce a new fully automated method for segmenting and characterizing the dendritic tree of neurons in confocal image stacks. Our method is aimed at wide-field-of-view, low-resolution imagery of retinal neurons in which dendrites can be intertwined and difficult to follow. The approach is based on 3-D skeletonization and includes a method for automatically determining an appropriate global threshold as well as a soma detection algorithm. We provide the details of the algorithm and a qualitative performance comparison against a commercially available neurite tracing software package, showing that a segmentation produced by our method more closely matches the ground-truth segmentation.

59 BASIC BIOLOGICAL SCIENCES↗

Patch-based image segmentation of satellite imagery using minimum spanning tree construction

We present a method for hierarchical image segmentation and feature extraction. This method builds upon the combination of the detection of image spectral discontinuities using Canny edge detection and the image Laplacian, followed by the construction of a hierarchy of segmented images of successively reduced levels of details. These images are represented as sets of polygonized pixel patches (polygons) attributed with spectral and structural characteristics. This hierarchy forms the basis for object-oriented image analysis. To build fine level-of-detail representation of the original image, seed partitions (polygons) are built upon a triangular mesh composed of irregular sized triangles, whose spatial arrangement is adapted to the image content. This is achieved by building the triangular mesh on the top of the detected spectral discontinuities that form a network of constraints for the Delaunay triangulation. A polygonized image is represented as a spatial network in the form of a graph with vertices which correspond to the polygonal partitions and graph edges reflecting pairwise partitions relations. Image graph partitioning is based on the iterative graph oontraction using Boruvka's Minimum Spanning Tree algorithm. An important characteristic of the approach is that the agglomeration of partitions is constrained by the detected spectral discontinuities; thus the shapes of agglomerated partitions are more likely to correspond to the outlines of real-world objects.

97 MATHEMATICS AND COMPUTING↗

Method of particle trajectory recognition in particle flows of high particle concentration using a candidate trajectory tree process with variable search areas

The application relates to particle trajectory recognition from a Centroid Population comprised of Centroids having an (x, y, t) or (x, y, f) coordinate. The method is applicable to visualization and measurement of particle flow fields of high particle. In one embodiment, the centroids are generated from particle images recorded on camera frames. The application encompasses digital computer systems and distribution mediums implementing the method disclosed and is particularly applicable to recognizing trajectories of particles in particle flows of high particle concentration. The method accomplishes trajectory recognition by forming Candidate Trajectory Trees and repeated searches at varying Search Velocities, such that initial search areas are set to a minimum size in order to recognize only the slowest, least accelerating particles which produce higher local concentrations. When a trajectory is recognized, the centroids in that trajectory are removed from consideration in future searches.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Performing a scatterv operation on a hierarchical tree network optimized for collective operations

Performing a scatterv operation on a hierarchical tree network optimized for collective operations including receiving, by the scatterv module installed on the node, from a nearest neighbor parent above the node a chunk of data having at least a portion of data for the node; maintaining, by the scatterv module installed on the node, the portion of the data for the node; determining, by the scatterv module installed on the node, whether any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child; and sending, by the scatterv module installed on the node, those portions of data to the nearest neighbor child if any portions of the data are for a particular nearest neighbor child below the node or one or more other nodes below the particular nearest neighbor child.

97 MATHEMATICS AND COMPUTING↗

Genetic Algorithms and Classification Trees in Feature Discovery: Diabetes and the NHANES database

This paper presents a feature selection methodology that can be applied to datasets containing a mixture of continuous and categorical variables. Using a Genetic Algorithm (GA), this method explores a dataset and selects a small set of features relevant for the prediction of a binary (1/0) response. Binary classification trees and an objective function based on conditional probabilities are used to measure the fitness of a given subset of features. The method is applied to health data in order to find factors useful for the prediction of diabetes. Results show that our algorithm is capable of narrowing down the set of predictors to around 8 factors that can be validated using reputable medical and public health resources.

Heredia-Langner, Alejandro↗

Embedding global and collective in a torus network with message class map based tree path selection

Embodiments of the invention provide a method, system and computer program product for embedding a global barrier and global interrupt network in a parallel computer system organized as a torus network. The computer system includes a multitude of nodes. In one embodiment, the method comprises taking inputs from a set of receivers of the nodes, dividing the inputs from the receivers into a plurality of classes, combining the inputs of each of the classes to obtain a result, and sending said result to a set of senders of the nodes. Embodiments of the invention provide a method, system and computer program product for embedding a collective network in a parallel computer system organized as a torus network. In one embodiment, the method comprises adding to a torus network a central collective logic to route messages among at least a group of nodes in a tree structure.

97 MATHEMATICS AND COMPUTING↗

APHiD: Hierarchical Task Placement to Enable a Tapered Fat Tree Topology for Lower Power and Cost in HPC Networks

The power and procurement cost of bandwidth in system-wide networks has forced a steady drop in the byte/flop ratio. This trend of computation becoming faster relative to the network is expected to hold. In this paper, we explore how cost-oriented task placement enables reducing the cost of system-wide networks by enabling high performance even on tapered topologies where more bandwidth is provisioned at lower levels. We describe APHiD, an efficient hierarchical placement algorithm that uses new techniques to improve the quality of heuristic solutions and reduces the demand on high-level, expensive bandwidth in hierarchical topologies. We apply APHiD to a tapered fat-tree, demonstrating that APHiD maintains application scalability even for severely tapered network configurations. Using simulation, we show that for tapered networks APHiD improves performance by more than 50% over random placement and even 15% in some cases over costlier, state-of-the-art placement algorithms.

Michelogiannakis, George↗

Automated Proton Track Identification in MicroBooNE Using Gradient Boosted Decision Trees

MicroBooNE is a liquid argon time projection chamber (LArTPC) neutrino experiment that is currently running in the Booster Neutrino Beam at Fermilab. LArTPC technology allows for high-resolution, three-dimensional representations of neutrino interactions. A wide variety of software tools for automated reconstruction and selection of particle tracks in LArTPCs are actively being developed. Short, isolated proton tracks, the signal for low- momentum-transfer neutral current (NC) elastic events, are easily hidden in a large cosmic background. Detecting these low-energy tracks will allow us to probe interesting regions of the proton's spin structure. An effective method for selecting NC elastic events is to combine a highly efficient track reconstruction algorithm to find all candidate tracks with highly accurate particle identification using a machine learning algorithm. We present our work on particle track classification using gradient tree boosting software (XGBoost) and the performance on simulated neutrino data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

LeptonJet Categorization with Decision Tree

With much evidence for dark matter arising from astronomical observations, particle physics has also begun to look for dark matter candidates. Here, a boosted decision tree machine learning algorithm (BDT) is used to distinguish signal from background in a search for self-interacting dark matter at CMS with two different final states of signal. The signal final states are two displaced collimated pairs of leptons (leptonJets). In this project, possible improvements to the BDT are explored. Various methods of signal separation are studied, as well as various accuracy metrics to study and compare the different models. Through the separated models and improvements in training, a slight increase in accuracy score was obtained (0.01% on electrons, 0.46% on muons). Additionally, the separated models were able to recognize a significantly increased percentage of signal, particularly against the electron signal. Separated models are being considered as part of the larger an alysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Decision trees for incorporating the likelihood of excessive hydrologic alteration into hydropower-ecosystem tradeoffs

Detrimental ecological impacts have often been observed or anticipated when changes in streamflow indicators exceed percent deviation thresholds believed to be ecologically critical. Yet, short pre- and post-impact flow records often make it difficult to determine whether changes exceeding tolerable thresholds are due to dam operations or natural variability. Through a hypothetical reservoir operations example, we incorporate the uncertainty of dam-induced streamflow changes into a Bayesian decision tree framework that evaluates tradeoffs between expected regrets associated with hydropower and ecology. The likelihood of over-protection (type I) and under-protection (type II) errors associated with hypothesis tests are used to compute expected hydropower and ecosystem regrets associated with dam operation decisions. We examine changes to high (annual Q5) and low flows (annual Q95) in typical years using a modified and extended nonparametric ranked-sum test that accounts for percent deviation thresholds. A multiple comparison test is then used to determine the likelihood of at least one threshold violation. An example shows that our decision-theoretic approach can lead to different dam operation recommendations than do other common methods, and highlights limitations that arise when the type I error rate is selected a priori. While we illustrate a hydropower-ecosystem tradeoff, our approach can also be applied to other multi-stakeholder reservoir and river management conflicts.

Bayesian decision-making, environmental flows, flo↗

FEMP Facility Evaluation (Audit) Decision Tree

This document is a resource to be used in concert with FEMP Audit Definitions, FEMP Consolidated Facility Management Guidance, and agency best practices and expert judgment—for agencies to use to determine the best approaches to evaluate their facilities. It features a decision tree that provides a framework for agencies to interpret gathered facility data to understand the existing conditions; benchmark the facility against others in the portfolio to determine whether an on-site or remote audit is appropriate for a facility; determine the best remote or on-site audit level of detail to meet agency facility auditing goals, such as meeting Energy Independence and Security Act of 2007 requirements and developing projects; and improve their energy and water management programs.

auditing↗

Impact of Tree Age and Anatomical Fraction on Forest Residue Pyrolysis and Hydrotreating

Utilization of cost-advantaged biomass and waste resources to produce clean, domestic biofuels will be a key factor in decarbonizing transportation in the United States. This study investigates how the distribution of anatomical fractions (stem wood, bark, needles, branches) from pine forest residues of different ages impacts pyrolysis and hydrotreating processes, including product composition, carbon efficiency, economics, and overall sustainability. Commercially sourced 13- and 23-year-old loblolly pine residues were chosen to represent available resources; whole tree thinnings, and tops and branches from merchantable timber, respectively. Detailed characterization of the residue samples, product distributions, bio-oil, char, and gas characterization data are presented for 13 experiments, including the individual fractions, blends, and air-classified samples to reduce ash content. Pyrolysis mass balances averaged 97 +/- 3%. As expected, bio-oil yields were lower for the bark, needles, and blends with high proportions of these (53-56% dry basis), and highest for the debarked stem wood (67-71% dry basis). Lower yields were attributed to the high ash content of the needles, but also to the high lignin content in the bark (>50%), which is hypothesized to have led to increased char formation during pyrolysis. Higher-oil yield was generally correlated with total volatiles, hydrogen, oxygen, glucan, and mannan; somewhat correlated with xylan and acetyl content; and negatively correlated with total carbon, fixed carbon, nitrogen, sulfur, and extractives. Air classification of the residues was effective in reducing ash content (1.5% to 0.64%), extractives (~7% to 2%), and sulfur (0.04% to 0.02%), resulting in a small increase in yield, a significant increase in the GC-detectable proportion of oil (27% to 34%) and a net economic benefit. These experimental results were used to conduct technoeconomic and life cycle analyses, which are also summarized here.

biofuels↗

A Simplified Multi-Path Event Tree for the Integral, Inherently-Safe Light Water Reactor (I{sup 2}S-LWR)

The Integral, Inherently-Safe Light Water Reactor (I{sup 2}S-LWR) concept aims to raise the bar for nuclear power plant safety while maintaining the economic advantages of large, gigawatt-scale plants.1 To obtain this goal, the project safety team seeks to eliminate initiating events where possible, maximize passivity of safety systems, and optimize a balance of redundancy, diversity, and simplicity of safety systems.2 Achievement of these objectives, particularly the last set, requires detailed, quantitative risk information from the earliest stages of development. Therefore, despite limited design information, we have constructed a preliminary probabilistic risk assessment (PRA) for I{sup 2}S-LWR. Safety implementation for I{sup 2}S-LWR, then, requires an iterative process involving system design, thermal-hydraulic (T/H) and neutronic deterministic analyses, and risk-informing PRA studies. Due to this parallelism, it is vital those team members without PRA expertise quickly and correctly understand preliminary PRA results. To this end, we have developed a method to condense the entire PRA into a single, multi-path event tree (MPET). (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗