Search NASA⌕ Search

SEARCH · Search NASA

Results for “Graph properties”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

The inviscid stability of supersonic flow past a sharp cone

The effects of lateral curvature on the development of supersonic laminar inviscid boundary-layer flow on a sharp cone with adiabatic wall conditions are investigated analytically, with a focus on the linear temporal inviscid stability properties. The derivation of the governing equations and of a 'triply generalized' inflexion condition is outlined, and numerical results for freestream Mach number 3.8 are presented in extensive graphs and characterized in detail. A third instability mode related to the viscous mode observed by Duck and Hall (1990) using triple-deck theory is detected and shown to be more unstable and to have larger growth rates than the second mode in some cases. It is found that the 'sonic' neutral mode is affected by the lateral curvature and becomes a supersonic neutral mode.

Duck, Peter W.↗
DOE OSTI2026

When does global attention help: a unified empirical study on atomistic graph learning

Graph neural networks (GNNs) are widely used as surrogates for costly experiments and first-principles simulations to study the behavior of compounds at atomistic scale, and their architectural complexity is constantly increasing to enable the modeling of complex physics. While most recent GNNs combine more traditional message passing neural networks (MPNNs) layers to model short-range interactions with more advanced graph transformers (GTs) with global attention mechanisms to model long-range interactions, it is still unclear when global attention mechanisms provide real benefits over well-tuned MPNN layers due to inconsistent implementations, features, or hyperparameter tuning. We introduce the first unified, reproducible benchmarking framework–built on HydraGNN–that enables seamless switching among four controlled model classes: MPNN, MPNN with chemistry/topology encoders, GPS-style hybrids of MPNN with global attention, and fully fused localglobal models with encoders. Using seven diverse open-source datasets for benchmarking across regression and classification tasks, we systematically isolate the contributions of message passing, global attention, and encoder-based feature augmentation. Our study shows that encoder-augmented MPNNs form a robust baseline, while fused localglobal models yield the clearest benefits for properties governed by long-range interaction effects. We further quantify the accuracycompute trade-offs of attention, reporting its overhead in memory. Together, these results establish the first controlled evaluation of global attention in atomistic graph learning and provide a reproducible testbed for future model development.

Equivariant graph neural networks↗
DOE OSTI2018

Efficient Monte Carlo With Graph-Based Subsurface Flow and Transport Models

Simulating flow and transport in fractured porous media frequently involves solving numerical discretizations of partial differential equations with a large number of degrees of freedom using discrete fracture network (DFN) models. Uncertainty in the properties of the fracture network that controls flow and transport requires a large number of DFN simulations to statistically describe quantities of interest. However, the computational cost of solving more than a few realizations of a large DFN can be intractable. As a means of circumventing this problem, we utilize both a high-fidelity DFN model and a graphbased model of flow and transport in combination with a multifidelity Monte Carlo (MC) method to reduce the number of high-fidelity simulations that are needed to obtain an accurate estimate of the quantity of interest. We demonstrate the approach by estimating quantiles of the breakthrough time for a conservative tracer in an ensemble of fractured porous media. Our results demonstrate that a multifidelity MC estimate, whose computational cost is equal to the cost of 10 DFN simulations, can be as accurate as a standard MC estimate that utilizes 1,000 DFN simulations. Thus the combination of our graphbased model with multifidelity MC estimates effectively reduces the computational cost of the problem by a factor of approximately 100.

58 GEOSCIENCES↗
DOE OSTI2025

PySIDT: Subgraph Isomorphic Decision Trees for Molecular Property Prediction

Accurate molecular property prediction is important across all fields of chemistry. Deep neural networks (DNNs) have become increasingly popular due to their ability to train automatically, avoiding the incredibly tedious process of constructing and extending traditional property estimation schemes. However, DNNs require large amounts of training data, are challenging to interpret, require large amounts of memory to load even during inference, and have severe difficulties incorporating qualitative chemical knowledge, which are often desired for molecular property prediction tasks. Here, in this study, we present PySIDT (https://github.com/zadorlab/PySIDT), a software for training and running inference on Subgraph Isomorphic Decision Trees (SIDTs). SIDTs are graph-based decision trees made of nodes associated with molecular substructures. Inference is done by descending target molecular structures down the decision tree to nodes with matching subgraph isomorphic substructures and making predictions based on the final (most specific) nodes matched. SIDTs scale down well to dataset sizes much smaller than is feasible for DNNs. As trees of molecular substructures, SIDTs are inherently readable and easy to visualize, making them easy to analyze. They are also straightforward to extend and retrain, facilitate uncertainty estimation, and enable easy integration of expert knowledge. We demonstrate the SIDT approach discussing its application to a diverse range of molecular prediction tasks: rate coefficient estimation, diffusion coefficient estimation, thermochemistry estimation, transition state bond stretch prediction, p K a prediction, stability of molecular structures, stability of surface structures, and prediction of surface lateral interaction energetics. Additionally, we demonstrate the power of the SIDT algorithms in two direct learning curve vanilla comparisons with the popular DNN-based software Chemprop and the popular gradient boosted trees-based software XGBoost on enthalpy of formation and rate coefficient prediction tasks. In particular, in the enthalpy of formation case, vanilla PySIDT is able to outperform vanilla Chemprop and XGBoost across the full range of training/validation set sizes out to 11,560 data points.

Johnson, Matthew Sean [Sandia National Laboratorie↗
DOE OSTI2023

Artificial Intelligence Designer of Materials and Processes for Advanced Power Generation

In this presentation, ‘deep-freeze’ graphs, ‘convoluted filtering’ networks, ‘mirror-image’ graphs, and adversarial ensemble methods are utilized to support inversion modeling for optimization of the complex compositions and complex processes in design of high-performing alloys, with their properties tailored to the energy application specifications.

Romanov, Vyacheslav↗
DOE OSTI2024

Nanoparticle self-assemblies with modern complexity

Thanks to decades of tireless efforts, nanoparticle assemblies have reached at an extremely high level of controllability, sophistication, and complexity, with new insights provided by integration with graph theory, cutting-edge characterization, and machine learning (ML)-based computation and modeling, as well as with ever-diversifying applications in energy, catalysis, biomedicine, optics, electronics, magnetics, organic biosynthesis, and quantum technology. Nanoparticle assemblies can be crystalline, known as superlattices or supracrystals. Their assembly entails a transition from disorder—dispersed nanoparticles—to order, which can be achieved through classical nucleation pathways or nonclassical pathways via prenucleation precursors or particle aggregation. Further, the periodic lattices allow facile manipulations of electrons, phonons, photons, and even spins, leading to advanced device components and metamaterials. Meanwhile, aperiodic assemblies out of nanoparticles, such as gels, networks, and amorphous solids, also start to attract attentions. Despite the loss of periodicity, symmetry-lowering or symmetry-breaking three-dimensional (3D) structures emerge with unique properties, such as chiroptical activity, topological mechanical strength, and quantum entanglement. Real-space imaging such as electron microscopy and X-ray based tomography methods are utilized to characterize these complex structures, while mathematical tools such as graph theories are in need to describe such complex structures. This issue aims to provide a timely review of the efforts in this greatly broadened materials design space including experiment, simulation, theory, and applications. Nine top experts (and their teams) from four countries deliver six review papers, summarizing fundamental mechanistic understandings of nanoparticle assemblies, highlighted with the developments of state-of-the-art in situ characterization tools and ML-assisted reverse engineering, and newly emergent applications of nanoarchitectures.

36 MATERIALS SCIENCE↗
DOE OSTI2024

A General Materials Data Science Framework for Quantitative 2D Analysis of Particle Growth from Image Sequences

Abstract Phase transformations are a challenging problem in materials science, which lead to changes in properties and may impact performance of material systems in various applications. We introduce a general framework for the analysis of particle growth kinetics by utilizing concepts from machine learning and graph theory. As a model system, we use image sequences of atomic force microscopy showing the crystallization of an amorphous fluoroelastomer film. To identify crystalline particles in an amorphous matrix and track the temporal evolution of the particle dispersion, we have developed quantitative methods of 2D analysis. 700 image sequences were analyzed using a neural network architecture, achieving 0.97 pixel-wise classification accuracy as a measure of the correctly classified pixels. The growth kinetics of isolated and impinged particles were tracked throughout time using these image sequences. The relationship between image sequences and spatiotemporal graph representations was explored to identify the proximity of crystallites from each other. The framework enables the analysis of all image sequences without the requirement of sampling for specific particles or timesteps for various materials systems.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Gauges, loops, and polynomials for partition functions of graphical models

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and optimization applications. The problem is #P-hard that is of an exponential complexity with respect to the number of variables. Here, aimed at approximating the partition function, we consider multi-graph models where binary variables and multivariable factors are associated with edges and nodes, respectively, of an undirected multi-graph. We suggest a new methodology for analysis and computations that combines the Gauge function technique from Chertkov and Chernyak with the technique developed in Anari and Oveis Gharan 2017 arXiv:1702.02937; Gurvits 2011 arXiv:1106.2844; Straszak and Vishnoi 2017 55th Annual Allerton Conf. on Communication, Control, and Computing, based on the recent progress in the field of real stable polynomials. We show that the Gauge function, representing a single-out term in a finite sum expression for the partition function which achieves extremum at the so-called belief-propagation gauge, has a natural polynomial representation in terms of gauges/variables associated with edges of the multi-graph. Moreover, Gauge function can be used to recover the partition function through a sequence of transformations allowing appealing algebraic and graphical interpretations. Algebraically, one step in the sequence consists of the application of a differential operator over gauges associated with an edge. Graphically, the sequence is interpreted as a repetitive elimination/contraction of edges resulting in multi-graph models on decreasing in size (number of edges) graphs with the same partition function as in the original multi-graph model. Even though the complexity of computing factors in the sequence of the derived multi-graph models and respective Gauge functions grow exponentially with the number of eliminated edges, polynomials associated with the new factors remain bi-stable if the original factors have this property. Moreover, we show that BP estimations in the sequence do not decrease, each low-bounding the partition function.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1994

A 3M high temperature dielectric film

The performance characteristics of a dielectric film are summarized. Additionally, the film's environmental and chemical properties are listed: low shrinkage to 300 C; moisture insensitive; low outgassing under vacuum; excellent surface qualities--easy metallization of film; flame retardant; and low smoke generation. A series of graphs that display the performance characteristics of the film are also presented.

Hampl, Edward, Jr.↗
NASA NTRS2000

Analysis of Phase-Type Stochastic Petri Nets With Discrete and Continuous Timing

The Petri net formalism is useful in studying many discrete-state, discrete-event systems exhibiting concurrency, synchronization, and other complex behavior. As a bipartite graph, the net can conveniently capture salient aspects of the system. As a mathematical tool, the net can specify an analyzable state space. Indeed, one can reason about certain qualitative properties (from state occupancies) and how they arise (the sequence of events leading there). By introducing deterministic or random delays, the model is forced to sojourn in states some amount of time, giving rise to an underlying stochastic process, one that can be specified in a compact way and capable of providing quantitative, probabilistic measures. We formalize a new non-Markovian extension to the Petri net that captures both discrete and continuous timing in the same model. The approach affords efficient, stationary analysis in most cases and efficient transient analysis under certain restrictions. Moreover, this new formalism has the added benefit in modeling fidelity stemming from the simultaneous capture of discrete- and continuous-time events (as opposed to capturing only one and approximating the other). We show how the underlying stochastic process, which is non-Markovian, can be resolved into simpler Markovian problems that enjoy efficient solutions. Solution algorithms are provided that can be easily programmed.

Jones, Robert L.↗
DOE OSTI2022

Learning Distributed Geometric Koopman Operator for Sparse Networked Dynamical Systems

Koopman operator theory provides an alternative to study nonlinear networked dynamical systems by mapping the state space to an abstract higher dimensional space where the system evolution is linear. Recent works show the application of graph neural networks (GNNs) to learn state to object-centric embeddings and achieve centralized block-wise computation of Koopman operator (KO) under additional assumptions on the underlying agents properties and constraints on the KO structure. However, the computational complexity of learning the Koopman increases exponentially for networked systems where the number of possible system states grows in a combinatorial fashion with the number of nodes. The learning challenge is further amplified for sparse networks by two factors: 1) sample sparsity for learning the Koopman operator in the non-linear space, and 2) the divergence in the dynamics of individual nodes or from one subgraph to another. Our work aims to address these challenge by formulating the representation learning of networked dynamical systems into a multi-agent paradigm and learning the Koopman operator in a distributive manner. The computational as well as performance advantages of distributed Koopman is predominant for sparse networks whereas for fully connected networks, it is shown to coincide with the centralized one. The empirical study on rope system, network of oscillators and a synthetic power system show comparable and superior performance along with computational benefits with the state-of-the-art methods.

Mukherjee, Sayak↗
NASA NTRS1994

A new test method for the assessment of the arc tracking properties of wire insulation in air, oxygen enriched atmospheres and vacuum

Development of a new test method suitable for the assessment of the resistance of aerospace cables to arc tracking for different specific environmental and network conditions of spacecraft is given in view-graph format. The equipment can be easily adapted for tests at different realistic electrical network conditions incorporating circuit protection and the test system works equally well whatever the test atmosphere. Test results confirm that pure Kapton insulated wire has bad arcing characteristics and ETFE insulated wire is considerably better in air. For certain wires, arc tracking effects are increased at higher oxygen concentrations and significantly increased under vacuum. All tests on different cable insulation materials and in different environments, including enriched oxygen atmospheres, resulted in a more or less rapid extinguishing of all high temperature effects at the beginning of the post-test phase. In no case was a self-maintained fire initiated by the arc.

Koenig, Dieter↗
NASA NTRS1979

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

A methodology for evaluating the reliability and risk of structures under complex service environments

The theoretical basis and numerical implementation of NESSUS (Numerical Evaluation of Stochastic Structures Under Stress; Cruse et al., 1988), a computer code for probabilistic structural analyses of aerospace components, are described, with an emphasis on the use of NESSUS for reliability and risk assessment. Topics addressed include the structure of NESSUS, the material-properties model, computational procedures, probabilistic models of fatigue-crack initiation, risk/cost evaluation, fatigue-fracture analyses, and fatigue-crack propagation. Numerical results from typical applications are presented in extensive graphs and briefly characterized; the usefulness of NESSUS predictions for establishing inspection and retirement schedules and for component certification is indicated.

Shiao, Michael C.↗
DOE OSTI2022

Quantifying the atomistic free-volume morphology of materials with graph theory

Here, we introduce a new computational methodology for the identification and characterization of free volume within/around atomistic configurations. This scheme employs a three-stage workflow, by which spheres are iteratively grown inside of voxels, and ultimately converted to planar graphs, which are then characterized via a graph-based order parameter. Our approach is computationally efficient, physically intuitive, and universally transferable to any material system. Validation of our methodology is performed on several sets of materials problems: (1) classification of unique free volumes in various crystal phases, (2) autonomous detection and classification of complex surface defects during epitaxial growth simulations, (3) characterization of free volume defects in metals/alloys, and (4) quantification of the spatio-temporal behavior of nano-scale free volume morphologies as a function of both temperature and free-volume size. Our method accurately identifies and characterizes unique free volumes over a multitude of systems and length scales, indicating its potential for future use in understanding the relationship between free volume morphology and material properties under both static and dynamic conditions.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Beyond nothingness in the formation and functional relevance of voids in polymer films

Abstract Voids—the nothingness—broadly exist within nanomaterials and impact properties ranging from catalysis to mechanical response. However, understanding nanovoids is challenging due to lack of imaging methods with the needed penetration depth and spatial resolution. Here, we integrate electron tomography, morphometry, graph theory and coarse-grained molecular dynamics simulation to study the formation of interconnected nanovoids in polymer films and their impacts on permeance and nanomechanical behaviour. Using polyamide membranes for molecular separation as a representative system, three-dimensional electron tomography at nanometre resolution reveals nanovoid formation from coalescence of oligomers, supported by coarse-grained molecular dynamics simulations. Void analysis provides otherwise inaccessible inputs for accurate fittings of methanol permeance for polyamide membranes. Three-dimensional structural graphs accounting for the tortuous nanovoids within, measure higher apparent moduli with polyamide membranes of higher graph rigidity. Our study elucidates the significance of nanovoids beyond the nothingness, impacting the synthesis‒morphology‒function relationships of complex nanomaterials.

36 MATERIALS SCIENCE↗
DOE OSTI2024

HydraGNN_Predictive_GFM_2024 - Ensemble of predictive graph foundation models for ground state atomistic materials modeling

We provide the ensemble of fifteen pre-trained graph foundation models (GFMs) for atomistic materials modeling applications. Each one of the fifteen GFMs has been trained on five open-source datasets that (once aggregated) amount to over 154 million atomistic structures, which cover over two-thirds of the natural elements of the periodic table and that comprises a broad set of organic and inorganic compounds. This vast set of atomistic structures comprises ground state configurations that are dynamically stable (i.e., equilibrated structures with atomic forces approximately close to zero values) as well as dynamically unstable structures (i.e., non-equilibrium structures with non-negligible non-zero values of atomic forces). The ensemble of datasets aggregated does NOT include excited states. The datasets have been curated to remove atomistic structures with spectral norm of the force tensor above 100 eV/angstrom. Moreover, a linear term of the energy was computed for each dataset using a linear regression model that uses the chemical concentration of each natural element as regressor. The linear term predicted by the linear regression model has been subtracted from each original energy value to perform a re-alignment of the energy values across different electronic structures approximation theories performed to generate the diverse multi-source, multi-fidelity datasets. The folder "ADIOS_files" contains the set of pre-processed datasets in Adaptable I/O System (ADIOS) format (https://www.exascaleproject.org/research-project/adios/) that have been used for the development and training of GFMs in this work. The "ADIOS_files" directory contains 6 sub-directories named as follows: - ANI1x-v3.bp - MPTrj-v3.bp - OC2020-20M-v3.bp - OC2020-v3.bp - OC2022-v3.bp - qm7x-v3.bp Each sub-directory contains the pre-processed datasets converted in Adaptable I/O System (ADIOS) format (https://www.exascaleproject.org/research-project/adios/) that have been used to the development, training, and performance testing of the ensemble go predictive graph foundation models. Each GFM was developed using HydraGNN (https://github.com/ORNL/HydraGNN) as underlying graph neural network (GNN) architecture. The multi-task learning (MTL) capability of HydraGNN was used to simultaneously train the GFMs on labeled values for direct predictions of energy (a total system property of an atomistic structure that measures the chemical stability) and atomic forces (an atomic level property of an atomistic structure that measures the dynamical stability). The hyper parameters of the GFM have been tuned using scalable hyperparameter optimization (HPO) algorithms implemented in the software DeepHyper (https://github.com/deephyper/deephyper). The pre-training of each HPO trial was performed using distributed data parallelism (DDP) to scale the training across 128 compute nodes of the exascale OLCF supercomputer Frontier. Each HPO trial was trained only for 10 epochs and an early stopping was performed to avoid wasting significant computational resources on GNN architectures that were clearly underperforming. For each HPO trial, the 'omnistat' tool developed by (AMD Research - Advanced Micro Device) was used to measure the total energy consumption in kWh. The ensemble of GFMs was obtained by selecting the fifteen best performing HPO trials. Four models have been selected for their clear advantage in accuracy, and these are the GFMs with IDs 229, 156, 147, 260. Additional eleven models have been selected based on judicious balance between accuracy and energy consumption needed for training, and these are the GFMs with IDs 165, 78, 137, 1, 175, 171, 181, 67, 179, 167, 351. Each selected GFM of the ensemble was continued to cumulate a total of at most 30 epochs. In some cases, the total number of epochs actually performed was les than 30 due to two combined factors: (1) the size of the GFM (i.e., the number of model parameters to train) and (2) the total wall-clock time for which the computational resources could be allocated on OLCF-Frontier. The "Ensemble_of_models" directory contains 15 sub-directories named as follows: - gfm_0.229 - gfm_0.156 - gfm_0.147 - gfm_0.260 - gfm_0.165 - gfm_0.78 - gfm_0.137 - gfm_0.1 - gfm_0.175 - gfm_0.171 - gfm_0.181 - gfm_0.67 - gfm_0.179 - gfm_0.167 - gfm_0.351 Each one of these sub-directories refers to one of the fifteen HPO trials that have been selected to continue the pre-training with at most 30 epochs. With each sub-directory associated with a specific HPO trial, the following files can be found: - config.json: file for argument parsing to develop and train an HydraGNN architecture - gfm_0.ID_epoch_N.pk: file with model parameters for HPO ID trial after N epochs of training The ensemble of fifteen GFM architectures was used for (1) ensemble averaging to stabilize the predictions of energy and atomic forces after pre-training for post-processing analysis and (2) ensemble uncertainty quantification (UQ). The code used to develop, pre-train, and load the pre-trained models for post-processing analysis is available on the ORNL-GitHub at the following link: https://github.com/ORNL/HydraGNN/tree/Predictive_GFM_2024

36 MATERIALS SCIENCE↗