Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “difference 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 307 records · Page 17

Topology-Dependent Performance of Free-Space Photonic Quantum Networks Under Noise

Photonic quantum communication enables secure and high-fidelity information transfer beyond classical limits, with direct relevance to emerging quantum networks operating in free-space environments. While physical-layer models of depolarizing noise, Gamma–Gamma turbulence statistics, entanglement swapping, and decoy-state QKD security bounds are individually well established, prior work typically treats these components in isolation or under fixed network assumptions. In this work, we develop a unified topology-aware analytical framework that simultaneously integrates free-space optical link budgets, turbulence-induced visibility degradation, depolarizing qubit noise, multi-hop entanglement cascade dynamics, teleportation fidelity thresholds, CHSH nonlocality certification, and asymptotic decoy-state secret key rate bounds across star, mesh, and ring graph structures. Rather than introducing new physical channel models, we demonstrate that identical physical links exhibit fundamentally different end-to-end performance once embedded within different network topologies. Mesh architectures minimize visibility cascade through hop-count reduction but incur quadratic hardware scaling. Star topologies minimize link count but concentrate noise and synchronization overhead at the hub. Ring configurations offer linear hardware scaling with multiplicative fidelity degradation. The results establish topology as a first-order design parameter in near-term free-space quantum networks operating without full quantum repeater infrastructures. While motivated by distributed multi-agent architectures, the framework applies broadly to terrestrial, airborne, and satellite-assisted photonic quantum communication systems.

QKD↗

The effect of adiabatic focusing upon charged particle propagation in random magnetic fields

Charged particles propagating along the diverging lines of force of a spatially inhomogeneous guiding field were considered as they are scattered by random fields. Their longitudinal transport is described in terms of the eigenfunctions of a Sturm-Liouville operator incorporating the effect of adiabatic focussing along with that of scattering. The relaxation times and characteristic velocities are graphed and tabulated. The particle density is evaluated as a function of space and time for two different regimes. In the first regime (relatively weak focussing), a diffusive mode of propagation is dominant but coherent modes are also dominant. In the second regime (strong focussing), diffusion does not occur and the propagation is purely coherent. This supercoherent mode corresponds exactly to the so-called scatter-free propagation of kilovolt solar flare electrons. On a larger scale, focussed transport provides an interpretation of many observed characteristics of extragalactic radio sources.

Earl, J. A.↗

The OEOP Duties of Reasonable Accommodation

I was fortunate enough to be assigned two assignments during my ten weeks here at NASA's Langley Research Center, in the Office of Equal Opportunity Programs (OEOP). One of my projects gave me the chance to gain experience in developing calculation formulas for the EXCEL computer system, while my second project gave me the chance to put my research skills and legal knowledge to use. The function of the OEOP is to ensure the adherence to personnel policy and practices in the employment, development, advancement and treatment of Federal employees and applicants for employment. This includes veterans and disabled as well. My initial project involved the research of hiring and promotion among the different minorities and females employed here at Langley. The objective of my first project was to develop graphs that showed the number of promotions during the past five years for each minority group here on the Center. I also had to show the average number of years it took for each promotion. The objective of my second and main research project was to find and research cases regarding the reasonable accommodation of disabled workers. The research of these cases is to ensure that individuals with disabilities are provided the necessary accommodations that are essential to the function of their job.

Coppedge, Angela↗

Crew Health and Performance on Mars

The issues surrounding the health and performance on Mars of a human crew are discussed in this presentation. The work of Human Space Life Sciences Program Office (HSLSPO) in the preparation of a crew for a Martian mission is reviewed. This includes a review of issues relating to human health and performance (HHP) in space and microgravity. The Mars design reference mission requires the most rigorous life sciences critical path of any manned mission in the forseeable future. This mission will require a 30 months round trip, with 4 different transistions to different gravities, and two episodes of high gravity load, during the Mars and Earth Aerobraking exercises. A graph is presented which shows the number of subjects with human space flight experience greater than 30 days. A chart presents the physical challenges to HHP in terms of gravity and acceleration and the length of times the crew will be exposed to the various gravity loads. Another chart presents the radiation challenges to the HHP for the duration of the trip. The human element is the most complex element of the mission design. Some challenges (i.e., human engineering and life support) must be overcome, and some issues such as bone loss, and radiation exposure must be addressed prior to making a decision for a manned Martian mission.

Stegemoeller, Charlie↗

Evidence for yellow light suppression of lettuce growth

Researchers studying plant growth under different lamp types often attribute differences in growth to a blue light response. Lettuce plants were grown in six blue light treatments comprising five blue light fractions (0, 2, 6% from high-pressure sodium [HPS] lamps and 6, 12, 26% from metal halide [MH] lamps). Lettuce chlorophyll concentration, dry mass, leaf area and specific leaf area under the HPS and MH 6% blue were significantly different, suggesting wavelengths other than blue and red affected plant growth. Results were reproducible in two replicate studies at each of two photosynthetic photon fluxes, 200 and 500 mumol m-2 s-1. We graphed the data against absolute blue light, phytochrome photoequilibrium, phototropic blue, UV, red:far red, blue:red, blue: far red and 'yellow' light fraction. Only the 'yellow' wavelength range (580-600 nm) explained the differences between the two lamp types.

Non-NASA Center↗

A Test-Bed Validation of Electromagnetic Surface Wave Propagation Along a Dielectric-Coated Metal Pipe

This paper provides a summary of the results of an attempt at experimental verification of the propagation of electromagnetic surface waves at microwaves frequencies, in and along the uniform dielectric coating of a circular cylindrical metal pipe, based on the previously established theoretical investigation. These experimental results are of value for the diagnostic of anomalies on the surface of tar-coated pipes used in protecting the underground power transmission cables (feeder pipes). A test-bed was designed and implemented using an aluminum tubes (10” diameter) with an acrylic tube coating (0.25” thickness). Two identical wave launcher/receiver arrays, each of 32 elements around the tube for relatively uniform radiation/reception, were designed and fabricated at the frequency of interest (~6 GHz). This arrangement was put in a specially designed small anechoic chamber and attached to a network analyzer. A variety of tests were performed to establish the launch efficiency, prove surface wave propagation along, and reflection from different types of anomalies on the coating. In the paper, a number of test results and supporting graphs will be provided and future work for improving the performance of the launch array and the test-bed arrangement for better results will be outlined.

Gatti, Mark↗

Distributed Multi-GPU Community Detection on Exascale Computing Platforms

Community detection is a fundamental operation in graph mining, and by uncovering hidden structures and patterns within complex systems it helps solve fundamental problems pertaining to social networks, such as information diffusion, epidemics, and recommender systems. Scaling graph algorithms for massive networks becomes challenging on modern distributed-memory multi-GPU (Graphics Processing Unit) systems due to limitations such as irregular memory access patterns, load imbalances, higher communication-computation ratios, and cross-platform support. We present a novel algorithm HiPDPL-GPU (distributed parallel Louvain) to address these challenges. We conduct experiments involving different partitioning techniques to achieve optimized performance of HiPDPL-GPU on the two largest supercomputers: Frontier and Summit. Remarkably, HiPDPL-GPU processes a graph with 4.2 billion edges in less than 3 minutes using 1024 GPUs. Qualitatively performance of HiPDPL-GPU is similar or better compared to other state-of-the-art CPU- and GPU-based implementations. While prior GPU implementations have predominantly employed CUDA, our first-of-its-kind implementation for community detection is cross-platform, accommodating both AMD and NVIDIA GPUs.

graph algorithms, high performance comptuing↗

QC-GN 2 oMS 2 : a Graph Neural Net for High Resolution Mass Spectra Prediction

Predicting the mass spectrum of a molecular ion is often accomplished via three generalized approaches: rules-based methods for bond breaking, deep learning, or quantum chemical (QC) modeling. Rules-based approaches are often limited by the conditions for different chemical subspaces and perform poorly under chemical regimes with few defined rules. QC modeling is theoretically robust but requires significant amounts of computational time to produce a spectrum for a given target. Among deep learning techniques, graph neural networks (GNNs) have performed better than previous work with fingerprint-based neural networks in mass spectra prediction. To explore this technique further, we investigate the effects of including quantum chemically derived information as edge features in the GNN to increase predictive accuracy. The models we investigated include categorical bond order, bond force constants derived from extended tight-binding (xTB) quantum chemistry, and acyclic bond dissociation energies. Throughout this work, we evaluated these models against a control GNN with no edge features in the input graphs. Bond dissociation enthalpies yielded the best improvement with a cosine similarity score of 0.462 relative to the baseline model (0.437). In this work we also apply dynamic graph attention which improves performance on benchmark problems and supports the inclusion of edge features. Between implementations, we investigate the nature of the molecular embedding for spectra prediction and discuss the recognition of fragment topographies in distinct chemistries for further development in tandem mass spectrometry prediction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Resilient Integrated Resource Planning Framework for Transmission Systems: Analysis and Optimization

This article presents a resilient Integrated Resource Planning (IRP) framework designed for transmission systems, with a specific focus on analyzing and optimizing responses to High-Impact Low-Probability (HILP) events. The framework aims to improve the resilience of transmission networks in the face of extreme events by prioritizing the assessment of events with significant consequences. Unlike traditional reliability-based planning methods that average the impact of various outage durations, this work adopts a metric based on the proximity of outage lines to generators to select HILP events. The system’s baseline resilience is evaluated by calculating load curtailment in different parts of the network resulting from HILP outage events. The transmission network is represented as an undirected graph. Graph-theoretic techniques are used to identify islands with or without generators, potentially forming segmented grids or microgrids. This article introduces Expected Load Curtailment (ELC) as a metric to quantify the system’s resilience. The framework allows for the re-evaluation of system resilience by integrating additional generating resources to achieve desired resilience levels. Optimization is performed in the re-evaluation stage to determine the optimal placement of distributed energy resources (DERs) for enhancing resilience, i.e., minimizing ELC. Case studies on the IEEE 24-bus system illustrate the effectiveness of the proposed framework. In the broader context, this resilient IRP framework aligns with energy sustainability goals by promoting robust and resilient transmission networks, as the optimal placement of DERs for resilience enhancement not only strengthens the system’s ability to withstand and recover from disruptions but also contributes to efficient resource utilization, advancing the overarching goal of energy sustainability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Frequency modulation television analysis: Distortion analysis

Computer simulation is used to calculate the time-domain waveform of standard T-pulse-and-bar test signal distorted in passing through an FM television system. The simulator includes flat or preemphasized systems and requires specification of the RF predetection filter characteristics. The predetection filters are modeled with frequency-symmetric Chebyshev (0.1-db ripple) and Butterworth filters. The computer was used to calculate distorted output signals for sixty-four different specified systems, and the output waveforms are plotted for all sixty-four. Comparison of the plotted graphs indicates that a Chebyshev predetection filter of four poles causes slightly more signal distortion than a corresponding Butterworth filter and the signal distortion increases as the number of poles increases. An increase in the peak deviation also increases signal distortion. Distortion also increases with the addition of preemphasis.

Hodge, W. H.↗

Blast wave in a nozzle for propulsive applications

The reported investigation has been conducted in connection with studies concerning the development of a propulsion system based on the use of a detonating fluid propellant. Measurements have been made of the pressure and shock wave velocity in a conical nozzle at various ambient pressures and at an ambient temperature of 25 C. In the experiments a small amount of explosive was placed at the end wall of a conical aluminum nozzle and detonated by a microdetonator inside the nozzle. Differences regarding the characteristics of conventional chemical propulsion and detonation propulsion are illustrated with the aid of a graph. One- and two-dimensional numerical flow calculations were performed and compared with the experimental data.

Varsi, G.↗

Unsteady transonic airfoil computation using the integral solution of full-potential equation

The shock-capturing integral-equation scheme developed by Kandil and Hu (1987) for the analysis of steady transonic flow over airfoils is extended to the unsteady case. The full potential formulation of the governing equations is reviewed; the solution method is outlined; and results for a NACA 0012 airfoil in forced pitching oscillation at Mach 0.755 are presented in extensive graphs and briefly characterized. The present technique is shown to require significantly less computation time than finite-difference or finite-volume methods, and to give shock-motion predictions in good agreement with those of an implicit finite-volume Euler solver; the surface-pressure peaks are slightly underpredicted.

Kandil, O. A.↗

Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the shortest route updates the edges in its path.

Alena, Richard I.↗

Distributed Multi-GPU Community Detection on Exascale Computing Platforms

Community detection is a fundamental operation in graph mining, and by uncovering hidden structures and patterns within complex systems it helps solve fundamental problems pertaining to social networks, such as information diffusion, epidemics, and recommender systems. Scaling graph algorithms for massive networks becomes challenging on modern distributed-memory multi-GPU (Graphics Processing Unit) systems due to limitations such as irregular memory access patterns, load imbalances, higher communication-computation ratios, and cross-platform support. We present a novel algorithm HiPDPL-GPU (Distributed Parallel Louvain) to address these challenges. We conduct experiments involving different partitioning techniques to achieve an optimized performance of HiPDPL-GPU on the two largest supercomputers: Frontier and Summit. Remarkably, HiPDPL-GPU processes a graph with 4.2 billion edges in less than 3 minutes using 1024 GPUs. Qualitatively, the performance of HiPDPL-GPU is similar or better compared to other state-of-the-art CPU- and GPU-based implementations. While prior GPU implementations have predominantly employed CUDA, our first-of-its-kind implementation for community detection is cross-platform, accommodating both AMD and NVIDIA GPUs.

Sattar, Naw Safrin↗

Using Correlation to Compute Better Probability Estimates in Plan Graphs

Plan graphs are commonly used in planning to help compute heuristic "distance" estimates between states and goals. A few authors have also attempted to use plan graphs in probabilistic planning to compute estimates of the probability that propositions can be achieved and actions can be performed. This is done by propagating probability information forward through the plan graph from the initial conditions through each possible action to the action effects, and hence to the propositions at the next layer of the plan graph. The problem with these calculations is that they make very strong independence assumptions - in particular, they usually assume that the preconditions for each action are independent of each other. This can lead to gross overestimates in probability when the plans for those preconditions interfere with each other. It can also lead to gross underestimates of probability when there is synergy between the plans for two or more preconditions. In this paper we introduce a notion of the binary correlation between two propositions and actions within a plan graph, show how to propagate this information within a plan graph, and show how this improves probability estimates for planning. This notion of correlation can be thought of as a continuous generalization of the notion of mutual exclusion (mutex) often used in plan graphs. At one extreme (correlation=0) two propositions or actions are completely mutex. With correlation = 1, two propositions or actions are independent, and with correlation > 1, two propositions or actions are synergistic. Intermediate values can and do occur indicating different degrees to which propositions and action interfere or are synergistic. We compare this approach with another recent approach by Bryce that computes probability estimates using Monte Carlo simulation of possible worlds in plan graphs.

Bryce, Daniel↗

Community detection robustness of graph neural networks

Graph neural networks (GNNs) are increasingly widely used for community detection in attributed networks. They combine structural topology with node attributes through message passing and pooling. However, their robustness or lack thereof with respect to different perturbations and targeted attacks in conjunction with community detection tasks is not well understood. To shed light on latent mechanisms behind GNN sensitivity on community detection tasks, we conduct a systematic computational evaluation of six widely adopted GNN architectures graph convolutional network, graph attention network, graph sample and aggregate (GraphSAGE), differentiable pooling (DiffPool), minimum cut pooling (MinCUT), and deep modularity networks (DMoN). The analysis covers three perturbation categories: node attribute manipulations, edge topology distortions, and adversarial attacks. We use element-centric similarity as the evaluation metric on synthetic benchmarks and real-world citation networks. Our findings indicate that supervised GNNs tend to achieve higher baseline accuracy, while unsupervised methods, particularly DMoN, maintain stronger resilience under targeted and adversarial perturbations. Furthermore, robustness appears to be strongly influenced by community strength, with well-defined communities reducing performance loss. Across all models, node attribute perturbations associated with targeted edge deletions and shifts in attribute distributions tend to cause the largest degradation in community recovery. These findings highlight important trade-offs between accuracy and robustness in GNN-based community detection and offer insights into selecting architectures resilient to noise and adversarial attacks.

Goel, Jaidev [Virginia Polytechnic Inst. and State↗

Enabling Efficient Sparse Computations using Linear Algebra Aware Compilers

This project developed the LAPIS compiler framework, built on the Multilevel Intermediate Representation (MLIR), to optimize sparse linear algebra operations and support performance portability across diverse architectures. The main innovation of LAPIS is the Kokkos dialect, which allows for lowering codes from a high productivity language to different architectures in an elegant way. The dialect also allows the conversion of lower-level MLIR code to C++ Kokkos code, facilitating the integration of scientific machine learning (SciML) models into applications. To extend LAPIS for distributed memory architectures, a new partition dialect was created to manage the distribution of sparse tensors and express communication patterns for sparse linear algebra operations. This dialect also supports the distributed execution of operators and includes algorithmic optimizations to minimize communication to improve performance. The project also demonstrates that MLIR can enable effective linear algebra-level optimizations, improving performance on different GPUs for both sparse and dense linear algebra kernels. Key applications of LAPIS include sparse linear algebra and graph kernels, TenSQL, a relational database management solution built on GraphBLAS, and the development of subgraph isomorphism and monomorphism kernels, showcasing performance portability. In summary, the LAPIS framework supports productivity, performance, portability, and distributed memory execution, while also enabling linear algebra-level optimizations that are challenging in traditional programming languages, with successful applications ranging from simple sparse linear algebra to complex graph kernels.

97 MATHEMATICS AND COMPUTING↗

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.↗