Search NASA⌕ Search

SEARCH · Search NASA

Results for “convolutional networks”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Temporal Convolutional Network Using Empirical Mode Decomposition to Detect Faults in Grid Connected Systems

Grid-connected power electronic systems require timely and reliable fault detection to prevent equipment damage and reduce downtime. This paper presents a forecasting-based anomaly detection pipeline that decomposes voltage and current measurements into intrinsic mode functions (IMFs) using empirical mode decomposition (EMD), then trains a causal temporal convolutional network (TCN) on normal-operation IMF data to predict short-horizon future dynamics. Deviations between forecasts and observations are summarized as reliability-weighted residual scores and thresholded per sensor using robust statistics with temporal persistence constraints to suppress false positives. To reduce runtime, EMD is performed on downsampled signals for detection, while raw-rate EMD is applied only within a short region of interest for high-frequency interpretability near detected events. Results on a simulated grid-connected converter system demonstrate that IMF-domain forecasting improves anomaly separability relative to raw-signal forecasting and provides interpretable evidence of faults across decomposition channels.

Sutton, Elizabeth [ORNL] (ORCID:0009000078885935)↗
DOE OSTI2021

DeepDist: real-value inter-residue distance prediction with deep residual convolutional network

Abstract Background Driven by deep learning, inter-residue contact/distance prediction has been significantly improved and substantially enhanced ab initio protein structure prediction. Currently, most of the distance prediction methods classify inter-residue distances into multiple distance intervals instead of directly predicting real-value distances. The output of the former has to be converted into real-value distances to be used in tertiary structure prediction. Results To explore the potentials of predicting real-value inter-residue distances, we develop a multi-task deep learning distance predictor (DeepDist) based on new residual convolutional network architectures to simultaneously predict real-value inter-residue distances and classify them into multiple distance intervals. Tested on 43 CASP13 hard domains, DeepDist achieves comparable performance in real-value distance prediction and multi-class distance prediction. The average mean square error (MSE) of DeepDist’s real-value distance prediction is 0.896 Å 2 when filtering out the predicted distance ≥ 16 Å, which is lower than 1.003 Å 2 of DeepDist’s multi-class distance prediction. When distance predictions are converted into contact predictions at 8 Å threshold (the standard threshold in the field), the precision of top L/5 and L/2 contact predictions of DeepDist’s multi-class distance prediction is 79.3% and 66.1%, respectively, higher than 78.6% and 64.5% of its real-value distance prediction and the best results in the CASP13 experiment. Conclusions DeepDist can predict inter-residue distances well and improve binary contact prediction over the existing state-of-the-art methods. Moreover, the predicted real-value distances can be directly used to reconstruct protein tertiary structures better than multi-class distance predictions due to the lower MSE. Finally, we demonstrate that predicting the real-value distance map and multi-class distance map at the same time performs better than predicting real-value distances alone.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Assessing the Feasibility of Bordered Block Diagonal Reordering in Power System Matrices using Fully Convolutional Network

In electromagnetic transient (EMT) simulations for power systems and inverter-based resources (IBRs), the arrangement of states within the system's linear equations, represented by matrix A in Ax=b, is critical. The state ordering in matrix A can highlight distinct characteristics of the system's graph, and identifying an optimal state ordering is crucial for efficient computation. The choice of state ordering, however, is dependent on the solver used, as each solver may perform optimally with different matrix patterns. With a wide array of matrix reordering algorithms available, selecting the most suitable one becomes challenging without insights into the matrix's ideal configuration. To address this, the paper proposes a fully convolutional network (FCN) to evaluate the reordering potential of the A matrix into a bordered block diagonal (BBD) pattern, which is commonly observed in power system and IBR modeling. The FCN's assessment aims to streamline the solver's operation, which in turn could substantially reduce the computational time required to find a solution.

Xia, Qianxue↗
DOE OSTI2025

RE-INTEGRATE EMT Simulation Software: Graph Convolutional Network for Sparse Matrix Pattern Detection

The increasing complexity of power networks, driven by proliferation of inverters, presents analytical challenges that simplified models often fail to capture, necessitating Electromagnetic Transient (EMT) simulations. EMT models are represented as discretized differential-algebraic equations (DAEs), forming a linear system Ax = b that is computationally intensive to solve. Due to inherent sparsity of adjacency matrix A, distinct patterns emerge that, when accurately identified, enable efficient solver selection to minimize computation time. However, identifying ideal pattern is complicated by numerous reordering algorithms and limited structural insights. To address this, we introduce a Graph Convolutional Network (GCN) model for classifying sparse matrix patterns common in power system analysis. The model, achieving 96% test accuracy, is validated using PV plant models of 125 MW capacities connected to New England 39-bus transmission system (TS), and further scaled to a 4,992-bus network with 384 PV plants, yielding 191, 616 × 191, 616 sized A matrix. For all cases, the GCN model accurately identifies the matrix’s intrinsic sparse pattern, demonstrating its potential to enhance solver performance in EMT analysis.

Hossain, Md Rifat [Florida International Universit↗
DOE OSTI2022

Power quality disturbances diagnosis: A 2D densely connected convolutional network framework

The fast and accurate diagnosis of power quality disturbances (PQD) aids in avoiding shutdowns and unnecessary procedures, concerning electric energy distribution systems. As such, a number of techniques have been tested and applied in order to reach this objective. Majority of the techniques applied are two-step based. On the first step, power quality disturbances features are extracted. Second step, considering features extracted, disturbance classification is implemented. Recently, relevant literature has presented data-driven signal processing-based approaches, as deep convolutional neural networks (DCNN), which can implement both processing steps while providing automated recognition of patterns and outliers in data. However, not considered by state-of-art, power quality disturbances are evolving in nature, while all possible regularities might not be represented in the dataset. In this work a 2 Dimension Densely Connected Convolutional Network (2D-DenseNet) framework is presented. Further, a case study with synthetic disturbance events are analyzed. Easy-to-implement formulation, built on the 2D-DenseNet, without hard-to-design parameters, highlight potential aspects for real-life implementation.

42 ENGINEERING↗
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 OSTI2022

Denoising Convolutional Networks to Accelerate Detector Simulation

The high accuracy of detector simulation is crucial for modern particle physics experiments. However, this accuracy comes with a high computational cost, which will be exacerbated by the large datasets and complex detector upgrades associated with next-generation facilities such as the High Luminosity LHC. We explore the viability of regression-based machine learning (ML) approaches using convolutional neural networks (CNNs) to "denoise" faster, lower-quality detector simulations, augmenting them to produce a higher-quality final result with a reduced computational burden. The denoising CNN works in concert with classical detector simulation software rather than replacing it entirely, increasing its reliability compared to other ML approaches to simulation. We obtain promising results from a prototype based on photon showers in the CMS electromagnetic calorimeter. Future directions are also discussed.

Banerjee, Sunanda↗
DOE OSTI2021

Denoising Convolutional Networks to Accelerate Detector Simulation [Poster]

The high accuracy of detector simulation is crucial for modern particle physics experiments. However, this accuracy comes with a high computational cost, which will be exacerbated by the large datasets and complex detector upgrades associated with next-generation facilities such as the High Luminosity LHC. We explore the viability of regression-based machine learning (ML) approaches using convolutional neural networks (CNN) to ``denoise'' faster, lower-quality detector simulations, augmenting them to produce a higher-quality final result with a reduced computational burden. The denoising CNN works in concert with classical detector simulation software rather than replacing it entirely, increasing its reliability compared to other ML approaches to simulation. We obtain promising results from a prototype based on photon showers in the CMS electromagnetic calorimeter. Future directions are also discussed.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

When Spectral Modeling Meets Convolutional Networks: A Method for Discovering Reionization-era Lensed Quasars in Multiband Imaging Data

Over the last two decades, around 300 quasars have been discovered at z ≳ 6, yet only one has been identified as being strongly gravitationally lensed. We explore a new approach—enlarging the permitted spectral parameter space, while introducing a new spatial geometry veto criterion—which is implemented via image-based deep learning. We first apply this approach to a systematic search for reionization-era lensed quasars, using data from the Dark Energy Survey, the Visible and Infrared Survey Telescope for Astronomy Hemisphere Survey, and the Wide-field Infrared Survey Explorer. Our search method consists of two main parts: (i) the preselection of the candidates, based on their spectral energy distributions (SEDs), using catalog-level photometry; and (ii) relative probability calculations of the candidates being a lens or some contaminant, utilizing a convolutional neural network (CNN) classification. The training data sets are constructed by painting deflected point-source lights over actual galaxy images, to generate realistic galaxy–quasar lens models, optimized to find systems with small image separations, i.e., Einstein radii of θ E ≤ 1''. Visual inspection is then performed for sources with CNN scores of P lens > 0.1, which leads us to obtain 36 newly selected lens candidates, which are awaiting spectroscopic confirmation. These findings show that automated SED modeling and deep learning pipelines, supported by modest human input, are a promising route for detecting strong lenses from large catalogs, which can overcome the veto limitations of primarily dropout-based SED selection approaches.

High-redshift galaxies↗
DOE OSTI2020

Completion design improvement using a deep convolutional network

Maximizing stimulated natural and hydraulic fracture network is one of the primary hydraulic fracturing concerns for economic production from a horizontal shale gas well. Geomechanical facies and preexisting fractures in each stage are identified based on similarities in formation characteristics to optimize the locations of perforation clusters. This often requires analyzing large volumes of drilling, Logging While Drilling (LWD) and Measurement While Drilling (MWD) data. In this paper, we develop a methodology that calculates the mechanical specific energy (MSE) using real-time drill string acceleration signals directly from its definition. High resolution vibration signals have been collected using a tri-axial accerlometer, which was an auxiliary tool included in acoustic borehole imager. This technique provides a cost-efficient solution for engineered completion design. Furthermore, we adopt deep Convolutional Neural Network (CNN) with signal processing to build a data pipeline that effectively extracts patterns from dynamic acceleration signals for rock lateral MSE classification. First, we apply discrete wavelet transform and Short-Time Fourier Transform (STFT) for signal denoising and pattern recognition. Then we construct an image dataset using multi-scale image fusion at pixel level from 3 sensor channels, including axial, lateral acceleration spectrograms and zero-padded revolutions per minute (RPM). The resulted RGB image dataset includes 4,000 images of 5 MSE ranges with various rock strength conditions. Our results demonstrate that the proposed deep learning model can achieve more than 90% classification accuracy. The deep learning results, as a reference source, were applied in selected Marcellus Shale Energy and Environmental Lab (MSEEL) wells engineered completion located in the Marcellus shale gas site.

03 NATURAL GAS↗
DOE OSTI2022

H-GCN: A Graph Convolutional Network Accelerator on Versal ACAP Architecture

Recently Graph Neural Networks (GNNs) have drawn tremendous attentions due to their unique capability to extend the Machine Learning (ML) approaches to broadly defined applications with unstructured data, especially graphs. Comparing with other ML modalities, the acceleration of GNNs is as critical but even more challenging due to the irregularity and heterogeneity from graph typologies that together limit the performance. Existing efforts mainly focus on handling graphs’ irregularity, however, have not studied the heterogeneity. To this end, in this work, we propose H-GCN, a PL-AIE-based hybrid accelerator that leverages the emerging heterogeneity of Xilinx Versal ACAPs to achieve high-performance GNN inference. In particular, H-GCN partitions each graph into three subgraphs based on its inherent heterogeneity and processes them using PL and the newly emerged AIE respectively. To further improve the performance, we explore the sparsity support of AIE and develop an efficient density-aware method to map tiles of SpMM onto the systolic tensor array automatically. Compared with the current state-of-the-art GCN accelerator, HGCN achieves on average 1.5× speedups.

Zhang, Chengming↗
DOE OSTI2021

I-GCN: A Graph Convolutional Network Accelerator with Runtime Locality Enhancement through Islandization

In this paper, we propose a novel hardware accelerator for GCN inference called I-GCN that significantly improves data locality and reduces unnecessary computation through a new online graph restructuring algorithm we refer to as islandization. The proposed algorithm finds clusters of nodes with strong internal but weak external connections. The islandization process yields two major benefits. First, by processing islands rather than individual nodes, there is better on-chip data reuse and fewer off-chip memory accesses. Second, there is less redundant computation as aggregation for common/shared neighbors in an island can be reused. The parallel search, identification, and leverage of graph islands are all handled purely in hardware at runtime working in an incremental pipelined manner. This is done without any preprocessing of the graph data or adjustment of the GCN model structure.

Geng, Tong↗