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.

SourceResearch connectionFrom yearThrough year

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

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

DOE OSTI2019

Beyond toy models: distilling tensor networks in full AdS/CFT

We present a general procedure for constructing tensor networks that accurately reproduce holographic states in conformal field theories (CFTs). Given a state in a large-N CFT with a static, semiclassical gravitational dual, we build a tensor network by an iterative series of approximations that eliminate redundant degrees of freedom and minimize the bond dimensions of the resulting network. We argue that the bond dimensions of the tensor network will match the areas of the corresponding bulk surfaces. For “tree” tensor networks (i.e., those that are constructed by discretizing spacetime with nonintersecting Ryu-Takayanagi surfaces), our arguments can be made rigorous using a version of one-shot entanglement distillation in the CFT. Using the known quantum error correcting properties of AdS/CFT, we show that bulk legs can be added to the tensor networks to create holographic quantum error correcting codes. These codes behave similarly to previous holographic tensor network toy models, but describe actual bulk excitations in continuum AdS/CFT. By assuming some natural generalizations of the “holographic entanglement of purification” conjecture, we are able to construct tensor networks for more general bulk discretizations, leading to finer-grained networks that partition the information content of a Ryu-Takayanagi surface into tensor-factorized subregions. While the granularity of such a tensor network must be set larger than the string/Planck scales, we expect that it can be chosen to lie well below the AdS scale. However, we also prove a no-go theorem which shows that the bulk-to-boundary maps cannot all be isometries in a tensor network with intersecting Ryu-Takayanagi surfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Haar-Like Wavelets on Hierarchical Trees

Here, discrete wavelet methods, originally formulated in the setting of regularly sampled signals, can be adapted to data defined on a point cloud if some multiresolution structure is imposed on the cloud. A wide variety of hierarchical clustering algorithms can be used for this purpose, and the multiresolution structure obtained can be encoded by a hierarchical tree of subsets of the cloud. Prior work introduced the use of Haar-like bases defined with respect to such trees for approximation and learning tasks on unstructured data. This paper builds on that work in two directions. First, we present an algorithm for constructing Haar-like bases on general discrete hierarchical trees. Second, with an eye towards data compression, we present thresholding techniques for data defined on a point cloud with error controlled in the $L$ $\infty$ norm and in a Hölder-type norm. In a concluding trio of numerical examples, we apply our methods to compress a point cloud dataset, study the tightness of the $L$ $\infty$ error bound, and use thresholding to identify MNIST classifiers with good generalizability.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1990

Scattering measurements on natural and model trees

The acoustical back scattering from a simple scale model of a tree has been experimentally measured. The model consisted of a trunk and six limbs, each with 4 branches; no foliage or twigs were included. The data from the anechoic chamber measurements were then mathematically combined to construct the effective back scattering from groups of trees. Also, initial measurements have been conducted out-of-doors on a single tree in an open field in order to characterize its acoustic scattering as a function of azimuth angle. These measurements were performed in the spring, prior to leaf development. The data support a statistical model of forest scattering; the scattered signal spectrum is highly irregular but with a remarkable general resemblance to the incident signal spectrum. Also, the scattered signal's spectra showed little dependence upon scattering angle.

Rogers, James C.↗

NASA NTRS2009

Deriving Safety Cases from Automatically Constructed Proofs

Formal proofs provide detailed justification for the validity of claims and are widely used in formal software development methods. However, they are often complex and difficult to understand, because the formalism in which they are constructed and encoded is usually machine-oriented, and they may also be based on assumptions that are not justified. This causes concerns about the trustworthiness of using formal proofs as arguments in safety-critical applications. Here, we present an approach to develop safety cases that correspond to formal proofs found by automated theorem provers and reveal the underlying argumentation structure and top-level assumptions. We concentrate on natural deduction style proofs, which are closer to human reasoning than resolution proofs, and show how to construct the safety cases by covering the natural deduction proof tree with corresponding safety case fragments. We also abstract away logical book-keeping steps, which reduces the size of the constructed safety cases. We show how the approach can be applied to the proofs found by the Muscadet prover.

Basir, Nurlida↗

NASA NTRS1990

Satellite sound broadcast propagation studies and measurements

Satellite Sound Broadcasting is an attractive satellite application. Before regulatory decisions can be made in 1992, the propagation effects encountered have to be characterized. The Electrical Engineering Research Laboratory has nearly completed a system which will allow amplitude measurements to be made over 10 MHz bandwidths in the 800 to 1800 MHz frequency range. The system uses transmission from a transportable tower, and reception inside buildings or in the shadow of trees or utility poles. The goal is to derive propagation models for use by systems engineers who are about to design satellite broadcast systems. The advance of fiber-optics technology has helped to focus future development of satellite services into areas where satellites are uniquely competitive. One of these preferred satellite applications is the broadcasting of high-quality sound for stationary or mobile reception by listeners using low-cost, consumer-grade receivers. Before such services can be provided, however, the political hurdles of spectrum allocation have to be surmounted and the technical questions of standardization for world-wide compatibility have to be resolved. In order to arrive at an optimal system design, efficient in the use of our scarce spectral resources, affordable both to the broadcaster and the listener, and providing predictable performance, the propagation effects to which the service is subjected have to be characterized. Consequently, the objective of the research project is to make basic propagation measurements for direct Satellite Sound Broadcasting Service (SSBS). The data obtained should allow the development of propagation models to be used by communications engineers designing the operational systems. Such models shall describe the effects of shadowing and multipath propagation on SSBS receivers operating in a specified environment, such as inside commercial or residential buildings of various construction and also in the shadow of trees or utility poles as might be encountered by transporting or mobile listeners.

Vogel, Wolfhard J.↗

NASA NTRS1992

Structural system reliability calculation using a probabilistic fault tree analysis method

The development of a new probabilistic fault tree analysis (PFTA) method for calculating structural system reliability is summarized. The proposed PFTA procedure includes: developing a fault tree to represent the complex structural system, constructing an approximation function for each bottom event, determining a dominant sampling sequence for all bottom events, and calculating the system reliability using an adaptive importance sampling method. PFTA is suitable for complicated structural problems that require computer-intensive computer calculations. A computer program has been developed to implement the PFTA.

Torng, T. Y.↗

NASA NTRS2013

Contact Graph Routing Enhancements Developed in ION for DTN

The Interplanetary Overlay Network (ION) software suite is an open-source, flight-ready implementation of networking protocols including the Delay/Disruption Tolerant Networking (DTN) Bundle Protocol (BP), the CCSDS (Consultative Committee for Space Data Systems) File Delivery Protocol (CFDP), and many others including the Contact Graph Routing (CGR) DTN routing system. While DTN offers the capability to tolerate disruption and long signal propagation delays in transmission, without an appropriate routing protocol, no data can be delivered. CGR was built for space exploration networks with scheduled communication opportunities (typically based on trajectories and orbits), represented as a contact graph. Since CGR uses knowledge of future connectivity, the contact graph can grow rather large, and so efficient processing is desired. These enhancements allow CGR to scale to predicted NASA space network complexities and beyond. This software improves upon CGR by adopting an earliest-arrival-time cost metric and using the Dijkstra path selection algorithm. Moving to Dijkstra path selection also enables construction of an earliest- arrival-time tree for multicast routing. The enhancements have been rolled into ION 3.0 available on sourceforge.net.

Segui, John S.↗

NASA NTRS1979

Development of an Accelerated Test Design for Predicting the Service Life of the Solar Array at Mead, Nebraska

Potential long-term degradation modes for the two types of modules in the Mead array were determined and judgments were made as to those environmental stresses and combinations of stresses which accelerate the degradation of the power output. Hierarchical trees representing the severity of effects of stresses (test conditions) on eleven individual degradation modes were constructed and were pruned of tests judged to be nonessential. Composites of those trees were developed so that there is now one pruned tree covering eight degradation modes, another covering two degradation modes, and a third covering one degradation mode. These three composite trees form the basis for selection of test conditions in the final test plan which is now being prepared.

Gaines, G. B.↗

DOE OSTI2020

Hanging by a thread? Forests and drought

Trees are the living foundations on which most terrestrial biodiversity is built. Central to the success of trees are their woody bodies, which connect their elevated photosynthetic canopies with the essential belowground activities of water and nutrient acquisition. The slow construction of these carbon-dense, woody skeletons leads to a slow generation time, leaving trees and forests highly susceptible to rapid changes in climate. Other long-lived, sessile organisms such as corals appear to be poorly equipped to survive rapid changes, which raises questions about the vulnerability of contemporary forests to future climate change. The emerging view that, similar to corals, tree species have rather inflexible damage thresholds, particularly in terms of water stress, is especially concerning. This Review examines recent progress in our understanding of how the future looks for forests growing in a hotter and drier atmosphere.

Science & Technology - Other Topics↗

DOE OSTI2018

Cluster Method of Constructing Bethe Approximation for the Ising Model of a Dilute Magnet

The paper offers an interpretation of Bethe approximation based on comparison of spin clusters of different sizes on the Cayley tree. Based on this interpretation, the authors suggested the method to construct Bethe approximation for the node- or bond-diluted Ising magnet. The method provides an accurate value of the percolation threshold for the Bethe lattice. For different variations of this method, the authors constructed spontaneous magnetizations at zero and final temperatures as a function of concentration of magnetic atoms and found an analytical expression for the critical indicator of the correlation length.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

NASA NTRS1980

Reliability/safety analysis of a fly-by-wire system

An analysis technique has been developed to estimate the reliability of a very complex, safety-critical system by constructing a diagram of the reliability equations for the total system. This diagram has many of the characteristics of a fault-tree or success-path diagram, but is much easier to construct for complex redundant systems. The diagram provides insight into system failure characteristics and identifies the most likely failure modes. A computer program aids in the construction of the diagram and the computation of reliability. Analysis of the NASA F-8 Digital Fly-by-Wire Flight Control System is used to illustrate the technique.

Brock, L. D.↗

DOE OSTI2017

Gluon amplitudes as 2 d conformal correlators

Recently, spin-one wave functions in four dimensions that are conformal primaries of the Lorentz group S L ( 2 , C ) were constructed. Herein, we compute low-point, tree-level gluon scattering amplitudes in the space of these conformal primary wave functions. The answers show the same conformal covariance as correlators of spin-one primaries in a 2 d CFT. The Britto–Cachazo–Feng–Witten (BCFW) recursion relation between three- and four-point gluon amplitudes is recast into this conformal basis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

DOE OSTI2025

Clustering at Massive Scale

ClaMS provides hierarchical clustering technology for use on massive, high-dimensional datasets that require distributed memory for processing. The algorithm employed is inspired by the popular HDBSCAN algorithm but makes use of computational kernels better suited for distributed computing. ClaMS is built on scalable nearest neighbor graph construction, metric forest completion, and approximate minimum spanning tree techniques.

Stanley, ThomasA [Lawrence Livermore National Labo↗

NASA NTRS2008

From Informal Safety-Critical Requirements to Property-Driven Formal Validation

Most of the efforts in formal methods have historically been devoted to comparing a design against a set of requirements. The validation of the requirements themselves, however, has often been disregarded, and it can be considered a largely open problem, which poses several challenges. The first challenge is given by the fact that requirements are often written in natural language, and may thus contain a high degree of ambiguity. Despite the progresses in Natural Language Processing techniques, the task of understanding a set of requirements cannot be automatized, and must be carried out by domain experts, who are typically not familiar with formal languages. Furthermore, in order to retain a direct connection with the informal requirements, the formalization cannot follow standard model-based approaches. The second challenge lies in the formal validation of requirements. On one hand, it is not even clear which are the correctness criteria or the high-level properties that the requirements must fulfill. On the other hand, the expressivity of the language used in the formalization may go beyond the theoretical and/or practical capacity of state-of-the-art formal verification. In order to solve these issues, we propose a new methodology that comprises of a chain of steps, each supported by a specific tool. The main steps are the following. First, the informal requirements are split into basic fragments, which are classified into categories, and dependency and generalization relationships among them are identified. Second, the fragments are modeled using a visual language such as UML. The UML diagrams are both syntactically restricted (in order to guarantee a formal semantics), and enriched with a highly controlled natural language (to allow for modeling static and temporal constraints). Third, an automatic formal analysis phase iterates over the modeled requirements, by combining several, complementary techniques: checking consistency; verifying whether the requirements entail some desirable properties; verify whether the requirements are consistent with selected scenarios; diagnosing inconsistencies by identifying inconsistent cores; identifying vacuous requirements; constructing multiple explanations by enabling the fault-tree analysis related to particular fault models; verifying whether the specification is realizable.

Cimatti, Alessandro↗

NASA NTRS2009

Deriving Safety Cases from Machine-Generated Proofs

Proofs provide detailed justification for the validity of claims and are widely used in formal software development methods. However, they are often complex and difficult to understand, because they use machine-oriented formalisms; they may also be based on assumptions that are not justified. This causes concerns about the trustworthiness of using formal proofs as arguments in safety-critical applications. Here, we present an approach to develop safety cases that correspond to formal proofs found by automated theorem provers and reveal the underlying argumentation structure and top-level assumptions. We concentrate on natural deduction proofs and show how to construct the safety cases by covering the proof tree with corresponding safety case fragments.

Basir, Nurlida↗

NASA NTRS2009

Deriving Safety Cases from Machine-Generated Proofs

Basir, Nurlida↗

NASA NTRS2021

Dendroarchaeological Analysis of the Terminal Warehouse in New York City Reveals A History of Long-Distance Timber Transport During the Gilded Age

The Gilded Age of the late 19th century marked a period of rapid development and urbanization in New York City, U.S. To accommodate the high demand in wood products during that time, the timbers used for development of the city were increasingly sourced from locations distant from the northeastern United States. The Terminal Warehouse in the Chelsea neighborhood of New York City was one of many large buildings erected during this period of city expansion, and is an important symbol of New York City commerce during the late 1800s. To determine the history and provenance of timbers used in the construction of the Terminal Warehouse, we used tree-ring analysis on longleaf pine (Pinus palustris Mill.) joists that were original to the building. The ring-width patterns on the joists cross dated well internally, suggesting a common origin of the sampled lumber. Further, our Terminal Warehouse tree-ring chronology (1512–1891 C.E.) correlated strongly with existing tree-ring chronologies from western/central Georgia and eastern Alabama, indicating that the timbers were extracted from this region of the southeastern United States. The provenancing and dating of the Terminal Warehouse timbers underscores the important role that southern pines played in the expansion and development of New York City during the Gilded Age.

Dendroprovenance↗