Search NASA⌕ Search

SEARCH · Search NASA

Results for “Decoder Input”

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.

65 records · Page 4

Manifold Learning-Based Polynomial Chaos Expansions for High-Dimensional Surrogate Models

In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantities of interest of the computational or analytical model. For this purpose, we employ Grassmannian diffusion maps, a two-step nonlinear dimension reduction technique which allows us to reduce the dimensionality of the data and identify meaningful geometric descriptions in a parsimonious and inexpensive manner. Polynomial chaos expansion is then used to construct a mapping between the stochastic input parameters and the diffusion coordinates of the reduced space. An adaptive clustering technique is proposed to identify an optimal number of clusters of points in the latent space. The similarity of points allows us to construct a number of geometric harmonic emulators which are finally utilized as a set of inexpensive pretrained models to perform an inverse map of realizations of latent features to the ambient space and thus perform accurate out-of-sample predictions. Thus, the proposed method acts as an encoder-decoder system which is able to automatically handle very high-dimensional data while simultaneously operating successfully in the small-data regime. The method is demonstrated on two benchmark problems and on a system of advection-diffusion-reaction equations which model a first-order chemical reaction between two species. In all test cases, the proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.

42 ENGINEERING↗

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↗

An Assessment of Receiver Algorithms for Distributed Massive MIMO Systems: Investigating Design Solutions and Performance

This study investigates receiver design solutions for distributed Massive Multiple Input Multiple Output (D-m MIMO) systems, taking into account parameters such as number of access points as well as concerns related to channel estimates that use single-carrier frequency-domain equalization (SC-FDE). A significant contribution of this research is the integration of Low-Density Parity-Check (LDPC) codes to simplify coding complexity and enhance communication efficiency. The research examines different receiver designs, such as spatial antenna correlation and sophisticated channel estimation methods. The authors propose integrating LDPC codes into the receiver architecture to simplify computations and enhance error correction and decoding. Moreover, the paper examines performance evaluation measures and approaches, highlighting the trade-offs among complexity, spectral efficiency, and error performance. The comparative analysis indicates the benefits, in terms of performance, of incorporating LDPC codes and improving system throughput and dependability. We examine four distinct receiver algorithms: zero-forcing (ZF), minimum mean square error (MMSE), maximum ratio combining (MRC), and equal gain combining (EGC). The study shows that MRC and EGC receivers work well in D-m MIMO because they make the receiver system less computationally demanding.

Gashtasbi, Ali↗

Comparing Machine Learning and Physics-Based Nanoparticle Geometry Determinations Using Far-Field Spectral Properties

Anisotropic metal nanostructures exhibit polarization-dependent light scattering, a property which has been widely studied and exploited to determine orientations of subwavelength structures using far-field microscopy. Here we explore the use of variational autoencoders (VAEs) to determine the geometries of gold nanorods (NRs) such as in-plane orientation and aspect ratio under linearly polarized dark-field illumination in an optical microscope. We enforce a shared latent space to connect two VAEs trained separately with polarized dark-field scattering spectra and electron microscopy images and achieve image prediction (shape, orientation, and size) of Au NRs using only polarized dark-field scattering spectra. We determine the geometrical parameters of orientational angle and aspect ratio quantitatively via both our dual-VAE and physics-based analysis on the input scattering spectra. We show that orientational angle prediction by dual-VAE performs well with only a small (~300 particle) training set, yielding a mean absolute error (MAE) of 14.4° and a concordance correlation coefficient (CCC) of 0.95. This performance is only marginally worse than the physics-based cos(2?) fitting approach between the scattering intensity and the polarizing angle, which achieves MAE of 8.78° and CCC of 0.99. Aspect ratio determination is also comparable for the dual-VAE and physics-based fitting comparison (MAE of 0.21 vs. 0.23 and CCC of 0.53 vs. 0.68). Here, this dual encoder-decoder architecture effectively exploits the structure-property relationships of plasmonic nanostructures to construct a cross-modal machine learning (ML) approach, providing a pathway to employ ML approaches to address other structure-property relationships in materials science.

Dark-field scattering↗

STSR-INR: Spatiotemporal super-resolution for multivariate time-varying volumetric data via implicit neural representation

Implicit neural representation (INR) has surfaced as a promising direction for solving different scientific visualization tasks due to its continuous representation and flexible input and output settings. We present STSR-INR, an INR solution for generating simultaneous spatiotemporal super-resolution for multivariate time-varying volumetric data. Inheriting the benefits of the INR-based approach, STSR-INR supports unsupervised learning and permits data upscaling with arbitrary spatial and temporal scale factors. Unlike existing GAN- or INR-based super-resolution methods, STSR-INR focuses on tackling variables or ensembles and enabling joint training across datasets of various spatiotemporal resolutions. Here we achieve this capability via a variable embedding scheme that learns latent vectors for different variables. In conjunction with a modulated structure in the network design, we employ a variational auto-decoder to optimize the learnable latent vectors to enable latent-space interpolation. To combat the slow training of INR, we leverage a multi-head strategy to improve training and inference speed with significant speedup. We demonstrate the effectiveness of STSR-INR with multiple scalar field datasets and compare it with conventional tricubic+linear interpolation and state-of-the-art deep-learning-based solutions (STNet and CoordNet).

97 MATHEMATICS AND COMPUTING↗

Noisy quantum trees: infinite protection without correction

We study quantum networks with tree structures, in which information propagates from a root to leaves. At each node in the network, the received qubit unitarily interacts with fresh ancilla qubits, after which each qubit is sent through a noisy channel to a different node in the next level. Therefore, as the tree depth grows, there is a competition between the irreversible effect of noise and the protection against such noise achieved by the delocalization of information. In the classical setting, where each node simply copies the input bit into multiple output bits, this model has been studied as the broadcasting or reconstruction problem on trees, which has broad applications. In this work, we study the quantum version of this problem. We consider a Clifford encoder at each node that encodes the input qubit in a stabilizer code, along with a single qubit Pauli noise channel at each edge. Such noisy quantum trees describe a scenario in which one has access to a stream of fresh (low-entropy) ancilla qubits, but cannot perform error correction. Therefore, they provide a different perspective on quantum fault tolerance. Furthermore, they provide a useful model for describing the effect of noise within the encoders of concatenated codes. We prove that above certain noise thresholds, which depend on the properties of the code such as its distance, as well as the properties of the encoder, information decays exponentially with the depth of the tree. On the other hand, by studying certain efficient decoders, we prove that for codes with distance d ≥ 2 and for sufficiently small (but non-zero) noise, classical information and entanglement propagate over a noisy tree with infinite depth. Indeed, we find that this remains true even for binary trees with certain 2-qubit encoders at each node, which encodes the received qubit in the binary repetition code with distance d = 1.

Quantum information↗

Serial Input Output

Serial Input/Output (SIO) is designed to be a long term storage format of a sophistication somewhere between simple ASCII files and the techniques provided by inter alia Objectivity and Root. The former tend to be low density, information lossy (floating point numbers lose precision) and inflexible. The latter require abstract descriptions of the data with all that that implies in terms of extra complexity. The basic building blocks of SIO are streams, records and blocks. Streams provide the connections between the program and files. The user can define an arbitrary list of streams as required. A given stream must be opened for either reading or writing. SIO does not support read/write streams. If a stream is closed during the execution of a program, it can be reopened in either read or write mode to the same or a different file. Records represent a coherent grouping of data. Records consist of a collection of blocks (see next paragraph). The user can define a variety of records (headers, events, error logs, etc.) and request that any of them be written to any stream. When SIO reads a file, it first decodes the record name and if that record has been defined and unpacking has been requested for it, SIO proceeds to unpack the blocks. Blocks are user provided objects which do the real work of reading/writing the data. The user is responsible for writing the code for these blocks and for identifying these blocks to SIO at run time. To write a collection of blocks, the user must first connect them to a record. The record can then be written to a stream as described above. Note that the same block can be connected to many different records. When SIO reads a record, it scans through the blocks written and calls the corresponding block object (if it has been defined) to decode it. Undefined blocks are skipped. Each of these categories (streams, records and blocks) have some characteristics in common. Every stream, record and block has a name with the condition that each stream, record or block name must be unique in its category (i.e. all streams must have different names, but a stream can have the same name as a record). Each category is an arbitrary length list which is handled by a 'manager' and there is one manager for each category.

99 GENERAL AND MISCELLANEOUS↗

ISiCLE: A Quantum Chemistry Pipeline for Establishing in Silico Collision Cross Section Libraries

High throughput, comprehensive, and confident identifications of metabolites and other chemicals in biological and envi-ronmental samples will revolutionize our understanding of the role of these intriguing and chemically diverse molecules in biological systems. Despite recent technological advances, a metabolomics study still results in the detection of a dispropor-tionate number of features than cannot be confidently assigned to a chemical structure. This inadequacy is driven by the sin-gle most significant limitation in metabolomics: the reliance on reference libraries constructed through the analysis of au-thentic reference chemicals and the limited commercial availability of these compounds. To this end, we have developed the in silico chemical library engine (ISiCLE), a high-performance computing-friendly cheminformatics workflow for generating chemical properties. In the instantiation described here, we predict probable three-dimensional molecular conformers (i.e. conformational isomers) using chemical identifiers as input, from which collision cross sections (CCS) are derived. The ap-proach employs state-of-the-art first-principles simulation, distinguished by use of molecular dynamics, quantum chemistry, and ion mobility calculations to generate predictions, all without training data. Importantly, optimization of ISiCLE includ-ed a refactoring of the popular MOBCAL code for trajectory-based mobility calculations, improving its computational effi-ciency by over two orders of magnitude. Calculated CCS values were validated against 1,983 experimental CCS values and compared to previously reported CCS calculation approaches. Average CCS calculation absolute error is 3.2% with standard deviation 3.1%. An online database is introduced for sharing both calculated and experimental CCS values (metabolom-ics.pnnl.gov), initially including a CCS library with over 0.8M entries. Finally, three successful applications of molecule characterization using calculated CCS are described, including the identification of an environmental degradation product, the separation of molecular isomers, and the decoding of complex blinded mixtures of exposure chemicals. This work represents a promising method to address the limitations of small molecule identification, and offers alternatives to standards-based chemical identification amenable to high-performance computation.

metabolomics, standards-free, collision cross sect↗

ISiCLE: A Quantum Chemistry Pipeline for Establishing in Silico Collision Cross Section Libraries

High throughput, comprehensive, and confident identifications of metabolites and other chemicals in biological and envi-ronmental samples will revolutionize our understanding of the role of these intriguing and chemically diverse molecules in biological systems. Despite recent technological advances, a metabolomics study still results in the detection of a dispropor-tionate number of features than cannot be confidently assigned to a chemical structure. This inadequacy is driven by the sin-gle most significant limitation in metabolomics: the reliance on reference libraries constructed through the analysis of au-thentic reference chemicals and the limited commercial availability of these compounds. To this end, we have developed the in silico chemical library engine (ISiCLE), a high-performance computing-friendly cheminformatics workflow for generating chemical properties. In the instantiation described here, we predict probable three-dimensional molecular conformers (i.e. conformational isomers) using chemical identifiers as input, from which collision cross sections (CCS) are derived. The ap-proach employs state-of-the-art first-principles simulation, distinguished by use of molecular dynamics, quantum chemistry, and ion mobility calculations to generate predictions, all without training data. Importantly, optimization of ISiCLE includ-ed a refactoring of the popular MOBCAL code for trajectory-based mobility calculations, improving its computational effi-ciency by over two orders of magnitude. Calculated CCS values were validated against 1,983 experimental CCS values and compared to previously reported CCS calculation approaches. Average CCS calculation absolute error is 3.2% with standard deviation 3.1%. An online database is introduced for sharing both calculated and experimental CCS values (metabolom-ics.pnnl.gov), initially including a CCS library with over 0.8M entries. Finally, three successful applications of molecule characterization using calculated CCS are described, including the identification of an environmental degradation product, the separation of molecular isomers, and the decoding of complex blinded mixtures of exposure chemicals. This work represents a promising method to address the limitations of small molecule identification, and offers alternatives to standards-based chemical identification amenable to high-performance computation.

Colby, Sean M↗

Learning model combining convolutional deep neural network with a self-attention mechanism for AC optimal power flow

Alternating current optimal power flow (OPF) analysis is critical for efficient and reliable operation of power systems. For large systems or repetitive computations, the traditional methods such as the direct and gradient methods, or non-traditional methods, such as the genetic algorithm and simulating annealing, are time-consuming and unsuitable for real-time computing. The work in this paper proposes a novel framework to obtain the optimal solution of power flow in real-time using a combination of convolutional neural networks and a self-attention mechanism. All parameters of the power networks are rearranged in an image-like shape of a multi-channel image where each channel is a two-dimensional matrix. The proposed approach is adaptive with every input size of power systems as well as frequent variations of network topologies without intervention to the framework core. The encompassment of all power system contexts in which all parameters of internal elements, generation costs, and topology information are included, contributes to the higher accuracy of inference compared to other current machine-learning-based OPF-solving methods. Besides, the proposed framework established on ubiquitous platforms is effortlessly integrated into current infrastructures of power systems, and the great efficiency along with the computation speed may serve as a critical point for practical implications, such as enabling faster decision-making during real-time operations, predicting system contingencies, and remedial actions based on an offline pre-trained model. Furthermore, this supervised learning process is applied to the dataset of four case studies of meshed power systems: the IEEE 5-bus system (IEEE-5), the IEEE 30-bus system (IEEE-30), the IEEE 39-bus system (IEEE-39), and the IEEE 57-bus system (IEEE-57) to prove the efficacy of the proposed method.

42 ENGINEERING↗

Neural Active Manifolds: Nonlinear Dimensionality Reduction for Uncertainty Quantification

We present a new approach for nonlinear dimensionality reduction, specifically designed for computationally expensive mathematical models. We leverage autoencoders to discover a one-dimensional neural active manifold (NeurAM) capturing the model output variability, through the aid of a simultaneously learnt surrogate model with inputs on this manifold. Our method only relies on model evaluations and does not require the knowledge of gradients. The proposed dimensionality reduction framework can then be applied to assist outer loop many-query tasks in scientific computing, like sensitivity analysis and multifidelity uncertainty propagation. In particular, we prove, both theoretically under idealized conditions, and numerically in challenging test cases, how NeurAM can be used to obtain multifidelity sampling estimators with reduced variance by sampling the models on the discovered low-dimensional and shared manifold among models. Several numerical examples illustrate the main features of the proposed dimensionality reduction strategy and highlight its advantages with respect to existing approaches in the literature.

Autoencoders↗