Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational graph”

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 1,675 records · Page 93
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Carbon Capture Multidisciplinary Simulation CenterTrilab Support Team Fall Meeting 2018 Report

The TST continues to be very impressed with the quality of work presented and the rapid progress made by the CCMSC on a highly complex multiphysics problem domain. The Center is gathering increasing expertise and experience in multiple areas likely to be of broad interest to DOE and the greater HPC community, particularly in the areas of programming models and DSLs, I/O, V&V/UQ, and visualization/data analytics. This year in particular saw very impressive results in their task graph algorithms, strong and weak scaling of their overall code, and sophistication of their physics models and V/UQ analysis and approach. The team was particularly impressed with the depth of engagement and quality of discussion at the V/UQ deep dive. There are very few organizations outside of NNSA doing multiphysics simulation at this level of accuracy, efficiency, scale and sophistication and DOE would be well-advised to actively work to maintain a close collaborative relationship with this team after the completion of the PSAAP II program if at all possible.

20 FOSSIL-FUELED POWER PLANTS↗
DOE OSTI2022

Tunable Geometries in Sparse Clifford Circuits

We investigate the emergence of different effective geometries in stochastic Clifford circuits with sparse coupling. By changing the probability distribution for choosing two-site gates as a function of distance, we generate sparse interactions that either decay or grow with distance as a function of a single tunable parameter. Tuning this parameter reveals three distinct regimes of geometry for the spreading of correlations and growth of entanglement in the system. We observe linear geometry for short-range interactions, treelike geometry on a sparse coupling graph for long-range interactions, and an intermediate fast scrambling regime at the crossover point between the linear and treelike geometries. This transition in geometry is revealed in calculations of the subsystem entanglement entropy and tripartite mutual information. We also study emergent lightcones that govern these effective geometries by teleporting a single qubit of information from an input qubit to an output qubit. These tools help to analyze distinct geometries arising in dynamics and correlation spreading in quantum many-body systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Spatiotemporal Graph Convolutional Networks for Earthquake Source Characterization

Abstract Accurate earthquake location and magnitude estimation play critical roles in seismology. Recent deep learning frameworks have produced encouraging results on various seismological tasks (e.g., earthquake detection, phase picking, seismic classification, and earthquake early warning). Many existing machine learning earthquake location methods utilize waveform information from a single station. However, multiple stations contain more complete information for earthquake source characterization. Inspired by recent successes in applying graph neural networks (GNNs) in graph‐structured data, we develop a Spatiotemporal Graph Neural Network (STGNN) for estimating earthquake locations and magnitudes. Our graph neural network leverages geographical and waveform information from multiple stations to construct graphs automatically and dynamically by adaptive message passing based on graphs' edges. Using a recent graph neural network and a fully convolutional neural network as baselines, we apply STGNN to earthquakes recorded by the Southern California Seismic Network from 2000 to 2019 and earthquakes collected in Oklahoma from 2014 to 2015. STGNN yields more accurate earthquake locations than those obtained by the baseline models and performs comparably in terms of depth and magnitude prediction, though the ability to predict depth and magnitude remains weak for all tested models. Our work demonstrates the potential of using GNNs and multiple stations for better automatic estimation of earthquake epicenters.

58 GEOSCIENCES↗
DOE OSTI2025

CuXASNet: Rapid and accurate prediction of copper L-edge x-ray absorption spectra using machine learning

In this work, we have developed CuXASNet, a dense neural network that predicts simulated Cu -edge x-ray absorption spectra (XAS) from atomic structures. Featurization of the Cu local environment is performed using a component of M3GNet, a graph neural network developed for predicting the potential energy surface. CuXASNet is trained on simulated spectra from FEFF9 at the multiple scattering level of theory, and can predict the and edges for Cu sites to quantitative accuracy. To validate our approach, we compare 14 experimental spectra extracted from the literature with the predictions of CuXASNet. The agreement of CuXASNet with experiments is shown by an average mean absolute error of 0.125 and an average Spearman's correlation coefficient of 0.891, which is comparable to FEFF9's values of 0.131 and 0.898 for the same metrics. As such, CuXASNet can rapidly predict a large number of -edge XAS spectra at the same accuracy as FEFF9 simulations. This can be used as a drop-in replacement for multiple scattering codes for fast screening of candidate atomic structure models of a measured system. This model establishes a general framework for Cu XAS prediction, and can be extended to more computationally expensive levels of theory and to other transition metal edges.

36 MATERIALS SCIENCE↗
NASA NTRS1989

Collision integrals and high temperature transport properties for N-N, O-O, and N-O

Accurate collision integrals are reported for the interactions of N(4 S 0) + N(4 S 0), O(3 P), and N(4 S 0) + O(3 P). These are computed from a semiclassical formulation of the scattering using the best available representations of all of the potential energy curves needed to describe the collisions. Experimental RKR curves and other accurate measured data are used where available; the results of accurate ab initio electronic structure calculations are used to determine the remaining potential curves. The high-lying states are found to give the largest contributions to the collision cross sections. The nine collision integrals, needed to determine transport properties to second order, are tabulated for translational temperatures in the range 250 K to 100,000 K. These results are intended to reduce the uncertainty in future predictions of the transport properties of nonequilibrium air, particularly at high temperatures. The viscosity, thermal conductivity, diffusion coefficient, and thermal diffusion factor for a gas composed of nitrogen and oxygen atoms in thermal equilibrium are calculated. It was found that the second order contribution to the transport properties is small. Graphs of these transport properties for various mixture ratios are presented for temperatures in the range 5000 to 15000 K.

Levin, E.↗
DOE OSTI2018

Quickest Detection for Changes in Maximal kNN Coherence of Random Matrices

This paper addresses the problem of quickest detection of a change in the maximal coherence between columns of a n p random matrix based on a sequence of matrix observations having a single unknown change point. The random matrix is assumed to have identically distributed rows and the maximal coherence is defined as the largest of the ( 2 p) correlation coefficients associated with any row. Likewise the κ nearest neighbor (kNN) coherence is defined as the κ-th largest of these correlation coefficients. The forms of the preand postchange distributions of the observed matrices are assumed to belong to the family of elliptically contoured densities with sparse dispersion matrices but are otherwise unknown. A nonparametric stopping rule is proposed that is based on the maximal kNN sample coherence between columns of each observed random matrix. This is a summary statistic that is related to a test of existence of a hub vertex in a sample correlation graph having degree at least κ. Performance bounds on the delay and false alarm performance of the proposed stopping rule are obtained in the purely high-dimensional regime where p → ∞ and n is fixed. When the prechange dispersion matrix is diagonal it is shown that, among all functions of the proposed summary statistic, the proposed stopping rule is asymptotically optimal under a minimax quickest change detection model as the stopping threshold approaches infinity. Furthermore, the theory developed also applies to sequential hypothesis testing and fixed sample size tests.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2025

Exploring Multilayer Network Models to Build a Scientific Basis for Integrated Deterrence: Final Report

The emerging multipolar international security environment represents a fundamental restructuring of global nuclear balance of power to include two nuclear peer competitors, growing non-peer nuclear threats, and concerns of nuclear latency from both allies and adversaries. Conflicts in the grey zone, cyber operations, mis- and disinformation campaigns, and emerging disruptive technologies like drones, and hypersonic missiles are becoming more prevalent. These present a risk of cross-domain and multi-domain conflicts that may not follow known escalatory patterns. In order to prepare for the new deterrence environment, it is critical to have quantitative and qualitative understandings of these cross-domain conflicts, their potential for escalation, and which systems they may impact. To that end, our team created a Multi-Layer Network (MLN) model of ‘integrated deterrence’ where instruments of national power are modeled as individual network graph layers that include efforts from all domains. We then evaluate the potential for escalation against escalation scenarios. Analysis of the escalation scenarios is then used to identify insights of potential risk and escalation within integrated deterrence.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2024

On the use of Graphs for Test Sequence Selection

This report demonstrates that applying graph theory techniques provides a way to obtain sufficient statistics in finding errors when testing complex state machines. It discusses how to define the tests, then demonstrates how to automatically generate test suites that diversify test cases, subject to constraints. If included within a continuous integration approach, these constructs provide an unbiased means to systematically check for errors within the latest controller software release.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Posiform planting: generating QUBO instances for benchmarking

We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. Such problems are NP-hard in general, implying that the exact minima of randomly generated instances are hard to find and thus typically unknown. While brute forcing smaller instances is possible, such instances are typically not interesting due to being too easy for both quantum and classical algorithms. In this contribution, we propose a novel method, called posiform planting , for generating random QUBO instances of arbitrary size with known optimal solutions, and use those instances to benchmark the sampling quality of four D-Wave quantum annealers utilizing different interconnection structures (Chimera, Pegasus, and Zephyr hardware graphs) and the simulated annealing algorithm. Posiform planting differs from many existing methods in two key ways. It ensures the uniqueness of the planted optimal solution, thus avoiding groundstate degeneracy, and it enables the generation of QUBOs that are tailored to a given hardware connectivity structure, provided that the connectivity is not too sparse. Posiform planted QUBOs are a type of 2-SAT boolean satisfiability combinatorial optimization problems. Our experiments demonstrate the capability of the D-Wave quantum annealers to sample the optimal planted solution of combinatorial optimization problems with up to 5, 627 qubits.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2010

The Process of the Development of an Operator

On the job training is where new employees called operators can start gaining knowledge on what they will be working on during their time in JSC. In these lessons I learned different things that are important ranging from thermal systems to electrical systems. While doing OJT classes the student will learn how to use a portable computer system which has displays that I also helped edit and clean up. The way you can also learn is by reading system briefs which describes the different systems. Due to the fact of a possible change in the ISS I updated a systems brief so that it can be relevant to what is actually on the space station. I was given a task that will help develop my skills and make myself better prepared for my future in the work field. The project that I worked on had me pulling real time data from the International Space Station. The Data I obtained from the space station will be correlated to battery performance. The group I will be working which is called REBA and we will take the telemetry and evaluate the data. I will be working with my mentor Ben Chislom and co-op Tyler along with the Pro team. They then will put this data into a graph so that they can get the discrepancies and find a way to improve the battery performance. The first weeks I read familiarization books that informed me how the ISS works, how it was built, and the systems that are used to keep the station working. This project is going to benefit NASA by finding out how electricity is being used on the ISS and enabling us to see how it can be used more efficiently. This way we can operate the ISS without wasting power. While conducting research that goes on inside the space station knowing all electricity is being used efficiently.

Banks, Terrence↗
DOE OSTI2020

Detecting multiple communities using quantum annealing on the D-Wave system

A very important problem in combinatorial optimization is the partitioning of a network into communities of densely connected nodes; where the connectivity between nodes inside a particular community is large compared to the connectivity between nodes belonging to different ones. This problem is known as community detection, and has become very important in various fields of science including chemistry, biology and social sciences. The problem of community detection is a twofold problem that consists of determining the number of communities and, at the same time, finding those communities. This drastically increases the solution space for heuristics to work on, compared to traditional graph partitioning problems. In many of the scientific domains in which graphs are used, there is the need to have the ability to partition a graph into communities with the “highest quality” possible since the presence of even small isolated communities can become crucial to explain a particular phenomenon. We have explored community detection using the power of quantum annealers, and in particular the D-Wave 2X and 2000Q machines. It turns out that the problem of detecting at most two communities naturally fits into the architecture of a quantum annealer with almost no need of reformulation. This paper addresses a systematic study of detecting two or more communities in a network using a quantum annealer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Uncovering Structure–Conductivity Relationships in Anion Exchange Membranes (AEMs) Using Interpretable Machine Learning

Anion exchange membranes (AEMs) play a vital role in the performance of water electrolyzers and fuel cells, yet their discovery and optimization remain challenging due to the complexity of structure–property relationships. In this study, we introduce a machine learning framework that leverages conditional graph neural networks (cGNNs) and descriptor-based models and a hybrid graph neural network (HGARE) to predict and interpret ionic conductivity. The descriptor-based pipeline employs principal component analysis (PCA), ablation, and SHAP analysis to identify factors governing anion conductivity, revealing electronic, topological, and compositional descriptors as key contributors. Beyond prediction, dimensionality reduction and clustering are performed by employing t-SNE and KMeans as well as SOM, which reveal distinct membranes clusters, some of which were enriched with high anion conductivity. Among graph-based approaches, the graph convolutional (GCN) achieved strong predictive performance, while the Hybrid Graph Autoencoder-Regressor Ensemble (HGARE) achieved the highest accuracy. Additionally, atom-level saliency maps from GCN provide spatial explanations for conductive behavior, revealing the importance of polarizable and flexible regions. This work contributes to the accelerated and data-driven design of high-performance AEMs.

Naghshnejad, Pegah [Department of Chemical Enginee↗
DOE OSTI2023

Noise dynamics of quantum annealers: estimating the effective noise using idle qubits

Quantum annealing is a type of analog computation that aims to use quantum mechanical fluctuations in search of optimal solutions of QUBO (quadratic unconstrained binary optimization) or, equivalently, Ising problems. Since NP-hard problems can in general be mapped to Ising and QUBO formulations, the quantum annealing paradigm has the potential to help solve various NP-hard problems. Current quantum annealers, such as those manufactured by D-Wave Systems, Inc. have various practical limitations including the size (number of qubits) of the problem that can be solved, the qubit connectivity, and error due to the environment or system calibration, which can reduce the quality of the solutions. Typically, for an arbitrary problem instance, the corresponding QUBO (or Ising) structure will not natively embed onto the available qubit architecture on the quantum chip. Thus, in these cases, a minor embedding of the problem structure onto the device is necessary. However, minor embeddings on these devices do not always make use of the full sparse chip hardware graph, and a large portion of the available qubits stay unused during quantum annealing. In this work, we embed a disjoint random QUBO on the unused parts of the chip alongside the QUBO to be solved, which acts as an indicator of the solution quality of the device over time. Using experiments on three different D-Wave quantum annealers, we demonstrate that (i) long term trends in solution quality exist on the D-Wave device, and (ii) the unused qubits can be used to measure the current level of noise of the quantum system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Modeling of three-dimensional surfaces using high-level canonical piecewise-linear functions in cylindrical coordinates

In this paper, the potential application of the high-level canonical piecewise-linear model in the field of three-dimensional visualization is proposed. This idea emerges from the premise that a three-dimensional surface can be modeled by a continuous two-dimensional function. In this regard, the main contribution consists in providing a methodology for the construction of such function. For this purpose, the well-known algorithm used in the high-level canonical piecewise-linear model has been modified to achieve functions with greater graphing capability. One of the most notorious changes made with respect to the traditional methodology is the use of a new scheme of function domain partition. Contrary to the simplicial partitioning, in our proposal, an equally distributed angular partitioning is considered. With this, the resulting approximate function is expressed in cylindrical coordinates which overcome the typical limitation of graphs in Cartesian coordinates of only representing single-valued surfaces. Another remarkable change can be found in the range of evaluation of the function. Instead of using an open interval, in our approach, a closed interval from 0 to 2π is adopted. To support this proposal, illustrative case studies are reported. Numerical simulations demonstrate the effectiveness of this type of representation model not only in visual perception of three-dimensional surfaces, but also in more complex tasks like volume estimation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

FY18 Proxy App Suite Release. Milestone Report for the ECP Proxy App Project

The ECP Proxy App Team released version 2.0 of the ECP Proxy App suite on September 28, 2018. The new version includes 5 new proxies and adds or improves coverage in several areas, most notably graph analytics and communication patterns. Proxy apps are used heavily by the PathForward projects, and several of the new proxies are being eagerly adopted. Over the last year we have observed vendors are becoming more sophisticated in their use of proxy apps. However, there is still progress to be made, especially in the area of ensuring that representative problem specifications are used. The Proxy App Team is currently working on such specifications and will be publishing them on our website in the near future.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗
NASA NTRS2004

Software for Preprocessing Data from Rocket-Engine Tests

Three computer programs have been written to preprocess digitized outputs of sensors during rocket-engine tests at Stennis Space Center (SSC). The programs apply exclusively to the SSC E test-stand complex and utilize the SSC file format. The programs are the following: Engineering Units Generator (EUGEN) converts sensor-output-measurement data to engineering units. The inputs to EUGEN are raw binary test-data files, which include the voltage data, a list identifying the data channels, and time codes. EUGEN effects conversion by use of a file that contains calibration coefficients for each channel. QUICKLOOK enables immediate viewing of a few selected channels of data, in contradistinction to viewing only after post-test processing (which can take 30 minutes to several hours depending on the number of channels and other test parameters) of data from all channels. QUICKLOOK converts the selected data into a form in which they can be plotted in engineering units by use of Winplot (a free graphing program written by Rick Paris). EUPLOT provides a quick means for looking at data files generated by EUGEN without the necessity of relying on the PV-WAVE based plotting software.

Cheng, Chiu-Fu↗
NASA NTRS2002

Software for Preprocessing Data From Rocket-Engine Tests

Three computer programs have been written to preprocess digitized outputs of sensors during rocket-engine tests at Stennis Space Center (SSC). The programs apply exclusively to the SSC "E" test-stand complex and utilize the SSC file format. The programs are the following: 1) Engineering Units Generator (EUGEN) converts sensor-output-measurement data to engineering units. The inputs to EUGEN are raw binary test-data files, which include the voltage data, a list identifying the data channels, and time codes. EUGEN effects conversion by use of a file that contains calibration coefficients for each channel; 2) QUICKLOOK enables immediate viewing of a few selected channels of data, in contradistinction to viewing only after post test processing (which can take 30 minutes to several hours depending on the number of channels and other test parameters) of data from all channels. QUICKLOOK converts the selected data into a form in which they can be plotted in engineering units by use of Winplot (a free graphing program written by Rick Paris); and 3) EUPLOT provides a quick means for looking at data files generated by EUGEN without the necessity of relying on the PVWAVE based plotting software.

Cheng, Chiu-Fu↗