Search NASA⌕ Search

SEARCH · Search NASA

Results for “directed graphs”

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 415 records · Page 23

Optical study of charge exchange collisions between He+ and CO2.

Helium ions were produced in an electron bombardment ion source and directed into a gas cell containing carbon dioxide. A Wien filter placed between the ion source and the gas cell insured that only singly charged helium ions reached the cell. The spectrum obtained for the bombardment of carbon dioxide with the helium ions at 1200 eV is shown in a graph. Prominent features of the lower spectrum are two atomic lines at 3889 and 4471 A.

Coplan, M. A.↗

Power Flow Geometry and Approximation

Here, the power flow equations are important in numerous power systems problems of practical interest which consider alternating current power flow (ACPF) physics. Perhaps the most well studied being the alternating current optimal power flow problem (ACOPF), seeking to optimize the operation of an electric power system. Due to their non-linearity, problems which include the power flow equations are typically challenging, particularly in optimization. Interestingly, the set of solutions to the power flow equations forms a smooth manifold. As a result, differential geometry can be used to describe and analyze this set of equations. This approach has proven effective in several engineering applications (e.g., solving ACOPF and analyzing the solution space boundary). Central to the success of this approach is an understanding of the power flow manifold's geometry. In this work, we develop the geometric and topological properties of this manifold using concepts from differential geometry. After demonstrating the convenience of this manifold's representation as a function's graph, computational methods are emphasized: we develop retractions, error bounds for linear approximation, and formulas for evaluating the Riemannian metric (including associated objects such as geodesics and the curvature tensor). Scalar curvature and the second fundamental form play a new role in quantifying the quality of linear approximations, like the popular direct current approximation. All functions are implemented in Julia and available in an online repository. Proofs are included for completeness.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stability analysis of spacecraft power systems

The problems in applying standard electric utility models, analyses, and algorithms to the study of the stability of spacecraft power conditioning and distribution systems are discussed. Both single-phase and three-phase systems are considered. Of particular concern are the load and generator models that are used in terrestrial power system studies, as well as the standard assumptions of load and topological balance that lead to the use of the positive sequence network. The standard assumptions regarding relative speeds of subsystem dynamic responses that are made in the classical transient stability algorithm, which forms the backbone of utility-based studies, are examined. The applicability of these assumptions to a spacecraft power system stability study is discussed in detail. In addition to the classical indirect method, the applicability of Liapunov's direct methods to the stability determination of spacecraft power systems is discussed. It is pointed out that while the proposed method uses a solution process similar to the classical algorithm, the models used for the sources, loads, and networks are, in general, more accurate. Some preliminary results are given for a linear-graph, state-variable-based modeling approach to the study of the stability of space-based power distribution networks.

Halpin, S. M.↗

Automatic Data Distribution for CFD Applications on Structured Grids

Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAPT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAPT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.

Frumkin, Michael↗

Automatic Data Distribution for CFD Applications on Structured Grids

Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAFT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAFT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.

Frumkin, Michael↗

Graph characterization of higher-order structure in atmospheric chemical reaction mechanisms

Atmospheric chemical reactions play an important role in air quality and climate change. While the structure and dynamics of individual chemical reactions are fairly well understood, the emergent properties of the entire atmospheric chemical system, which can involve many different species that participate in many different reactions, are not well described. In this work, we leverage graph-theoretic techniques to characterize patterns of interaction (“motifs”) in three different representations of gas-phase atmospheric chemistry, termed “chemical mechanisms.” These widely used mechanisms, the master chemical mechanism, the GEOS-Chem mechanism, and the Super-Fast mechanism, vary dramatically in scale and application, but they all generally aim to simulate the abundance and variability of chemical species in the atmosphere. This motif analysis quantifies the fundamental patterns of interaction within the mechanisms, which are directly related to their construction. For example, the gas-phase chemistry in the very small Super-Fast mechanism is entirely composed of bimolecular reactions, and its motif distribution matches that of an individual bimolecular reaction well. The larger and more complex mechanisms show emergent motif distributions that differ strongly from any specific reaction type, consistent with their complexity. The proposed motif analysis demonstrates that while these mechanisms all have a similar design goal, their higher-order structure of interactions differs strongly and thus provides a novel set of tools for exploring differences across chemical mechanisms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗

Learning Distribution Grid Topologies: A Tutorial

Unveiling feeder topologies from data is of paramount importance to advance situational awareness and proper utilization of smart resources in power distribution grids. This tutorial summarizes, contrasts, and establishes useful links between recent works on topology identification and detection schemes that have been proposed for power distribution grids. The primary focus is to highlight methods that overcome the limited availability of measurement devices in distribution grids, while enhancing topology estimates using conservation laws of power-flow physics and structural properties of feeders. Grid data from phasor measurement units or smart meters can be collected either passively in the traditional way, or actively, upon actuating grid resources and measuring the feeder's voltage response. Analytical claims on feeder identifiability and detectability are reviewed under disparate meter placement scenarios. Such topology learning claims can be attained exactly or approximately so via algorithmic solutions with various levels of computational complexity, ranging from least-squares fits to convex optimization problems, and from polynomial-time searches over graphs to mixed-integer programs. Although the emphasis is on radial single-phase feeders, extensions to meshed and/or multiphase circuits are sometimes possible and discussed. Here this tutorial aspires to provide researchers and engineers with knowledge of the current state-of-the-art in tractable distribution grid learning and insights into future directions of work.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Automatic Calibration and Health Monitoring of Infrastructure Sensors

Smart transportation infrastructure relies on networks of heterogeneous sensors - cameras, radars, and lidars - continuously monitoring traffic conditions. However, executing the initial spatial calibration of multiple sensors and the subsequent health monitoring presents significant operational challenges. Environmental factors, mechanical vibrations, and gradual drift cause spatial misalignment, degrading fusion performance and tracking accuracy. Traditional calibration approaches require manual intervention with specialized targets or survey equipment, resulting in service interruptions and high maintenance costs. This work presents an automated framework for initial calibration and continuous health monitoring without human intervention or service disruption. Our approach addresses two critical problems: (1) detecting when sensors become miscalibrated during operation, and (2) automatically re-establishing spatial alignment using only operational traffic data. The health monitoring component analyzes measurement innovations - differences between sensor observations and predicted object states - to detect systematic biases indicative of calibration drift. By computing bias magnitude, directional consistency, and rejection rates, the system identifies miscalibrations as small as 0.5 meters. Unlike traditional methods requiring known calibration targets, our diagnostic operates continuously on live traffic observations, enabling early detection before fusion quality degrades. The automatic recalibration algorithm leverages overlapping sensor fields-of-view and temporal correlation of vehicle observations. Using graph-based optimization, the system automatically discovers which sensor pairs observe common regions, estimates pairwise spatial transformations using RANSAC-based robust estimation, and jointly optimizes all sensor poses through bundle adjustment. The framework handles practical deployment challenges, including different sensor sampling rates (1-10 Hz), varying installation positions, unknown orientations, and limited overlap regions (>10%). When approximate sensor positions are available from installation surveys (+/-1m accuracy), the algorithm additionally estimates sensor orientations, refining both position and rotation to sub-meter and sub-degree accuracy. We validate the framework on multi-hour traffic datasets from six heterogeneous sensors with sampling rates ranging from 1 Hz to 10 Hz. Results demonstrate successful calibration even with sparse overlap (<20%) and automatic detection of miscalibrations exceeding 0.8 meters. This work enables a "deploy-and-forget" sensor infrastructure that maintains calibration autonomously, reducing maintenance costs while improving tracking accuracy. The techniques generalize beyond transportation to any multi-sensor monitoring application requiring robust spatial alignment, including smart cities, industrial monitoring, and surveillance systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Elastic constants for superplastically formed/diffusion-bonded sandwich structures

Formulae and the associated graphs are presented for contrasting the effective elastic constants for a superplastically formed/diffusion-bonded (SPF/DB) corrugated sandwich core and a honeycomb sandwich core. The results used in the comparison of the structural properties of the two types of sandwich cores are under conditions of equal sandwich density. It was found that the stiffness in the thickness direction of the optimum SPF/DB corrugated core (i.e., triangular truss core) was lower than that of the honeycomb core, and that the former had higher transverse shear stiffness than the latter.

Ko, W. L.↗

Integrated controls-structures optimization of a large space structure

A technique for the simultaneous optimization of structural and control elements of a large space structure is developed and demonstrated for a test problem, the NASA COFS-I Mast Flight System. General-purpose control and structural-analysis codes are applied directly to a large detailed model, with realistic objective and constraint functions. The steps in the process (structural optimization, control optimization, and system coordination) are described and illustrated with diagrams; the numerical implementation (using different computers for different steps) is discussed; and results showing significant design improvements in three COFS-I configurations are presented in graphs. When the weights of both structure and power-generating equipment are taken into account, a 40-bay truss design is found to be better than designs with 42 or 44 bays.

Padula, Sharon L.↗

Global bases for nonplanar loop integrands, generalized unitarity, and the double copy to all loop orders

We introduce a constructive method for defining a global loop-integrand basis for scattering amplitudes, encompassing both planar and nonplanar contributions. Our approach utilizes a graph-based framework to establish a well-defined, non-redundant basis of integrands. This basis, constructed from a chosen set of non-redundant graphs together with a selection of irreducible scalar products, provides clear insights into various physical properties of scattering amplitudes and proves useful in multiple contexts, such as on-shell Ward identities and manifesting gauge-choice independence. A key advantage of our integrand basis is its ability to streamline the generalized unitarity method. Specifically, we can directly read off the coefficients of basis elements without resorting to ansätze or solving linear equations. This novel approach allows us to lift generalized unitarity cuts — expressed as products of tree amplitudes — to loop-level integrands, facilitating the use of the tree-level double copy to generate complete gravitational integrands at any loop order. This method circumvents the difficulties in identifying complete higher-loop-order gauge-theory integrands that adhere to the color-kinematics duality. Additionally, our cut-based organization is well-suited for expansion in hard or soft limits, aiding in the exploration of ultraviolet or classical limits of scattering amplitudes.

Effective Field Theories↗

Some aerodynamic considerations for advanced aircraft configurations

Recent NASA wind-tunnel investigations of advanced unconventional configurations are surveyed, with an emphasis on those applicable to general-aviation aircraft. Photographs of typical models and graphs of aerodynamic parameters are provided. The designs discussed include aft installation of tractor or pusher-propellor engines; forward-swept wings; canards; combinations of canard, wing, and horizontal tail; and propeller-over-the-wing configurations. Consideration is given to canard-wing flow-field interactions, natural laminar flow, the choice of canard airfoil, directional stability and control, and propulsion-system location.

Williams, L. J.↗

Spatio-Temporal Video Segmentation with Shape Growth or Shrinkage Constraint

We propose a new method for joint segmentation of monotonously growing or shrinking shapes in a time sequence of noisy images. The task of segmenting the image time series is expressed as an optimization problem using the spatio-temporal graph of pixels, in which we are able to impose the constraint of shape growth or of shrinkage by introducing monodirectional infinite links connecting pixels at the same spatial locations in successive image frames. The globally optimal solution is computed with a graph cut. The performance of the proposed method is validated on three applications: segmentation of melting sea ice floes and of growing burned areas from time series of 2D satellite images, and segmentation of a growing brain tumor from sequences of 3D medical scans. In the latter application, we impose an additional intersequences inclusion constraint by adding directed infinite links between pixels of dependent image structures.

Segmentation↗

PersGNN: Applying Topological Data Analysis and Geometric Deep Learning to Structure-Based Protein Function Prediction

Understanding protein structure-function relationships is a key challenge in computational biology, with applications across the biotechnology and pharmaceutical industries. While it is known that protein structure directly impacts protein function, many functional prediction tasks use only protein sequence. In this work, we isolate protein structure to make functional annotations for proteins in the Protein Data Bank in order to study the expressiveness of different structure-based prediction schemes. We present PersGNN - an end-to-end trainable deep learning model that combines graph representation learning with topological data analysis to capture a complex set of both local and global structural features. While variations of these techniques have been successfully applied to proteins before, we demonstrate that our hybridized approach, PersGNN, outperforms either method on its own as well as a baseline neural network that learns from the same information. PersGNN achieves a 9.3% boost in area under the precision recall curve (AUPR) compared to the best individual model, as well as high F1 scores across different gene ontology categories, indicating the transferability of this approach.

Swenson, Nicolas↗

Analysis of simulated measurements of earth emitted radiation using geometric shape factors, and some results from analysis of ESSA 7 and Nimbus 6 data

In the reported study, simulated measurements of earth radiation with wide field-of-view (WFOV) radiometers are reduced to earth fluxes through geometric shape factors. Estimates of emitted flux for global and zonal scales and for regions smaller than the detector field-of-view are compared to fluxes derived directly from a model. Geometric shape factors are used to estimate global, zonal, and regional averages of earth-emitted flux from measurements with WFOV detectors on the ESSA 7 satellite and the Nimbus 6 satellite. Zonal and global averages of emitted flux for each of the 3-month periods of ESSA 7 data are shown in a graph. Another graph shows zonal and global averages of emitted flux for August 1975 obtained with the aid of Nimbus 6. The data are compared to values reported by Green and Smith (1977) who used a spherical harmonic solution.

Weaver, W. L.↗

Semi-supervised graph neural networks for pileup noise removal

Abstract The high instantaneous luminosity of the CERN Large Hadron Collider leads to multiple proton–proton interactions in the same or nearby bunch crossings (pileup). Advanced pileup mitigation algorithms are designed to remove this noise from pileup particles and improve the performance of crucial physics observables. This study implements a semi-supervised graph neural network for particle-level pileup noise removal, by identifying individual particles produced from pileup. The graph neural network is firstly trained on charged particles with known labels, which can be obtained from detector measurements on data or simulation, and then inferred on neutral particles for which such labels are missing. This semi-supervised approach does not depend on the neutral particle pileup label information from simulation, and thus allows us to perform training directly on experimental data. The performance of this approach is found to be consistently better than widely-used domain algorithms and comparable to the fully-supervised training using simulation truth information. The study serves as the first attempt at applying semi-supervised learning techniques to pileup mitigation, and opens up a new direction of fully data-driven machine learning pileup mitigation studies.

43 PARTICLE ACCELERATORS↗

Heat flow experiment

The heat flow experiment conducted during the Apollo 17 flight in the Taurus-Littrow area of the moon is discussed. The concept of the experiment is based on the direct measurement of the vertical flow of heat through the regolith. The measurement is made far enough below the surface so that the time-varying heat flow resulting from the very large diurnal variations of the surface temperature is small as compared with the flow from the interior. The equipment used for the experiment is described and illustrated. Graphs are developed to present the results of heat flow and surface temperature measurements.

Langseth, M. G., Jr.↗