Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Evaluating the Use of Foundational Chemical Language Models in Multimodal Graph Fusion

Rapid and accurate prediction of the physicochemical properties of molecules given their structures remains a key challenge in cheminformatics. Machine learning approaches offer high-throughput options, but the optimality of inductive biases and data representations are up for debate. For example, BERT-based masked language models (MLMs) can be trained in a self-supervised way on hundreds of millions to billions of readily available SMILES strings. Another option is graph neural networks (GNNs), which can operate directly on molecular structures. Yet, generating accurate molecular geometry is computationally expensive, leading to a relative scarcity in data compared to SMILES strings. It is attractive to combine these two paradigms by pre-training an LM on a large corpus of SMILES strings and embedding these representation into a geometric graph neural network. Despite the promise of such an approach, and contrary to previous studies, we find mixed results with the combination of the LMs and GNNs on several molecule datasets. In particular, we found evidence for improvement on the FreeSolv and QM7 benchmarks, but degraded performance on the ESOL, LIPO and QM9 datasets compared to a GNN baseline.

Francel, Collin [University of Alabama]↗
DOE OSTI2021

Amphiphile conformation impacts aggregate morphology and solution structure across multiple lengthscales

Although the self-assembly of amphiphiles is well-studied in aqueous solutions, much less is understood about the fundamental driving forces and structure property relationships in non-polar media. In recent work [Journal of Physical Chemistry B, 2020, 124, 10822.] the authors have studied a series of malonomide-based amphiphiles that are relevant to liquid-liquid extraction. That work demonstrated that aggregation is largely driven by local dipole-dipole interactions between molecules. Here, we build upon this observation to develop a more detailed understanding of how the balance of dipole-dipole interactions (controlled by conformation) and molecular architecture influences the morphology of the aggregates across lengthscales. Using constrained molecular dynamics about key degrees of freedom, we demonstrate that the conformation of N,N-dimethyl,N,N-dioctylhexylethoxy malonamide (DMDOHEMA) and N,N-dimethyl,N,N-dibutyltetradecyl malonamide (DMDBTDMA) has a significant impact upon self-association - where appropriate conformational sampling is essential. To quantify the aggregate morphology, several graph theoretic and persistent homology based properties are determined. The former examines the patterns of intermolecular interactions within clusters, while the latter examines the 3-dimensional spatial distribution. Based upon these analyses, we find that the morphology of aggregates, particularly at higher malonamide concentration, depends on a balance of dipole alignment and alkyl tail sterics. Dipole alignment encourages linear patterns of the intermolecular interactions within aggregates, while the alkyl tail steric interactions between the malonamide result in noticeably less linear aggregates for DMDOHEMA than DMDBTDMA. This is reflected in the spatial distribution, where more holes or voids exist between extractants within the DMDOHEMA that distribute within the solution in more of a "swiss cheese" arrangement as opposed to the more filamentous distribution of DMBDTDMA. This study links conformation and molecular structure to the morphology of amphiphile assemblies, and serves as a basis for ongoing study of multicomponent amphiphile solutions with polar and other solutes, and how these impact aggregation phenomena.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Predicting Elastic Properties of Materials from Electronic Charge Density Using 3D Deep Convolutional Neural Networks

Materials representation plays a key role in machine learning-based prediction of materials properties and new materials discovery. Currently both graph and three-dimensional (3D) voxel representation methods are based on the heterogeneous elements of the crystal structures. Here, we propose to use electronic charge density (ECD) as a generic unified 3D descriptor for materials property prediction with the advantage of possessing close relation with the physical and chemical properties of materials. We developed an ECD-based 3D convolutional neural networks (CNNs) for predicting the elastic properties of materials, in which CNNs can learn effective hierarchical features with multiple convolving and pooling operations. Extensive benchmark experiments over 2170 $Fm\bar3m$ face-centered-cubic materials show that our ECD-based CNNs can achieve good performance for elasticity prediction. Especially, our CNN models based on the fusion of elemental Materials-Agnostic Platform for Informatics and Exploration features and ECD descriptors achieved the best fivefold cross-validation performance. More importantly, we showed that our ECD-based CNN models can achieve significantly better extrapolation performance when evaluated over nonredundant data sets, where there are few neighbor-training samples around test samples. As an additional validation, we evaluated the predictive performance of our models on 329 materials of space group $Fm\bar3m$ by comparing to density functional theory calculated values, which shows a better prediction power of our model for bulk modulus than shear modulus. Because of the unified representation power of ECD, it is expected that our ECD-based CNN approach can also be applied to predict other physical and chemical properties of crystalline materials.

36 MATERIALS SCIENCE↗
DOE OSTI2021

FL-DISCO: Federated Generative Adversarial Network for Graph-based Molecule Drug Discovery: Special Session Paper

The outbreak of the global COVID-19 pandemic emphasizes the importance of collaborative drug discovery for high effectiveness; however, due to the stringent data regulation, data privacy becomes an imminent issue needing to be addressed to enable collaborative drug discovery. In addition to the data privacy issue, the efficiency of drug discovery is another key objective since infectious diseases spread exponentially and effectively conducting drug discovery could save lives. Advanced Artificial Intelligence (AI) techniques are promising to solve these problems: (1) Federated Learning (FL) is born to keep data privacy while learning data from distributed clients; (2) graph neural network (GNN) can extract structural properties of molecules whose underlying architecture is the connected atoms; and (3) generative adversarial network (GAN) can generate novel molecules while retaining the properties learned from the training data. In this work, we make the first attempt to build a holistic collaborative and privacy-preserving FL framework, namely FL- DISCO, which integrates GAN and GNN to generate molecular graphs. Experimental results demonstrate the effectiveness of FL- DISCO on: (1) IID data for ESOL and QM9, where FL-DISCO can generate highly novel compounds with high drug-likeliness, uniqueness and LogP scores compared to the baseline; (2) non- IID data for ESOL and QM9, where FL-DISCO generates 100% novel compounds with high validity and LogP scores compared to the baseline. We also demonstrate how different fractions of clients, generator and discriminator architectures affect our evaluation scores.

Manu, Daniel↗
DOE OSTI2025

Scalable training of trustworthy and energy-efficient predictive graph foundation models for atomistic materials modeling: a case study with HydraGNN

We present our work on developing and training scalable, trustworthy, and energy-efficient predictive graph foundation models (GFMs) using HydraGNN, a multi-headed graph convolutional neural network architecture. HydraGNN expands the boundaries of graph neural network (GNN) computations in both training scale and data diversity. It abstracts over message passing algorithms, allowing both reproduction of and comparison across algorithmic innovations that define nearest-neighbor convolution in GNNs. This work discusses a series of optimizations that have allowed scaling up the GFMs training to tens of thousands of GPUs on datasets consisting of hundreds of millions of graphs. Our GFMs use multitask learning (MTL) to simultaneously learn graph-level and node-level properties of atomistic structures, such as energy and atomic forces. Using over 154 million atomistic structures for training, we illustrate the performance of our approach along with the lessons learned on two state-of-the-art US Department of Energy (US-DOE) supercomputers, namely the Perlmutter petascale system at the National Energy Research Scientific Computing Center and the Frontier exascale system at Oak Ridge Leadership Computing Facility. The HydraGNN architecture enables the GFM to achieve near-linear strong scaling performance using more than 2000 GPUs on Perlmutter and 16,000 GPUs on Frontier.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Graph Networks as a Universal Machine Learning Framework for Molecules and Crystals

Graph networks are a new machine learning (ML) paradigm that supports both relational reasoning and combinatorial generalization. Here, we develop universal MatErials Graph Network (MEGNet) models for accurate property prediction in both molecules and crystals. We demonstrate that the MEGNet models outperform prior ML models such as the SchNet in 11 out of 13 properties of the QM9 molecule data set. Similarly, we show that MEGNet models trained on $\sim 60,000$ crystals in the Materials Project substantially outperform prior ML models in the prediction of the formation energies, band gaps and elastic moduli of crystals, achieving better than DFT accuracy over a much larger data set. Here, we present two new strategies to address data limitations common in materials science and chemistry. First, we demonstrate a physically-intuitive approach to unify four separate molecular MEGNet models for the internal energy at 0 K and room temperature, enthalpy and Gibbs free energy into a single free energy MEGNet model by incorporating the temperature, pressure and entropy as global state inputs. Second, we show that the learned element embeddings in MEGNet models encode periodic chemical trends and can be transfer-learned from a property model trained on a larger data set (formation energies) to improve property models with smaller amounts of data (band gaps and elastic moduli).

36 MATERIALS SCIENCE↗
DOE OSTI2017

An improved hyperbolic embedding algorithm

Because hyperbolic space has properties that make it amenable to graph representations, there is significant interest in scalable hyperbolic-space embedding methods. These embeddings enable constant-time approximation of shortest-path distances, and so are significantly more efficient than full shortest-path computations. In this article, we improve on existing landmark-based hyperbolic embedding algorithms for large-scale graphs. Whereas previous methods compute the embedding by using the derivative-free Nelder–Mead simplex optimization method, our approach uses the limited-memory BFGS (LBFGS) method, which is quasi-Newton optimization, with analytic gradients. Our method is not only significantly faster but also produces higher-quality embeddings. Moreover, we are able to include the hyperbolic curvature as a variable in the optimization. We compare our hyperbolic embedding method implementation in Python (called Hypy) against the best publicly available software, Rigel. Our method is an order of magnitude faster and shows significant improvements in the accuracy of the shortest-path distance calculations. Furthermore, tests are performed on a variety of real-world networks, and we show the scalability of our method by embedding a graph with 1.8 billion edges and 65 million nodes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Improving Performance of Multi-Area State Estimation Using Spectral Clustering

This paper investigates the problem of dividing a large power system into several areas to be solved by a state estimator which coordinates locally obtained decentralized estimates. By applying automatic partitioning to the utility system, the performance of the distributed state estimator can be improved as compared to the pre-defined utility control areas. The presented approach utilizes the spectral properties of the un-directed graph formed by assigning a vertex to every bus and an edge to every pair of buses connected by a line. The graph Laplacian matrix and associated eigenvectors and eigenvalues are used to cluster the graph vertices in such a way that each area has a large number of internal connections, but a small number of external connections. This approach is demonstrated using the IEEE 118 bus system.

Kelle, David↗
DOE OSTI2024

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↗
NASA NTRS1975

Earth-type planets (Mercury, Venus, and Mars)

Spacecraft- and Earth-based studies on the physical nature of the planets Mercury, Venus, and Mars are reported. Charts and graphs are presented on planetary surface properties, rotational parameters, atmospheric compositions, and astronomical characteristics.

Marov, M. Y.↗
NASA NTRS1983

External control of planetary radio emission

Recent studies using data from Voyagers 1 and 2 to correlate variations in the Saturn kilometric radiation (SKR) with changes in solar-wind properties are summarized and illustrated with graphs. Best SKR correlations have been obtained with the solar-wind ram pressure and the related kinetic energy flux. It is pointed out that the related phenomenon on earth, the auroral kilometric radiation, occurs mainly in the nightside auroral region (as opposed to the dayside cleft region for SKR) and is best correlated with solar-wind velocity and inverted-V electron-precipitation events, implying a different stimulation process. The evidence for solar-wind control of the non-Io-related decametric radiation of Jupiter is also reviewed.

Rucker, H. O.↗
NASA NTRS1987

Methodology for testing and validating knowledge bases

A test and validation toolset developed for artificial intelligence programs is described. The basic premises of this method are: (1) knowledge bases have a strongly declarative character and represent mostly structural information about different domains, (2) the conditions for integrity, consistency, and correctness can be transformed into structural properties of knowledge bases, and (3) structural information and structural properties can be uniformly represented by graphs and checked by graph algorithms. The interactive test and validation environment have been implemented on a SUN workstation.

Krishnamurthy, C.↗
DOE OSTI2023

Session Introduction: Graph Representations and Algorithms in Biomedicine

Connectivity is a fundamental property of biological systems: on the cellular level, proteins interact with each other to form protein-protein interaction networks (PPIs); on the organism level, neurons are arranged in a network; and on a community-level, species can have complex relationships with one another that drive the development and balance of an ecosystem. Graphs, representations of systems consisting of entities as vertices and their connections as edges, are a useful structure to characterize many such systems. Such models can be used to understand biological systems that naturally have a network structure, including PPIs, biological neurons, and ecosystems. In today’s information age, graph representations and algorithms (often in combination with machine learning techniques) are used to organize massive amounts of related data, much of which may be heterogeneous or unstructured, and identify patterns that represent novel biological insights. PSB’s 2023 session “Graph Representations and algorithms in Biomedicine,” encompasses modern developments in graph theory and its applications to various fields of biomedicine. This session includes a wide range of research - knowledge graphs built from text-mined health data, heterogeneous networks using multi-omic databases, and graphs refined to represent uncertainty or improve memory usage.

Chrisman, Brianna S.↗
DOE OSTI2020

A Guide to Conquer the Biological Network Era Using Graph Theory

Networks are one of the most common ways to represent biological systems as complex sets of binary interactions or relations between different bioentities. In this article, we discuss the basic graph theory concepts and the various graph types, as well as the available data structures for storing and reading graphs. In addition, we describe several network properties and we highlight some of the widely used network topological features. We briefly mention the network patterns, motifs and models, and we further comment on the types of biological and biomedical networks along with their corresponding computer- and human-readable file formats. Finally, we discuss a variety of algorithms and metrics for network analyses regarding graph drawing, clustering, visualization, link prediction, perturbation, and network alignment as well as the current state-of-the-art tools. We expect this review to reach a very broad spectrum of readers varying from experts to beginners while encouraging them to enhance the field further.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1988

Hygrothermal and strain-rate effects on properties of graphite/epoxy composites

The combined effects of moisture (M), temperature (T), and strain rate (SR) on the properties of the unidirectional graphite/epoxy composite AS4/3501-6 are investigated experimentally. Longitudinal tensile, in-plane shear, and transverse tensile specimens with moisture content 0 or 1 percent were characterized using standard mechanical tests and the techniques described by Yaniv et al. (1987) at temperatures 23-128 C and strain rates from 5 x 10 to the -6th/sec to 5/sec. The results are presented in graphs and discussed in detail. The longitudinal properties of the composite were found to be generally unaffected by changes in the parameters, whereas transverse and interlaminar properties decreased with increasing T and M at constant SR and the transverse and in-plane shear moduli increased with SR. A time-T-M equivalence principle is used to derive master curves for all the matrix-dominated properties, expressed in terms of a two-variable shift function.

Daniel, I. M.↗
NASA NTRS1998

Analysis of Vegetation Within A Semi-Arid Urban Environment Using High Spatial Resolution Airborne Thermal Infrared Remote Sensing Data

High spatial resolution (5 m) remote sensing data obtained using the airborne Thermal Infrared Multispectral Scanner (TIMS) sensor for daytime and nighttime have been used to measure thermal energy responses for 2 broad classes and 10 subclasses of vegetation typical of the Salt Lake City, Utah urban landscape. Polygons representing discrete areas corresponding to the 10 subclasses of vegetation types have been delineated from the remote sensing data and are used for analysis of upwelling thermal energy for day, night, and the change in response between day and night or flux, as measured by the TIMS. These data have been used to produce three-dimensional graphs of energy responses in W/ sq m for day, night, and flux, for each urban vegetation land cover as measured by each of the six channels of the TIMS sensor. Analysis of these graphs provides a unique perspective for both viewing and understanding thermal responses, as recorded by the TIMS, for selected vegetation types common to Salt Lake City. A descriptive interpretation is given for each of the day, night, and flux graphs along with an analysis of what the patterns mean in reference to the thermal properties of the vegetation types surveyed in this study. From analyses of these graphs, it is apparent that thermal responses for vegetation can be highly varied as a function of the biophysical properties of the vegetation itself, as well as other factors. Moreover, it is also seen where vegetation, particularly trees, has a significant influence on damping or mitigating the amount of thermal radiation upwelling into the atmosphere across the Salt Lake City urban landscape. Published by Elsevier Science Ltd.

Quattrochi, Dale A.↗
DOE OSTI2025

Scaling Laws of Graph Neural Networks for Atomistic Materials Modeling

Atomistic materials modeling is a critical task with wide-ranging applications, from drug discovery to materials science, where accurate predictions of the target material property can lead to significant advancements in scientific discovery. Graph Neural Networks (GNNs) represent the state-of-the-art approach for modeling atomistic material data thanks to their capacity to capture complex relational structures. While machine learning performance has historically improved with larger models and datasets, GNNs for atomistic materials modeling remain relatively small compared to large language models (LLMs), which leverage billions of parameters and terabyte-scale datasets to achieve remarkable performance in their respective domains. To address this gap, we explore the scaling limits of GNNs for atomistic materials modeling by developing a foundational model with billions of parameters, trained on extensive datasets in terabytescale. Our approach incorporates techniques from LLM libraries to efficiently manage large-scale data and models, enabling both effective training and deployment of these large-scale GNN models. This work addresses three fundamental questions in scaling GNNs: the potential for scaling GNN model architectures, the effect of dataset size on model accuracy, and the applicability of LLM-inspired techniques to GNN architectures. Specifically, the outcomes of this study include (1) insights into the scaling laws for GNNs, highlighting the relationship between model size, dataset volume, and accuracy, (2) a foundational GNN model optimized for atomistic materials modeling, and (3) a GNN codebase enhanced with advanced LLM-based training techniques. Our findings lay the groundwork for large-scale GNNs with billions of parameters and terabyte-scale datasets, establishing a scalable pathway for future advancements in atomistic materials modeling.

Li, Chaojian [ORNL] (ORCID:0000000340309777)↗
DOE OSTI2018

Isolation and Connectivity in Random Geometric Graphs with Self-similar Intensity Measures

Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many nodes and shrinking linking range, the number of isolated nodes is Poisson distributed, and the probability of no isolated nodes is equal to the probability the whole graph is connected. Here we examine these properties for several self-similar node distributions, including smooth and fractal, uniform and nonuniform, and finitely ramified or otherwise. We show that nonuniformity can break the Poisson distribution property, but it strengthens the link between isolation and connectivity. It also stretches out the connectivity transition. Finite ramification is another mechanism for lack of connectivity. The same considerations apply to fractal distributions as smooth, with some technical differences in evaluation of the integrals and analytical arguments.

97 MATHEMATICS AND COMPUTING↗