Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse representation”

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 199 records · Page 11

Sparse sampling methods and probe systems for analytical instruments

Sparse sampling approaches and probe systems for analytical instruments are disclosed providing for effective sub-sampling of a specimen and inpainting to reconstruct representations of actual information. The sub-sampling involves serial acquisition of contiguous measured values lying at positions along a scan path extending in a line toward a first direction and having random perturbations in a second direction. The perturbations are limited within a predetermined distance from the line. Inpainting techniques are utilized among the measured values to reconstruct a representation of actual information regarding the specimen.

Kovarik, Libor↗

Acquisition of STEM Images by Adaptive Compressive Sensing

Compressive Sensing (CS) allows a signal to be sparsely measured first and accurately recovered later in software [1]. In scanning transmission electron microscopy (STEM), it is possible to compress an image spatially by reducing the number of measured pixels, which decreases electron dose and increases sensing speed [2,3,4]. The two requirements for CS to work are: (1) sparsity of basis coefficients and (2) incoherence of the sensing system and the representation system. However, when pixels are missing from the image, it is difficult to have an incoherent sensing matrix. Nevertheless, dictionary learning techniques such as Beta-Process Factor Analysis (BPFA) [5] are able to simultaneously discover a basis and the sparse coefficients in the case of missing pixels. On top of CS, we would like to apply active learning [6,7] to further reduce the proportion of pixels being measured, while maintaining image reconstruction quality. Suppose we initially sample 10% of random pixels. We wish to select the next 1% of pixels that are most useful in recovering the image. Now, we have 11% of pixels, and we want to decide the next 1% of “most informative” pixels. Active learning methods are online and sequential in nature. Our goal is to adaptively discover the best sensing mask during acquisition using feedback about the structures in the image. In the end, we hope to recover a high quality reconstruction with a dose reduction relative to the non-adaptive (random) sensing scheme. In doing this, we try three metrics applied to the partial reconstructions for selecting the new set of pixels: (1) variance, (2) Kullback-Leibler (KL) divergence using a Radial Basis Function (RBF) kernel, and (3) entropy. Figs. 1 and 2 display the comparison of Peak Signal-to-Noise (PSNR) using these three different active learning methods at different percentages of sampled pixels. At 20% level, all the three active learning methods underperform the original CS without active learning. However, they all beat the original CS as more of the “most informative” pixels are sampled. One can also argue that CS equipped with active learning requires less sampled pixels to achieve the same value of PSNR than CS with pixels randomly sampled, since all the three PSNR curves with active learning grow at a faster pace than that without active learning. For this particular STEM image, by observing the reconstructed images and the sensing masks, we find that while the method based on RBF kernel acquires samples more uniformly, the one on entropy samples more areas of significant change, thus less uniformly. The KL-divergence method performs the best in terms of reconstruction error (PSNR) for this example [8].

Xie, Weiyi↗

Characterizing Ice Nucleating Particles Over the Southern Ocean Using Simultaneous Aircraft and Ship Observations

Abstract Supercooled liquid clouds are ubiquitous over the Southern Ocean (SO), even to temperatures below −20°C, and comprise a large fraction of the marine boundary layer (MBL) clouds. Earth system models and reanalysis products have struggled to reproduce the observed cloud phase distribution and occurrence of cloud ice in the region. Recent simulations found the microphysical representation of ice nucleation and growth has a large impact on these properties, however, measurements of SO ice nucleating particles (INPs) to validate simulations are sparse. This study presents measurements of INPs from simultaneous aircraft and ship campaigns conducted over the SO in austral summer 2018, which include the first in situ observations in and above cloud in the region. Our results confirm recent observations that INP concentrations are uniformly lower than measurements made in the late 1960s. While INP concentrations below and above cloud are similar, higher ice nucleation efficiency above cloud supports model simulations that the dominant INP composition varies with height. Model parameterizations based solely on aerosol properties capture the mean relationship between INP concentration and temperature but not the observed variability, which is likely related to the only modest correlations observed between INPs and environmental or aerosol metrics. Including wind speed in addition to activation temperature in a marine INP parameterization reduces bias but does not explain the large range of observed INP concentrations. Direct and indirect inference of marine INP size suggests MBL INPs, at least during Austral summer, are dominated by particles with diameters smaller than 500 nm.

Meteorology & Atmospheric Sciences↗

Scale-Dependent Fracture-Matrix Interactions and Their Impact on Radionuclide Transport: Development of efficient particle-tracking methods

Matrix Diffusion and Adsorption within a rock matrix are important mechanisms for retarding transport of radionuclides in fractured rock. Due to computational limitations and difficulties in characterizing complex subsurface systems, diffusive exchange between a fracture network and surrounding rock matrix is often modeled using simplified conceptual representations. There is significant uncertainty in “effective” parameters used in these models, such as the “effective matrix diffusivity”. Often, these parameters are estimated by fitting sparse breakthrough data, and estimated values fall outside meaningful ranges, because simplified interpretive models do not consider complex three-dimensional flow. There is limited understanding of the relationship between the effective parameters and rock mass characteristics including network structure and matrix properties. There is also evidence for an apparent scale-dependence in “effective matrix diffusion” coefficients. These observations raise questions on whether fracture-matrix interaction parameters estimated from small-scale tracer tests can be used for predicting radionuclide fate and transport at the scale of DOE field sites. High-resolution three-dimensional Discrete-Fracture-Network-Matrix (DFNM) models based on well-defined local scale transport equations can help to address some of these questions. Due to tremendous advances in computational technology over the last 10 years, DFNM modeling in relatively large domains is now feasible. The overarching objective of our research is to use DFNM modeling to improve fundamental understanding of how effective parameters in conceptual models are related to fracture network structure and matrix properties. An advanced three-dimensional DFNM model is being developed, which combines upscaled particle-tracking algorithms for fracture-matrix interaction and a parallel fracture-network flow simulator. The particle-tracking algorithms allow complexity in flow fields at different scales, and track transport across fracture-matrix interfaces based on rigorous local approximations to the transport equations. This modeling approach can incorporate aperture variability, multi-scale preferential flow and matrix heterogeneity. We developed efficient particle-tracking methods for handling matrix diffusion and adsorption on fracture walls and demonstrated their efficiency for use within the context of large-scale complex fracture network models with variability in apertures across a network of fractures and within individual fractures.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Comparison of point cloud and image-based models for calorimeter fast simulation

Score based generative models are a new class of generative models that have been shown to accurately generate high dimensional calorimeter datasets. Recent advances in generative models have used images with 3D voxels to represent and model complex calorimeter showers. Point clouds, however, are likely a more natural representation of calorimeter showers, particularly in calorimeters with high granularity. Furthermore, point clouds preserve all of the information of the original simulation, more naturally deal with sparse datasets, and can be implemented with more compact models and data files. In this work, two state-of-the-art score based models are trained on the same set of calorimeter simulation and directly compared.

47 OTHER INSTRUMENTATION↗

A stochastic mixed finite element heterogeneous multiscale method for flow in porous media

A computational methodology is developed to efficiently perform uncertainty quantification for fluid transport in porous media in the presence of both stochastic permeability and multiple scales. In order to capture the small scale heterogeneity, a new mixed multiscale finite element method is developed within the framework of the heterogeneous multiscale method (HMM) in the spatial domain. This new method ensures both local and global mass conservation. Starting from a specified covariance function, the stochastic log-permeability is discretized in the stochastic space using a truncated Karhunen-Loeve expansion with several random variables. Due to the small correlation length of the covariance function, this often results in a high stochastic dimensionality. Therefore, a newly developed adaptive high dimensional stochastic model representation technique (HDMR) is used in the stochastic space. This results in a set of low stochastic dimensional subproblems which are efficiently solved using the adaptive sparse grid collocation method (ASGC). Numerical examples are presented for both deterministic and stochastic permeability to show the accuracy and efficiency of the developed stochastic multiscale method.

97 MATHEMATICS AND COMPUTING↗

Dynamic graph system for a semantic database

A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

97 MATHEMATICS AND COMPUTING↗

Dynamic graph system for a semantic database

A method and system in a computer system for dynamically providing a graphical representation of a data store of entries via a matrix interface is disclosed. A dynamic graph system provides a matrix interface that exposes to an application program a graphical representation of data stored in a data store such as a semantic database storing triples. To the application program, the matrix interface represents the graph as a sparse adjacency matrix that is stored in compressed form. Each entry of the data store is considered to represent a link between nodes of the graph. Each entry has a first field and a second field identifying the nodes connected by the link and a third field with a value for the link that connects the identified nodes. The first, second, and third fields represent the rows, column, and elements of the adjacency matrix.

97 MATHEMATICS AND COMPUTING↗

A combinatorial model for dentate gyrus sparse coding

The dentate gyrus forms a critical link between the entorhinal cortex and CA3 by providing a sparse version of the signal. Concurrent with this increase in sparsity, a widely accepted theory suggests the dentate gyrus performs pattern separation—similar inputs yield decorrelated outputs. Although an active region of study and theory, few logically rigorous arguments detail the dentate gyrus’s (DG) coding. We suggest a theoretically tractable, combinatorial model for this action. The model provides formal methods for a highly redundant, arbitrarily sparse, and decorrelated output signal.To explore the value of this model framework, we assess how suitable it is for two notable aspects of DG coding: how it can handle the highly structured grid cell representation in the input entorhinal cortex region and the presence of adult neurogenesis, which has been proposed to produce a heterogeneous code in the DG. We find tailoring the model to grid cell input yields expansion parameters consistent with the literature. In addition, the heterogeneous coding reflects activity gradation observed experimentally. Lastly, we connect this approach with more conventional binary threshold neural circuit models via a formal embedding.

60 APPLIED LIFE SCIENCES↗

Time and Frequency Domain Methods for Basis Selection in Random Linear Dynamical Systems

Polynomial chaos methods have been extensively used to analyze systems in uncertainty quantification. Furthermore, several approaches exist to determine a low-dimensional approximation (or sparse approximation) for some quantity of interest in a model, where just a few orthogonal basis polynomials are required. In this work, we consider linear dynamical systems consisting of ordinary differential equations with random variables. The aim of this paper is to explore methods for producing low-dimensional approximations of the quantity of interest further. We investigate two numerical techniques to compute a low-dimensional representation, which both fit the approximation to a set of samples in the time domain. On the one hand, a frequency domain analysis of a stochastic Galerkin system yields the selection of the basis polynomials. It follows a linear least squares problem. On the other hand, a sparse minimization yields the choice of the basis polynomials by information from the time domain only. An orthogonal matching pursuit produces an approximate solution of the minimization problem. Finally, we compare the two approaches using a test example from a mechanical application.

97 MATHEMATICS AND COMPUTING↗

MetaStrider: Architectures for Scalable Memory-centric Reduction of Sparse Data Streams

Reduction is an operation performed on the values of two or more key-value pairs that share the same key. Reduction of sparse data streams finds application in a wide variety of domains such as data and graph analytics, cybersecurity, machine learning, and HPC applications. However, these applications exhibit low locality of reference, rendering traditional architectures and data representations inefficient. This article presents MetaStrider, a significant algorithmic and architectural enhancement to the state-of-the-art, SuperStrider. Furthermore, these enhancements enable a variety of parallel, memory-centric architectures that we propose, resulting in demonstrated performance that scales near-linearly with available memory-level parallelism.

97 MATHEMATICS AND COMPUTING↗

ECLEIRS: Exact conservation law embedded identification of reduced states for parameterized nonlinear conservation laws from sparse and noisy data

Multi-query applications such as parameter estimation, uncertainty quantification and design optimization for parameterized partial differential equation (PDE) systems are expensive. While reduced/latent state dynamics approaches for parameterized PDEs offer a viable alternative, these approaches rely on high-quality data and struggle with highly sparse spatiotemporal noisy measurements typically obtained from experiments. Furthermore, there is no guarantee that these models satisfy governing physical conservation laws. In this article, we propose a reduced state dynamics approach, referred to as ECLEIRS, that embeds exact conservation in the solution and flux representation by utilizing a space-time divergence-free neural network formulation. We compare ECLEIRS with other reduced state dynamics approaches, those that do not enforce any physical constraints and those with physics-informed loss functions, for three shock-propagation problems: 1-D advection, 1-D Burgers and 2-D Euler equations. In conclusion, the numerical experiments conducted in this study demonstrate that ECLEIRS provides the most accurate prediction of dynamics for unseen parameters even in the presence of highly sparse and noisy data.

97 MATHEMATICS AND COMPUTING↗

Understanding the Design Space of Sparse/Dense Multiphase Dataflows for Mapping Graph Neural Networks on Spatial Accelerators

Graph Neural Networks (GNNs) have garnered a lot of recent interest because of their success in learning representations from graph-structured data across several critical applications in cloud and HPC. Owing to their unique compute and memory characteristics that come from an interplay between dense and sparse phases of computations, the emergence of reconfigurable dataflow (aka spatial) accelerators offers promise for acceleration by mapping optimized dataflows (i.e., computation order and parallelism) for both phases. The goal of this work is to characterize and understand the design-space of dataflow choices for running GNNs on spatial accelerators in order for the compilers to optimize the dataflow based on the workload. Specifically, we propose a taxonomy to describe all possible choices for mapping the dense and sparse phases of GNNs spatially and temporally over a spatial accelerator, capturing both the intra-phase dataflow and the inter-phase (pipelined) dataflow. Using this taxonomy, we do deep-dives into the cost and benefits of several dataflows and perform case studies on implications of hardware parameters for dataflows and value of flexibility to support pipelined execution.

97 MATHEMATICS AND COMPUTING↗

Disentangling multidimensional spatio-temporal data into their common and aberrant responses

With the advent of high-throughput measurement techniques, scientists and engineers are starting to grapple with massive data sets and encountering challenges with how to organize, process and extract information into meaningful structures. Multidimensional spatio-temporal biological data sets such as time series gene expression with various perturbations over different cell lines, or neural spike trains across many experimental trials, have the potential to acquire insight about the dynamic behavior of the system. For this potential to be realized, we need a suitable representation to understand the data. A general question is how to organize the observed data into meaningful structures and how to find an appropriate similarity measure. A natural way of viewing these complex high dimensional data sets is to examine and analyze the large-scale features and then to focus on the interesting details. Since the wide range of experiments and unknown complexity of the underlying system contribute to the heterogeneity of biological data, we develop a new method by proposing an extension of Robust Principal Component Analysis (RPCA), which models common variations across multiple experiments as the lowrank component and anomalies across these experiments as the sparse component. We show that the proposed method is able to find distinct subtypes and classify data sets in a robust way without any prior knowledge by separating these common responses and abnormal responses. Thus, the proposed method provides us a new representation of these data sets which has the potential to help users acquire new insight from data.

59 BASIC BIOLOGICAL SCIENCES↗

Kalman-filtered compressive sensing for high resolution estimation of anthropogenic greenhouse gas emissions from sparse measurements.

The estimation of fossil-fuel CO2 emissions (ffCO2) from limited ground-based and satellite measurements of CO2 concentrations will form a key component of the monitoring of treaties aimed at the abatement of greenhouse gas emissions. The limited nature of the measured data leads to a severely-underdetermined estimation problem. If the estimation is performed at fine spatial resolutions, it can also be computationally expensive. In order to enable such estimations, advances are needed in the spatial representation of ffCO2 emissions, scalable inversion algorithms and the identification of observables to measure. To that end, we investigate parsimonious spatial parameterizations of ffCO2 emissions which can be used in atmospheric inversions. We devise and test three random field models, based on wavelets, Gaussian kernels and covariance structures derived from easily-observed proxies of human activity. In doing so, we constructed a novel inversion algorithm, based on compressive sensing and sparse reconstruction, to perform the estimation. We also address scalable ensemble Kalman filters as an inversion mechanism and quantify the impact of Gaussian assumptions inherent in them. We find that the assumption does not impact the estimates of mean ffCO2 source strengths appreciably, but a comparison with Markov chain Monte Carlo estimates show significant differences in the variance of the source strengths. Finally, we study if the very different spatial natures of biogenic and ffCO2 emissions can be used to estimate them, in a disaggregated fashion, solely from CO2 concentration measurements, without extra information from products of incomplete combustion e.g., CO. We find that this is possible during the winter months, though the errors can be as large as 50%.

Ray, Jaideep↗

Improving Simulations of Vegetation Dynamics over the Tibetan Plateau: Role of Atmospheric Forcing Data and Spatial Resolution

The efficacy of vegetation dynamics simulations in offline land surface models (LSMs) largely depends on the quality and spatial resolution of meteorological forcing data. In this study, the Princeton Global Meteorological Forcing Data (PMFD) and the high spatial resolution and upscaled China Meteorological Forcing Data (CMFD) were used to drive the Simplified Simple Biosphere model version 4/Top-down Representation of Interactive Foliage and Flora Including Dynamics (SSiB4/TRIFFID) and investigate how meteorological forcing datasets with different spatial resolutions affect simulations over the Tibetan Plateau (TP), a region with complex topography and sparse observations. By comparing the monthly Leaf Area Index (LAI) and Gross Primary Production (GPP) against observations, we found that SSiB4/TRIFFID driven by upscaled CMFD improved the performance in simulating the spatial distributions of LAI and GPP over the TP, reducing RMSEs by 24.3% and 20.5%, respectively. The multi-year averaged GPP decreased from 364.68 gC m –2 yr –1 to 241.21 gC m –2 yr –1 with the percentage bias dropping from 50.2% to –1.7%. When using the high spatial resolution CMFD, the RMSEs of the spatial distributions of LAI and GPP simulations were further reduced by 7.5% and 9.5%, respectively. This study highlights the importance of more realistic and high-resolution forcing data in simulating vegetation growth and carbon exchange between the atmosphere and biosphere over the TP.

54 ENVIRONMENTAL SCIENCES↗

CLOUDS, AEROSOLS, RADIATION AND THE AIR-SEA INTERFACE OF THE SOUTHERN OCEAN: ESTABLISHING DIRECTIONS FOR FUTURE RESEARCH

A workshop sponsored by the Department of Energy was convened at the University of Washington to discuss the state of knowledge of clouds, aerosols and air-sea interaction over the Southern Ocean and to identify strategies for reducing uncertainties in their representation in global and regional models. The Southern Ocean plays a critical role in the global climate system and is a unique pristine environment, yet other than from satellite, there have been sparse observations of clouds, aerosols, radiation and the air-sea interface in this region. Consequently, much is unknown about atmospheric and oceanographic processes and their linkage in this region. Approximately 60 scientists, including graduate students, postdoctoral fellows and senior researchers working in atmospheric and oceanic sciences at U.S. and foreign universities and government laboratories, attended the Southern Ocean Workshop. It began with a day of scientific talks, partly in plenary and partly in two parallel sessions, discussing the current state of the science for clouds, aerosols and air-sea interaction in the Southern Ocean. After the talks, attendees broke into two working groups; one focused on clouds and meteorology, and one focused on aerosols and their interactions with clouds. This was followed by more plenary discussion to synthesize the two working group discussions and to consider possible plans for organized activities to study clouds, aerosols and the air-sea interface in the Southern Ocean. The agenda and talk slides, including short summaries of the highlights of the parallel session talks developed by the session chars, are available at http://www.atmos.washington.edu/socrates/presentations/SouthernOceanPresentations/.

54 ENVIRONMENTAL SCIENCES↗

Improved Reanalysis and Prediction of Atmospheric Fields Over the Southern Ocean Using Campaign‐Based Radiosonde Observations

Abstract This study investigated the impact of radiosonde observations from the Southern Ocean obtained by the Australian R/V Aurora Australis on the ALERA2 experimental ensemble reanalysis data set and ensemble forecast experiment. An observing system experiment (OSE) that included additional ship‐launched radiosonde data captured the atmospheric structure over the Southern Ocean. ALERA2 without additional radiosondes had positive temperature biases exceeding 7 °C in the upper troposphere when low‐pressure cyclonic systems passed over the ship. The spread in the upper level was reduced by 15% in the OSE, which propagated downstream from the ship's position because of the sparse observing network over southern high latitudes. Comparison of two 63‐member ensemble forecast experiments initialized by ALERA2 and the OSE revealed that prediction of midlatitude cyclone tracks was improved by the realistic representation of upper‐level troughs in the OSE forecast. This confirms that additional radiosondes over the Southern Ocean reduce uncertainty and error in midlatitude cyclone forecasts.

54 ENVIRONMENTAL SCIENCES↗