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 1,585 records · Page 88

Frequency Event Categorization in Power Distribution Systems Using Micro PMU Measurements

Frequency is an important metric for power stability. To enhance the situational awareness in power distribution systems, this article proposes a data-driven approach that utilizes the data from micro phasor measurement units (μPMU) to categorize frequency events observed in distribution feeders. The proposed approach has three layers, each of which analyzes if a frequency event is propagated from the transmission system, formed inside a distribution feeder or falsely produced by instantaneous frequency (IF) estimation algorithms, respectively. In the first layer, the Granger causality is utilized to compare the causal relations from measurements across different locations to decide if an event is propagated from the transmission side. In the second layer, a trained sparse coding dictionary is utilized to unmix the physical causes of a frequency event. In the third layer, a moving z-score based event-pair detector is applied to identify if a frequency event is algorithm-induced. The proposed approach is tested using the μPMU measurements collected from Lawrence Berkeley National Laboratory (LBNL) and Riverside Public Utility (RPU).

24 POWER TRANSMISSION AND DISTRIBUTION↗

A convex pseudolikelihood framework for high dimensional partial correlation estimation with convergence guarantees

Sparse high dimensional graphical model selection is a topic of much interest in modern day statistics. A popular approach is to apply l1-penalties to either parametric likelihoods, or regularized regression/pseudolikelihoods, with the latter having the distinct advantage that they do not explicitly assume Gaussianity. As none of the popular methods proposed for solving pseudolikelihood-based objective functions have provable convergence guarantees, it is not clear whether corresponding estimators exist or are even computable, or if they actually yield correct partial correlation graphs. We propose a new pseudolikelihood-based graphical model selection method that aims to overcome some of the shortcomings of current methods, but at the same time retain all their respective strengths. In particular, we introduce a novel framework that leads to a convex formulation of the partial covariance regression graph problem, resulting in an objective function comprised of quadratic forms. The objective is then optimized via a coordinate wise approach. The specific functional form of the objective function facilitates rigorous convergence analysis leading to convergence guarantees; an important property that cannot be established by using standard results, when the dimension is larger than the sample size, as is often the case in high dimensional applications. These convergence guarantees ensure that estimators are well defined under very general conditions and are always computable. In addition, the approach yields estimators that have good large sample properties and also respect symmetry. Furthermore, application to simulated and real data, timing comparisons and numerical convergence is demonstrated. We also present a novel unifying framework that places all graphical pseudolikelihood methods as special cases of a more general formulation, leading to important insights.

97 MATHEMATICS AND COMPUTING↗

Comprehensive compartmental model and calibration algorithm for the study of clinical implications of the population-level spread of COVID-19: a study protocol

The complex dynamics of the coronavirus disease 2019 (COVID-19) pandemic has made obtaining reliable long-term forecasts of the disease progression difficult. Simple mechanistic models with deterministic parameters are useful for short-term predictions but have ultimately been unsuccessful in extrapolating the trajectory of the pandemic because of unmodelled dynamics and the unrealistic level of certainty that is assumed in the predictions. We propose a 22-compartment epidemiological model that includes compartments not previously considered concurrently, to account for the effects of vaccination, asymptomatic individuals, inadequate access to hospital care, post-acute COVID-19 and recovery with long-term health complications. Additionally, new connections between compartments introduce new dynamics to the system and provide a framework to study the sensitivity of model outputs to several concurrent effects, including temporary immunity, vaccination rate and vaccine effectiveness. Subject to data availability for a given region, we discuss a means by which population demographics (age, comorbidity, socioeconomic status, sex and geographical location) and clinically relevant information (different variants, different vaccines) can be incorporated within the 22-compartment framework. Considering a probabilistic interpretation of the parameters allows the model's predictions to reflect the current state of uncertainty about the model parameters and model states. We propose the use of a sparse Bayesian learning algorithm for parameter calibration and model selection. This methodology considers a combination of prescribed parameter prior distributions for parameters that are known to be essential to the modelled dynamics and automatic relevance determination priors for parameters whose relevance is questionable. This is useful as it helps prevent overfitting the available epidemiological data when calibrating the parameters of the proposed model. Population-level administrative health data will serve as partial observations of the model states.

59 BASIC BIOLOGICAL SCIENCES↗

An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations

Here, we propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND (sparsified Nested Dissection). It is based on nested dissection, sparsification, and low-rank compression. After eliminating all interiors at a given level of the elimination tree, the algorithm sparsifies all separators corresponding to the interiors. This operation reduces the size of the separators by eliminating some degrees of freedom but without introducing any fill-in. This is done at the expense of a small and controllable approximation error. The result is an approximate factorization that can be used as an efficient preconditioner. We then perform several numerical experiments to evaluate this algorithm. We demonstrate that a version using orthogonal factorization and block-diagonal scaling takes fewer CG iterations to converge than previous similar algorithms on various kinds of problems. Furthermore, this algorithm is provably guaranteed to never break down and the matrix stays symmetric positive-definite throughout the process. We evaluate the algorithm on some large problems show it exhibits near-linear scaling. The factorization time is roughly $\mathcal{O}$(N), and the number of iterations grows slowly with N.

97 MATHEMATICS AND COMPUTING↗

Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement

We report thatpProbing is a general technique that is used to reduce the variance of the Hutchinson stochastic estimator for the trace of the inverse of a large, sparse matrix A. The variance of the estimator is the sum of the squares of the off-diagonal elements of A -1 . Therefore, this technique computes probing vectors that when used in the estimator annihilate the largest off-diagonal elements. For matrices that display decay of the magnitude of |A$^{-1}_{ij}$| with the graph distance between nodes i and j, this is achieved through graph coloring of increasing powers A k . Equivalently, when a matrix stems from a lattice discretization, it is computationally beneficial to find a distance-k coloring of the lattice. Previously, a hierarchical coloring was proposed so that k can be increased at runtime as needed without discarding previous work. In this work, we study probing for the more general problem of computing the trace of a permutation of A -1 , say PA -1 . The motivation comes from lattice quantum chromodynamics (QCD), where we need to construct “disconnected diagrams” to extract flavor-separated generalized parton functions. In lattice QCD, where the matrix has a four-dimensional toroidal lattice structure, these nonlocal operators correspond to a PA -1 , where P is the permutation relating to some displacement $\vec{p}$ in one or more dimensions. We focus on a single dimension displacement (p), but our methods are general. We show that probing on A k or (PA) k does not annihilate the largest magnitude elements. To resolve this issue, our displacement-based probing works on PA k using a new coloring scheme that works directly on appropriately displaced neighborhoods on the lattice. We prove lower bounds on the number of colors needed and study the effect of this scheme on variance reduction, both theoretically and experimentally on a real-world lattice QCD calculation. We achieve orders of magnitude speedup over the unprobed or the naively probed methods.

97 MATHEMATICS AND COMPUTING↗

Fast 2D Bicephalous Convolutional Autoencoder for Compressing 3D Time Projection Chamber Data

High-energy large-scale particle colliders produce data at high speed in the order of 1 terabytes per second in nuclear physics and petabytes per second in high energy physics. Developing real-time data compression algorithms to reduce such data at high throughput to fit permanent storage has drawn increasing attention. Specifically, at the newly constructed sPHENIX experiment at the Relativistic Heavy Ion Collider (RHIC), a time projection chamber is used as the main tracking detector, which records particle trajectories in a volume of three-dimensional (3D) cylinder. The resulting data are usually very sparse with occupancy around 10.8%. Such sparsity presents a challenge to conventional learning-free lossy compression algorithms, such as SZ, ZFP, and MGARD. The 3D convolutional neural network (CNN)-based approach, Bicephalous Convolutional Autoencoder (BCAE), outperforms traditional methods both in compression rate and reconstruction accuracy. BCAE can also utilize the computation power of graphical processing units suitable for deployment in a modern heterogeneous highperformance computing environment. This work introduces two BCAE variants: BCAE++ and BCAE-2D. BCAE++ achieves a 15% better compression ratio and a 77% better reconstruction accuracy measured in mean absolute error compared with BCAE. BCAE-2D treats the radial direction as the channel dimension of an image, resulting in a 3× speedup in compression throughput. In addition, we demonstrate an unbalanced autoencoder with a larger decoder can improve reconstruction accuracy without significantly sacrificing throughput. Lastly, we observe both the BCAE++ and BCAE-2D can benefit more from using half-precision mode in throughput (76 - 79% increase) without loss in reconstruction accuracy. The source code and links to data and pretrained models can be found at https://github.com/BNL-DAQ-LDRD/NeuralCompression_v2

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Two-level structural sparsity regularization for identifying lattices and defects in noisy images

Here, this paper presents a regularized regression model with a two-level structural sparsity penalty applied to locate individual atoms in a noisy scanning transmission electron microscopy image (STEM). In crystals, the locations of atoms is symmetric, condensed into a few lattice groups. Therefore, by identifying the underlying lattice in a given image, individual atoms can be accurately located. We propose to formulate the identification of the lattice groups as a sparse group selection problem. Furthermore, real atomic scale images contain defects and vacancies, so atomic identification based solely on a lattice group may result in false positives and false negatives. To minimize error, model includes an individual sparsity regularization in addition to the group sparsity for a within-group selection, which results in a regression model with a two-level sparsity regularization. We propose a modification of the group orthogonal matching pursuit (gOMP) algorithm with a thresholding step to solve the atom finding problem. The convergence and statistical analyses of the proposed algorithm are presented. The proposed algorithm is also evaluated through numerical experiments with simulated images. The applicability of the algorithm on determination of atom structures and identification of imaging distortions and atomic defects was demonstrated using three real STEM images. In conclusion, we believe this is an important step toward automatic phase identification and assignment with the advent of genomic databases for materials.

36 MATERIALS SCIENCE↗

An Adaptive Wavelet Stochastic Collocation Method for Irregular Solutions of Stochastic Partial Differential Equations

Accurate predictive simulations of complex real world applications require numerical approximations to first, oppose the curse of dimensionality and second, converge quickly in the presence of steep gradients, sharp transitions, bifurcations or finite discontinuities in high-dimensional parameter spaces. In this paper we present a novel multi-dimensional multi-resolution adaptive (MdMrA) sparse grid stochastic collocation method, that utilizes hierarchical multiscale piecewise Riesz basis functions constructed from interpolating wavelets. The basis for our non-intrusive method forms a stable multiscale splitting and thus, optimal adaptation is achieved. Error estimates and numerical examples will used to compare the efficiency of the method with several other techniques.

adaptive sparse grids↗

Robust parallel iterative solvers for linear and least-squares problems (Final Technical Report)

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.

97 MATHEMATICS AND COMPUTING↗

Data Structures for Extreme Scale Computing

As computing problems of national importance grow, the government meets the increased demand by funding the development of ever larger systems. The overarching goal of the work supported in part by this grant is to increase efficiency of programming and performing computations on these large computing systems. In past work, we have demonstrated that some of these computations once thought to require expensive hardware designs and/or complex, special-purpose programming may be executed efficiently on low-cost commodity cluster computing systems using a general-purpose “latency-tolerant” programming framework. One important developed application of the ideas underlying this framework is graph database technology supporting social network pattern matching used by US intelligence agencies to more quickly identify potential terrorist threats. This database application has been spun out by the Pacific Northwest National Laboratory, a Department of Energy Laboratory, into a commercial start-up, Trovares Inc. We explore an alternative application of the same underlying ideas to a well-studied challenge arising in engineering: solving unstructured sparse linear equations. Solving these equations is key to predicting the behavior of large electronic circuits before they are fabricated. Predicting that behavior ahead of fabrication means that designs can optimized and errors corrected ahead of the expense of manufacture.

42 ENGINEERING↗

Linking Associations of Rare Low-Abundance Species to Their Environments by Association Networks

Studies of microbial communities by targeted sequencing of rRNA genes lead to recovering numerous rare low-abundance taxa with unknown biological roles. We propose to study associations of such rare organisms with their environments by a computational framework based on transformation of the data into qualitative variables. Namely, we analyze the sparse table of putative species or OTUs (operational taxonomic units) and samples generated in such studies, also known as an OTU table, by collecting statistics on co-occurrences of the species and on shared species richness across samples. Based on the statistics we built two association networks, of the rare putative species and of the samples respectively, using a known computational technique, Association networks (Anets) developed for analysis of qualitative data. Clusters of samples and clusters of OTUs are then integrated and combined with metadata of the study to produce a map of associated putative species in their environments. We tested and validated the framework on two types of microbiomes, of human body sites and that of the Populus tree root systems. We show that in both studies the associations of OTUs can separate samples according to environmental or physiological characteristics of the studied systems.

54 ENVIRONMENTAL SCIENCES↗

Accuracy optimized neural networks do not effectively model optic flow tuning in brain area MSTd

Accuracy-optimized convolutional neural networks (CNNs) have emerged as highly effective models at predicting neural responses in brain areas along the primate ventral stream, but it is largely unknown whether they effectively model neurons in the complementary primate dorsal stream. We explored how well CNNs model the optic flow tuning properties of neurons in dorsal area MSTd and we compared our results with the Non-Negative Matrix Factorization (NNMF) model, which successfully models many tuning properties of MSTd neurons. To better understand the role of computational properties in the NNMF model that give rise to optic flow tuning that resembles that of MSTd neurons, we created additional CNN model variants that implement key NNMF constraints – non-negative weights and sparse coding of optic flow. While the CNNs and NNMF models both accurately estimate the observer's self-motion from purely translational or rotational optic flow, NNMF and the CNNs with nonnegative weights yield substantially less accurate estimates than the other CNNs when tested on more complex optic flow that combines observer translation and rotation. Despite its poor accuracy, NNMF gives rise to tuning properties that align more closely with those observed in primate MSTd than any of the accuracy-optimized CNNs. This work offers a step toward a deeper understanding of the computational properties and constraints that describe the optic flow tuning of primate area MSTd.

60 APPLIED LIFE SCIENCES↗

Unsupervised Feature Learning for High-Resolution Satellite Image Classification

The rich data provided by high-resolution satellite imagery allow us to directly model geospatial neighborhoods by understanding their spatial and structural patterns. In this paper we explore an unsupervised feature learning approach to model geospatial neighborhoods for classification purposes. While pixel and object based classification approaches are widely used for satellite image analysis, often these approaches exploit the high-fidelity image data in a limited way. In this paper we extract low-level features to characterize the local neighborhood patterns. We exploit the unlabeled feature measurements in a novel way to learn a set of basis functions to derive new features. The derived sparse feature representation obtained by encoding the measured features in terms of the learned basis function set yields superior classification performance. We applied our technique on two challenging image datasets: ORNL dataset representing one-meter spatial resolution satellite imagery representing five land-use categories and, UCMERCED dataset consisting of 21 different categories representing sub-meter resolution overhead imagery. Our results are highly promising and, in the case of UCMERCED dataset we outperform the best results obtained for this dataset. We show that our feature extraction and learning methods are highly effective in developing a detection system that can be used to automatically scan large-scale high-resolution satellite imagery for detecting large-facility.

Basis function↗

Feature Clustering for Accelerating Parallel Coordinate Descent

We demonstrate an approach for accelerating calculation of the regularization path for L1 sparse logistic regression problems. We show the benefit of feature clustering as a preconditioning step for parallel block-greedy coordinate descent algorithms.

classification↗

A Hybrid Framework Combining Model-Based and Data-Driven Methods for Hierarchical Decentralized Robust Dynamic State Estimation: Preprint

This paper combines model-based and data-driven methods to develop a hierarchical decentralized robust dynamic state estimator (DSE). A two-level hierarchy is proposed, where the lower level is comprised of robust model-based decentralized DSEs. The state estimates sent from the lower level are received at the upper level, where they are filtered by a robust data- driven DSE, after a principled sparse selection. This selection allows us to shrink the dimension of the problem at the upper level, and hence to speed up the computational time significantly. The proposed hybrid framework does not depend upon the centralized infrastructure of the control centers, thus it can be completely embedded into the wide-area measurement systems. This feature will ultimately facilitate the placement of hierarchical decentralized control schemes at the phasor data concentrator (PDC) locations. Also, the network model is not necessary, thus a topology processor is not required. Finally, there is no assumption on the dynamics of the electric loads. The proposed framework is tested on a 2000-bus network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A new estimate of the China temperature anomaly series and uncertainty assessment in 1900–2006

While global warming during the last century has been well recognized, the magnitude of the climate warming in regions such as China over the past 100 years still has some uncertainty due to limited observations during the early years. Several series of temperature anomalies for the 20th century in China have been independently developed by different groups. The uncertainty arises mainly from the sparse observations before 1950, where statistics are sensitive to the small and potentially biased sample. In this study, BSHADE–MSN (Biased Sentinel Hospitals Areal Disease Estimation and Means of Stratified Nonhomogeneous Surface), a combination of two novel distinct statistical methods that are applicable with different sample situations to a spatial heterogeneous surface, is applied to estimate annual mean temperature anomalies for China. This method takes into account prior knowledge of geographical spatial autocorrelation and nonhomogeneity of target domains, remedies the biased sample, and maximizes an objective function for the best linear unbiased estimation (BLUE) of the regional mean quantity. For the period 1900–1999, the overall trend estimated by BSHADE–MSN is 0.80°C with a 95% confidential interval between 0.41°C and 1.18°C. This is significantly lower than that calculated by Climate Anomaly Method (CAM) and Block Kriging. The new temperature anomaly series for China exhibits slightly warmer conditions for the period before 1950 than existing studies. All the methods applied so far agree well with each other for the period after 1950, when there are sufficient stations across the country for the estimation of temperature anomaly series. Cross validation shows that the new regional mean temperature anomaly series has smaller estimation error variance and higher accuracy than those based on the other methods assessed in this study.

54 ENVIRONMENTAL SCIENCES↗

Russian anthropogenic black carbon: Emission reconstruction and Arctic black carbon simulation

Development of reliable source emission inventories is needed to advance the understanding of the origin of Arctic haze using chemical transport modeling. This paper develops a regional anthropogenic black carbon (BC) emission inventory for the Russian Federation, the largest country by land area in the Arctic Council. Activity data from combination of local Russia information and international resources, emission factors based on either Russian documents or adjusted values for local conditions, and other emission source data are used to approximate the BC emissions. Emissions are gridded at a resolution of 0.1° × 0.1° and developed into a monthly temporal profile. Total anthropogenic BC emission of Russia in 2010 is estimated to be around 224 Gg. Gas flaring, a commonly ignored black carbon source, contributes a significant fraction of 36.2% to Russia's total anthropogenic BC emissions. Other sectors, i.e., residential, transportation, industry, and power plants, contribute 25.0%, 20.3%, 13.1%, and 5.4%, respectively. Three major BC hot spot regions are identified: the European part of Russia, the southern central part of Russia where human population densities are relatively high, and the Urals Federal District where Russia's major oil and gas fields are located but with sparse human population. BC simulations are conducted using the hemispheric version of Community Multi-scale Air Quality Model with emission inputs from a global emission database EDGAR (Emissions Database for Global Atmospheric Research)-HTAPv2 (Hemispheric Transport of Air Pollution) and EDGAR-HTAPv2 with its Russian part replaced by the newly developed Russian BC emissions, respectively. The simulation using the new Russian BC emission inventory could improve 30–65% of absorption aerosol optical depth measured at the AERONET sites in Russia throughout the whole year as compared to that using the default HTAPv2 emissions. At the four ground monitoring sites (Zeppelin, Barrow, Alert, and Tiksi) in the Arctic Circle, surface BC simulations are improved the most during the Arctic haze periods (October–March). The poor performance of Arctic BC simulations in previous studies may be partly ascribed to the Russian BC emissions built on out-of-date and/or missing information, which could result in biases to both emission rates and the spatial distribution of emissions. Finally, this study highlights that the impact of Russian emissions on the Arctic haze has likely been underestimated, and its role in the Arctic climate system needs to be reassessed. The Russian black carbon emission source data generated in this study can be obtained via http://abci.ornl.gov/download.shtml or http://acs.engr.utk.edu/Data.php.

54 ENVIRONMENTAL SCIENCES↗

The Global Positioning System constellation as a space weather monitor. Comparison of electron measurements with Van Allen Probes data

Energetic electron observations in Earth's radiation belts are typically sparse, and multipoint studies often rely on serendipitous conjunctions. This paper establishes the scientific utility of the Combined X-ray Dosimeter (CXD), currently flown on 19 satellites in the Global Positioning System (GPS) constellation, by cross-calibrating energetic electron measurements against data from the Van Allen Probes. By breaking our cross calibration into two parts—one that removes any spectral assumptions from the CXD flux calculation and one that compares the energy spectra—we first validate the modeled instrument response functions, then the calculated electron fluxes. Unlike previous forward modeling of energetic electron spectra, we use a combination of four distributions that together capture a wide range of observed spectral shapes. Moreover, our two-step approach allowed us to identify, and correct for, small systematic offsets between block IIR and IIF satellites. Using the Magnetic Electron Ion Spectrometer and Relativistic Electron-Proton Telescope on Van Allen Probes as a “gold standard,” here we demonstrate that the CXD instruments are well understood. A robust statistical analysis shows that CXD and Van Allen Probes fluxes are similar and the measured fluxes from CXD are typically within a factor of 2 of Van Allen Probes at energies inline image4 MeV. Our team present data from 17 CXD-equipped GPS satellites covering the 2015 “St. Patrick's Day” geomagnetic storm to illustrate the scientific applications of such a high data density satellite constellation and therefore demonstrate that the GPS constellation is positioned to enable new insights in inner magnetospheric physics and space weather forecasting.

47 OTHER INSTRUMENTATION↗