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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Differentially Private Adaptive Noise Injection (DP-ANI) v1.0

Location data is collected from users continuously to understand their mobility patterns. Releasing the user trajectories may compromise user privacy. Therefore, the general practice is to release aggregated location datasets. However, private information may still be inferred from an aggregated version of location trajectories. Differential privacy (DP) protects the query output against inference attacks regardless of background knowledge. This software implements a differential privacy-based privacy model that protects the user's origins and destinations from being inferred from aggregated mobility datasets. This is achieved by injecting Planar Laplace noise to the user origin and destination GPS points. The noisy GPS points are then transformed into a link representation using a link-matching algorithm. Finally, the link trajectories form an aggregated mobility network. The injected noise level is selected using the Sparse Vector Mechanism. This DP selection mechanism considers the link density of the location and the functional category of the localized links. Compared to the different baseline models, including a k-anonymity method, our differential privacy-based aggregation model offers query responses that are close to the raw data in terms of aggregate statistics at both the network and trajectory-levels with maximum 9% deviation from the baseline in terms of network length.

Peisert, Sean [Lawrence Berkeley National Laborato↗
DOE OSTI2019

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↗
DOE OSTI2017

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↗
DOE OSTI2024

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↗
DOE OSTI2024

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↗
DOE OSTI2016

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↗
DOE OSTI2018

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↗
DOE OSTI2019

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↗
DOE OSTI2026

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↗
DOE OSTI2021

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↗
NASA NTRS2015

Enhancements of Bayesian Blocks; Application to Large Light Curve Databases

Bayesian Blocks are optimal piecewise linear representations (step function fits) of light-curves. The simple algorithm implementing this idea, using dynamic programming, has been extended to include more data modes and fitness metrics, multivariate analysis, and data on the circle (Studies in Astronomical Time Series Analysis. VI. Bayesian Block Representations, Scargle, Norris, Jackson and Chiang 2013, ApJ, 764, 167), as well as new results on background subtraction and refinement of the procedure for precise timing of transient events in sparse data. Example demonstrations will include exploratory analysis of the Kepler light curve archive in a search for "star-tickling" signals from extraterrestrial civilizations. (The Cepheid Galactic Internet, Learned, Kudritzki, Pakvasa1, and Zee, 2008, arXiv: 0809.0339; Walkowicz et al., in progress).

Kepler light curve archive↗
NASA NTRS1994

Arctic sea ice albedo from AVHRR

The seasonal cycle of surface albedo of sea ice in the Arctic is estimated from measurements made with the Advanced Very High Resolution Radiometer (AVHRR) on the polar-orbiting satellites NOAA-10 and NOAA-11. The albedos of 145 200-km-square cells are analyzed. The cells are from March through September 1989 and include only those for which the sun is more than 10 deg above the horizon. Cloud masking is performed manually. Corrections are applied for instrument calibration, nonisotropic reflection, atmospheric interference, narrowband to broadband conversion, and normalization to a common solar zenith angle. The estimated albedos are relative, with the instrument gain set to give an albedo of 0.80 for ice floes in March and April. The mean values for the cloud-free portions of individual cells range from 0.18 to 0.91. Monthly averages of cells in the central Arctic range from 0.76 in April to 0.47 in August. The monthly averages of the within-cell standard deviations in the central Arctic are 0.04 in April and 0.06 in September. The surface albedo and surface temperature are correlated most strongly in March (R = -0.77) with little correlation in the summer. The monthly average lead fraction is determined from the mean potential open water, a scaled representation of the temperature or albedo between 0.0 (for ice) and 1.0 (for water); in the central Arctic it rises from an average 0.025 in the spring to 0.06 in September. Sparse data on aerosols, ozone, and water vapor in the atmospheric column contribute uncertainties to instantaneous, area-average albedos of 0.13, 0.04, and 0.08. Uncertainties in monthly average albedos are not this large. Contemporaneous estimation of these variables could reduce the uncertainty in the estimated albedo considerably. The poor calibration of AVHRR channels 1 and 2 is another large impediment to making accurate albedo estimates.

Lindsay, R. W.↗
DOE OSTI2022

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↗
DOE OSTI2018

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↗
NASA NTRS2008

Understanding Differences Between Co-Incident CloudSat, Aqua/MODIS and NOAA18 MHS Ice water Path Retrievals Over the Tropical Oceans

Accurate measurement of the physical and radiative properties of clouds and their representation in climate models continues to be a challe nge. Model parameterizations are still subject to a large number of t unable parameters; furthermore, accurate and representative in situ o bservations are very sparse, and satellite observations historically have significant quantitative uncertainties, particularly with respect to particle size distribution (PSD) and cloud phase. Ice Water Path (IWP), or amount of ice present in a cloud column, is an important cl oud property to accurately quantify, because it is an integral measur e of the microphysical properties of clouds and the cloud feedback pr ocesses in the climate system. This paper investigates near co-incident retrievals of IWP over tropical oceans using three diverse measurem ent systems: radar from CloudSat, Vis/IR from Aqua/MODIS, and microwa ve from NOAA-18IMHS. CloudSat 94 GHz radar measurements provide high resolution vertical and along-orbit structure of cloud reflectivity a nd enable IWP (and IWC) retrievals. Overlapping MODIS measurements of cloud optical thickness and phase allow estimates of IWP when cloud tops are identified as being ice. Periodically, NOAA18 becomes co-inci dent in space I time to enable comparison of A-Train measurements to IWP inferred from the 157 and 89 GHz channel radiances. This latter m easurement is effective only for thick convective anvil systems. We s tratify these co-incident data (less than 4 minutes separation) into cirrus only, cirrus overlying liquid water clouds, and precipitating d eep convective clouds. Substantial biases in IWP and ice effective ra dius are found. Systematic differences in these retrievals are consid ered in light of the uncertainties in a priori assumptions ofPSDs, sp ectral sensitivity and algorithm strategies, which have a direct impact on the IWP product.

Pittman, Jasna↗
DOE OSTI2017

Low-rank factorization of electron integral tensors and its application in electronic structure theory

In this letter, we introduce the reverse Cuthill-McKee (RCM) algorithm, which is often used for the bandwidth reduction of sparse tensors, to transform the two-electron integral tensors to their block diagonal forms. By further applying the pivoted Cholesky decomposition (CD) on each of the diagonal blocks, we are able to represent the high-dimensional two-electron integral tensors in terms of permutation matrices and low-rank Cholesky vectors. This representation facilitates the low-rank factorization of the high-dimensional tensor contractions that are usually encountered in post-Hartree-Fock calculations. In this letter, we discuss the second-order Møller-Plesset (MP2) method and linear coupled- cluster model with doubles (L-CCD) as two simple examples to demonstrate the efficiency of the RCM-CD technique in representing two-electron integrals in a compact form.

electronic structure theory↗
DOE OSTI2024

Cloud condensation nuclei concentrations derived from the CAMS reanalysis

Determining number concentrations of cloud condensation nuclei (CCN) is one of the first steps in the chain in analysis of cloud droplet formation, the direct microphysical link between aerosols and cloud droplets, and a process key for aerosol–cloud interactions (ACI). However, due to sparse coverage of in situ measurements and difficulties associated with retrievals from satellites, a global exploration of their magnitude, source as well as temporal and spatial distribution cannot be easily obtained. Thus, a better representation of CCN numbers is one of the goals for quantifying ACI processes and achieving uncertainty-reduced estimates of their associated radiative forcing. Here, we introduce a new CCN dataset which is derived based on aerosol mass mixing ratios from the latest Copernicus Atmosphere Monitoring Service reanalysis (CAMSRA) in a diagnostic model that uses CAMSRA aerosol properties and a simplified kappa-Köhler framework suitable for global models. The emitted aerosols in CAMSRA are not only based on input from emission inventories using aerosol observations, they also have a strong tie to satellite-retrieved aerosol optical depth (AOD) as this is assimilated as a constraining factor in the reanalysis. Furthermore, the reanalysis interpolates for cases of poor or missing retrievals and thus allows for a full spatiotemporal quantification of CCN numbers. The derived CCN dataset captures the general trend and spatial and temporal distribution of total CCN number concentrations and CCN from different aerosol species. A brief evaluation with ground-based in situ measurements demonstrates the improvement of the modelled CCN over the sole use of AOD as a proxy for CCN as the overall correlation coefficient improved from 0.37 to 0.71. However, we find the modelled CCN from CAMSRA to be generally high biased and find a particular erroneous overestimation at one heavily polluted site which emphasises the need for further validation. The CCN dataset (https://doi.org/10.26050/WDCC/QUAERERE_CCNCAMS_v1, Block, 2023), which is now freely available to users, features 3-D CCN number concentrations of global coverage for various supersaturations and aerosol species covering the years 2003–2021 with daily frequency. This dataset is one of its kind as it offers lots of opportunities to be used for evaluation in models and in ACI studies.

54 ENVIRONMENTAL SCIENCES↗