Search NASA⌕ Search

SEARCH · Search NASA

Results for “Adaptive convolution.”

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 55 records · Page 3

Time projection chamber for GADGET II

The established Gaseous Detector with Germanium Tagging (GADGET) detection system is used to measure weak, low-energy 𝛽-delayed proton decays. It consists of the Gaseous Proton Detector equipped with a MICROMEGAS (MM) readout to detect protons and other charged particles calorimetrically, surrounded by the Segmented Germanium Array (SeGA) for high-resolution detection of prompt 𝛾 rays. To upgrade GADGET's Proton Detector to operate as a compact time projection chamber (TPC) for the detection, three-dimensional imaging and identification of low-energy 𝛽-delayed single- and multiparticle emissions mainly of interest to astrophysical studies. A new high granularity MM board with 1024 pads has been designed, fabricated, installed, and tested. A high-density data acquisition system based on generic electronics for TPCs (GET) has been installed and optimized to record and process the gas avalanche signals collected on the readout pads. The TPC's performance has been tested using a 220 Rn 𝛼-particle source and cosmic-ray muons. In addition, decay events in the TPC have been simulated by adapting the attpcroot data analysis framework. Furthermore, a novel application of two-dimensional convolutional neural networks for GADGET II event classification is introduced. The optimization of data throughput is also addressed. The GADGET II TPC is capable of detecting and identifying 𝛼 particles as well as measuring their track direction, range, and energy. The extracted energy resolution of the GADGET II TPC using P10 gas is about 5.4% at 6.288 MeV ( 220 Rn 𝛼 events), computed using charge integration. Based on a systematic simulation study, we estimated the detection efficiency of the GADGET II TPC for protons and 𝛼 particles, respectively. It has also been demonstrated that the GADGET II TPC is capable of tracking minimum-ionizing particles (i.e., cosmic-ray muons). From these measurements, the electron drift velocity was measured under typical operating conditions. In addition to being one of the first generation of micropattern gaseous detectors (MPGDs) to utilize a resistive anode applied to low-energy nuclear physics, the GADGET II TPC will also be the first TPC surrounded by a high-efficiency array of high-purity germanium 𝛾-ray detectors. As a result, the TPC of GADGET II has been designed, fabricated, and tested and is ready for operation at the Facility for Rare Isotope Beams for radioactive-beam-line experiments.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Automated Threat Recognition For Aviation Security Applications

We have developed a framework for automated threat recognition (ATR) of explosive threat materials for both single-energy and dual-energy X-ray CT systems. Under this framework, two different types of ATR have been developed. The first type of ATR employs supervised machine learning with statistical characterization of target materials for threat identification training. The reliance only on statistical characterization information for threat training uniquely enables this style of ATR to adapt quickly to evolving threats. The second type of ATR employs deep learning through convolutional neural networks. Convolutional neural networks are attractive due to their human-like capacity for learning and strong ability to identify trends and patterns. Although this method is more powerful than the first type, it requires large amounts of training data and therefore is less agile. Each ATR performs threat characterization at the voxel neighborhood level. This approach avoids the use of threat shape as a detection criterion, which is prohibited by DHS and TSA guidelines.

97 MATHEMATICS AND COMPUTING↗

Detection of Synchrophasor False Data Injection Attack using Feature Interactive Network

The synchrophasor data recorded by Phasor Measurement Units (PMUs) plays an increasingly critical role in the regulation and situational awareness of power systems. However, the widely installed PMUs are vulnerable to multiple malicious attacks from cyber hackers during data transmission and storage. To address this problem, a Modified Ensemble Empirical Mode Decomposition (MEEMD) is proposed first to extract the intrinsic mode functions of each Synchrophasor Data Attacks (SDA). The frequency-based adaptive screening criterion embedded in MEEMD is used to eliminate the false intrinsic mode functions. Next, a Multivariate Convolutional Neural Network (MCNN) is proposed to identify multiple SDA by utilizing the extracted intrinsic mode functions and original SDA as input vectors. A fusion block as the main structure of MCNN is also leveraged to increase the diversity of features and compress the model parameters. Integrating MEEMD and MCNN, a framework with automatic feature extraction and multi-source information fusion capability, referred to as Feature Interactive Network (FIN), is proposed to detect multiple SDA. Based on the proposed FIN framework, six types of SDA are explored for the first time using actual synchrophasor data in FNET/Grideye that was collected from different locations in the U.S. Eastern Interconnection. Finally, a large quantity of experiments with different attack strengths are used to evaluate the adaptability and classification performance of the proposed FIN.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Modified Sequence-to-point HVAC Load Disaggregation Algorithm

This paper presents a modified sequence-to-point (S2P) algorithm for disaggregating the heat, ventilation, and air conditioning (HVAC) load from the total building electricity consumption. The original S2P model is convolutional neural network (CNN) based, which uses load profiles as inputs. We propose three modifications. First, the input convolution layer is changed from 1D to 2D so that normalized temperature profiles are also used inputs to the S2P model. Second, a drop-out layer is added to improve adaptability and generalizability so that the model trained in one area can be transferred to other geographical areas without labelled HVAC data. Third, a fine-tuning process is proposed for areas with a small amount of labelled HVAC data so that the pre-trained S2P model can be fine-tuned to achieve higher disaggregation accuracy (i.e., better transferability) in other areas. The model is first trained and tested using smart meter and sub-metered HVAC data collected in Austin, Texas. Then, the trained model is tested on two other areas: Boulder, Colorado and San Diego, California. Simulation results show that the proposed modified S2P algorithm outperforms the original S2P model and the support-vector machine based approach in accuracy, adaptability, and transferability.

Ye, Kai↗

Reconstruction of 3D Concrete Microstructures Combining High-Resolution Characterization and Convolutional Neural Network for Image Segmentation

After water, concrete is the second most used material in the world. Concrete’s forming adaptability and low-cost constituents make it a predominant material used in the construction of civil infrastructures in nuclear power plants such as concrete biological shields, containment buildings, turbine buildings, fuel handling and storage buildings, underground piping for cooling, cooling towers, and so on. Depending on environmental and operating conditions, these passive structures are subject to time-dependent phenomena that can either enhance (e.g., continued hydration) or degrade concrete’s structural performance. Unlike components such as the reactor pressure vessel and the primary circuit, concrete composition varies regionally because it is manufactured using local aggregates and cement. Hence, concrete performance metrics over time cannot be derived confidently using empirical relations. Alternatively, the specific characteristics of the local concrete constituents and their assemblage in concrete must be considered.

36 MATERIALS SCIENCE↗

Adaptive autoencoder latent space tuning for more robust machine learning beyond the training set for six-dimensional phase space diagnostics of a time-varying ultrafast electron-diffraction compact accelerator

In this work, we present a general adaptive latent space tuning approach for improving the robustness of machine learning tools with respect to time variation and distribution shift. We demonstrate our approach by developing an encoder-decoder convolutional neural network-based virtual 6D phase space diagnostic of charged particle beams in the HiRES ultrafast electron diffraction (UED) compact particle accelerator with uncertainty quantification. Our method utilizes model-independent adaptive feedback to tune a low dimensional 2D latent space representation of ~1 million dimensional objects which are the 15 unique 2D projections (x, y),...,(z, p z ) of the 6D phase space (x, y, z, p x , p y , p z ) of the charged particle beams. We demonstrate our method with numerical studies of short electron bunches utilizing experimentally measured UED input beam distributions.

43 PARTICLE ACCELERATORS↗

Explore Spatio‐Temporal Learning of Large Sample Hydrology Using Graph Neural Networks

Abstract Streamflow forecasting over gauged and ungauged basins play a vital role in water resources planning, especially under the changing climate. Increased availability of large sample hydrology data sets, together with recent advances in deep learning techniques, has presented new opportunities to explore temporal and spatial patterns in hydrological signatures for improving streamflow forecasting. The purpose of this study is to adapt and benchmark several state‐of‐the‐art graph neural network (GNN) architectures, including ChebNet, Graph Convolutional Network (GCN), and GraphWaveNet, for end‐to‐end graph learning. We explicitly represent river basins as nodes in a graph, learn the spatiotemporal nodal dependencies, and then use the learned relations to predict streamflow simultaneously across all nodes in the graph. The efficacy of the developed GNN models is investigated using the Catchment Attributes and MEteorology for Large‐sample Studies (CAMELS) data set under two settings, fixed graph topology (transductive learning), and variable graph topology (inductive learning), with the latter applicable to prediction in ungauged basins (PUB). Results indicate that GNNs are generally robust and computationally efficient, achieving similar or better performance than a baseline model trained using the long short‐term memory (LSTM) network. Further analyses are conducted to interpret the graph learning process at the edge and node levels and to investigate the effect of different model configurations. We conclude that graph learning constitutes a viable machine learning‐based method for aggregating spatiotemporal information from a multitude of sources for streamflow forecasting

Sun, Alexander Y.↗

Accelerate microstructure evolution simulation using graph neural networks with adaptive spatiotemporal resolution

Abstract Surrogate models driven by sizeable datasets and scientific machine-learning methods have emerged as an attractive microstructure simulation tool with the potential to deliver predictive microstructure evolution dynamics with huge savings in computational costs. Taking 2D and 3D grain growth simulations as an example, we present a completely overhauled computational framework based on graph neural networks with not only excellent agreement to both the ground truth phase-field methods and theoretical predictions, but enhanced accuracy and efficiency compared to previous works based on convolutional neural networks. These improvements can be attributed to the graph representation, both improved predictive power and a more flexible data structure amenable to adaptive mesh refinement. As the simulated microstructures coarsen, our method can adaptively adopt remeshed grids and larger timesteps to achieve further speedup. The data-to-model pipeline with training procedures together with the source codes are provided.

36 MATERIALS SCIENCE↗

Wootz: a compiler-based framework for fast CNN pruning via composability

Convolutional Neural Networks (CNN) are widely used for Deep Learning tasks. CNN pruning is an important method to adapt a large CNN model trained on general datasets to fit a more specialized task or a smaller device. The key challenge is on deciding which filters to remove in order to maximize the quality of the pruned networks while satisfying the constraints. It is time-consuming due to the enormous configuration space and the slowness of CNN training.The problem has drawn many efforts from the machine learning field, which try to reduce the set of network configurations to explore. This work tackles the problem distinctively from a programming systems perspective, trying to speed up the evaluations of the remaining configurations through computation reuse via a compiler-based framework. We empirically uncover the existence of composability in the training of a collection of pruned CNN models, and point out the opportunities for computation reuse. We then propose composability-based CNN pruning, and design a compression-based algorithm to efficiently identify the set of CNN layers to pre-train for maximizing their reuse benefits in CNN pruning. We further develop a compiler-based framework named Wootz, which, for an arbitrary CNN, automatically generates code that builds a Teacher-Student scheme to materialize composability-based pruning. Experiments show that network pruning enabled by Wootz shortens the state-of-art pruning process by up to 186X while producing significantly better pruning results.

Guan, Hui↗

Adaptive methods of generating complex light arrays

Structured light arrays of various shapes have been a cornerstone in optical science, driven by the complexities of precise and adaptable generation. This study introduces an approach using a spatial light modulator (SLM) as a generator for these arrays. By projecting a holographic mask onto the SLM, it functions simultaneously as an optical convolution device, focusing mechanism, and structured light beam mask. Our approach offers unmatched versatility, allowing for the experimental fabrication of traditional beam arrays like azimuthal Laguerre–Gaussian (LG), Bessel–Gaussian (BG), and Hermite–Gauss (HG) in the far-field. Notably, it has enabled a method of generating Ince–Gauss (IG) and LG radial mode beam arrays using a convolution solution. Our system provides exceptional control over array periodicity and intensity distribution, bypassing the Talbot self-imaging phenomenon seen in traditional setups. We provide an in-depth theoretical discussion, supported by empirical evidence, of our far-field results. This method has vast potential for applications in optical communication, data processing, and multi-particle manipulation. It paves the way for rapid generation of structured light with high spatial frequencies and complex shapes, promising transformative advances in these domains.

Optics↗

Feature‐shared adaptive‐boost deep learning for invasiveness classification of pulmonary subsolid nodules in CT images

Purpose In clinical practice, invasiveness is an important reference indicator for differentiating the malignant degree of subsolid pulmonary nodules. These nodules can be classified as atypical adenomatous hyperplasia (AAH), adenocarcinoma in situ (AIS), minimally invasive adenocarcinoma (MIA), or invasive adenocarcinoma (IAC). The automatic determination of a nodule's invasiveness based on chest CT scans can guide treatment planning. However, it is challenging, owing to the insufficiency of training data and their interclass similarity and intraclass variation. To address these challenges, we propose a two‐stage deep learning strategy for this task: prior‐feature learning followed by adaptive‐boost deep learning. Methods The adaptive‐boost deep learning is proposed to train a strong classifier for invasiveness classification of subsolid nodules in chest CT images, using multiple 3D convolutional neural network (CNN)‐based weak classifiers. Because ensembles of multiple deep 3D CNN models have a huge number of parameters and require large computing resources along with more training and testing time, the prior‐feature learning is proposed to reduce the computations by sharing the CNN layers between all weak classifiers. Using this strategy, all weak classifiers can be integrated into a single network. Results Tenfold cross validation of binary classification was conducted on a total of 1357 nodules, including 765 noninvasive (AAH and AIS) and 592 invasive nodules (MIA and IAC). Ablation experimental results indicated that the proposed binary classifier achieved an accuracy of with an AUC of 81.3 . These results are superior compared to those achieved by three experienced chest imaging specialists who achieved an accuracy of , , and , respectively. About 200 additional nodules were also collected. These nodules covered 50 cases for each category (AAH, AIS, MIA, and IAC, respectively). Both binary and multiple classifications were performed on these data and the results demonstrated that the proposed method definitely achieves better performance than the performance achieved by nonensemble deep learning methods. Conclusions It can be concluded that the proposed adaptive‐boost deep learning can significantly improve the performance of invasiveness classification of pulmonary subsolid nodules in CT images, while the prior‐feature learning can significantly reduce the total size of deep models. The promising results on clinical data show that the trained models can be used as an effective lung cancer screening tool in hospitals. Moreover, the proposed strategy can be easily extended to other similar classification tasks in 3D medical images.

Wang, Jun↗

An Infinite Domain 3D Poisson Solver Based on the Barnes-Hut Algorithm

We present a domain decomposition method for the solution of the 3D Poisson equation with infinite domain boundary conditions. The method is based on an application of the Barnes-Hut tree particle scheme adapted to gridded data. Long range interactions are computed using the first two terms in the Cartesian multipole expansion of Green’s function convoluted with the charge while short range computations are performed using Hockney’s domain doubling algorithm. A standard domain decomposition strategy requires O(N 2 ) applications of Hockney’s algorithm, where N is the number of subdomains that intersect that charge support, while in the present approach only O(Nlog 2 N) such computations suffice. The discretization scheme employed is a sixth order Mehrstellen approximation of the 3D Laplace opera tor. The method exhibits satisfactory accuracy at a substantially reduced computational cost compared to the full domain decomposition Hockney’s algorithm.

97 MATHEMATICS AND COMPUTING↗

Dynamic Profiling of β-Coronavirus 3CL Mpro Protease Ligand-Binding Sites

β-coronavirus (CoVs) alone has been responsible for three major global outbreaks in the 21st century. The current crisis has led to an urgent requirement to develop therapeutics. Even though a number of vaccines are available, alternative strategies targeting essential viral components are required as a backup against the emergence of lethal viral variants. One such target is the main protease (Mpro) that plays an indispensable role in viral replication. The availability of over 270 Mpro X-ray structures in complex with inhibitors provides unique insights into ligand–protein interactions. Herein, we provide a comprehensive comparison of all nonredundant ligand-binding sites available for SARS-CoV2, SARS-CoV, and MERS-CoV Mpro. Extensive adaptive sampling has been used to investigate structural conservation of ligand-binding sites using Markov state models (MSMs) and compare conformational dynamics employing convolutional variational auto-encoder-based deep learning. Our results indicate that not all ligand-binding sites are dynamically conserved despite high sequence and structural conservation across β-CoV homologs. This highlights the complexity in targeting all three Mpro enzymes with a single pan inhibitor.

59 BASIC BIOLOGICAL SCIENCES↗

Few-Shot Learning Enables Population-Scale Analysis of Leaf Traits in Populus trichocarpa

Plant phenotyping is typically a time-consuming and expensive endeavor, requiring large groups of researchers to meticulously measure biologically relevant plant traits, and is the main bottleneck in understanding plant adaptation and the genetic architecture underlying complex traits at population scale. In this work, we address these challenges by leveraging few-shot learning with convolutional neural networks to segment the leaf body and visible venation of 2,906 Populus trichocarpa leaf images obtained in the field. In contrast to previous methods, our approach (a) does not require experimental or image preprocessing, (b) uses the raw RGB images at full resolution, and (c) requires very few samples for training (e.g., just 8 images for vein segmentation). Traits relating to leaf morphology and vein topology are extracted from the resulting segmentations using traditional open-source image-processing tools, validated using real-world physical measurements, and used to conduct a genome-wide association study to identify genes controlling the traits. In this way, the current work is designed to provide the plant phenotyping community with (a) methods for fast and accurate image-based feature extraction that require minimal training data and (b) a new population-scale dataset, including 68 different leaf phenotypes, for domain scientists and machine learning researchers. All of the few-shot learning code, data, and results are made publicly available.

59 BASIC BIOLOGICAL SCIENCES↗

Efficient Multiscale Optoelectronic Prediction for Conjugated Polymers

Conjugated polymers represent a high-potential material class due to the tunability of their optoelectronic properties via straightforward processing protocols. However, to in silico tailor these optoelectronic properties, one must compute the conformationally dependent electronic structure over mesoscopic length and time scales. This task represents a challenging multiscale computational problem in which quantum chemistry and atomistic or coarse-grained molecular dynamics must be integrated. Recently, we introduced a methodology, called electronic coarse graining (ECG), that utilizes artificial neural networks to compute ab initio quality electronic structures using only the reduced degrees of freedom of coarse-grained models. Here, we adapt ECG to variable-molecular weight conjugated oligomers by casting the problem in the framework of sequence detection. A machine-learning (ML) architecture employing one-dimensional convolutional neural networks and long short-term memory networks is utilized to compute ground-state orbital energies, charge density distributions, and optical spectra solely from the coarse-grained model's configurational degrees of freedom. Robust molecular weight transferability for ECG is established via a A-ML approach that leverages model electronic Hamiltonians for ground and excited-state property determination. The accuracy and transferability of the ECG methodology opens the door for scalable optoelectronic property prediction in conjugated polymers directly from coarse-grained degrees of freedom.

36 MATERIALS SCIENCE↗

Topological analysis of X-ray CT data for the recognition and trending of subtle changes in microstructure under material aging

X-ray computed tomography (CT) is an established non-destructive tool for 3D imaging of multiphasic composites. Numerous applications of X-ray CT in medical diagnosis and materials characterization have been reported, many involving field-specific innovations in the imaging technology itself. Yet, quantitative summarization to link image features to properties of interest has been rare. Here we address this issue by employing state-of-the-art technics in scalar field topology for the summarization of X-ray CT images of an example biphasic system. By varying processing-parameters we create different microstructures, evolve them through accelerated thermal aging, CT-image them pre- and post-aged, and demonstrate the ability of our image summarization method to systematically track process- and age-related changes, which can often be very subtle. A novel aspect of the algorithm involves recognition over multiple resolution levels, which provides deeper insight into the pattern relationship between grain-like features and their neighbors. The method is general, adaptable to diverse image reconstruction methods and materials systems, and particularly useful in applications where practical constraints on the sample-size limits the reliable use of more complex models, e.g., convolutional neural networks.

36 MATERIALS SCIENCE↗

Leveraging generative adversarial networks to create realistic scanning transmission electron microscopy images

Abstract The rise of automation and machine learning (ML) in electron microscopy has the potential to revolutionize materials research through autonomous data collection and processing. A significant challenge lies in developing ML models that rapidly generalize to large data sets under varying experimental conditions. We address this by employing a cycle generative adversarial network (CycleGAN) with a reciprocal space discriminator, which augments simulated data with realistic spatial frequency information. This allows the CycleGAN to generate images nearly indistinguishable from real data and provide labels for ML applications. We showcase our approach by training a fully convolutional network (FCN) to identify single atom defects in a 4.5 million atom data set, collected using automated acquisition in an aberration-corrected scanning transmission electron microscope (STEM). Our method produces adaptable FCNs that can adjust to dynamically changing experimental variables with minimal intervention, marking a crucial step towards fully autonomous harnessing of microscopy big data.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

TULIP: An RNA-seq-based Primary Tumor Type Prediction Tool Using Convolutional Neural Networks

Background: With cancer as one of the leading causes of death worldwide, accurate primary tumor type prediction is critical in identifying genetic factors that can inhibit or slow tumor progression. There have been efforts to categorize primary tumor types with gene expression data using machine learning, and more recently with deep learning, in the last several years. Methods In this paper, we developed four 1-dimensional (1D) Convolutional Neural Network (CNN) models to classify RNA-seq count data as one of 17 highly represented primary tumor types or 32 primary tumor types regardless of imbalanced representation. Additionally, we adapted the models to take as input either all Ensembl genes (60,483) or protein coding genes only (19,758). Unlike previous work, we avoided selection bias by not filtering genes based on expression values. RNA-seq count data expressed as FPKM-UQ of 9,025 and 10,940 samples from The Cancer Genome Atlas (TCGA) were downloaded from the Genomic Data Commons (GDC) corresponding to 17 and 32 primary tumor types respectively for training and validating the models. Results: All 4 1D-CNN models had an overall accuracy of 94.7% to 97.6% on the test dataset. Further evaluation indicates that the models with protein coding genes only as features performed with better accuracy compared to the models with all Ensembl genes for both 17 and 32 primary tumor types. For all models, the accuracy by primary tumor type was above 80% for most primary tumor types. Conclusions: We packaged all 4 models as a Python-based deep learning classification tool called TULIP (TUmor CLassIfication Predictor) for performing quality control on primary tumor samples and characterizing cancer samples of unknown tumor type. Further optimization of the models is needed to improve the accuracy of certain primary tumor types.

Jones, Sara↗