Search NASA⌕ Search

SEARCH · Search NASA

Results for “Constructive 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 163 records · Page 9

Spatio-Temporal Modeling of Field Surveyed Backsheet Degradation

Assessing photovoltaic module backsheet durability is critical to increasing module lifetime. Lab based accelerating testing has recently failed to predict large scale failures of widely adopted polymeric materials. Field surveyed data is critical to assess the performance of component lifetime. Using a documented field survey protocol, 13 field surveys where conducted. Each measurement is encoded with it's spatial location in respect to the other modules. By combining field survey data on degradation predictors with real time satellite weather data, data-driven predictive models of backsheet degradation were trained. LOESS models were constructed to investigate the spatial dependence of measurements. It was found that micro-climatic effects like tree-lines, ground surface changes, and elevation changes effected the magnitude and variance of the measurements. A GAM model was created to predict the value of degradation based on measured predictors. The model includes variables on the climate of the system and the location of each measurement in the PV mounting structure. The model performed well with an adj.R 2 of 0.95 for yellowness index prediction. The model was cross-validated using k-folds.

backsheet↗

PySIDT: Subgraph Isomorphic Decision Trees for Molecular Property Prediction

Accurate molecular property prediction is important across all fields of chemistry. Deep neural networks (DNNs) have become increasingly popular due to their ability to train automatically, avoiding the incredibly tedious process of constructing and extending traditional property estimation schemes. However, DNNs require large amounts of training data, are challenging to interpret, require large amounts of memory to load even during inference, and have severe difficulties incorporating qualitative chemical knowledge, which are often desired for molecular property prediction tasks. Here, in this study, we present PySIDT (https://github.com/zadorlab/PySIDT), a software for training and running inference on Subgraph Isomorphic Decision Trees (SIDTs). SIDTs are graph-based decision trees made of nodes associated with molecular substructures. Inference is done by descending target molecular structures down the decision tree to nodes with matching subgraph isomorphic substructures and making predictions based on the final (most specific) nodes matched. SIDTs scale down well to dataset sizes much smaller than is feasible for DNNs. As trees of molecular substructures, SIDTs are inherently readable and easy to visualize, making them easy to analyze. They are also straightforward to extend and retrain, facilitate uncertainty estimation, and enable easy integration of expert knowledge. We demonstrate the SIDT approach discussing its application to a diverse range of molecular prediction tasks: rate coefficient estimation, diffusion coefficient estimation, thermochemistry estimation, transition state bond stretch prediction, p K a prediction, stability of molecular structures, stability of surface structures, and prediction of surface lateral interaction energetics. Additionally, we demonstrate the power of the SIDT algorithms in two direct learning curve vanilla comparisons with the popular DNN-based software Chemprop and the popular gradient boosted trees-based software XGBoost on enthalpy of formation and rate coefficient prediction tasks. In particular, in the enthalpy of formation case, vanilla PySIDT is able to outperform vanilla Chemprop and XGBoost across the full range of training/validation set sizes out to 11,560 data points.

Johnson, Matthew Sean [Sandia National Laboratorie↗

One-loop matrix elements of effective superstring interactions: α' -expanding loop integrands

In the low-energy effective action of string theories, non-abelian gauge interactions and supergravity are augmented by infinite towers of higher-mass-dimension operators. We propose a new method to construct one-loop matrix elements with insertions of operators D 2k F n and D 2k R n in the tree-level effective action of type-I and type-II superstrings. Inspired by ambitwistor string theories, our method is based on forward limits of moduli-space integrals using string tree-level amplitudes with two extra points, expanded in powers of the inverse string tension α'. Similar to one-loop ambitwistor computations, intermediate steps feature non-standard linearized Feynman propagators which eventually recombine to conventional quadratic propagators. With linearized propagators the loop integrand of the matrix elements obey one-loop versions of the monodromy and KLT relations. We express a variety of four- and five-point examples in terms of quadratic propagators and formulate a criterion on the underlying genus-one correlation functions that should make this recombination possible at all orders in α'. The ultraviolet divergences of the one-loop matrix elements are crosschecked against the non-separating degeneration of genus-one integrals in string amplitudes. Conversely, our results can be used as a constructive method to determine degenerations of elliptic multiple zeta values and modular graph forms at arbitrary weight.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scattering amplitudes and N -body post-Minkowskian Hamiltonians in general relativity and beyond

We present a general framework for calculating post-Minskowskian, classical, conservative Hamiltonians for N non-spinning bodies in general relativity from relativistic scattering amplitudes. Novel features for N > 2 are described including the subtraction of tree-like iteration contributions and the calculation of non-trivial many-body Fourier transform integrals needed to construct position space potentials. A new approach to calculating these integrals as an expansion in the hierarchical limit is described based on the method of regions. As an explicit example, we present the O(G 2 ) 3-body momentum space potential in general relativity as well as for charged bodies in Einstein-Maxwell. The result is shown to be in perfect agreement with previous post-Newtonian calculations in general relativity up to O(G 2 v 4 ). Furthermore, in appropriate limits the result is shown to agree perfectly with relativistic probe scattering in multi-center extremal black hole backgrounds and with the scattering of slowly-moving extremal black holes in the moduli space approximation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Learning non-Higgsable gauge groups in 4D F-theory

We apply machine learning techniques to solve a specific classification problem in 4D F-theory. For a divisor D on a given complex threefold base, we want to read out the non-Higgsable gauge group on it using local geometric information near D. The input features are the triple intersection numbers among divisors near D and the output label is the non-Higgsable gauge group. We use decision tree to solve this problem and achieved 85%-98% out-of-sample accuracies for different classes of divisors, where the data sets are generated from toric threefold bases without (4,6) curves. We have explicitly generated a large number of analytic rules directly from the decision tree and proved a small number of them. As a crosscheck, we applied these decision trees on bases with (4,6) curves as well and achieved high accuracies. Additionally, we have trained a decision tree to distinguish toric (4,6) curves as well. Finally, we present an application of these analytic rules to construct local base configurations with interesting gauge groups such as SU(3).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantifying Firebrand Production and Transport Using the Acoustic Analysis of In-Fire Cameras

Firebrand travel and ignition of spot fires is a major concern in the Wildland-Urban Interface and in wildfire operations overall. Firebrands allow for the efficient breaching across fuel-free barriers such as roads, rivers and constructed fuel breaks. Existing observation-based knowledge on medium-distance firebrand travel is often based on single tree experiments that do not replicate the intensity and convective updraft of a continuous crown fire. Recent advances in acoustic analysis, specifically pattern detection, has enabled the quantification of the rate at which firebrands are observed in the audio recordings of in-fire cameras housed within fire-proof steel boxes that have been deployed on experimental fires. The audio pattern being detected is the sound created by a flying firebrand hitting the steel box of the camera. This technique allows for the number of firebrands per second to be quantified and can be related to the fire's location at that same time interval (using a detailed rate of spread reconstruction) in order to determine the firebrand travel distance. A proof of concept is given for an experimental crown fire that shows the viability of this technique. When related to the fire's location, key areas of medium-distance spotting are observed that correspond to regions of peak fire intensity. Trends on the number of firebrands landing per square metre as the fire approaches are readily quantified using low-cost instrumentation.

58 GEOSCIENCES↗

Resolution of the 1D regularized Burgers equation using a spatial wavelet approximation

The Burgers equation with a small viscosity term, initial and periodic boundary conditions is resolved using a spatial approximation constructed from an orthonormal basis of wavelets. The algorithm is directly derived from the notions of multiresolution analysis and tree algorithms. Before the numerical algorithm is described these notions are first recalled. The method uses extensively the localization properties of the wavelets in the physical and Fourier spaces. Moreover, the authors take advantage of the fact that the involved linear operators have constant coefficients. Finally, the algorithm can be considered as a time marching version of the tree algorithm. The most important point is that an adaptive version of the algorithm exists: it allows one to reduce in a significant way the number of degrees of freedom required for a good computation of the solution. Numerical results and description of the different elements of the algorithm are provided in combination with different mathematical comments on the method and some comparison with more classical numerical algorithms.

Liandrat, J.↗

Modeling of interactions between biosphere and atmosphere on the global scale

Simulations of weather and climate with general circulation models show that the circulation and rainfall are sensitive to the transfers of radiation, sensible heat, water vapor, and momentum across the atmosphere land surface interface. Because, in nature, these transfers depend in large measure on the morphological and physiological characteristics of the surface vegetation, an interactive biosphere is needed for GCM's. The simple model of the biosphere (SiB) that the authors have constructed is based on the recognized difference between ground cover vegetation (grasses and other herbaceous plants) and canopy vegetation (trees and shrubs), where the latter act like elevated blocks of porous material which efficiently extract momentum from the air that flows through them; by a large number of multiple reflections enhance the absorption of the incident solar radiation; when the canopy is wet, act like well ventilated psychrometers which extract sensible heat from the air and produce a negative Bowen ratio; and, in all of these ways, behave differently from ground cover vegetation. The complete set of governing equations of SiB, whereby the various allowable combinations of trees, ground covers, and bare ground, in interaction with the atmosphere, determine all of the vegetation dependent transfers at the land surface, have been presented and described.

Baer, Ferdinand↗

Bounding the Resource Availability of Partially Ordered Events with Constant Resource Impact

We compare existing techniques to bound the resource availability of partially ordered events. We first show that, contrary to intuition, two existing techniques, one due to Laborie and one due to Muscettola, are not strictly comparable in terms of the size of the search trees generated under chronological search with a fixed heuristic. We describe a generalization of these techniques called the Flow Balance Constraint to tightly bound the amount of available resource for a set of partially ordered events with piecewise constant resource impact We prove that the new technique generates smaller proof trees under chronological search with a fixed heuristic, at little increase in computational expense. We then show how to construct tighter resource bounds but at increased computational cost.

Frank, Jeremy↗

Double-copy towards supergravity inflation with α-attractor models

A bstract Key to the simplicity of supergravity α -attractor models of inflation are Volkov-Akulov fermions, often in the form of nilpotent superfields. Here we explore the possibility of using the double-copy to construct theories of Dirac-Born-Infeld-Volkov-Akulov (DBIVA) coupled to supergravity. A color-dual bootstrap admits scattering amplitudes involving pions and vectors through five-point tree-level order by order in mass-dimension, but requires the introduction of a Tr( F 3 ) operator. Gauge theories with this operator were recently found to require a tower of higher-derivative operators to be compatible with the duality between color and kinematics. Adjoint-type double-copy construction at its most conservative seems to require the UV completion of DBIVA + pure Poincaré supergravity scattering amplitudes to a family of theories involving DBIVA-like particles coupled to Weyl-Einstein supergravity. We also point out an alternative solution to color-dual gauged pions that allows adjoint double-copy without a tower of higher derivative corrections but at the cost of exchange symmetry between scalars.

Physics↗

Extracting Einstein from the loop-level double-copy

The naive double-copy of (multi) loop amplitudes involving massive matter coupled to gauge theories will generically produce amplitudes in a gravitational theory that contains additional contributions from propagating antisymmetric tensor and dilaton states even at tree-level. We present a graph-based approach that combines the method of maximal cuts with double-copy construction to offer a systematic framework to isolate the pure Einstein-Hilbert gravitational contributions through loop level. Indeed this allows for a bootstrap of pure-gravitational results from the double-copy of massive scalar-QCD. We apply this to construct the novel result of the D-dimensional one-loop five-point QFT integrand relevant in the classical limit to generating observables associated with the radiative effects of massive black-hole scattering via pure Einstein-Hilbert gravity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An Estimate of the Impact of Reionization on Supermassive Black Hole Growth

Abstract The supermassive black holes (SMBHs) that power active galactic nuclei found at z ≥ 6 were formed during the Epoch of Reionization. Because reionization is an inhomogeneous process, the physical properties of SMBH host-galaxy environments will vary spatially during reionization. We construct a semi-analytic model to estimate the impact of reionization on SMBH growth. Using a series of merger trees, reionization models, and black hole (BH) growth models, we find that early reionization can reduce a SMBH’s mass by up to [50, 70, 90]% within dark matter halos of mass [10 12 , 10 11 , 10 10 ] M ⊙ by z = 6. Our findings also suggest that the redshift range in which BH growth is impacted by reionization strongly depends on whether the Eddington accretion rate can be exceeded. If so, we find that BH masses are significantly suppressed principally during the early phases of reionization ( z ≳ 10), while they are more readily suppressed across the full redshift range if super-Eddington growth is not allowed. We find that the global average impact of reionization may be to reduce the masses of BHs residing in ≲10 11 M ⊙ halos by a factor of ≳2. The census of SMBHs being uncovered by the JWST may offer a means to test the basic prediction that more massive BHs reside in cosmological volumes that are reionized at later times.

79 ASTRONOMY AND ASTROPHYSICS↗

Performance and policy dimensions in internet routing

The Internet Routing Project, referred to in this report as the 'Highball Project', has been investigating architectures suitable for networks spanning large geographic areas and capable of very high data rates. The Highball network architecture is based on a high speed crossbar switch and an adaptive, distributed, TDMA scheduling algorithm. The scheduling algorithm controls the instantaneous configuration and swell time of the switch, one of which is attached to each node. In order to send a single burst or a multi-burst packet, a reservation request is sent to all nodes. The scheduling algorithm then configures the switches immediately prior to the arrival of each burst, so it can be relayed immediately without requiring local storage. Reservations and housekeeping information are sent using a special broadcast-spanning-tree schedule. Progress to date in the Highball Project includes the design and testing of a suite of scheduling algorithms, construction of software reservation/scheduling simulators, and construction of a strawman hardware and software implementation. A prototype switch controller and timestamp generator have been completed and are in test. Detailed documentation on the algorithms, protocols and experiments conducted are given in various reports and papers published. Abstracts of this literature are included in the bibliography at the end of this report, which serves as an extended executive summary.

Mills, David L.↗

Standardized phylogenetic and molecular evolutionary analysis applied to species across the microbial tree of life

There is growing interest in reconstructing phylogenies from the copious amounts of genome sequencing projects that target related viral, bacterial or eukaryotic organisms. To facilitate the construction of standardized and robust phylogenies for disparate types of projects, we have developed a complete bioinformatic workflow, with a web-based component to perform phylogenetic and molecular evolutionary (PhaME) analysis from sequencing reads, draft assemblies or completed genomes of closely related organisms. Furthermore, the ability to incorporate raw data, including some metagenomic samples containing a target organism (e.g. from clinical samples with suspected infectious agents), shows promise for the rapid phylogenetic characterization of organisms within complex samples without the need for prior assembly.

59 BASIC BIOLOGICAL SCIENCES↗

Cooperative answers in database systems

A major concern of researchers who seek to improve human-computer communication involves how to move beyond literal interpretations of queries to a level of responsiveness that takes the user's misconceptions, expectations, desires, and interests into consideration. At Maryland, we are investigating how to better meet a user's needs within the framework of the cooperative answering system of Gal and Minker. We have been exploring how to use semantic information about the database to formulate coherent and informative answers. The work has two main thrusts: (1) the construction of a logic formula which embodies the content of a cooperative answer; and (2) the presentation of the logic formula to the user in a natural language form. The information that is available in a deductive database system for building cooperative answers includes integrity constraints, user constraints, the search tree for answers to the query, and false presuppositions that are present in the query. The basic cooperative answering theory of Gal and Minker forms the foundation of a cooperative answering system that integrates the new construction and presentation methods. This paper provides an overview of the cooperative answering strategies used in the CARMIN cooperative answering system, an ongoing research effort at Maryland. Section 2 gives some useful background definitions. Section 3 describes techniques for collecting cooperative logical formulae. Section 4 discusses which natural language generation techniques are useful for presenting the logic formula in natural language text. Section 5 presents a diagram of the system.

Gaasterland, Terry↗

Inductive Learning Approaches for Improving Pilot Awareness of Aircraft Faults

Neural network flight controllers are able to accommodate a variety of aircraft control surface faults without detectable degradation of aircraft handling qualities. Under some faults, however, the effective flight envelope is reduced; this can lead to unexpected behavior if a pilot performs an action that exceeds the remaining control authority of the damaged aircraft. The goal of our work is to increase the pilot s situational awareness by informing him of the type of damage and resulting reduction in flight envelope. Our methodology integrates two inductive learning systems with novel visualization techniques. One learning system, the Inductive Monitoring System (IMS), learns to detect when a simulation includes faulty controls, while two others, Inductive Classification System (INCLASS) and multiple binary decision tree system (utilizing C4.5), determine the type of fault. In off-line training using only non-failure data, IMS constructs a characterization of nominal flight control performance based on control signals issued by the neural net flight controller. This characterization can be used to determine the degree of control augmentation required in the pitch, roll, and yaw command channels to counteract control surface failures. This derived information is typically sufficient to distinguish between the various control surface failures and is used to train both INCLASS and C4.5. Using data from failed control surface flight simulations, INCLASS and C4.5 independently discover and amplify features in IMS results that can be used to differentiate each distinct control surface failure situation. In real-time flight simulations, distinguishing features learned during training are used to classify control surface failures. Knowledge about the type of failure can be used by an additional automated system to alter its approach for planning tactical and strategic maneuvers. The knowledge can also be used directly to increase the pilot s situational awareness and inform manual maneuver decisions. Our multi-modal display of this information provides speech output to issue control surface failure warnings to a lesser-used communication channel and provides graphical displays with pilot-selectable !eve!s of details to issues additional information about the failure. We also describe a potential presentation for flight envelope reduction that can be viewed separately or integrated with an existing attitude indicator instrument. Preliminary results suggest that the inductive approach is capable of detecting that a control surface has failed and determining the type of fault. Furthermore, preliminary evaluations suggest that the interface discloses a concise summary of this information to the pilot.

Spikovska, Lilly↗

Automated Generation of Fault Management Artifacts from a Simple System Model

Our understanding of off-nominal behavior - failure modes and fault propagation - in complex systems is often based purely on engineering intuition; specific cases are assessed in an ad hoc fashion as a (fallible) fault management engineer sees fit. This work is an attempt to provide a more rigorous approach to this understanding and assessment by automating the creation of a fault management artifact, the Failure Modes and Effects Analysis (FMEA) through querying a representation of the system in a SysML model. This work builds off the previous development of an off-nominal behavior model for the upcoming Soil Moisture Active-Passive (SMAP) mission at the Jet Propulsion Laboratory. We further developed the previous system model to more fully incorporate the ideas of State Analysis, and it was restructured in an organizational hierarchy that models the system as layers of control systems while also incorporating the concept of "design authority". We present software that was developed to traverse the elements and relationships in this model to automatically construct an FMEA spreadsheet. We further discuss extending this model to automatically generate other typical fault management artifacts, such as Fault Trees, to efficiently portray system behavior, and depend less on the intuition of fault management engineers to ensure complete examination of off-nominal behavior.

Spinup and Orient↗

Transformational derivation of programs using the Focus system

A program derivation support system called Focus is being constructed. It will formally derive programs using the paradigm of program transformation. The following issues are discussed: (1) the integration of validation and program derivation activities in the Focus system; (2) its tree-based user interface; (3) the control of search spaces in program derivation; and (4) the structure and organization of program derivation records. The inference procedures of the system are based on the integration of functional and logic programming principles. This brings about a synthesis of paradigms that were heretofore considered far apart, such as logical and executable specifications and constructive and transformational approaches to program derivation. A great emphasis has been placed, in the design of Focus, on achieving small search spaces during program derivation. The program manipulation operations such as expansion, simplification and rewriting were designed with this objective. The role of operations that are expensive in search spaces, such as folding, has been reduced. Program derivations are documented in Focus in a way that the high level descriptions of derivations are expressed only using program level information. All the meta-level information, together with dependencies between derivations of program components, is automatically recorded by the system at a lower level of description for its own use in replay.

Reddy, Uday S.↗