Search NASA⌕ Search

SEARCH · Search NASA

Results for “Tree Topology”

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 127 records · Page 7

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↗

Computing a Stable Distance on Merge Trees

Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological summaries cannot and 2) to still be robust to perturbations in the dataset. The combination of these two properties, known respectively as stability and discriminativity, has led to theoretical distances which are either thought to be or shown to be computationally complex and thus their implementations have been scarce. In order to design similarity measures on merge trees which are computationally feasible for more complex merge trees, many researchers have elected to loosen the restrictions on at least one of these two properties. The question still remains, however, if there are practical situations where trading these desirable properties is necessary. Here we construct a distance between merge trees which is designed to retain both discriminativity and stability. While our approach can be expensive for large merge trees, we illustrate its use in a setting where the number of nodes is small. This setting can be made more practical since we also provide a proof that persistence simplification increases the outputted distance by at most half of the simplified value. As a result, we demonstrate our distance measure on applications in shape comparison and on detection of periodicity in the von Kármán vortex street.

97 MATHEMATICS AND COMPUTING↗

Programmable interactions and emergent geometry in an array of atom clouds

Interactions govern the flow of information and the formation of correlations between constituents of many-body quantum systems, dictating phases of matter found in nature and forms of entanglement generated in the laboratory. Typical interactions decay with distance and thus produce a network of connectivity governed by geometry—such as the crystalline structure of a material or the trapping sites of atoms in a quantum simulator. However, many envisioned applications in quantum simulation and computation require more complex coupling graphs including non-local interactions, which feature in models of information scrambling in black hole, and mappings of hard optimization problems onto frustrated classical magnets. Here we describe the realization of programmable non-local interactions in an array of atomic ensembles within an optical cavity, in which photons carry information between atomic spins. By programming the distance dependence of the interactions, we access effective geometries for which the dimensionality, topology and metric are entirely distinct from the physical geometry of the array. As examples, we engineer an antiferromagnetic triangular ladder, a Möbius strip with sign-changing interactions and a treelike geometry inspired by concepts of quantum gravity. The tree graph constitutes a toy model of holographic duality, in which the quantum system lies on the boundary of a higher-dimensional geometry that emerges from measured correlations. Overall, our work provides broader prospects for simulating frustrated magnets and topological phases, investigating quantum optimization paradigms and engineering entangled resource states for sensing and computation.

74 ATOMIC AND MOLECULAR PHYSICS↗

Elongated galactan side chains mediate cellulose–pectin interactions in engineered Arabidopsis secondary cell walls

SUMMARY The plant secondary cell wall is a thickened matrix of polysaccharides and lignin deposited at the cessation of growth in some cells. It forms the majority of carbon in lignocellulosic biomass, and it is an abundant and renewable source for forage, fiber, materials, fuels, and bioproducts. The complex structure and arrangement of the cell wall polymers mean that the carbon is difficult to access in an economical and sustainable way. One solution is to alter the cell wall polymer structure so that it is more suited to downstream processing. However, it remains difficult to predict what the effects of this engineering will be on the assembly, architecture, and properties of the cell wall. Here, we make use of Arabidopsis plants expressing a suite of genes to increase pectic galactan chain length in the secondary cell wall. Using multi‐dimensional solid‐state nuclear magnetic resonance, we show that increasing galactan chain length enhances pectin–cellulose spatial contacts and increases cellulose crystallinity. We also found that the increased galactan content leads to fewer spatial contacts of cellulose with xyloglucan and the backbone of pectin. Hence, we propose that the elongated galactan side chains compete with xyloglucan and the pectic backbone for cellulose interactions. Due to the galactan topology, this may result in comparatively weak interactions and disrupt the cell wall architecture. Therefore, introduction of this strategy into trees or other bioenergy crops would benefit from cell‐specific expression strategies to avoid negative effects on plant growth.

59 BASIC BIOLOGICAL SCIENCES↗

Timber inventory using Landsat

The results of recent efforts to apply Landsat MSS imagery, in concert with topological maps, to forestry timber inventories via the FOCIS program are reported. FOCIS (Forests Classification and Inventory System) was defined for inventorying the lumber volume of coniferous tree types in rugged terrain regions. Data from four bands serve as input for unsupervised clustering and iterative labeling of the elevation, slope angle, and subregions of interest. Simulated photographic maps are generated which serve as overlays for regular maps for assessing timber harvests and sales goals. Sample procedures followed in mapping the Eldorado region forests in the Sierra Nevada mountains are discussed.

Strahler, A. H.↗

G4Boost: a machine learning-based tool for quadruplex identification and stability prediction

Background: G-quadruplexes (G4s), formed within guanine-rich nucleic acids, are secondary structures involved in important biological processes. Although every G4 motif has the potential to form a stable G4 structure, not every G4 motif would, and accurate energy-based methods are needed to assess their structural stability. Here, we present a decision tree-based prediction tool, G4Boost, to identify G4 motifs and predict their secondary structure folding probability and thermodynamic stability based on their sequences, nucleotide compositions, and estimated structural topologies. Results: G4Boost predicted the quadruplex folding state with an accuracy greater then 93% and an F1-score of 0.96, and the folding energy with an RMSE of 4.28 and R 2 of 0.95 only by the means of sequence intrinsic feature. G4Boost was successfully applied and validated to predict the stability of experimentally-determined G4 structures, including for plants and humans. Conclusion: G4Boost outperformed the three machine-learning based prediction tools, DeepG4, Quadron, and G4RNA Screener, in terms of both accuracy and F1-score, and can be highly useful for G4 prediction to understand gene regulation across species including plants and humans.

59 BASIC BIOLOGICAL SCIENCES↗

Experiments on Evolving Software Models of Analog Circuits

Analog circuits are of great importance in electronic system design since the world is fundamentally analog in nature. While the amount of digital design activity far outpaces that of analog design, most digital systems require analog modules for interfacing with the external world. It was recently estimated that approximately 60% of digital application- specific integrated circuit designs incorporated analog circuits. With challenging analog circuit design problems and few analog design engineers, there are economic reasons for automating the analog design process, especially time-to-market considerations. Techniques for analog circuit design automation began appearing about two decades ago. These methods incorporated heuristics [6], knowledge bases [1], simulated annealing [5], and other algorithms. Efforts using techniques from evolutionary computation began appearing over the last few years. These include the use of genetic algorithms to select electronic component values (for example, the resistance value of a resistor), to select circuit topologies, and to design amplifiers using a limited set of canned topologies [4]. A genetic programming-based analog circuit design system has been demonstrated in which the circuit sizes, component values, and the circuit topologies are determined automatically [3]. The genetic-algorithm systems typically represent circuit structures as vectors of parameters encoded in binary strings, while the genetic programming system manipulates tree data structures.

Lohn, Jason D.↗

An Efficient Solution Method for Multibody Systems with Loops Using Multiple Processors

This paper describes a multibody dynamics algorithm formulated for parallel implementation on multiprocessor computing platforms using the divide-and-conquer approach. The system of interest is a general topology of rigid and elastic articulated bodies with or without loops. The algorithm divides the multibody system into a number of smaller sets of bodies in chain or tree structures, called "branches" at convenient joints called "connection points", and uses an Order-N (O (N)) approach to formulate the dynamics of each branch in terms of the unknown spatial connection forces. The equations of motion for the branches, leaving the connection forces as unknowns, are implemented in separate processors in parallel for computational efficiency, and the equations for all the unknown connection forces are synthesized and solved in one or several processors. The performances of two implementations of this divide-and-conquer algorithm in multiple processors are compared with an existing method implemented on a single processor.

Multibody dynamics↗

Optimization of Distribution Feeder Topology: A Differential Programming Learning Approach

This paper presents a gradient based method for optimizing distribution feeder network topology under load un- certainty. We recast the optimal network reconfiguration problem as a learning problem where edge weights of a graph are learned to produce an optimized spanning tree for a distribution network. Using recent methods published on differentiable programming, we provide a data driven method for learning these weights. We test our method on 100 variations of an IEEE 15-bus test system. Our results show that our method outperforms more traditional mathematical programming-based approaches.

differentiable programming↗

Scalar-scaffolded gluons and the combinatorial origins of Yang-Mills theory

We present a new formulation for Yang-Mills scattering amplitudes in any number of dimensions and at any loop order, based on the same combinatorial and binary-geometric ideas in kinematic space recently used to give an all-order description of Tr Φ 3 theory. We propose that in a precise sense the amplitudes for a suitably “stringy” form of these two theories are identical, up to a simple shift of kinematic variables. This connection is made possible by describing the amplitudes for n gluons via a “scalar scaffolding”, arising from the scattering of 2n colored scalars coming in n distinct pairs of flavors fusing to produce the gluons. Fundamental properties of the “u-variables”, describing the “binary geometry” for surfaces appearing in the topological expansion, magically guarantee that the kinematically shifted Tr Φ 3 amplitudes satisfy the physical properties needed to be interpreted as scaffolded gluons. These include multilinearity, gauge invariance, and factorization on tree- and loop-level gluon cuts. Our “stringy” scaffolded gluon amplitudes coincide with amplitudes in the bosonic string for extra-dimensional gluon polarizations at tree-level, but differ (and are simpler) at loop-level. We provide many checks on our proposal, including matching non-trivial leading singularities through two loops. The simple counting problem underlying the u variables autonomously “knows” about everything needed to convert colored scalar to gluon amplitudes, exposing a striking “discovery” of Yang-Mills amplitudes from elementary combinatorial ideas in kinematic space.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NETRA: A parallel architecture for integrated vision systems. 1: Architecture and organization

Computer vision is regarded as one of the most complex and computationally intensive problems. An integrated vision system (IVS) is considered to be a system that uses vision algorithms from all levels of processing for a high level application (such as object recognition). A model of computation is presented for parallel processing for an IVS. Using the model, desired features and capabilities of a parallel architecture suitable for IVSs are derived. Then a multiprocessor architecture (called NETRA) is presented. This architecture is highly flexible without the use of complex interconnection schemes. The topology of NETRA is recursively defined and hence is easily scalable from small to large systems. Homogeneity of NETRA permits fault tolerance and graceful degradation under faults. It is a recursively defined tree-type hierarchical architecture where each of the leaf nodes consists of a cluster of processors connected with a programmable crossbar with selective broadcast capability to provide for desired flexibility. A qualitative evaluation of NETRA is presented. Then general schemes are described to map parallel algorithms onto NETRA. Algorithms are classified according to their communication requirements for parallel processing. An extensive analysis of inter-cluster communication strategies in NETRA is presented, and parameters affecting performance of parallel algorithms when mapped on NETRA are discussed. Finally, a methodology to evaluate performance of algorithms on NETRA is described.

Choudhary, Alok N.↗

Sign flip triangulations of the amplituhedron

We present new triangulations of the m = 4 amplituhedron relevant for scattering amplitudes in planar N = 4 super-Yang-Mills, obtained directly from the combinatorial definition of the geometry. Using the “sign flip” characterization of the amplituhedron, we reproduce the canonical forms for the all-multiplicity next-tomaximally helicity violating (NMHV) and next-to-next-to-maximally helicity violating (N2MHV) tree-level as well as the NMHV one-loop cases, without using any input from traditional amplitudes methods. Our results provide strong evidence for the equivalence of the original definition of the amplituhedron [1] and the topological one [2], and suggest a new path forward for computing higher loop amplitudes geometrically. In particular, we realize the NMHV one-loop amplituhedron as the intersection of two amplituhedra of lower dimensionality, which is reflected in the novel structure of the corresponding canonical form.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Phylogenomic Insights into the Evolution and Origin of Nematoda

Abstract The phylum Nematoda represents one of the most cosmopolitan and abundant metazoan groups on Earth. In this study, we reconstructed the phylogenomic tree for phylum Nematoda. A total of 60 genomes, belonging to 8 nematode orders, were newly sequenced, providing the first low-coverage genomes for the orders Dorylaimida, Mononchida, Monhysterida, Chromadorida, Triplonchida, and Enoplida. The resulting phylogeny is well-resolved across most clades, with topologies remaining consistent across various reconstruction parameters. The subclass Enoplia is placed as a sister group to the rest of Nematoda, agreeing with previously published phylogenies. While the order Triplonchida is monophyletic, it is not well-supported, and the order Enoplida is paraphyletic. Taxa possessing a stomatostylet form a monophyletic group; however, the superfamily Aphelenchoidea does not constitute a monophyletic clade. The genera Trichinella and Trichuris are inferred to have shared a common ancestor approximately 202 millions of years ago (Ma), a considerably later period than previously suggested. All stomatostylet-bearing nematodes are proposed to have originated ~305 Ma, corresponding to the transition from the Devonian to the Permian period. The genus Thornia is placed outside of Dorylaimina and Nygolaimina, disagreeing with its position in previous studies. In addition, we tested the whole genome amplification method and demonstrated that it is a promising strategy for obtaining sufficient DNA for phylogenomic studies of microscopic eukaryotes. This study significantly expanded the current nematode genome dataset, and the well-resolved phylogeny enhances our understanding of the evolution of Nematoda.

Qing, Xue (ORCID:0000000203559956)↗

HPC Network Simulation Tuning via Automatic Extraction of Hardware Parameters

Popular HPC network interconnection simulators such as SST/macro provide a variety of configurable parameters to explore the design space of hardware components such as network interface cards (NIC), switches, and links among them. While such knobs provide flexibility to explore design trade-offs for novel hardware, manually configuring simulations for matching configurations of the existing hardware to focus on topology exploration can be cumbersome and error-prone, leading to widely inaccurate simulations. This challenge is compounded when specifications of various (proprietary) technologies are not readily available or intentionally omitted. In this work, we propose a framework to autotune the multiple network models’ simulation configurations within SST/macro using Tree-structured Parzen Estimator-based Bayesian optimization to observe the effect on simulation accuracy across different message regimes. These regimes consist of small to large message sizes and latency to bandwidth-bound messages. We provide a detailed analysis of the simulation error for four representative HPC systems. Our Bayesian optimization based autotuning framework for network models achieves a maximum of 5x improvement in accuracy over best-effort manual configurations based on available hardware specifications.

Simulation, autotuning↗

The Dynamic of Complex Two-Phase Mixtures During Coarsening: From Dendritic to Bicontinuous Mixtures

Dendrites are tree-like crystals that frequently form during the solidification of castings. In systems with nearly isotropic interfacial energy, these dendrites possess secondary and sometimes even tertiary arms, and lead to morphologically complex two-phase mixtures. Dealloying, in which one component is selectively leached, leads to nanoporous structures that have proven useful for many technological applications. These bicontinuous two-phase mixtures are topologically and morphologically complex with spatially varying mean and Gaussian curvatures. The evolution of these structures during coarsening is of considerable technological importance since the morphology of the dendrites and nanoporous structure sets the properties of the resulting material. During coarsening, the total surface area per volume of the mixture decreases, thus resulting in an increase in the size-scale of the two-phase mixture. The evolution of interfacial morphology of these interconnected two-phase mixtures is being studied using large-scale computer simulations. The simulations are used to develop a theory of coarsening in these systems that will elucidate the impact of the complicated morphology found in dendritic and nanoporous systems on the coarsening process. The experiments employ four-dimensional X-ray microtomography, which enables the morphology of the two-phase mixture to be followed in three dimensions and time (an additional dimension). The experiments also serve as a test of simulations and theory of the coarsening process, as well as to provide initial conditions for the simulations. Through these experiments and theory, we aim to develop a comprehensive description of coarsening in these complex and technologically important two-phase mixtures.

36 MATERIALS SCIENCE↗

Loop-level double-copy for massive fermions in the fundamental

We find that unitarity cuts and the duality between color and kinematics are sufficient constraints to bootstrap D-dimensional QCD scattering amplitudes starting from three-particle tree-level. Specifically, we calculate tree level amplitudes through six-points, as well as the four-point one-loop correction for massive fermions in the fundamental representation of the gauge group — constructing a color-dual representation of the latter for the first time. To do so we clarify a prescription for functional kinematic ansatze involving fermionic matter. The advantages of color-dual calculation, familiar from particles in the adjoint, also apply here: only a small number of basis topologies must be constrained via physical information of the theory, and algebraic relations propagate this to a full solution. As all the QCD amplitudes we construct here are color-dual, they trivially generate D-dimensional amplitudes in gravitational theories via double-copy construction.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

All-order splits and multi-soft limits for particle and string amplitudes

The most important aspects of scattering amplitudes have long been thought to be associated with their poles. But recently a very different sort of “split” factorizations for a wide range of particle and string tree amplitudes have been discovered away from poles. In this paper, we give a simple, conceptual origin for these splits arising from natural properties of the binary geometry of the curve integral formulation for scattering amplitudes for Tr(Φ 3 ) theory. The most natural way of “joining” smaller surfaces to build larger ones directly produces a choice of kinematics for which higher amplitudes factor into lower ones. This gives a generalization of splits to all orders in the topological expansion. These splits allow us to access and compute loop-integrated multi-soft limits for particle and string amplitudes, at all loop orders. This includes split factorizations and multisoft limits for pion and gluon amplitudes, that are related to Tr(Φ 3 ) theory by a simple kinematical shift.

Bosonic Strings↗

Whole-proteome tree of life suggests a deep burst of organism diversity

An organism tree of life (organism ToL) is a conceptual and metaphorical tree to capture a simplified narrative of the evolutionary course and kinship among the extant organisms. Such a tree cannot be experimentally validated but may be reconstructed based on characteristics associated with the organisms. Since the whole-genome sequence of an organism is, at present, the most comprehensive descriptor of the organism, a whole-genome sequence-based ToL can be an empirically derivable surrogate for the organism ToL. However, experimentally determining the whole-genome sequences of many diverse organisms was practically impossible until recently. We have constructed three types of ToLs for diversely sampled organisms using the sequences of whole genome, of whole transcriptome, and of whole proteome. Of the three, whole-proteome sequence-based ToL (whole-proteome ToL), constructed by applying information theory-based feature frequency profile method, an “alignment-free” method, gave the most topologically stable ToL. Here, we describe the main features of a whole-proteome ToL for 4,023 species with known complete or almost complete genome sequences on grouping and kinship among the groups at deep evolutionary levels. The ToL reveals 1) all extant organisms of this study can be grouped into 2 “Supergroups,” 6 “Major Groups,” or 35+ “Groups”; 2) the order of emergence of the “founders” of all of the groups may be assigned on an evolutionary progression scale; 3) all of the founders of the groups have emerged in a “deep burst” at the very beginning period near the root of the ToL—an explosive birth of life’s diversity.

59 BASIC BIOLOGICAL SCIENCES↗