Search NASA⌕ Search

SEARCH · Search NASA

Results for “Constructive Tree”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Algorithmic Patterns for $$\mathcal {H}$$-Matrices on Many-Core Processors

In this work, we consider the reformulation of hierarchical ( \(\mathcal {H}\) ) matrix algorithms for many-core processors with a model implementation on graphics processing units (GPUs). \(\mathcal {H}\) matrices approximate specific dense matrices, e.g., from discretized integral equations or kernel ridge regression, leading to log-linear time complexity in dense matrix–vector products. The parallelization of \(\mathcal {H}\) matrix operations on many-core processors is difficult due to the complex nature of the underlying algorithms. While previous algorithmic advances for many-core hardware focused on accelerating existing \(\mathcal {H}\) matrix CPU implementations by many-core processors, we here aim at totally relying on that processor type. As main contribution, we introduce the necessary parallel algorithmic patterns allowing to map the full \(\mathcal {H}\) matrix construction and the fast matrix–vector product to many-core hardware. In this work, crucial ingredients are space filling curves, parallel tree traversal and batching of linear algebra operations. The resulting model GPU implementation hmglib is the, to the best of the authors knowledge, first entirely GPU-based Open Source \(\mathcal {H}\) matrix library of this kind. We investigate application examples as present in kernel ridge regression, Gaussian Process Regression and kernel-based interpolation. In this context, an in-depth performance analysis and a comparative performance study against a standard multi-core CPU \(\mathcal {H}\) matrix library highlights profound speedups of our many-core parallel approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Learning the stable and metastable phase diagram to accelerate the discovery of metastable phases of boron

Boron, an element of captivating chemical intricacy, has been surrounded by controversies ever since its discovery in 1808. The complexities of boron stem from its unique position between metals and insulators in the Periodic Table. Recent computational studies have shed light on some of the stable boron allotropes. However, the demand for multifunctionality necessitates the need to go beyond the stable phases into the realm of metastability and explore the potentially vast but elusive metastable phases of boron. Traditional search for stable phases of materials has focused on identifying materials with the lowest enthalpy. Here, we introduce a workflow that uses reinforcement learning coupled with decision trees, such as Monte Carlo tree search, to search for stable and metastable boron phases, with enthalpy as the objective. We discover new boron metastable phases and construct a phase diagram that locates their phase space (T, P) at different levels of metastability (ΔG) from the ground state and provides useful information on the domains of relative stability of the various stable and metastable boron phases.

42 ENGINEERING↗
NASA NTRS2012

Utilizing NASA Earth Observing System (EOS) Data to Determine Ideal Planting Locations for Wetland Tree Species in St. Bernard Parish, Louisiana

St. Bernard Parish, in southeast Louisiana, is rapidly losing coastal forests and wetlands due to a combination of natural and anthropogenic disturbances (e.g. subsidence, saltwater intrusion, low sedimentation, nutrient deficiency, herbivory, canal dredging, levee construction, spread of invasive species, etc.). After Hurricane Katrina severely impacted the area in 2005, multiple Non-Governmental Organizations (NGOs) have worked not only on rebuilding destroyed dwellings, but on rebuilding the ecosystems that once protected the citizens of St. Bernard Parish. Volunteer groups, NGOs, and government entities often work separately and independently of each other and use different sets of information to choose the best planting sites for coastal forests. Using NASA EOS, NRCS soil surveys, and ancillary road and canal data in conjunction with ground truthing, the team created maps of optimal planting sites for several species of wetland trees to aid in unifying these organizations, who share a common goal, under one plan. The methodology for this project created a comprehensive Geographic Information System (GIS) to help identify suitable planting sites in St. Bernard Parish. This included supplementing existing elevation data using LIDAR data and classifying existing land cover in the study area from ASTER multispectral satellite data. Low altitude AVIRIS hyperspectral imagery was used to assess the health of vegetation over an area near the intersection of the Mississippi River Gulf Outlet Canal (MRGO) and Bayou la Loutre. Historic extent of coastal forests was mapped using aerial photos from USGS collected between 1952 and 1956. The final products demonstrated the utility of combining NASA EOS with other geospatial data in assessing, monitoring, and restoring of coastal ecosystems in Louisiana. This methodology also provides a useful template for other ecological forecasting and coastal restoration applications.

Reahard, Ross↗
NASA NTRS1997

Pentium Pro inside: A treecode at 430 Gigaflops on ASCI Red - 1

As an entry for the 1997 Gordon Bell performance prize, we present results from two methods of solving the gravitational N-body problem on the Intel Teraflops system at Sandia National Laboratory (ASCI Red). The first method, an O(N2) algorithm, obtained 635 Gigaflops for a 1 million particle problem on 6800 Pentium Pro processors. The second solution method, a tree-code which scales as O(N log N), sustained 170 Gigaflops over a continuous 9.4 hour period on 4096 processors, integrating the motion of 322 million mutually interacting particles in a cosmology simulation, while saving over 100 Gigabytes of raw data. Additionally, the tree-code sustained 430 Gigaflops on 6800 processors for the first 5 time-steps of that simulation. This tree-code solution is approximately 105 times more efficient than the O(N2) algorithm for this problem. As an entry for the 1997 Gordon Bell price/performance prize, we present two calculations from the disciplines of astrophysics and fluid dynamics. The simulations were performed on two 16 Pentium Pro processor Beowulf-class computers (Loki and Hyglac) constructed entirely from commodity personal computer technology, at a cost of roughly $50k each in September, 1996. The price of an equivalent system in August 1997 is less than $30. At Los Alamos, Loki performed a gravitational tree-code N-body simulation of galaxy formation using 9.75 million particles, which sustained an average of 879 Mflops over a ten day period, and produced roughly 10 Gbytes of raw data.

Warren, M. S.↗
DOE OSTI2020

Contrasting responses to climate change at Himalayan treelines revealed by population demographics of two dominant species

Abstract Alpine treelines are expected to shift upward due to recent climate change. However, interpretation of changes in montane systems has been problematic because effects of climate change are frequently confounded with those of land use changes. The eastern Himalaya, particularly Langtang National Park, Central Nepal, has been relatively undisturbed for centuries and thus presents an opportunity for studying climate change impacts on alpine treeline uncontaminated by potential confounding factors. We studied two dominant species, Abies spectabilis (AS) and Rhododendron campanulatum (RC) , above and below the treeline on two mountains. We constructed 13 transects, each spanning up to 400 m in elevation, in which we recorded height and state (dead or alive) of all trees, as well as slope, aspect, canopy density, and measures of anthropogenic and animal disturbance. All size classes of RC plants had lower mortality above treeline than below it, and young RC plants (<2 m tall) were at higher density above treeline than below. AS shows little evidence of a position change from the historic treeline, with a sudden extreme drop in density above treeline compared to below. Recruitment, as measured by size–class distribution, was greater above treeline than below for both species but AS is confined to ~25 m above treeline whereas RC is luxuriantly growing up to 200 m above treeline. Synthesis . Evidence suggests that the elevational limits of RC have shifted upward both because (a) young plants above treeline benefited from facilitation of recruitment by surrounding vegetation, allowing upward expansion of recruitment, and (b) temperature amelioration to mature plants increased adult survival. We predict that the current pure stand of RC growing above treeline will be colonized by AS that will, in turn, outshade and eventually relegate RC to be a minor component of the community, as is the current situation below the treeline.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

On the differential representation and color-kinematics duality of AdS boundary correlators

The AdS boundary correlators and their dual correlation functions of boundary operators have been the main dynamic observables of the holographic duality relating a bulk AdS theory and a boundary conformal field theory. We show that tree-level AdS boundary correlators for generic states can be expressed as nonlocal differential operators of a certain structure acting on contact Witten diagrams. We further write the boundary correlators in a form that is very similar to flat space amplitudes, with Mandelstam variables replaced by certain combinations of single-state conformal generators, prove that all tree-level AdS boundary correlators have a differential representation, and detail the conversion of such differential expressions to position space. We illustrate the construction through the computation of the boundary correlators of scalars coupled to gluons and gravitons; when converted to position space, they reproduce known results. Color-kinematics duality and BCJ relations can be defined in analogy with their flat space counterparts, and are respected by the scalar correlators with a gluon exchange. We also discuss potential approaches to the double copy and find that its direct generalization may require nontrivial extensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Machine Learning an Ab-Initio Based Bond-Order Potential for Bismuthene

Bismuthene is a heavy 2D material whose strong spin–orbit coupling and recently observed single-element ferroelectricity have intensified interest in its structural, vibrational, and transport properties. Accurate modeling of these behaviors requires a short-range interatomic potential that can reproduce the underlying bonding physics at a fraction of the computational cost of first-principles methods. However, such a potential is currently unavailable. Here, in this work, we construct a Tersoff bond-order potential for β-bismuthene using a reinforcement-learning framework that integrates a continuous Monte Carlo Tree Search with a simplex-based local optimizer. The optimized parameter sets reproduce first-principles lattice constants, cohesive energy, the equation of state, elastic constants, and phonon dispersion. We validate the models by performing thermal-conductivity calculations and uniaxial fracture simulations our findings confirm the reliability of the resulting models across multiple thermomechanical regimes. Comparison of the three best solutions reveals how differences in pairwise interactions, angular terms, and bond-order behavior govern phonon features and mechanical responses. We demonstrate an interpretable and computationally efficient potential for bismuthene and demonstrate a general reinforcement-learning strategy for developing bond-order models in emerging 2D materials.

deformation↗
NASA NTRS1988

Solutions to time variant problems of real-time expert systems

Real-time expert systems for monitoring and control are driven by input data which changes with time. One of the subtle problems of this field is the propagation of time variant problems from rule to rule. This propagation problem is even complicated under a multiprogramming environment where the expert system may issue test commands to the system to get data and to access time consuming devices to retrieve data for concurrent reasoning. Two approaches are used to handle the flood of input data. Snapshots can be taken to freeze the system from time to time. The expert system treats the system as a stationary one and traces changes by comparing consecutive snapshots. In the other approach, when an input is available, the rules associated with it are evaluated. For both approaches, if the premise condition of a fired rule is changed to being false, the downstream rules should be deactivated. If the status change is due to disappearance of a transient problem, actions taken by the fired downstream rules which are no longer true may need to be undone. If a downstream rule is being evaluated, it should not be fired. Three mechanisms for solving this problem are discussed: tracing, backward checking, and censor setting. In the forward tracing mechanism, when the premise conditions of a fired rule become false, the premise conditions of downstream rules which have been fired or are being evaluated due to the firing of that rule are reevaluated. A tree with its root at the rule being deactivated is traversed. In the backward checking mechanism, when a rule is being fired, the expert system checks back on the premise conditions of the upstream rules that result in evaluation of the rule to see whether it should be fired. The root of the tree being traversed is the rule being fired. In the censor setting mechanism, when a rule is to be evaluated, a censor is constructed based on the premise conditions of the upstream rules and the censor is evaluated just before the rule is fired. Unlike the backward checking mechanism, this one does not search the upstream rules. This paper explores the details of implementation of the three mechanisms.

Yeh, Show-Way↗
NASA NTRS2023

Procedure Automation Rating Matrix

The National Aeronautics and Space Administration (NASA) Advanced Air Mobility (AAM) National Campaign (NC) is researching the means by which future Urban Air Mobility (UAM) aircraft will operate safely in an integrated and scalable airspace architecture. Consistent with this objective, the NASA NC Airspace Procedures team designed a matrix to evaluate UAM instrument flight procedure design, flyability and interoperability of candidate departure, enroute, and approach architectures in live flight or simulation. The Procedure Automation Rating Matrix (PARM) is a multi-dimensional rating scale designed to provide direct feedback from test pilots and operators to airspace procedure designers developing airspace constructs for the integration and scalability of AAM operations in the National Airspace System (NAS). The PARM is assessed using a hierarchical decision tree that guides the operator through a ten-point alpha-numeric rating scale initiated either with or without the use of automation.

National Campaign↗
DOE OSTI2022

2022 Swainson Hawk Summary Report

This summary report, prepared by Condor Country Consulting Inc. (CCCI), covers all construction monitoring of the Swainson’s hawk (Buteo swainsoni, SWHA) nest that occurred from April 2022 to July 2022 at the Sandia National Laboratories, California (SNL/CA). SNL/CA personnel first observed the SWHA pair near the pine tree along East Avenue that contained last year’s nest on April 19th, 2022. SWHA are a threatened species in the state of California and require a quarter-mile non-disturbance buffer. SNL/CA received approval from the California Department of Fish and Wildlife (CDFW) to continue work within the buffer area with a biological monitor on site to observe the SWHA for construction related disturbances. Monitoring began on April 20th, 2022 and concluded on July 1st, 2022.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2025

Strong CP and flavor in multi-Higgs theories

We introduce a class of multi-Higgs doublet extensions of the Standard Model that solve the strong problem with profound consequences for the flavor sector. The Yukawa matrices are constrained to have many zero entries by a “Higgs-flavor” symmetry, , that acts on Higgs and quark fields. The violation of both and occurs in the Higgs mass matrix so that, for certain choices of charges, the strong parameter is zero at tree level. Radiative corrections to are computed in this class of theories. They vanish in realistic two-Higgs doublet models with . We also construct realistic three-Higgs models with , where the one-loop results for are model-dependent. Requiring has important implications for the flavor problem by constraining the Yukawa coupling and Higgs mass matrices. Contributions to from higher-dimension operators are computed at one loop and can also be sufficiently small, although the hierarchy problem of this class of theories is worse than in the Standard Model.

Hall, Lawrence↗
NASA NTRS1986

Learned pattern recognition using synthetic-discriminant-functions

A method of using synthetic-discriminant-functions to facilitate learning in a pattern recognition system is discussed. Learning is accomplished by continually adding images to the training set used for synthetic discriminant functions (SDF) construction. Object identification is performed by efficiently searching a library of SDF filters for the maximum optical correlation. Two library structures are discussed - binary tree and multilinked graph - along with maximum ascent, back-tracking, perturbation, and simulated annealing searching techniques. By incorporating the distortion invariant properties of SDFs within a library structure, a robust pattern recognition system can be produced.

Jared, David A.↗
DOE OSTI2020

Scattering equations in AdS: scalar correlators in arbitrary dimensions

We introduce a bosonic ambitwistor string theory in AdS space. Even though the theory is anomalous at the quantum level, one can nevertheless use it in the classical limit to derive a novel formula for correlation functions of boundary CFT operators in arbitrary space-time dimensions. The resulting construction can be treated as a natural extension of the CHY formalism for the flat-space S-matrix, as it similarly expresses tree-level amplitudes in AdS as integrals over the moduli space of Riemann spheres with punctures. These integrals localize on an operator-valued version of scattering equations, which we derive directly from the ambitwistor string action on a coset manifold. As a testing ground for this formalism we focus on the simplest case of ambitwistor string coupled to two cur- rent algebras, which gives bi-adjoint scalar correlators in AdS. In order to evaluate them directly, we make use of a series of contour deformations on the moduli space of punctured Riemann spheres and check that the result agrees with tree level Witten diagram computations to all multiplicity. We also initiate the study of eigenfunctions of scattering equations in AdS, which interpolate between conformal partial waves in different OPE channels, and point out a connection to an elliptic deformation of the Calogero-Sutherland model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

The SAGEX review on scattering amplitudes Chapter 2: An invitation to color-kinematics duality and the double copy

Abstract Advances in scattering amplitudes have exposed previously-hidden color-kinematics and double-copy structures in theories ranging from gauge and gravity theories to effective field theories such as chiral perturbation theory and the Born–Infeld model. These novel structures both simplify higher-order calculations and pose tantalizing questions related to a unified framework underlying relativistic quantum theories. This introductory mini-review article invites further exploration of these topics. After a brief introduction to color-kinematics duality and the double copy as they emerge at tree and loop-level in gauge and gravity theories, we present two distinct examples: (1) an introduction to the web of double-copy-constructible theories, and (2) a discussion of the application of the double copy to calculation relevant to gravitational-wave physics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1987

Comparing barrier algorithms

A barrier is a method for synchronizing a large number of concurrent computer processes. After considering some basic synchronization mechanisms, a collection of barrier algorithms with either linear or logarithmic depth are presented. A graphical model is described that profiles the execution of the barriers and other parallel programming constructs. This model shows how the interaction between the barrier algorithms and the work that they synchronize can impact their performance. One result is that logarithmic tree structured barriers show good performance when synchronizing fixed length work, while linear self-scheduled barriers show better performance when synchronizing fixed length work with an imbedded critical section. The linear barriers are better able to exploit the process skew associated with critical sections. Timing experiments, performed on an eighteen processor Flex/32 shared memory multiprocessor, that support these conclusions are detailed.

Arenstorf, Norbert S.↗
NASA NTRS1989

Comparing barrier algorithms

A barrier is a method for synchronizing a large number of concurrent computer processes. After considering some basic synchronization mechanisms, a collection of barrier algorithms with either linear or logarithmic depth are presented. A graphical model is described that profiles the execution of the barriers and other parallel programming constructs. This model shows how the interaction between the barrier algorithms and the work that they synchronize can impact their performance. One result is that logarithmic tree structured barriers show good performance when synchronizing fixed length work, while linear self-scheduled barriers show better performance when synchronizing fixed length work with an imbedded critical section. The linear barriers are better able to exploit the process skew associated with critical sections. Timing experiments, performed on an eighteen processor Flex/32 shared memory multiprocessor that support these conclusions, are detailed.

Arenstorf, Norbert S.↗