SEARCH · Engineering Papers

Results for “Graph Processing”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Nature-GL: A Revolutionary Learning Paradigm Unleashing Nature’s Power in Real-World Spatial-Temporal Graph Learning

Spatial-Temporal Graph Learning (ST-GL) is a prominent research area due to its unique capability to effectively learn real-world graphs. Applications of ST-GL pose stringent and various demands on not only real-time inference with low energy cost and high ac- curacy but also fast training. Unfortunately, as Moore’s Law approaches its limits and ST-GL model complexity drastically grows, the gap between digital hardware’s computational power and ST- GL application demands is widening. In response, this paper introduces Nature-GL, a nature-powered graph learning paradigm that exploits the principle of entropy increase to advance graph learning. In particular, Nature-GL transforms both the training and inference of real-valued ST-GL into electron-speed natural anneal- ing processes of a parameterized dynamical system that represents the target graphs. Experimental results across four real-world ap- plications with six datasets demonstrate that Nature-GL achieves orders-of-magnitude speedups in both training and inference, delivering higher accuracy compared to Graph Neural Networks.

Liu, Chuan [University of Rochester]↗

DOE OSTI2022

Coherent manipulation of graph states composed of finite-energy Gottesman-Kitaev-Preskill-encoded qubits

Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states composed of realistic, finite-energy approximate GKP-encoded qubits thus constitutes a key task. We consider the finite-energy approximation of GKP-qubit states given by a coherent superposition of shifted finite-squeezed vacuum states, where the displacements are Gaussian distributed. We present an exact description of graph states composed of such approximate GKP qubits as a coherent superposition of a Gaussian ensemble of randomly displaced ideal GKP-qubit graph states. Using standard Gaussian dynamics, we track the transformation of the covariance matrix and the mean-displacement vector elements of the Gaussian distribution of the ensemble under tools such as GKP-Steane error-correction and fusion operations that can be used to grow large high-fidelity GKP-qubit graph states. The covariance matrix elements capture the noise in the graph state due to the finite-energy approximation of GKP qubits, while the mean displacements relate to the possible absolute shift errors on the individual qubits arising conditionally from the homodyne measurements that are a part of these tools. Our work thus pins down an exact coherent error model for graph states generated from truly finite-energy GKP qubits, which can shed light on their error-correction properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

GraphAlign: Graph-Enabled Machine Learning for Seismic Event Filtering

This report summarizes results from a 2 year effort to improve the current automated seismic event processing system by leveraging machine learning models that can operated over the inherent graph data structure of a seismic sensor network. Specifically, the GraphAlign project seeks to utilize prior information on which stations are more likely to detect signals originating from particular geographic regions to inform event filtering. To date, the GraphAlign team has developed a Graphical Neural Network (GNN) model to filter out false events generated by the Global Associator (GA) algorithm. The algorithm operates directly on waveform data that has been associated to an event by building a variable sized graph of station waveforms nodes with edge relations to an event location node. This builds off of previous work where random forest models were used to do the same task using hand crafted features. The GNN model performance was analyzed using an 8 week IMS/IDC dataset, and it was demonstrated that the GNN outperforms the random forest baseline. We provide additional error analysis of which events the GNN model performs well and poorly against concluded by future directions for improvements.

58 GEOSCIENCES↗

DOE OSTI2015

Tempered fractional calculus

Fractional derivatives and integrals are convolutions with a power law. Multiplying by an exponential factor leads to tempered fractional derivatives and integrals. Tempered fractional diffusion equations, where the usual second derivative in space is replaced by a tempered fractional derivative, govern the limits of random walk models with an exponentially tempered power law jump distribution. The limiting tempered stable probability densities exhibit semi-heavy tails, which are commonly observed in finance. Tempered power law waiting times lead to tempered fractional time derivatives, which have proven useful in geophysics. The tempered fractional derivative or integral of a Brownian motion, called a tempered fractional Brownian motion, can exhibit semi-long range dependence. The increments of this process, called tempered fractional Gaussian noise, provide a useful new stochastic model for wind speed data. A tempered fractional difference forms the basis for numerical methods to solve tempered fractional diffusion equations, and it also provides a useful new correlation model in time series.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2017

Genten: Software for Generalized Tensor Decompositions v. 1.0.0

Tensors, or multidimensional arrays, are a powerful mathematical means of describing multiway data. This software provides computational means for decomposing or approximating a given tensor in terms of smaller tensors of lower dimension, focusing on decomposition of large, sparse tensors. These techniques have applications in many scientific areas, including signal processing, linear algebra, computer vision, numerical analysis, data mining, graph analysis, neuroscience and more. The software is designed to take advantage of parallelism present emerging computer architectures such has multi-core CPUs, many-core accelerators such as the Intel Xeon Phi, and computation-oriented GPUs to enable efficient processing of large tensors.

Phipps, EricT.↗

DOE OSTI2021

Designing alloys with process-mapping AI pre-trained on empirical knowledge

<span style="font-family: Calibri, sans-serif; font-size: 12pt;">Accelerated materials design should match the recent trends in the product development cycles. Materials data analytics can be used to significantly shorten development time of specialized alloys needed for next generation energy applications. However, it faces a challenge of scarce data available for training ML models. Incorporation of the domain knowledge into deep-learning graph structure via fuzzy pre-training and causal process imitation presents a viable approach to developing accurate data-driven models and reliable alloy design tools, with limited datasets. Artificial Intelligence (AI) was used in this study to incorporate such knowledge in the domain-specific computational tool, pyroMind. The tool provides not only novel design ideas but also their interpretation via physics and engineering concepts.</span>

Romanov, Vyacheslav↗

DOE OSTI2018

A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices

We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D sparse LU algorithm uses a three-dimensional MPI process grid, aggressively exploits elimination tree parallelism and trades off increased memory for reduced per-process communication. We also analyze the asymptotic improvements for planar graphs (e.g., from 2D grid or mesh domains) and certain non-planar graphs (specifically for 3D grids and meshes). For planar graphs with n vertices, our algorithm reduces communication volume asymptotically in n by a factor of O{log n} and latency by a factor of O{log n}. For non-planar cases, our algorithm can reduce the per-process communication volume by 3× and latency by O{n^1/3} times. In all cases, the memory needed to achieve these gains is a constant factor. We implemented our algorithm by extending the 2D data structure used in superLU. Our new 3D code achieves speedups up to 27× for planar graphs and up to 3.3× for non-planar graphs over the baseline 2D superLU when run on 24,000 cores of a Cray XC30.

Sao, Piyush↗

DOE OSTI2019

A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems

We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D algorithm for sparse LU uses a three-dimensional MPI process grid, exploits elimination tree parallelism, and trades off increased memory for reduced per-process communication. We also analyze the asymptotic improvements for planar graphs (e.g., those arising from 2D grid or mesh discretizations) and certain non-planar graphs (specifically for 3D grids and meshes). For a planar graph with $n$ vertices, our algorithm reduces communication volume asymptotically in $n$ by a factor of $\mathscr{O}$ $\Big(\sqrt{log \ n}\Big)$ and latency by a factor of $\mathscr{O}$ $(log \ n)$. For nonplanar cases, our algorithm can reduce the per-process communication volume by 3× and latency by $\mathscr{O}$ $\Big(n^\frac13\Big)$ times. In all cases, the memory needed to achieve these gains is a constant factor. We implemented our algorithm by extending the 2D data structure used in SuperLU_DIST. Our new 3D code achieves empirical speedups up to 27× for planar graphs and up to 3.3× for non-planar graphs over the baseline 2D SuperLU_DIST when run on 24,000 cores of a Cray XC30. We extend the 3D algorithm for heterogeneous architectures by adding the Highly Asynchronous Lazy Offload (Halo) algorithm for co-processor offload. On 4096 nodes of a Cray XK7 with 32,768 CPU cores and 4096 Nvidia K20x GPUs, the 3D algorithm achieves empirical speedups up to 24× for planar graphs and 3.5× for non-planar graphs over the baseline 2D SuperLU_DIST with co-processor acceleration.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

A bayesian approach to estimate the size and structure of the broad-line region in active galactic nuclei using reverberation mapping data

This is the first paper in a series devoted to the systematic study of the size and structure of the broad-line region (BLR) in active galactic nuclei (AGNs) using reverberation mapping (RM) data. We employ a recently developed Bayesian approach that statistically describes the variability as a damped random walk process and delineates the BLR structure using a flexible disk geometry that can account for a variety of shapes, including disks, rings, shells, and spheres. We allow for the possibility that the line emission may respond non-linearly to the continuum, and we detrend the light curves when there is clear evidence for secular variation. We use a Markov Chain Monte Carlo implementation based on Bayesian statistics to recover the parameters and uncertainties for the BLR model. The corresponding transfer function is obtained self-consistently. We tentatively constrain the virial factor used to estimate black hole masses; more accurate determinations will have to await velocity-resolved RM data. Application of our method to RM data with Hβ monitoring for about 40 objects shows that the assumed BLR geometry can reproduce quite well the observed emission-line fluxes from the continuum light curves. We find that the Hβ BLR sizes obtained from our method are on average ∼20% larger than those derived from the traditional cross-correlation method. Nevertheless, we still find a tight BLR size-luminosity relation with a slope of α = 0.55 ± 0.03 and an intrinsic scatter of ∼0.18 dex. In particular, we demonstrate that our approach yields appropriate BLR sizes for some objects (such as Mrk 142 and PG 2130+099) where traditional methods previously encountered difficulties.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2019

Deformation pathway and defect generation in crystals: a combined group theory and graph theory description

The generation and motion of crystalline defects during plastic deformation are critical processes that determine the mechanical properties of a crystal. The types of defect generated are not only related to the symmetry of a crystal but also associated with the symmetry-breaking process during deformation. Proposed here is a new mathematical framework to capture the intrinsic coupling between crystal symmetry and deformation-induced symmetry breaking. Using a combination of group theory and graph theory, a general approach is demonstrated for the systematic determination of the types of crystalline defect induced by plastic deformation, through the construction of a crystal deformation group and a deformation pathway graph. The types of defect generated in the deformation of a face-centered cubic crystal are analyzed through the deformation pathway graph and compared with experimental observations.

36 MATERIALS SCIENCE↗

DOE OSTI2021

Graph convolutional networks applied to unstructured flow field data

Abstract Many scientific and engineering processes produce spatially unstructured data. However, most data-driven models require a feature matrix that enforces both a set number and order of features for each sample. They thus cannot be easily constructed for an unstructured dataset. Therefore, a graph based data-driven model to perform inference on fields defined on an unstructured mesh, using a graph convolutional neural network (GCNN) is presented. The ability of the method to predict global properties from spatially irregular measurements with high accuracy is demonstrated by predicting the drag force associated with laminar flow around airfoils from scattered velocity measurements. The network can infer from field samples at different resolutions, and is invariant to the order in which the measurements within each sample are presented. The GCNN method, using inductive convolutional layers and adaptive pooling, is able to predict this quantity with a validation R 2 above 0.98, and a Normalized Mean Squared Error below 0.01, without relying on spatial structure.

Ogoke, Francis (ORCID:0000000224327783)↗

DOE OSTI2018

On an asymptotic viscosity solution property of solutions of discrete Hamilton–Jacobi–Bellman equations

In this paper, we show that a proper limit of solutions of discrete Hamilton–Jacobi–Bellman (dHJB) equations in a random walk model becomes a viscosity solution of a Hamilton–Jacobi–Bellman (HJB) variational inequality in a continuous-time geometric Brownian model. HJB variational inequalities are used to analyze singular stochastic control problems in mathematical finance. By our result, with the help of dHJB equations, we can obtain viscosity solutions of HJB variational inequalities which are usually identified with the value functions of the singular stochastic control problems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Graphical Gaussian Process Regression Model for Aqueous Solvation Free Energy Prediction of Organic Molecules in Redox Flow Battery

The solvation free energy of organic molecules is a critical parameter in determining emergent properties such as solubility, liquid-phase equilibrium constants, and pKa and redox potentials in an organic redox flow battery. In this work, we present a machine learning (ML) model that can learn and predict the aqueous solvation free energy of an organic molecule using Gaussian process regression method based on a new molecular graph kernel. To investigate the performance of the ML model on electrostatic interaction, the nonpolar interaction contribution of solvent and the conformational entropy of solute in solvation free energy, three data sets with implicit or explicit water solvent models, and contribution of conformational entropy of solute are tested. We demonstrate that our ML model can predict the solvation free energy of molecules at chemical accuracy with a mean absolute error of less than 1 kcal/mol for subsets of the QM9 dataset and the Freesolv database. To solve the general data scarcity problem for a graph-based ML model, we propose a dimension reduction algorithm based on the distance between molecular graphs, which can be used to examine the diversity of the molecular data set. It provides a promising way to build a minimum training set to improve prediction for certain test sets where the space of molecular structures is predetermined.

25 ENERGY STORAGE↗

DOE OSTI2018

Representing local atomic environment using descriptors based on local correlations

Statistical learning of material properties is an emerging topic of research and has been tremendously successful in areas such as representing complex energy landscapes as well as in technologically relevant areas, like identification of better catalysts and electronic materials. However, analysis of large data sets to efficiently learn characteristic features of a complex energy landscape, for example, depends on the ability of descriptors to effectively screen different local atomic environments. Thus, discovering appropriate descriptors of bulk or defect properties and the functional dependence of such properties on these descriptors remains a difficult and tedious process. To this end, we develop here a framework to generate descriptors based on many-body correlations that can effectively capture intrinsic geometric features of the local environment of an atom. These descriptors are based on the spectrum of two-body, three-body, four-body, and higher order correlations between an atom and its neighbors and are evaluated by calculating the corresponding two-body, three-body, and four-body overlap integrals. They are invariant to global translation, global rotation, reflection, and permutations of atomic indices. By systematically testing the ability to capture the local atomic environment, it is shown that the local correlation descriptors are able to successfully reconstruct structures containing 10-25 atoms which was previously not possible.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

eCC++ : A Compiler Construction Framework for Embedded Domain-Specific Languages

eCC++ is a new compiler construction framework for embedding domain-specific programming languages within C++. That is, the host language is C++, the guest language is the DSL to be embedded in C++, and eCC++ is the tool that enables the embedding. The eCC++ framework is composed of three main components: a front-end, an API for program verification based on a functional and declarative intermediate representation (IR), and a Multi-Level Intermediate Representation (MLIR) code generator. The eCC++ front-end consists of a library of C++ classes and operators that can be used to define the guest language. Guest sources are compiled with any standard C++ compiler, and when run, the resulting executable generates an eCC++ IR representation of the program, which can be verified within the eCC++ framework. Finally, eCC++ allows for high-level and domain-specific optimizations before generating MLIR. In summary, eCC++ aims to act as a generic front-end that enables embedding guest languages into C++, and provides necessary compiler technology for program verification, targeting the existing capabilities in the MLIR infrastructure. The paper evaluates the eCC++ expressiveness and usability describing the process of embedding GraphIt, a high-performance graph language in C++.

Gonzalez Tallada, Marc↗

DOE OSTI2022

Learning Global Proliferation Expertise Evolution Using AI-Driven Analytics and Public Information

Detecting and anticipating global proliferation expertise and capability evolution from unstructured, noisy, and incomplete public data streams is a highly desired, but extremely challenging task. Here, in this article, we present our pioneering data-driven approach to support the non-proliferation mission to detect and explain the evolution of proliferation expertise and capability development globally from terabytes of publicly available information (PAI), focusing on our knowledge extraction pipeline and descriptive analytics. We first discuss how we fuse nine open-source data streams, including multilingual data, to convert 4 TB of unstructured data to structured knowledge and encode dynamically evolving proliferation expertise representations—content and context graphs. For this, we rely on natural language processing (NLP) and deep learning (DL) models to perform information extraction, topic modeling, and distributed text representation (aka embedding) learning. We then present interactive, usable, and explainable descriptive analytics to refine domain knowledge and present it in a human-understandable form. Finally, we introduce future work avenues that will leverage our dynamic knowledge representations and descriptive analytics to enable predictive and prescriptive inferences to achieve real-time domain understanding and contextual reasoning about global proliferation expertise and capability evolution.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

DOE OSTI2023

LowFive v1.0

LowFive is a new data transport layer based on the HDF5 data model, for in situ workflows. Executables using LowFive can communicate in situ (using in-memory data and MPI message passing), reading and writing traditional HDF5 files to physical storage, and combining the two modes. Minimal and often no source-code modification is needed for programs that already use HDF5. LowFive maintains deep copies or shallow references of datasets, configurable by the user. More than one task can produce (write) data, and more than one task can consume (read) data, accommodating fan-in and fan-out in the workflow task graph. LowFive supports data redistribution from n producer processes to m consumer processes.

Morozov, Dmitriy↗

DOE OSTI2024

Chemical and architectural intricacy from nanoscale tetrahedra and their analogues

The tetrahedron, as the simplest platonic shape, is a profound building block with the potential to create intricate superstructures. Noteworthy designs utilizing tetrahedral building blocks include the Sierpiński tetrahedron (the most fundamental three-dimensional fractal), a one-dimensional helical structure known as the tetrahelix, and various crystalline and quasicrystalline packings. Historically, the practicality of tetrahedral superstructures has been evident, providing stable, well-defined frameworks for various constructions, including truss bridges, tower cranes, and electricity transmission line pylons. In the field of self-assembled nanocrystal superlattices, tetrahedral nanocrystals, as building blocks, occupy a unique place among all the possible nanoscale particles. Mathematical models, simulation work, and experimental studies using nanocrystals in the laboratory have suggested that self-assembled structures derived from nanoscale tetrahedral building blocks are notably intricate, giving rise to new horizons of high-entropy nanocrystal superlattices. An important implication from previous works is that such tetrahedral nanocrystal superlattices form through highly delicate interparticle interactions, emphasizing the importance of the fine features of these nanocrystals. In this article, we summarize the advances in superlattices assembled from tetrahedral nanocrystals. Here, we first define the tetrahedron and tetrahedron analogues based on Conway’s transformation and graph theory, underscoring their relevance to the crystallization process producing tetrahedral nanocrystals. Then, we showcase previous reports on the synthesis of tetrahedral nanocrystals and the resulting nanocrystal superstructures. Finally, we conclude by offering insights and perspective into the chemical and architectural intricacy that could emerge from tetrahedral nanocrystals.

Nanostructure↗