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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Recursive dynamics of topological trees of rigid bodies via Kalman filtering and Bryson-Frazier smoothing

The inverse and forward dynamics problems for a set of rigid bodies connected by hinges to form a topological tree are solved by using recursive techniques from linear filtering and smoothing theory. An inward filtering sequence computes a set of constraint moments and forces. This is followed by an outward sequence to determine a corresponding set of angular and linear accelerations. An inward sequence begins at the tips of all of the terminal bodies of the tree and proceeds inwardly through all of the branches until it reaches the root. Similarly, an outward sequence begins at the root and propagates to all of the tree branches until it reaches the tips of the terminal bodies. The paper also provides an approach to evaluate recursively the composite multibody system inertia matrix and its inverse.

Rodriguez, G.↗
NASA NTRS1975

Point-connected rigid bodies in a topological tree

The purpose of the present paper is to explore the applicability of several methods of analytical mechanics to the modern problem of formulating generic equations of motion of a point-connected set of rigid bodies in a topological tree, in order to compare the results of the previously published Hooker-Margulies/Hooker equations. The unexpected result of the inquiry is the discovery that with the substitution of a key kinematical identity from the Hooker and Margulies vector-dyadic equations for the multiple-rigid-body tree, identical equations emerge from each of four quite different derivation procedures.

Likins, P. W.↗
NASA NTRS1984

Dynamics of flexible bodies in tree topology - A computer oriented approach

An approach suited for automatic generation of the equations of motion for large mechanical systems (i.e., large space structures, mechanisms, robots, etc.) is presented. The system topology is restricted to a tree configuration. The tree is defined as an arbitrary set of rigid and flexible bodies connected by hinges characterizing relative translations and rotations of two adjoining bodies. The equations of motion are derived via Kane's method. The resulting equation set is of minimum dimension. Dynamical equations are imbedded in a computer program called TREETOPS. Extensive control simulation capability is built in the TREETOPS program. The simulation is driven by an interactive set-up program resulting in an easy to use analysis tool.

Singh, R. P.↗
NASA NTRS2011

Constraint Embedding Technique for Multibody System Dynamics

Multibody dynamics play a critical role in simulation testbeds for space missions. There has been a considerable interest in the development of efficient computational algorithms for solving the dynamics of multibody systems. Mass matrix factorization and inversion techniques and the O(N) class of forward dynamics algorithms developed using a spatial operator algebra stand out as important breakthrough on this front. Techniques such as these provide the efficient algorithms and methods for the application and implementation of such multibody dynamics models. However, these methods are limited only to tree-topology multibody systems. Closed-chain topology systems require different techniques that are not as efficient or as broad as those for tree-topology systems. The closed-chain forward dynamics approach consists of treating the closed-chain topology as a tree-topology system subject to additional closure constraints. The resulting forward dynamics solution consists of: (a) ignoring the closure constraints and using the O(N) algorithm to solve for the free unconstrained accelerations for the system; (b) using the tree-topology solution to compute a correction force to enforce the closure constraints; and (c) correcting the unconstrained accelerations with correction accelerations resulting from the correction forces. This constraint-embedding technique shows how to use direct embedding to eliminate local closure-loops in the system and effectively convert the system back to a tree-topology system. At this point, standard tree-topology techniques can be brought to bear on the problem. The approach uses a spatial operator algebra approach to formulating the equations of motion. The operators are block-partitioned around the local body subgroups to convert them into aggregate bodies. Mass matrix operator factorization and inversion techniques are applied to the reformulated tree-topology system. Thus in essence, the new technique allows conversion of a system with closure-constraints into an equivalent tree-topology system, and thus allows one to take advantage of the host of techniques available to the latter class of systems. This technology is highly suitable for the class of multibody systems where the closure-constraints are local, i.e., where they are confined to small groupings of bodies within the system. Important examples of such local closure-constraints are constraints associated with four-bar linkages, geared motors, differential suspensions, etc. One can eliminate these closure-constraints and convert the system into a tree-topology system by embedding the constraints directly into the system dynamics and effectively replacing the body groupings with virtual aggregate bodies. Once eliminated, one can apply the well-known results and algorithms for tree-topology systems to solve the dynamics of such closed-chain system.

Woo, Simon S.↗
DOE OSTI2024

The Influence of the Number of Tree Searches on Maximum Likelihood Inference in Phylogenomics

Maximum likelihood (ML) phylogenetic inference is widely used in phylogenomics. As heuristic searches most likely find suboptimal trees, it is recommended to conduct multiple (e.g., 10) tree searches in phylogenetic analyses. However, beyond its positive role, how and to what extent multiple tree searches aid ML phylogenetic inference remains poorly explored. Here, we found that a random starting tree was not as effective as the BioNJ and parsimony starting trees in inferring the ML gene tree and that RAxML-NG and PhyML were less sensitive to different starting trees than IQ-TREE. We then examined the effect of the number of tree searches on ML tree inference with IQ-TREE and RAxML-NG, by running 100 tree searches on 19,414 gene alignments from 15 animal, plant, and fungal phylogenomic datasets. We found that the number of tree searches substantially impacted the recovery of the best-of-100 ML gene tree topology among 100 searches for a given ML program. In addition, all of the concatenation-based trees were topologically identical if the number of tree searches was ≥10. Quartet-based ASTRAL trees inferred from 1 to 80 tree searches differed topologically from those inferred from 100 tree searches for 6/15 phylogenomic datasets. Lastly, our simulations showed that gene alignments with lower difficulty scores had a higher chance of finding the best-of-100 gene tree topology and were more likely to yield the correct trees.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Performing optimized collective operations in a irregular subcommunicator of compute nodes in a parallel computer

In a parallel computer, performing optimized collective operations in an irregular subcommunicator of compute nodes may be carried out by: identifying, within the irregular subcommunicator, regular neighborhoods of compute nodes; selecting, for each neighborhood from the compute nodes of the neighborhood, a local root node; assigning each local root node to a node of a neighborhood-wide tree topology; mapping, for each neighborhood, the compute nodes of the neighborhood to a local tree topology having, at its root, the local root node of the neighborhood; and performing a one way, rooted collective operation within the subcommunicator including: performing, in one phase, the collective operation within each neighborhood; and performing, in another phase, the collective operation amongst the local root nodes.

Davis, Kristan Suzanne D.↗
DOE OSTI2025

Sempervirens: A Fast Reconstruction Algorithm for Noisy and Incomplete Binary Matrix Representations of Trees

Applications such as reconstructing cell lineage trees (represented as phylogenetic trees) from single-cell sequencing data require reconstructing a {0,1}-matrix that has many errors and missing entries. We introduce Sempervirens, a very fast matrix reconstruction algorithm for noisy and incomplete matrix representations of phylogenetic trees. Sempervirens uses an iterative maximum-likelihood approach to determine the topology tree represented by the corrupted data. We show that Sempervirens is at least three orders of magnitude faster than other methods on thousand by thousand matrices, with the speed gap widening with larger matrices. We also show that Sempervirens matches state-of-the-art methods in reconstruction accuracy. The speed of Sempervirens enables it to be tractably applied to reconstructing much larger matrices than those that other methods can reconstruct. In addition to experimental results, we justify the algorithm with a mathematical treatment of its subprocedures.

algorithms↗
NASA NTRS2000

The Design of a Fault-Tolerant COTS-Based Bus Architecture for Space Applications

The high-performance, scalability and miniaturization requirements together with the power, mass and cost constraints mandate the use of commercial-off-the-shelf (COTS) components and standards in the X2000 avionics system architecture for deep-space missions. In this paper, we report our experiences and findings on the design of an IEEE 1394 compliant fault-tolerant COTS-based bus architecture. While the COTS standard IEEE 1394 adequately supports power management, high performance and scalability, its topological criteria impose restrictions on fault tolerance realization. To circumvent the difficulties, we derive a "stack-tree" topology that not only complies with the IEEE 1394 standard but also facilitates fault tolerance realization in a spaceborne system with limited dedicated resource redundancies. Moreover, by exploiting pertinent standard features of the 1394 interface which are not purposely designed for fault tolerance, we devise a comprehensive set of fault detection mechanisms to support the fault-tolerant bus architecture.

Chau, Savio N.↗
NASA NTRS1972

Large-deformation modal coordinates for nonrigid vehicle dynamics

The derivation of minimum-dimension sets of discrete-coordinate and hybrid-coordinate equations of motion of a system consisting of an arbitrary number of hinge-connected rigid bodies assembled in tree topology is presented. These equations are useful for the simulation of dynamical systems that can be idealized as tree-like arrangements of substructures, with each substructure consisting of either a rigid body or a collection of elastically interconnected rigid bodies restricted to small relative rotations at each connection. Thus, some of the substructures represent elastic bodies subjected to small strains or local deformations, but possibly large gross deformations, in the hybrid formulation, distributed coordinates referred to herein as large-deformation modal coordinates, are used for the deformations of these substructures. The equations are in a form suitable for incorporation into one or more computer programs to be used as multipurpose tools in the simulation of spacecraft and other complex electromechanical systems.

Likins, P. W.↗
DOE OSTI2022

Distributed deep learning training using silicon photonic switched architectures

The scaling trends of deep learning models and distributed training workloads are challenging network capacities in today’s datacenters and high-performance computing (HPC) systems. We propose a system architecture that leverages silicon photonic (SiP) switch-enabled server regrouping using bandwidth steering to tackle the challenges and accelerate distributed deep learning training. In addition, our proposed system architecture utilizes a highly integrated operating system-based SiP switch control scheme to reduce implementation complexity. To demonstrate the feasibility of our proposal, we built an experimental testbed with a SiP switch-enabled reconfigurable fat tree topology and evaluated the network performance of distributed ring all-reduce and parameter server workloads. The experimental results show up to 3.6× improvements over the static non-reconfigurable fat tree. Our large-scale simulation results show that server regrouping can deliver up to 2.3× flow throughput improvement for a 2× tapered fat tree and a further 11% improvement when higher-layer bandwidth steering is employed. The collective results show the potential of integrating SiP switches into datacenters and HPC systems to accelerate distributed deep learning training.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Graph Analytics on Jellyfish topology

Because large unstructured datasets is important for many science domains, distributed graph analytics is critical to many scientists. Unfortunately, obtaining scaling and performance for irregular communication is challenging because contemporary network interconnects are primarily designed to maximize bandwidths of fixed-neighborhoods large-message exchanges (e.g., stencils). Although there is no consensus on the “best” network topologies for irregular communication, unstructured graph-based interconnects can be more suitable. We analyze three popular graph workloads – clustering, pattern enumeration, and traversal — on comparable networks (in terms of resources and costs) constructed from Jellyfish Random Regular, Dragonfly and Fat tree topologies, varying the routing algorithms. Using packet-level simulations, we demonstrate up to 60% improvement in communication time with Jellyfish due to diversity of the short paths between arbitrary endpoints, which can reduce overall network stalls and congestion.

Graph Analytics, network topology, interconnect, H↗
NASA NTRS2013

Implementation of Kane's Method for a Spacecraft Composed of Multiple Rigid Bodies

Equations of motion are derived for a general spacecraft composed of rigid bodies connected via rotary (spherical or gimballed) joints in a tree topology. Several supporting concepts are developed in depth. Basis dyads aid in the transition from basis-free vector equations to component-wise equations. Joint partials allow abstraction of 1-DOF, 2-DOF, 3-DOF gimballed and spherical rotational joints to a common notation. The basic building block consisting of an "inner" body and an "outer" body connected by a joint enables efficient organization of arbitrary tree structures. Kane's equation is recast in a form which facilitates systematic assembly of large systems of equations, and exposes a relationship of Kane's equation to Newton and Euler's equations which is obscured by the usual presentation. The resulting system of dynamic equations is of minimum dimension, and is suitable for numerical solution by computer. Implementation is ·discussed, and illustrative simulation results are presented.

Stoneking, Eric T.↗
NASA NTRS1975

Computer program system for dynamic simulation and stability analysis of passive and actively controlled spacecraft. Volume 1. Theory

A theoretical development and associated digital computer program system is presented. The dynamic system (spacecraft) is modeled as an assembly of rigid and/or flexible bodies not necessarily in a topological tree configuration. The computer program system may be used to investigate total system dynamic characteristics including interaction effects between rigid and/or flexible bodies, control systems, and a wide range of environmental loadings. Additionally, the program system may be used for design of attitude control systems and for evaluation of total dynamic system performance including time domain response and frequency domain stability analyses. Volume 1 presents the theoretical developments including a description of the physical system, the equations of dynamic equilibrium, discussion of kinematics and system topology, a complete treatment of momentum wheel coupling, and a discussion of gravity gradient and environmental effects. Volume 2, is a program users' guide and includes a description of the overall digital program code, individual subroutines and a description of required program input and generated program output. Volume 3 presents the results of selected demonstration problems that illustrate all program system capabilities.

Bodley, C. S.↗
NASA NTRS2020

Multibody Based Digital Astronaut Dynamics Simulation

BACKGROUND: This study provides the Software, Robotics, & Simulation Division at the NASA Johnson Space Center with a verification tool for multibody dynamics simulation requiring human motion. The motivation stems from current studies of several Vibration Isolation & Stabilization(VIS)system designs that attenuate the moments and forces which would be transmitted to a spacecraft during an exercise. A multibody dynamics model for a proposed VIS was available previously[1], therefore modeling of the VIS was not needed for this work. The interest here is in creating the multibody dynamics model of an astronaut in motion which may be utilized independently or while attached to a mechanism. An existing simulation [2] that utilizes OpenSim [3,4] and an in-house multibody dynamics package (MBDyn) [5] is used in order to verify the astronaut model. The main advantage this model will have over the existing simulation is that everything will be processed in one tool. METHODS AND RESULTS: Creating the simulation required; estimation of Body Segment Inertial Parameters (BSIP),a multibody model of the human-VIS system, joint acceleration profiles, and input files for MBDyn, which is used for this analysis. The scaling factors provided by Dumas et al. [6] are utilized in estimating the BSIP. Anthropometric data are used for estimating these parameters, the Anthropometric Survey of US Army Personnel (ANSUR II) [7] was the source. The astronaut model consists of 15 bodies, 14 joints and 32 degrees of freedom, with the dynamics topology generated using the center of mass locations and anthropometric data. MBDyn has an option for prescribed joint motion (PJM), which requires joint acceleration data as input. The joint angle data is first obtained from a motion capture system and then processed through code that has been created to generate approximate joint acceleration profiles. The topology tree for the astronaut model begins at the right foot up to the pelvis where there is one branch for going down the left leg and another for the torso. The torso branch leads to branches for the arms and a leaf body for the head/neck segment. For attachment to the VIS, the heel of the right foot is connected to the VIS platform through a fixed joint, resembling a foot restraint. The left foot does not attach to the platform in order to prevent a system with a closed loop. Topology and symmetry of the astronaut model were verified through kinematic analysis. Further verification of the forces and moments transmitted to the VIS were verified against the existing simulation. There was a satisfactory level of agreement when testing a simple motion, for example, rocking back and forth. Full exercise motions are to be tested soon. The main outcome has been a novel application of MBDyn for biomechanics modeling that is now available for dynamic simulations involving human motion. The estimation of BSIP was another useful result of this study, requiring only 15 inputs for generating mass properties of a theoretical astronaut model. Expansion on this work is possible by going through an alternative route in obtaining the joint motion data. Instead of high-tech and often expensive motion capture systems, an individual may watch videos with high focus and at a slow motion for each individual segment in order to determine the initial and final time and angle for that specific degree of freedom. Synthetic trajectories may also be created if there is no video reference available.

F N Matari↗
DOE OSTI2024

Detectability of Varied Hybridization Scenarios Using Genome-Scale Hybrid Detection Methods

Hybridization events complicate the accurate reconstruction of phylogenies, as they lead to patterns of genetic heritability that are unexpected under traditional, bifurcating models of species trees. This phenomenon has led to the development of methods to infer these varied hybridization events, both methods that reconstruct networks directly, as well as summary methods that predict individual hybridization events from a subset of taxa. However, a lack of empirical comparisons between methods – especially those pertaining to large networks with varied hybridization scenarios – hinders their practical use. Here, we provide a comprehensive review of popular summary methods: TICR, MSCquartets, HyDe, Patterson’s D-Statistic (ABBA-BABA), D3, and Dp. TICR and MSCquartets are based on quartet concordance factors gathered from gene tree topologies and HyDe, Patterson’s D-Statistic, D3, and Dp use site pattern frequencies to identify hybridization events between sets of three taxa. We then use simulated data to address questions of method accuracy and ideal use scenarios by testing methods against complex networks which depict gene flow events that differ in depth (timing), quantity (single vs. multiple, overlapping hybridizations), and rate of gene flow (γ). We find that deeper or multiple hybridization events may introduce noise and weaken the signal of hybridization, leading to higher relative false negative rates across all methods. Despite some forms of hybridization eluding quartet-based detection methods, MSCquartets displays high precision in most scenarios. While HyDe results in high false negative rates when tested on hybridizations involving extinct or unsampled ghost lineages, HyDe is the only method able to identify the direction of hybridization, distinguishing the source parental lineages from recipient hybrid lineages. Lastly, we test the methods on a dataset of ultraconserved elements from the bee subfamily Nomiinae, finding possible hybridization events between clades which correspond to regions of poor support in the species tree estimated in a previous study.

Bjorner, Marianne B.↗
DOE OSTI2025

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↗
DOE OSTI2020

Multi-Level Optimal Power Flow Solver in Large Distribution Networks

Solving optimal power flow (OPF) problems for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution network of tree topology with a deep penetration of active devices. We divide the network into collaborating areas featuring subtree topology and subareas featuring subsubtree topology. We design a multilevel implementation of the primal-dual gradient algorithm to solve the voltage regulation OPF problems while preserving nodal voltage information and topological information within areas and subareas. Numerical results on a 4,521-node system verify that the proposed algorithm can significantly improve the computational speed without compromising any optimality.

41 EE - Solar Energy Technologies Office (EE-4S)↗