Search NASA⌕ Search

SEARCH · Search NASA

Results for “trees (mathematics)”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

A mathematical model of tree harvesting in age-structured forests subject to beetle infestations

In this paper, we investigate a mathematical model for age-structured forest–beetle interactions that includes harvesting of trees. The aim is to broaden the understanding of the synergistic effects of harvesting and insect infestation on the age structure of the forests and the harvesting benefit. In the first part of this study, we consider different scenarios of the forest infestation by beetles and observe that the quantitative age profile of the forest depends significantly on whether the beetle population is in its endemic or epidemic states. In the second part, we also include harvesting of the forest trees and analyze two different harvesting strategies: cutting all trees older than a certain age, and cutting a fixed proportion of trees older than a certain age. Numerical simulations are implemented to determine the optimal cutting age for both harvesting strategies. The numerical simulations reveal that, independent of the steady state of the beetle population (that is, no beetles, endemic or epidemic state) clear cutting all trees older than a given age provides a higher harvesting benefit. Our numerical simulations further indicate that to obtain a fixed harvesting yield, a forest under a beetle epidemic state has to be cut at a younger age than if the forest were at an endemic beetle state or a no-beetle state.

54 ENVIRONMENTAL SCIENCES↗

Branch-Based Model for the Diameters of the Pulmonary Airways: Accounting for Departures From Self-Consistency and Registration Errors

We examine a previously published branch-based approach to modeling airway diameters that is predicated on the assumption of self-consistency across all levels of the tree. We mathematically formulate this assumption, propose a method to test it and develop a more general model to be used when the assumption is violated. We discuss the effect of measurement error on the estimated models and propose methods that account for it. The methods are illustrated on data from MRI and CT images of silicone casts of two rats, two normal monkeys and one ozone-exposed monkey. Our results showed substantial departures from self-consistency in all five subjects. When departures from selfconsistency exist we do not recommend using the self-consistency model, even as an approximation, as we have shown that it may likely lead to an incorrect representation of the diameter geometry. Measurement error has an important impact on the estimated morphometry models and needs to be accounted for in the analysis.

59 BASIC BIOLOGICAL SCIENCES↗

Deterministic symbolic regression with derivative information: General methodology and application to equations of state

Symbolic regression methods simultaneously determine the model functional form and the regression parameter values by generating expression trees. Symbolic regression can capture the complexity of real–world phenomena but the use of deterministic optimization for symbolic regression has been limited due to the complexity of the search space of existing formulations. Herein we present a novel deterministic mixed–integer nonlinear programming formulation for symbolic regression that incorporates derivative constraints through auxiliary expression trees. By applying the chain rule to mathematical operations, binary expression trees are capable of representing the calculation of first and second derivatives. We apply this formulation to illustrative examples using derivative information to show increased model discrimination capability. In addition, we perform a case study of a thermodynamic equation of state to gain insight on valid functional forms with thermodynamics–based constraints on the first and second derivatives.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Getting allometry right at the Oak Ridge free‐air CO 2 enrichment experiment: Old problems and new opportunities for global change experiments

Societal Impact Statement Free‐air CO 2 enrichment (FACE) experiments provide essential data on forest responses to increasing atmospheric CO 2 for evaluations of climate change impacts on humanity. Understanding and reducing the uncertainty in the experimental results is critical to ensure scientific and public confidence in the models and policy initiatives that derive therefrom. One source of uncertainty is the estimation of tree biomass using mathematical relationships between biomass and easily obtained and non‐destructive measurements (allometry). We evaluated the robustness of the allometric relationships established at the beginning of a FACE experiment and discuss the challenges and opportunities for the new generation of FACE experiments. Summary Long‐term field experiments to elucidate forest responses to rising atmospheric CO 2 concentration require allometric equations to estimate tree biomass from non‐destructive measurements of tree size. We analyzed whether the allometric equations established at the beginning of a free‐air CO 2 enrichment (FACE) experiment in a Liquidambar styraciflua plantation were still valid at the end of the 12 year experiment. Aboveground woody biomass was initially predicted by an equation that included bole diameter, taper, and height, assuming that including taper and height as predictors would accommodate changes in tree structure that might occur over time and in response to elevated CO 2 . At the conclusion of the FACE experiment, we harvested 23 trees, measured dimensions and dry mass of boles and branches, and extracted and measured the woody root mass of 10 trees. Although 10 of the harvested trees were larger than the trees used to establish the allometric relationship, measured aboveground woody biomass was well predicted by the original allometry. The initial linear equation between bole basal area and woody root biomass underestimated final root biomass by 28%, but root biomass was just 21% of total wood mass, and errors in aboveground and belowground estimates were offsetting. The allometry established at the beginning of the experiment provided valid predictions of tree biomass throughout the experiment. New allometric approaches using terrestrial laser scanning should reduce an important source of uncertainty in decade‐long forest experiments and in assessments of centuries‐long forest biomass accretion used in evaluating carbon offsets and climate mitigation.

59 BASIC BIOLOGICAL SCIENCES↗

Quantum Markov States and Quantum Hidden Markov States

In a previous paper (Funct. Anal. Appl., 3 (2015), 205–209), we defined quantum Markov states. Here we recall this definition and present a proof of the results from that paper (which are given there without proofs). We give a definition of a quantum hidden Markov state generated by a function of a quantum Markov process and show how it is related to other definitions of such states. Our definitions work for quantum Markov fields on ℤ{sup N} and on graphs. We consider an example with the Cayley tree.

97 MATHEMATICS AND COMPUTING↗

Design of Digital Twin Sensing Strategies Via Predictive Modeling and Interpretable Machine Learning

This work develops a methodology for sensor placement and dynamic sensor scheduling decisions for digital twins. The digital twin data assimilation is posed as a classification problem, and predictive models are used to train optimal classification trees that represent the map from observed data to estimated digital twin states. In addition to providing a rapid digital twin updating capability, the resulting classification trees yield an interpretable mathematical representation that can be queried to inform sensor placement and sensor scheduling decisions. The proposed approach is demonstrated for a structural digital twin of a 12 ft wingspan unmanned aerial vehicle. Offline, training data are generated by simulating scenarios using predictive reduced-order models of the vehicle in a range of structural states. Furthermore, these training data can be further augmented using experimental or other historical data. In operation, the trained classifier is applied to observational data from the physical vehicle, enabling rapid adaptation of the digital twin in response to changes in structural health. Within this context, we study the performance of the optimal tree classifiers and demonstrate how they enable explainable structural assessments from sparse sensor measurements and also inform optimal sensor placement.

47 OTHER INSTRUMENTATION↗

A method of building of decision trees based on data from wearable device during a rehabilitation of patients with tibia fractures

Nowadays technologies which are used in traumatology are a combination of mechanical, electronic, calculating and programming tools. Relevance of development of mobile applications for an expeditious data processing which are received from medical devices (in particular, wearable devices), and formulation of management decisions increases. Using of a mathematical method of building of decision trees for an assessment of a patient’s health condition using data from a wearable device considers in this article.

97 MATHEMATICS AND COMPUTING↗

Visualizing Hierarchical Performance Profiles of Parallel Codes Using CallFlow

Calling context trees (CCTs) couple performance metrics with call paths, helping understand the execution and performance of parallel programs. To identify performance bottlenecks, programmers and performance analysts visually explore CCTs to form and validate hypotheses regarding degraded performance. However, due to the complexity of parallel programs, existing visual representations do not scale to applications running on a large number of processors. In this work, we present CallFlow, an interactive visual analysis tool that provides a high-level overview of CCTs together with semantic refinement operations to progressively explore CCTs. Using a flow-based metaphor, we visualize a CCT by treating execution time as a resource spent during the call chain, and demonstrate the effectiveness of our design with case studies on large-scale, production simulation codes.

97 MATHEMATICS AND COMPUTING↗

Learning epistatic polygenic phenotypes with Boolean interactions

Detecting epistatic drivers of human phenotypes is a considerable challenge. Traditional approaches use regression to sequentially test multiplicative interaction terms involving pairs of genetic variants. For higher-order interactions and genome-wide large-scale data, this strategy is computationally intractable. Moreover, multiplicative terms used in regression modeling may not capture the form of biological interactions. Building on the Predictability, Computability, Stability (PCS) framework, we introduce the epiTree pipeline to extract higher-order interactions from genomic data using tree-based models. The epiTree pipeline first selects a set of variants derived from tissue-specific estimates of gene expression. Next, it uses iterative random forests (iRF) to search training data for candidate Boolean interactions (pairwise and higher-order). We derive significance tests for interactions, based on a stabilized likelihood ratio test, by simulating Boolean tree-structured null (no epistasis) and alternative (epistasis) distributions on hold-out test data. Finally, our pipeline computes PCS epistasis p-values that probabilisticly quantify improvement in prediction accuracy via bootstrap sampling on the test set. We validate the epiTree pipeline in two case studies using data from the UK Biobank: predicting red hair and multiple sclerosis (MS). In the case of predicting red hair, epiTree recovers known epistatic interactions surrounding MC1R and novel interactions, representing non-linearities not captured by logistic regression models. In the case of predicting MS, a more complex phenotype than red hair, epiTree rankings prioritize novel interactions surrounding HLA-DRB1 , a variant previously associated with MS in several populations. Taken together, these results highlight the potential for epiTree rankings to help reduce the design space for follow up experiments.

59 BASIC BIOLOGICAL SCIENCES↗

From Feynman diagrams to the amplituhedron: a gentle review

In this article we review, for a mathematical audience, the computation of (tree-level) scattering amplitudes in Yang-Mills theory in detail. In particular we demonstrate explicitly how the same formulas for six-particle NMHV helicity amplitudes are obtained from summing Feynman diagrams and from computing the canonical form of the n=6, k=1, m=4 amplituhedron.

Feynman diagrams↗

RANDOM FORESTS FOR PHOTOMETRIC REDSHIFTS

The main challenge today in photometric redshift estimation is not in the accuracy but in understanding the uncertainties. We introduce an empirical method based on Random Forests to address these issues. The training algorithm builds a set of optimal decision trees on subsets of the available spectroscopic sample, which provide independent constraints on the redshift of each galaxy. The combined forest estimates have intriguing statistical properties, notable among which are Gaussian errors. We demonstrate the power of our approach on multi-color measurements of the Sloan Digital Sky Survey.

79 ASTRONOMY AND ASTROPHYSICS↗

Asynchronous broadcast for ordered delivery between compute nodes in a parallel computing system where packet header space is limited

Disclosed is a mechanism on receiving processors in a parallel computing system for providing order to data packets received from a broadcast call and to distinguish data packets received at nodes from several incoming asynchronous broadcast messages where header space is limited. In the present invention, processors at lower leafs of a tree do not need to obtain a broadcast message by directly accessing the data in a root processor's buffer. Instead, each subsequent intermediate node's rank id information is squeezed into the software header of packet headers. In turn, the entire broadcast message is not transferred from the root processor to each processor in a communicator but instead is replicated on several intermediate nodes which then replicated the message to nodes in lower leafs. Hence, the intermediate compute nodes become "virtual root compute nodes" for the purpose of replicating the broadcast message to lower levels of a tree.

97 MATHEMATICS AND COMPUTING↗

SAPHIRE 8 Volume 2 - Technical Reference

The Systems Analysis Programs for Hands-on Integrated Reliability Evaluations (SAPHIRE) refers to a set of computer programs that were developed to create and analyze probabilistic risk assessment (PRAs). Herein information is provided on the principles used in the construction and operation of Version 8.0 of the SAPHIRE system. This report summarizes the fundamental mathematical concepts of sets and logic, fault trees, and probability. This volume then describes the algorithms used to construct a fault tree and to obtain the minimal cut sets. It gives the formulas used to obtain the probability of the top event from the minimal cut sets, and the formulas for probabilities that apply for various assumptions concerning reparability and mission time. It defines the measures of basic event importance that SAPHIRE can calculate. This volume gives an overview of uncertainty analysis using simple Monte Carlo sampling or Latin Hypercube sampling, and states the algorithms used by this program to generate random basic event probabilities from various distributions. Also covered are enhance capabilities such as seismic analysis, Workspace algorithms, cut set "recovery," end state manipulation, and use of "compound events."

97 MATHEMATICS AND COMPUTING↗

Systems Analysis Programs for Hands-On Integrated Reliability Evaluations (SAPHIRE) Technical Reference

The Systems Analysis Programs for Hands-on Integrated Reliability Evaluations (SAPHIRE) is a software application developed for performing a complete probabilistic risk assessment (PRA) using a personal computer (PC) running the Microsoft Windows? operating system. Herein information is provided on the principles used in the construction and operation of Version 6.0 and 7.0 of the SAPHIRE system. This report summarizes the fundamental mathematical concepts of sets and logic, fault trees, and probability. This volume then describes the algorithms used to construct a fault tree and to obtain the minimal cut sets. It gives the formulas used to obtain the probability of the top event from the minimal cut sets, and the formulas for probabilities that apply for various assumptions concerning reparability and mission time. It defines the measures of basic event importance that SAPHIRE can calculate. This volume gives an overview of uncertainty analysis using simple Monte Carlo sampling or Latin Hypercube sampling, and states the algorithms used by this program to generate random basic event probabilities from various distributions. Also covered are enhance capabilities such as seismic analysis, cut set "recovery," end state manipulation, and use of "compound events."

99 GENERAL AND MISCELLANEOUS↗

Learning Symbolic Expressions: Mixed-Integer Formulations, Cuts, and Heuristics

Here, in this paper, we consider the problem of learning a regression function without assuming its functional form. This problem is referred to as symbolic regression. An expression tree is typically used to represent a solution function, which is determined by assigning operators and operands to the nodes. Cozad and Sahinidis propose a nonconvex mixed-integer nonlinear program (MINLP), in which binary variables are used to assign operators and nonlinear expressions are used to propagate data values through nonlinear operators, such as square, square root, and exponential. We extend this formulation by adding new cuts that improve the solution of this challenging MINLP. We also propose a heuristic that iteratively builds an expression tree by solving a restricted MINLP. We perform computational experiments and compare our approach with a mixed-integer program–based method and a neural network–based method from the literature.

97 MATHEMATICS AND COMPUTING↗

Parallel peak pruning for scalable SMP contour tree computation

As data sets grow to exascale, automated data analysis and visualisation are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. Here in this paper, we report the first shared SMP algorithm for fully parallel contour tree computation, withfor-mal guarantees of O(lgnlgt) parallel steps and O(n lgn) work, and implementations with up to 10x parallel speed up in OpenMP and up to 50x speed up in NVIDIA Thrust.

97 MATHEMATICS AND COMPUTING↗

Multiscale Modeling of Hematologic Disorders

Parasitic infectious diseases and other hereditary hematologic disorders are often associated with major changes in the shape and viscoelastic properties of red blood cells (RBCs). Such changes can disrupt blood flow and even brain perfusion, as in the case of cerebral malaria. Modeling of these hematologic disorders requires a seamless multiscale approach, where blood cells and blood flow in the entire arterial tree are represented accurately using physiologically consistent parameters. In this chapter, we present a computational methodology based on dissipative particle dynamics (DPD) which models RBCs as well as whole blood in health and disease. DPD is a Lagrangian method that can be derived from systematic coarse-graining of molecular dynamics but can scale efficiently up to small arteries and can also be used to model RBCs down to spectrin level. To this end, we present two complementary mathematical models for RBCs and describe a systematic procedure on extracting the relevant input parameters from optical tweezers and microfluidic experiments for single RBCs. We then use these validated RBC models to predict the behavior of whole healthy blood and compare with experimental results. The same procedure is applied to modeling malaria, and results for infected single RBCs and whole blood are presented.

60 APPLIED LIFE SCIENCES↗