Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse”

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 307 records · Page 17

3′ RNA-seq is superior to standard RNA-seq in cases of sparse data but inferior at identifying toxicity pathways in a model organism

The application of RNA-sequencing has led to numerous breakthroughs related to investigating gene expression levels in complex biological systems. Among these are knowledge of how organisms, such as the vertebrate model organism zebrafish (Danio rerio), respond to toxicant exposure. Recently, the development of 3' RNA-seq has allowed for the determination of gene expression levels with a fraction of the required reads compared to standard RNA-seq. While 3' RNA-seq has many advantages, a comparison to standard RNA-seq has not been performed in the context of whole organism toxicity and sparse data. Here, we examined samples from zebrafish exposed to perfluorobutane sulfonamide (FBSA) with either 3' or standard RNA-seq to determine the advantages of each with regards to the identification of functionally enriched pathways. We found that 3' and standard RNA-seq showed specific advantages when focusing on annotated or unannotated regions of the genome. We also found that standard RNA-seq identified more differentially expressed genes (DEGs), but that this advantage disappeared under conditions of sparse data. We also found that standard RNA-seq had a significant advantage in identifying functionally enriched pathways via analysis of DEG lists but that this advantage was minimal when identifying pathways via gene set enrichment analysis of all genes. These results show that each approach has experimental conditions where they may be advantageous. Our observations can help guide others in the choice of 3' RNA-seq vs standard RNA sequencing to query gene expression levels in a range of biological systems.

3’ RNA-seq↗

Energy scaling advantages of resistive memory crossbar based computation and its application to sparse coding

In this study, the exponential increase in data over the last decade presents a significant challenge to analytics efforts that seek to process and interpret such data for various applications. Neural-inspired computing approaches are being developed in order to leverage the computational properties of the analog, low-power data processing observed in biological systems. Analog resistive memory crossbars can perform a parallel read or a vector-matrix multiplication as well as a parallel write or a rank-1 update with high computational efficiency. For an N × N crossbar, these two kernels can be O(N) more energy efficient than a conventional digital memory-based architecture. If the read operation is noise limited, the energy to read a column can be independent of the crossbar size (O(1)). These two kernels form the basis of many neuromorphic algorithms such as image, text, and speech recognition. For instance, these kernels can be applied to a neural sparse coding algorithm to give an O(N) reduction in energy for the entire algorithm when run with finite precision. Sparse coding is a rich problem with a host of applications including computer vision, object tracking, and more generally unsupervised learning.

97 MATHEMATICS AND COMPUTING↗

Quantized Constant-Q Gabor Atoms for Sparse Binary Representations of Cyber-Physical Signatures

Increased data acquisition by uncalibrated, heterogeneous digital sensor systems such as smartphones present new challenges. Binary metrics are proposed for the quantification of cyber-physical signal characteristics and features, and a standardized constant-Q variation of the Gabor atom is developed for use with wavelet transforms. Two different continuous wavelet transform (CWT) reconstruction formulas are presented and tested under different signal to noise ratio (SNR) conditions. A sparse superposition of Nth order Gabor atoms worked well against a synthetic blast transient using the wavelet entropy and an entropy-like parametrization of the SNR as the CWT coefficient-weighting functions. The proposed methods should be well suited for sparse feature extraction and dictionary-based machine learning across multiple sensor modalities.

46 - INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AN↗

Superresolution Full-polarimetric Imaging for Radio Interferometry with Sparse Modeling

We propose a new technique for radio interferometry to obtain superresolution full-polarization images in all four Stokes parameters using sparse modeling. The proposed technique reconstructs the image in each Stokes parameter from the corresponding full-complex Stokes visibilities by utilizing two regularization functions: the ℓ {sub 1} norm and the total variation (TV) of the brightness distribution. As an application of this technique, we present simulated linear polarization observations of two physically motivated models of M87 with the Event Horizon Telescope. We confirm that ℓ {sub 1}+TV regularization can achieve an optimal resolution of ~25%–30% of the diffraction limit λ/D{sub max}, which is the nominal spatial resolution of a radio interferometer for both the total intensity (i.e., Stokes I) and linear polarizations (i.e., Stokes Q and U). This optimal resolution is better than that obtained from the widely used Cotton–Schwab CLEAN algorithm or from using ℓ {sub 1} or TV regularizations alone. Furthermore, we find that ℓ {sub 1}+TV regularization can achieve much better image fidelity in linear polarization than other techniques over a wide range of spatial scales, not only in the superresolution regime, but also on scales larger than the diffraction limit. Our results clearly demonstrate that sparse reconstruction is a useful choice for high-fidelity full-polarimetric interferometric imaging.

79 ASTRONOMY AND ASTROPHYSICS↗

Machine-learned Identification of RR Lyrae Stars from Sparse, Multi-band Data: The PS1 Sample

RR Lyrae stars may be the best practical tracers of Galactic halo (sub-)structure and kinematics. The PanSTARRS1 (PS1) 3π survey offers multi-band, multi-epoch, precise photometry across much of the sky, but a robust identification of RR Lyrae stars in this data set poses a challenge, given PS1's sparse, asynchronous multi-band light curves (≲12 epochs in each of five bands, taken over a 4.5 year period). We present a novel template fitting technique that uses well-defined and physically motivated multi-band light curves of RR Lyrae stars, and demonstrate that we get accurate period estimates, precise to 2 s in >80% of cases. We augment these light-curve fits with other features from photometric time-series and provide them to progressively more detailed machine-learned classification models. From these models, we are able to select the widest (three-fourths of the sky) and deepest (reaching 120 kpc) sample of RR Lyrae stars to date. The PS1 sample of ∼45,000 RRab stars is pure (90%) and complete (80% at 80 kpc) at high galactic latitudes. It also provides distances that are precise to 3%, measured with newly derived period–luminosity relations for optical/near-infrared PS1 bands. With the addition of proper motions from Gaia and radial velocity measurements from multi-object spectroscopic surveys, we expect the PS1 sample of RR Lyrae stars to become the premier source for studying the structure, kinematics, and the gravitational potential of the Galactic halo. The techniques presented in this study should translate well to other sparse, multi-band data sets, such as those produced by the Dark Energy Survey and the upcoming Large Synoptic Survey Telescope Galactic plane sub-survey.

79 ASTRONOMY AND ASTROPHYSICS↗

Identification of RR Lyrae stars in multiband, sparsely-sampled data from the Dark Energy Survey using template fitting and Random Forest classification

Many studies have shown that RR Lyrae variable stars (RRL) are powerful stellar tracers of Galactic halo structure and satellite galaxies. The Dark Energy Survey (DES), with its deep and wide coverage (g ~ 23.5 mag in a single exposure; over 5000 deg2) provides a rich opportunity to search for substructures out to the edge of the Milky Way halo. However, the sparse and unevenly sampled multiband light curves from the DES wide-field survey (a median of four observations in each of grizY over the first three years) pose a challenge for traditional techniques used to detect RRL. We present an empirically motivated and computationally efficient template-fitting method to identify these variable stars using three years of DES data. When tested on DES light curves of previously classified objects in SDSS stripe 82, our algorithm recovers 89% of RRL periods to within 1% of their true value with 85% purity and 76% completeness. Using this method, we identify 5783 RRL candidates, ~28% of which are previously undiscovered. This method will be useful for identifying RRL in other sparse multiband data sets.

79 ASTRONOMY AND ASTROPHYSICS↗

Analog system for computing sparse codes

A parallel dynamical system for computing sparse representations of data, i.e., where the data can be fully represented in terms of a small number of non-zero code elements, and for reconstructing compressively sensed images. The system is based on the principles of thresholding and local competition that solves a family of sparse approximation problems corresponding to various sparsity metrics. The system utilizes Locally Competitive Algorithms (LCAs), nodes in a population continually compete with neighboring units using (usually one-way) lateral inhibition to calculate coefficients representing an input in an over complete dictionary.

Rozell, Christopher John↗

Threaded Operations on Sparse Matrices

We investigate the use of sparse matrices and OpenMP multi-threading on linear algebra operations involving them. Several sparse matrix data structures are presented. Implementation of the multi- threading primarily occurs in the level one and two BLAS functions used within the four algorithms investigated{the Power Method, Conjugate Gradient, Biconjugate Gradient, and Jacobi's Method. The bene ts of launching threads once per high level algorithm are explored.

97 MATHEMATICS AND COMPUTING↗

Amesos2 Templated Direct Sparse Solver Package

Amesos2 is a templated direct sparse solver package. Amesos2 provides interfaces to direct sparse solvers, rather than providing native solver capabilities. Amesos2 is a derivative work of the Trilinos package Amesos.

Source record↗

An L$_0$L$_1$-norm compressive sensing paradigm for the construction of sparse predictive lattice models using mixed integer quadratic programming

First-principles based lattice models allow the modeling of ab initio thermodynamics of crystalline mixtures for applications such as the construction of phase diagrams and the identification of ground state atomic orderings. The recent development of compressive sensing approaches for the construction of lattice models has further enabled the systematic construction of sparse physical models without the need for human intuition other than requiring the compactness of effective cluster interactions. However, conventional compressive sensing based on L1-norm regularization is strictly only applicable to certain classes of optimization problems and is otherwise not guaranteed to generate optimally sparse and transferable results, so that the method can only be applied to some materials science applications. In this paper, we illustrate a more robust L0L1-norm compressive-sensing method that removes the limitations of conventional compressive sensing and generally results in sparser lattice models that are at least as predictive as those obtained from L1-norm compressive sensing. Apart from the theory, a practical implementation based on state-of-the-art mixed-integer quadratic programming (MIQP) is proposed. The robustness of our methodology is illustrated for four different transition-metal oxides with relevance as battery cathode materials: Li2xTi2(1-x)O2, Li2xNi2yO2, MgxCr2O4, and NaxCrO2. This method provides a practical and robust approach for the construction of sparser and more predictive lattice models, improving on the compressive sensing paradigm and making it applicable to a much broader range of applications.

Huang, W↗

Improving Spectral Image Classification through a Custom Data Sparsing and Pixel Clustering Algorithm

The Underground Nuclear Explosion Signatures Experiment (UNESE) seeks to characterize non-prompt observables from underground nuclear explosions (UNE). As part of this effort, we evaluated the ability of Digital Globe’s World View-3 (WV3) to detect and map UNE signatures. WV3 has proven capabilities in the detection of large-scale, anomalous, man-made features; however, it has relatively limited spectral and spatial resolution as compared to airborne hyperspectral imaging. These limitations impede standard image classifiers from identifying UNE signatures that are spatially small and lack distinct spectral features. In order to improve image classification results, we developed a custom algorithm that increases the true positive rate, while decreasing the false positive rate. Our algorithm’s flexible front-end allows the user to choose the method used to sparse the data. These methods include band-ratio optimization, correlation coefficient threshold, or Adaptive Coherence Estimator (ACE) threshold. The resulting sparsed pixels are clustered into like-objects. A novel weighted-sum of ACE and correlation coefficient scores is used to classify each object based on the average spectrum of its constituent pixels. WV3 and AVIRIS data of Cuprite, Nevada were used as a verification data set. This algorithm improves overall pixel classification accuracy over standard classifiers by up to 14%.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Sparse Data Management in HDF5

The importance of sparse data management is growing with data produced by large-scale experimental and observational facilities that contain small amounts of non-zero values. In this document, we explore different design options to support sparse data in HDF5, one of the most popular highperformance I/O libraries and file formats used for scientific data. We discuss several use cases and requirements. Our main hard design constraint is that any changes to the HDF5 dataset API would be a burden on users and not acceptable. The remaining options are discussed below. We provide rationale for what we believe is the strongest candidate and describe how its potential benefits can be simulated with the existing HDF5 library. We have conducted a set of computational experiments the results of which are reported here. They show that our candidate meets all relevant requirements and gives us a certain degree of confidence for an HDF5 library-native implementation.

Mainzer, John↗

Communication-avoiding optimization methods for distributed massive-scale sparse inverse covariance estimation

Across a variety of scientific disciplines, sparse inverse covariance estimation is a popular tool for capturing the underlying dependency relationships in multivariate data. Unfortunately, most estimators are not scalable enough to handle the sizes of modern high-dimensional data sets (often on the order of terabytes), and assume Gaussian samples. To address these deficiencies, we introduce HP-CONCORD, a highly scalable optimization method for estimating a sparse inverse covariance matrix based on a regularized pseudolikelihood framework, without assuming Gaussianity. Our parallel proximal gradient method uses a novel communication-avoiding linear algebra algorithm and runs across a multi-node cluster with up to 1k nodes (24k cores), achieving parallel scalability on problems with up to ≈819 billion parameters (1.28 million dimensions); even on a single node, HP-CONCORD demonstrates scalability, outperforming a state-of-the-art method. We also use HP-CONCORD to estimate the underlying dependency structure of the brain from fMRI data, and use the result to identify functional regions automatically. The results show good agreement with a clustering from the neuroscience literature.

97 MATHEMATICS AND COMPUTING↗

Communication-Avoiding Optimization Methods for Distributed Massive-Scale Sparse Inverse Covariance Estimation.

Across a variety of scientific disciplines, sparse inverse covariance estimation is a popular tool for capturing the underlying dependency relationships in multivariate data. Unfortunately, most estimators are not scalable enough to handle the sizes of modern high-dimensional data sets (often on the order of terabytes), and assume Gaussian samples. To address these deficiencies, we introduce HP-CONCORD, a highly scalable optimization method for estimating a sparse inverse covariance matrix based on a regularized pseudolikelihood framework, without assuming Gaussianity. Our parallel proximal gradient method uses a novel communication-avoiding linear algebra algorithm and runs across a multi-node cluster with up to 1k nodes (24k cores), achieving parallel scalability on problems with up to ~819 billion parameters (1.28 million dimensions); even on a single node, HP-CONCORD demonstrates scalability, outperforming a state-of-the-art method. We also use HP-CONCORD to estimate the underlying dependency structure of the brain from fMRI data, and use the result to identify functional regions automatically. The results show good agreement with a clustering from the neuroscience literature.

Koanantakool, Penporn↗

Sensing analytical instrument parameters, specimen characteristics, or both from sparse datasets

Disclosed are methods for sensing conditions of an electron microscope system and/or a specimen analyzed thereby. Also disclosed are sensor systems and electron microscope systems able to sense system conditions, and/or conditions of the specimen being analyzed by such systems. In one embodiment, a sparse dataset can be acquired from a random sub-sampling of the specimen by an electron beam probe of the electron microscope system. Instrument parameters, specimen characteristics, or both can be estimated from the sparse dataset.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Athena: High-Performance Sparse Tensor Contraction Sequence on Heterogeneous Memory

Sparse tensor contraction sequence has been widely employed in many fields, such as chemistry and physics. However, how to efficiently implement the sequence faces multiple challenges, such as redundant computations and memory operations, massive memory consumption, and inefficient utilization of hardware. To address the above challenges, we introduce Athena, a high-performance framework for SpTC sequences. Athena introduces new data structures, leverages emerging Optane-based heterogeneous memory (HM) architecture, and stage parallelism. In particular, Athena introduces shared hash table-represented sparse accumulator to eliminate unnecessary input processing and data migration; Athena uses a novel data-semantic guided dynamic migration solution to make the best use of the Optane-based HM for high performance; Athena also co-runs execution phases with different characteristics to enable high hardware utilization. Evaluating with 12 datasets, we show that Athena brings 327-7362× speedup over the state-of-the-art SpTC algorithm. With the dynamic data placement guided by data semantics, Athena brings performance improvement on Optane-based HM over a state-of-the-art software-based data management solution, a hardware-based data management solution, and PMM-only by 1.58×, 1.82×, and 2.34× respectively.

Liu, Jiawen↗

High-Fidelity Heavy-Duty Vehicle Modeling Using Sparse Telematics Data

Heavy-duty commercial vehicles consume a significant amount of energy due to their large size and mass, directly leading to vehicle operators prioritizing energy efficiency to reduce operational costs and comply with environmental regulations. One tool that can be used for the evaluation of energy efficiency in heavy-duty vehicles is the evaluation of energy efficiency using vehicle modeling and simulation. Simulation provides a path for energy efficiency improvement by allowing rapid experimentation of different vehicle characteristics on fuel consumption without the need for costly physical prototyping. The research presented in this paper focuses on using real-world, sparsely sampled telematics data from a large fleet of heavy-duty vehicles to create high-fidelity models for simulation. Samples in the telematics dataset are collected sporadically, resulting in sparse data with an infrequent and irregular sampling rate. Captured in the dataset was geospatial information, time series measurements, and vehicle-specific metadata from a subset of 96 vehicles from varied geographic regions across North America. A series of custom algorithms was developed to process vehicle data and derive both vehicle model input parameters and representative drive cycles. Derived models provide a basis on which to simulate real-world vehicles and iterate on vehicle aerodynamics, auxiliary power loads, transmission shift schedules, and other parameters to achieve reduced fuel consumption and increase energy efficiency. Notably, these models were developed without the use of expensive field data collection, using only data collected through fleet telematics. Processed representative drive cycles are used to validate the fuel economy of derived models. The models developed through this research allow for more representative vehicle simulations with increased flexibility regarding vehicle-to-vehicle variations.

ADVANCED PROPULSION SYSTEMS↗

Learning Distributed Geometric Koopman Operator for Sparse Networked Dynamical Systems

Koopman operator theory provides an alternative to study nonlinear networked dynamical systems by mapping the state space to an abstract higher dimensional space where the system evolution is linear. Recent works show the application of graph neural networks (GNNs) to learn state to object-centric embeddings and achieve centralized block-wise computation of Koopman operator (KO) under additional assumptions on the underlying agents properties and constraints on the KO structure. However, the computational complexity of learning the Koopman increases exponentially for networked systems where the number of possible system states grows in a combinatorial fashion with the number of nodes. The learning challenge is further amplified for sparse networks by two factors: 1) sample sparsity for learning the Koopman operator in the non-linear space, and 2) the divergence in the dynamics of individual nodes or from one subgraph to another. Our work aims to address these challenge by formulating the representation learning of networked dynamical systems into a multi-agent paradigm and learning the Koopman operator in a distributive manner. The computational as well as performance advantages of distributed Koopman is predominant for sparse networks whereas for fully connected networks, it is shown to coincide with the centralized one. The empirical study on rope system, network of oscillators and a synthetic power system show comparable and superior performance along with computational benefits with the state-of-the-art methods.

Mukherjee, Sayak↗