Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 235 records · Page 13

Isovector charges of the nucleon from 2+1-flavor QCD with clover fermions

Here, we present high-statistics estimates of the isovector charges of the nucleon from four 2 + 1-flavor ensembles generated using Wilson-clover fermions with stout smearing and tree-level tadpole improved Symanzik gauge action at lattice spacings 𝑎 ≈ 0.127 and 0.09 fm and with 𝑀 𝜋 ≈ 280 and 170 MeV. The truncated solver method with bias correction and the coherent source sequential propagator construction are used to cost-effectively achieve 𝑂⁡(1⁢0 5 ) measurements on each ensemble. Using these data, the analysis of two-point correlation functions is extended to include four states in the fits, and of three-point functions to three states. Control over excited-state contamination in the calculation of the nucleon mass, the mass gaps between excited states, and in the matrix elements is demonstrated by the consistency of estimates using this multistate analysis of the spectral decomposition of the correlation functions and from simulations of the three-point functions at multiple values of the source-sink separation. The results for all three charges, 𝑔 𝐴 , 𝑔 𝑆 , and 𝑔 𝑇 , are in good agreement with calculations done using the clover-on-HISQ lattice formulation with similar values of the lattice parameters.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Discovery of genes that positively affect biomass and stress associated traits in poplar

Woody biomass serves as a renewable resource for various industries, including pulp and paper production, construction, biofuels, and electricity generation. However, the molecular mechanisms behind biomass traits are poorly understood, which significantly curtails the speed and efficiency of their improvement. We used activation tagging to discover genes that can positively affect tree biomass-associated traits. We generated and screened under greenhouse conditions a population of 2,700 independent activation tagging lines. A total of 761 lines, which had significantly and positively affected at least one biomass-associated trait, were discovered. The tag was positioned in the genome for forty lines which were affected in multiple traits and activation of proximal genes validated for a subset. For two lines we fully recapitulated the phenotype of the original lines through overexpression. Moreover, the overexpression led to more pronounced and additional improvements, not observed in the original lines. Importantly, the overexpression of a Fasciclin-like gene (PtaFLA10) and a Patatin-like gene (PtaPAT) was found to substantially improve biomass, with a 40% increase in dry-stem weight, and enhance drought tolerance, respectively. Additionally, PtaPAT overexpression increased cellulose content, which is crucial for biofuel production. Our work shows that the activation tagging approach applied even on a non-genome saturation scale in a poplar tree can be successfully used for the discovery of genes positively modify biomass productivity. Such dominant forward genetics approaches can aid in biotechnological manipulation of woody biomass traits and help unravel the functions and mechanisms of individual genes, gene families, and regulatory modules.

Plant Sciences↗

Barberton greenstone belt volcanism: Succession, style and petrogenesis

The Barberton Mountain Land is an early Archean greenstone belt along the eastern margin of the Kaapvaal Craton of southern Africa. Detailed mapping in the southern portion of the belt leads to the conclusion that a substantial thickness is due to original deposition of volcanics and sediments. In the area mapped, a minimum thickness of 12km of predominantly mafic and ultramafic volcanics comprise the Komati, Hooggenoeg, and Kromberg Formations of the Onverwacht Group, and at least one km of predominantly pyroclastic and epiclastic sediments derived from dacitic volcanics comprise the Fig Tree Group. The Barberton greenstone belt formed primarily by ultramafic to mafic volcanism on a shallow marine platform which underwent little or no concurrent extension. Vents for this igneous activity were probably of the non-constructional fissure type. Dacitic volcanism occurred throughout the sequence in minor amounts. Large, constructional vent complexes were formed, and explosive eruptions widely dispersed pyroclastic debris. Only in the final stages of evolution of the belt did significant thrust-faulting occur, generally after, though perhaps overlapping with, the final stage of dacitic igneous activity. A discussion follows.

Byerly, G. R.↗

Decision Space Modeling: Trade Space Ontology

As the National Aeronautics and Space Administration (NASA) works to develop a crewed Moon to Mars Architecture, it is dealing with a large decision space consisting of the overlay of human exploration architectures for both the Moon and for Mars. Efforts are underway to enable reasoning, analysis, and deliberation on this decision space. A critical first step is to develop a model of the decision space, which will then allow for various methods and techniques to be applied in support of the larger architecture decision-making process. The Trade Space Ontology consists of a set of terminologies and relations (an ontology) and a MagicDraw resource that enables documentation of decisions and alternatives. It also provides a means by which decisions and alternatives can be traced to other Systems Engineering artifacts. For documenting alternatives, the Trade Space Ontology adapts the Morphological Matrix methodology to The Systems Modeling Language (SysML) through a profile; custom diagrams are also implemented to simplify the profile's use. With the profile and custom diagrams, system architects can specify options for architecture attributes, as well as compatibility between them, in a compact visual format. While the approach shares similarities to a trade tree, the emphasis at this stage is less on enumerating specific combinations of options and instead on specifying the options and their compatibility. Enumeration of alternatives is performed by an external analysis that operates on an output file from a model constructed using the Trade Space Ontology. For decisions, the Trade Space Ontology provides a way to model generic precedence relationships as well as documenting inputs and outputs. These may include what alternatives, criteria, and rationale are understood to be relevant for each decision. Importantly, the decision-making side of the Trade Space Ontology is defined at a more general level, such that it can be adapted to the specific terms in use by projects and programs at NASA. However, this adaptability also means that less capability is provided ``out-of-the-box'' from installation. Currently the resource includes plugin functionality to enumerate paths through generic precedence relationships between decisions and to export these paths to a spreadsheet. Custom dependency stereotypes are included in the profile to indicate the cross-cutting relationships between the trade space and the architecture decisions, providing a means to map which parts of the trade space enumerate alternatives for a decision, and to identify how the output of a decision may modify the trade space through pruning or down-selection. While the motivating use case for this resource is in human exploration architectures, the broad applicability of the Morphological Matrix methodology indicates that the Trade Space Ontology should also be useful for other activities and tasks at the agency.

Trade Tree↗

Gibbs Measures Over Locally Tree-Like Graphs and Percolative Entropy Over Infinite Regular Trees

Consider a statistical physical model on the d-regular infinite tree T{sub d} described by a set of interactions Φ. Let {G_n} be a sequence of finite graphs with vertex sets V{sub n} that locally converge to T{sub d}. From Φ one can construct a sequence of corresponding models on the graphs G{sub n}. Let {μ_n} be the resulting Gibbs measures. Here we assume that {μ_n} converges to some limiting Gibbs measure μ on T{sub d} in the local weak{sup ∗} sense, and study the consequences of this convergence for the specific entropies |V{sub n}|{sup −1}H(μ{sub n}). We show that the limit supremum of |V{sub n}|{sup −1}H(μ{sub n}) is bounded above by the percolative entropyH{sub perc}(μ), a function of μ itself, and that |V{sub n}|{sup −1}H(μ{sub n}) actually converges to H{sub perc}(μ) in case Φ exhibits strong spatial mixing on T{sub d}. When it is known to exist, the limit of |V{sub n}|{sup −1}H(μ{sub n}) is most commonly shown to be given by the Bethe ansatz. Percolative entropy gives a different formula, and we do not know how to connect it to the Bethe ansatz directly. We discuss a few examples of well-known models for which the latter result holds in the high temperature regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparative Analysis of Machine Learning Models for Day-Ahead Photovoltaic Power Production Forecasting

A main challenge for integrating the intermittent photovoltaic (PV) power generation remains the accuracy of day-ahead forecasts and the establishment of robust performing methods. The purpose of this work is to address these technological challenges by evaluating the day-ahead PV production forecasting performance of different machine learning models under different supervised learning regimes and minimal input features. Specifically, the day-ahead forecasting capability of Bayesian neural network (BNN), support vector regression (SVR), and regression tree (RT) models was investigated by employing the same dataset for training and performance verification, thus enabling a valid comparison. The training regime analysis demonstrated that the performance of the investigated models was strongly dependent on the timeframe of the train set, training data sequence, and application of irradiance condition filters. Furthermore, accurate results were obtained utilizing only the measured power output and other calculated parameters for training. Consequently, useful information is provided for establishing a robust day-ahead forecasting methodology that utilizes calculated input parameters and an optimal supervised learning approach. Finally, the obtained results demonstrated that the optimally constructed BNN outperformed all other machine learning models achieving forecasting accuracies lower than 5%.

14 SOLAR ENERGY↗

Reconsidering Tree Fruit as Candidate Crops Through the Use of Rapid Cycle Crop Breeding Technologies

Tree fruit, although desirable from a crew nutrition and menu diversity perspective, have long been dismissed as candidate crops based on their long juvenile phase, large architecture, low short-term harvest index, and dormancy requirements. Recent developments in Rapid Cycle Crop Breeding (RCCB) have overcome these historical limitations, opening the door to a new era in candidate crop research. Researchers at the United States Department of Agriculture (USDA) have developed FT-construct (Flowering Locus T) dwarf plum lines that have a very short juvenile phase, vine-like architecture, and no obligate dormancy period. In a collaborative research effort, NASA and the USDA are evaluating the performance of these FT-lines under controlled environment conditions relevant to spaceflight.

PtFT1↗

Machine Learning Guided Synthesis of Flash Graphene

Advances in nanoscience have enabled the synthesis of nanomaterials, such as graphene, from low-value or waste materials through flash Joule heating. Though this capability is promising, the complex and entangled variables that govern nanocrystal formation in the Joule heating process remain poorly understood. In this work, machine learning (ML) models are constructed to explore the factors that drive the transformation of amorphous carbon into graphene nanocrystals during flash Joule heating. An XGBoost regression model of crystallinity achieves an r 2 score of 0.8051 ± 0.054. Feature importance assays and decision trees extracted from these models reveal key considerations in the selection of starting materials and the role of stochastic current fluctuations in flash Joule heating synthesis. Furthermore, partial dependence analyses demonstrate the importance of charge and current density as predictors of crystallinity, implying a progression from reaction-limited to diffusion-limited kinetics as flash Joule heating parameters change. Finally, a practical application of the ML models is shown by using Bayesian meta-learning algorithms to automatically improve bulk crystallinity over many Joule heating reactions. Furthermore, these results illustrate the power of ML as a tool to analyze complex nanomanufacturing processes and enable the synthesis of 2D crystals with desirable properties by flash Joule heating.

01 COAL, LIGNITE, AND PEAT↗

Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the N = 6 solution

We compute the set of all extreme rays of the 6-party subadditivity cone that are compatible with strong subadditivity. In total, we identify 208 new (genuine 6-party) orbits, 52 of which violate at least one known holographic entropy inequality. For the remaining 156 orbits, which do not violate any such inequalities, we construct holographic graph models for 150 of them. For the final 6 orbits, it remains an open question whether they are holographic. Consistent with the strong form of the conjecture in [1], 148 of these graph models are trees. However, 2 of the graphs contain a “bulk cycle”, leaving open the question of whether equivalent models with tree topology exist, or if these extreme rays are counterexamples to the conjecture. The paper includes a detailed description of the algorithm used for the computation, which is presented in a general framework and can be applied to any situation involving a polyhedral cone defined by a set of linear inequalities and a partial order among them to find extreme rays corresponding to down-sets in this poset.

AdS-CFT correspondence↗

Sparse Hardware Embedding of Spiking Neuron Systems for Community Detection

We study the applicability of spiking neural networks and neuromorphic hardware for solving general optimization problems without the use of adaptive training or learning algorithms. We leverage the dynamics of Hopfield networks and spin-glass systems to construct a fully connected spiking neural system to generate synchronous spike responses indicative of the underlying community structure in an undirected, unweighted graph. Mapping this fully connected system to current generation neuromorphic hardware is done by embedding sparse tree graphs to generate only the leading-order spiking dynamics. Here, we demonstrate that for a chosen set of benchmark graphs, the spike responses generated on a current generation neuromorphic processor can improve the stability of graph partitions and non-overlapping communities can be identified even with the loss of higher-order spiking behavior if the graphs are sufficiently dense. For sparse graphs, the loss of higher-order spiking behavior improves the stability of certain graph partitions but does not retrieve the known community memberships.

97 MATHEMATICS AND COMPUTING↗

Towards an improved understanding of the influence of subpixel vegetation structure on pixel-level spectra: a simulation approach

The planned NASA Hyperspectral Infrared Imager (HyspIRI) mission, equipped with an imaging spectrometer that has the capability of monitoring ecosystems globally, will provide an unprecedented opportunity to address scientific challenges related to ecosystem function and change. However, uncertainty remains around the impact of subpixel vegetation structure, in combination with the point spread function, on pixel-level imaging spectroscopy data. We estimated structural parameters, e.g., leaf area index (LAI), canopy cover, and tree location, from HyspIRI spectral data, with the goal of assessing how subpixel variation in these parameters impact pixel-level imaging spectroscopy data. The fine-scale variability of real vegetation structure makes this a challenging endeavor. Therefore, we utilized a simulation-based approach to counter the time-consuming and often destructive sampling needs of vegetation structural analysis and to simultaneously generate synthetic HyspIRI data pre-launch. Three virtual scenes were constructed, corresponding to the actual vegetation structure in the National Ecological Observatory Network’s (NEON) Pacific Southwest Domain (Fresno, CA). These included an oak savanna, a dense coniferous forest, and a conifer-manzanita-mixed forest. Simulated spectroscopy data for these scenes were then generated using the Digital Imaging and Remote Sensing Image Generation (DIRSIG) model. Simulations first were used to verify the physical model, virtual scene geometrical information, and simulation parameters. This was followed by simulations of HyspIRI data, where within-pixel structural variability was introduced, e.g., by iteratively changing per-pixel canopy cover and tree placement, tree clustering, leaf area index (LAI), etc., between simulation runs for the virtual scenes. Finally, narrow-band vegetation indices (VIs) were extracted from the data in an attempt to describe the variability of the subpixel structural parameters; this was done in order to assess VI robustness to changes in structural “levels”, as well as placement of trees/canopies within the instrument’s instantaneous field-of-view (IFOV). Our ultimate goal is not only to better understand how such subpixel variability influence imaging spectroscopy outputs, but also to better estimate vegetation structural parameters using spectra. We constructed regression models for LAI (R2 = 0.92) and canopy cover (R2 = 0.97) with narrow-band VIs via this simulation approach. Our models ultimately are intended to improve the HyspIRI mission’s ability to monitor global vegetation structure.

Van Aardt, Jan↗

The Stellar decomposition: A compact representation for simplicial complexes and beyond

Here, we introduce the Stellar decomposition, a model for efficient topological data structures over a broad range of simplicial and cell complexes. A Stellar decomposition of a complex is a collection of regions indexing the complex’s vertices and cells such that each region has sufficient information to locally reconstruct the star of its vertices, i.e., the cells incident in the region’s vertices. Stellar decompositions are general in that they can compactly represent and efficiently traverse arbitrary complexes with a manifold or non-manifold domain. They are scalable to complexes in high dimension and of large size, and they enable users to easily construct tailored application-dependent data structures using a fraction of the memory required by a corresponding global topological data structure on the complex. As a concrete realization of this model for spatially embedded complexes, we introduce the Stellar tree, which combines a nested spatial tree with a simple tuning parameter to control the number of vertices in a region. Stellar trees exploit the complex’s spatial locality by reordering vertex and cell indices according to the spatial decomposition and by compressing sequential ranges of indices. Stellar trees are competitive with state-of-the-art topological data structures for manifold simplicial complexes and offer significant improvements for cell complexes and non-manifold simplicial complexes. We conclude with a high-level description of several mesh processing and analysis applications that utilize Stellar trees to process large datasets.

97 MATHEMATICS AND COMPUTING↗

Inferring Viral Transmission Time from Phylogenies for Known Transmission Pairs

When the time of an HIV transmission event is unknown, methods to identify it from virus genetic data can reveal the circumstances that enable transmission. We developed a single-parameter Markov model to infer transmission time from an HIV phylogeny constructed of multiple virus sequences from people in a transmission pair. Our method finds the statistical support for transmission occurring in different possible time slices. We compared our time-slice model results to previously described methods: a tree-based logical transmission interval, a simple parsimony-like rules-based method, and a more complex coalescent model. Across simulations with multiple transmitted lineages, different transmission times relative to the source’s infection, and different sampling times relative to transmission, we found that overall our time-slice model provided accurate and narrower estimates of the time of transmission. We also identified situations when transmission time or direction was difficult to estimate by any method, particularly when transmission occurred long after the source was infected and when sampling occurred long after transmission. Applying our model to real HIV transmission pairs showed some agreement with facts known from the case investigations. We also found, however, that uncertainty on the inferred transmission time was driven more by uncertainty from time calibration of the phylogeny than from the model inference itself. Encouragingly, comparable performance of the Markov time-slice model and the coalescent model—which make use of different information within a tree—suggests that a new method remains to be described that will make full use of the topology and node times for improved transmission time inference.

59 BASIC BIOLOGICAL SCIENCES↗

Dynamic, risk informed decision support systems and methods

The present disclosure is directed to a decision support system or tool based on a Bayesian Network (BN) framework. The diagnostic support tool is created by using advanced Probabilistic Risk Assessment (PRA) method(s) to construct Bayesian Networks (BNs) that form a Bayesian Decision Support Process (BDSP) to provide science-based decision support for understanding and managing events in complex systems. In an embodiment, the PRA method(s) may include Discrete Dynamic Event Trees (DDETs) and simulations.

Groth, Katrina↗

The deconstruction of flavor in the privately democratic Higgs sector

The Standard Model (SM) of particle physics fails to explain the observed hierarchy in fermion masses or the origin of fermion-flavor structure. We construct a model to explain these observations in the quark sector. We introduce a spectrum of new particles consisting of six of each — massive singlet vector-like quarks (VLQs), singlet scalars, and SU(2)-doublet scalars. SM quark masses are generated when the neutral components of the SU(2)-doublet scalars acquire non-zero vacuum expectation values (VEVs). We impose global symmetries to ensure that Yukawa couplings stay roughly flavor diagonal and democratic (of the same order), as well as to suppress tree-level flavor-changing neutral currents. Quark-mass hierarchy then follows from a hierarchy in scalar VEVs. The singlet scalars also acquire weak-scale VEVs. Together with the VLQs, they act as messengers between different generations of quarks in the SM. These messenger particles are responsible for generating the elements of the Cabibbo-Kobayashi-Masakawa (CKM) matrix which depend on the ratios of the singlet VEVs and VLQ masses. Constructed this way, the CKM matrix is found to be independent of the SM fermion masses. Using the measured values of the CKM matrix elements and assuming order-one couplings, we derive constraints on the masses of the VLQs and discuss prospects for probing our model in the near future.

CKM Parameters↗

The Pennsylvania defoliation application pilot test

Satellite imagery for the State of Pennsylvania was digitally mosaicked to provide the seed data base for monitoring defoliation of hardwood trees by the gypsy moth. Two separate mosaics for the state were prepared, one before defoliation and one after defoliation, to determine the extent, direction, and impact of gypsy moth activity in the state. The digital mosaic technology used to construct the data base was transferred to Pennsylvania State University to permit periodic updates to the data base and to assist in planning and abatement activities. Participating agencies or institutions included Goddard Space Flight Center and the Pennsylvania State University Office for Remote Sensing of Earth Resources.

Mcleod, R. G.↗

Optimal parallel solution of sparse triangular systems

A method for the parallel solution of triangular sets of equations is described that is appropriate when there are many right-handed sides. By preprocessing, the method can reduce the number of parallel steps required to solve Lx = b compared to parallel forward or backsolve. Applications are to iterative solvers with triangular preconditioners, to structural analysis, or to power systems applications, where there may be many right-handed sides (not all available a priori). The inverse of L is represented as a product of sparse triangular factors. The problem is to find a factored representation of this inverse of L with the smallest number of factors (or partitions), subject to the requirement that no new nonzero elements be created in the formation of these inverse factors. A method from an earlier reference is shown to solve this problem. This method is improved upon by constructing a permutation of the rows and columns of L that preserves triangularity and allow for the best possible such partition. A number of practical examples and algorithmic details are presented. The parallelism attainable is illustrated by means of elimination trees and clique trees.

Alvarado, Fernando L.↗