Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “graph states”

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 379 records · Page 21

Topology-Informed Design Rules for Deconstructable Thermoset Copolymer Networks

Existing models of thermoset deconstruction facilitated by incorporating cleavable comonomers rely on a mean-field reverse gel point paradigm, which predicts network dissolution once cleavable bonds reach a critical stoichiometric threshold, but does not account for where those bonds reside within the network architecture. Using reactive coarse-grained molecular dynamics simulations coupled with graph-theoretic analysis, we extend this stoichiometric picture to show that deconstructability is governed by the curing-imprinted network topology rather than stoichiometry alone. This topological organization is hierarchical: at the local scale, the elastic effectiveness of cross-link junctions determines which cross-links constitute the load-bearing scaffold; at the mesoscale, the cross-linking rate kinetically templates that scaffold into topologically modular communities─densely cross-linked clusters connected by sparse bridging strands that sustain network connectivity. Using betweenness centrality to identify nodes that disproportionately lie on intercommunity shortest paths, we demonstrate that effective deconstruction of the network into macromolecular fragments requires cleavable comonomers to intercept these high-centrality bridging strands. We further find that under uniform, disassortative comonomer incorporation, this topological requirement provides a mechanistic basis for extending the reverse gel point to incorporate network topology. We also show that modularity imposes a fundamental limit on fragment uniformity that persists even when the centrality requirement is met. Finally, we demonstrate that chain stiffness provides a nearly independent lever to suppress mechanically redundant cross-links and raise the glass transition temperature without significantly altering the deconstruction outcome. Together, these findings reframe the thermoset design space around network topology and provide actionable guidelines for engineering thermoset copolymers with predictable deconstructability and targeted thermomechanical performance.

coarse-grained molecular dynamics↗

Accelerating computational fluid dynamics simulation of post-combustion carbon capture modeling with MeshGraphNets

Packed columns are commonly used in post-combustion processes to capture CO 2 emissions by providing enhanced contact area between a CO 2 -laden gas and CO 2 -absorbing solvent. To study and optimize solvent-based post-combustion carbon capture systems (CCSs), computational fluid dynamics (CFD) can be used to model the liquid–gas countercurrent flow hydrodynamics in these columns and derive key determinants of CO 2 -capture efficiency. However, the large design space of these systems hinders the application of CFD for design optimization due to its high computational cost. In contrast, data-driven modeling approaches can produce fast surrogates to study large-scale physics problems. We build our surrogates using MeshGraphNets (MGN), a graph neural network framework that efficiently learns and produces mesh-based simulations. We apply MGN to a random packed column modeled with over 160K graph nodes and a design space consisting of three key input parameters: solvent surface tension, inlet velocity, and contact angle. Our models can adapt to a wide range of these parameters and accurately predict the complex interactions within the system at rates over 1700 times faster than CFD, affirming its practicality in downstream design optimization tasks. This underscores the robustness and versatility of MGN in modeling complex fluid dynamics for large-scale CCS analyses.

97 MATHEMATICS AND COMPUTING↗

PURE: Scalable Phase Unwrapping with Spatial Redundant Arcs

Phase unwrapping is a key problem in many coherent imaging systems, such as syntheticapertureradar(SAR)interferometry. Ageneralformulationforredundant integration of finite differences for phase unwrapping (Costantini et al., 2010) was shown to produce a more reliable solution by exploiting redundant differential estimates. However, this technique requires a commercial linear programming solver for large-scale problems. For a linear cost function, we propose a method based on Dual Decomposition that breaks the given problem defined over a nonplanar graph into tractable sub-problems over planar subgraphs. We also propose a decomposition technique that exploits the underlying graph structure for solving thesub-problemsefficientlyandguaranteesasymptoticconvergencetotheglobally optimal solution. The experimental results demonstrate that the proposed approach is comparable to the existing state-of-the-art methods in terms of the estimate with a better runtime and memory footprint.

Lanka, Ravi↗

Muon capture rates on O-16 leading to bound states of N-16.

A low-energy spectrum of gamma-rays following muon capture in O-16 was obtained with a high-resolution 1 cu cm Ge(Li) detector. The graph of the spectrum shows the separation of contaminant peaks from the 120 keV N-16 line. It is pointed out that there is a large discrepancy between the capture rate obtained in the investigation and results reported by Deutsch et al. (1969).

Kane, F. R.↗

Universal Workflow Language and Software Enable Geometric Learning and FAIR Scientific Protocol Reporting

Written language and conventional data structures for representing scientific procedures suffer from low process detail, often fail to accurately represent protocols, and lack universality. New strategies for the handling of experimental data are needed to provide viable process information for both humans and machines. In this work, we present the universal workflow language (UWL) and interface (UWLi). UWL is a findable, accessible, interoperable, and reusable (FAIR)-compatible, graph-based data architecture that can capture arbitrary scientific procedures through workflow representation, and UWLi is an accompanying software package for building, manipulating, and interpreting UWL entries. The UWL format was found to be highly effective in identifying deficiencies in the reported process details of high-impact, peer-reviewed scientific journals, and in simulated scenarios, the graph format was shown to be more effective than conventional methods in predictively modeling the outcome of diverse scientific protocols. Implementation of UWL could enable more accurate scientific communication and more impactful process datasets.

14 SOLAR ENERGY↗

Recursive Gaussian Process over graphs for Integrating Multi-timescale Measurements in Low-Observable Distribution Systems

The transition to a smarter grid is empowered by enhanced sensor deployments and smart metering infrastructure in the distribution system. Measurements from these sensors and meters can be used for many applications, including distribution system state estimation (DSSE). However, these measurements are typically sampled at different rates and could be intermittent due to losses during the aggregation process. These multi timescale measurements should be reconciled in real-time to perform accurate grid monitoring. This paper tackles this problem by formulating a recursive multi-task Gaussian process (RGP-G) approach that sequentially aggregates sensor measurements. Specifically, we formulate a recursive multi-task GP with and without network connectivity information to reconcile the multi time-scale measurements in distribution systems. Here, the proposed framework is capable of aggregating the multi-time scale measurements batch-wise or in real-time. Following the aggregation of the multi time-scale measurements, the spatial states of the consistent time-series are estimated using matrix completion based DSSE approach. Simulation results on IEEE 37 and IEEE 123 bus test systems illustrate the efficiency of the proposed methods from the standpoint of both multi time-scale data aggregation and DSSE.

42 ENGINEERING↗

HydraGNN

Distributed PyTorch implementation of multi-headed graph convolutional neural networks

Lupo Pasini, Massimiliano [Oak Ridge National Lab.↗

Surface brightness profiles of 10 comets

CCD photometric observations of the comae of 10 comets, obtained at the 4-m and 2.1-m telescopes at KPNO during 1985-1986 using filters centered at 700.5, 650.0, or 546.0 nm, are reported. The data are presented in extensive tables and graphs and characterized in detail. The radial surface brightness profiles are shown to be steeper than predicted by an idealized spherically symmetric steady-state comet model, the steepness increasing with the projected distance from the nucleus. These profiles are attributed, on the basis of Monte Carlo simulations, to imperfect coupling between the sublimated gas and the optically dominant grains of the coma.

Jewitt, D. C.↗

FY 2002 Report on Software Visualization Techniques for IV and V

One of the major challenges software engineers often face in performing IV&V is developing an understanding of a system created by a development team they have not been part of. As budgets shrink and software increases in complexity, this challenge will become even greater as these software engineers face increased time and resource constraints. This research will determine which current aspects of providing this understanding (e.g., code inspections, use of control graphs, use of adjacency matrices, requirements traceability) are critical to the performing IV&V and amenable to visualization techniques. We will then develop state-of-the-art software visualization techniques to facilitate the use of these aspects to understand software and perform IV&V.

Fotta, Michael E.↗

A distributed voltage inference framework for cyber-physical attacks detection and localization in active distribution grids

The transition to active distribution grids with real-time monitoring and control depends on the proliferation of advanced communication networks and devices. This paradigm shift towards a cyber-physical architecture also introduces new vulnerabilities for adversaries to exploit and launch sophisticated cyber-physical attacks targeting grid observability. Current research highlights the challenges in distinguishing attacks on voltage phasor or nodal injection measurements and isolating multi-source attack locations in a multiphase distribution grid. The attack detection and localization methods in literature face accuracy issues, applications across diverse attack scenarios, or scalability limits. Here, to bridge these gaps, this paper proposes a distributed Voltage Inference framework for real-time detection and localization of cyber-physical attacks, addressing scalability, adaptability, and accuracy challenges in state-of-the-art methods. The proposed methodology leverages the distributed nature of the Voltage Inference framework through a two-step process of prediction and correction, together with a tractable graph partitioning approach, providing a reliable solution to identify compromised measurement sources and facilitate isolation. Extensive testing on IEEE 13 and 123-node distribution feeders underscores the algorithm’s efficacy, enhancing the security and resilience of active distribution grids against evolving cyber threats. Additionally, Hardware-in-the-Loop (HIL) implementation validates the proposed strategy’s practical applicability in real-world scenarios.

active distribution grids↗

Graph-Theoretic Approaches to Quantifying Power System Resiliency

Although gaining growing importance, the subject of power system resiliency still lacks a commonly acknowledged metric. As a contribution to solving this complication, in this paper we leverage the concepts of spanning trees and Fiedler value from graph theory to propose two topology-based indices for quantifying the resiliency of power systems. The proposed indices require least information and may be applied to any other flow network, such as water or gas pipeline networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantum simulation of hyperbolic space with circuit quantum electrodynamics: From graphs to geometry

We show how quantum many-body systems on hyperbolic lattices with nearest-neighbor hopping and local interactions can be mapped onto quantum field theories in continuous negatively curved space. Here, the underlying lattices have recently been realized experimentally with superconducting resonators and therefore allow for a table-top quantum simulation of quantum physics in curved background. Our mapping provides a computational tool to determine observables of the discrete system even for large lattices, where exact diagonalization fails. As an application and proof of principle we quantitatively reproduce the ground state energy, spectral gap, and correlation functions of the noninteracting lattice system by means of analytic formulas on the Poincaré disk, and show how conformal symmetry emerges for large lattices. This sets the stage for studying interactions and disorder on hyperbolic graphs in the future. Importantly, our analysis reveals that even relatively small discrete hyperbolic lattices emulate the continuous geometry of negatively curved space, and thus can be used to experimentally resolve fundamental open problems at the interface of interacting many-body systems, quantum field theory in curved space, and quantum gravity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Graph-based design of irregular metamaterials

In the field of metamaterial research, random structures offer a novel and less conventional approach compared to traditional periodic designs. Designing random metamaterials is challenging when it comes to ensuring intercon- nectivity, which is essential for manufacturability. This study introduces an innovative framework for generating random metamaterials using graph al- gorithms, ensuring connectivity and adaptability across various base shapes, including cylinders, triangles, pyramids, and cubes. By employing graph algorithms, our framework enhances the intuitiveness and efficiency of de- sign representation and manipulation, streamlining the design process. The framework generates families of designs that exhibit a wide range of prop- erty magnitudes that can be adjusted intuitively by modifying the input parameters. The rapid design process allows many designs to be generated, offering the user a multitude of solutions around the target property range. The designs can be effectively implemented in various fields and subjected to diverse analytical studies, including static, dynamic, and eigenfrequency assessments. We illustrate computational results for two key properties (stiff- ness and acoustic impedance), showcasing the method’s effectiveness through examples ranging from rod-based to cube-based designs. Here, the framework not only advances metamaterial research but also creates new opportunities for innovation in fields requiring customized material properties.

36 MATERIALS SCIENCE↗

pnnl/emp-gnn

Efficient Graph Neural Network for Predicting Molecular Properties software can compare the prediction quality with ab initio DFT results reported by the high-performance state-of-theart NWChem quantum chemistry package [1] through Mean Absolute Error (MAE) obtained by the fitting between DFT and model predictions i.e, MPNN [2]. We also demonstrated the performance benefits by grouping large molecules by atom sizes, and executing GNN models on different types of resources. Since the training times depend on the number of atoms, we demonstrate the impact of distributing the workloads on two GPUs with varying capabilities (e.g., NVIDIA A100 vs. GeForce RTX 2080 Ti) to optimize the efficiency. We are at the precipice of broad adoption of GNNs for molecular property prediction tasks; hence, our work is timely by comparing model prediction against classical approaches with the intent of providing initial screening for specific classes of molecules.

Lee, Hyungro↗

Certifiably Correct Range-Aided SLAM

We present the first algorithm capable of efficiently computing certifiably optimal solutions to range-aided simultaneous localization and mapping (RA-SLAM) problems. Robotic navigation systems are increasingly incorporating point-to-point ranging sensors, leading state estimation which takes the form of RA-SLAM. However, the RA-SLAM problem is more difficult to solve than traditional pose-graph SLAM; ranging sensor models introduce additional non-convexity, unlike pose-pose or pose-landmark measurements, a single range measurement does not uniquely determine the relative transform between the involved sensors, and RA-SLAM inference is highly sensitive to initial estimates. Our approach relaxes the RA-SLAM problem to a semidefinite program (SDP), which we show how to solve efficiently using the Riemannian staircase methodology. The solution of this SDP provides a high-quality initialization for our original RA-SLAM problem, which is subsequently refined via local optimization, as well as a lower-bound on the RA-SLAM problem's optimal value. Our algorithm, named certifiably correct RA-SLAM (CORA), applies to problems comprised of arbitrary pose-pose, pose-landmark, and ranging measurements. Evaluation on simulated and real-world marine examples shows that our algorithm frequently produces certifiably optimal RA-SLAM solutions; moreover, even suboptimal estimates are typically within 1-2\% of the optimal value.

Papalia, Alan↗

Ground state properties of solid and liquid spin-aligned atomic hydrogen

Calculations of the ground state energy in the solid phase were performed with the aid of a variational approach. The Morse potential form of the atomic triple potential computed by Kolos and Wolniewicz (1965) was employed for the calculations. The ground state energies of both the liquid and solid phases of spin-aligned atomic hydrogen around the volume of the transition are presented in a graph.

Danilowicz, R. L.↗