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,531 records · Page 85

Design of Materials with Alchemite

Machine learning models that establish the relationships between materials processing and properties can enable inverse design of materials through active learning. Alchemite is a commercial software that can perform inverse materials design on sparse data. Here we evaluate Alchemite’s performance on a dataset of shape memory alloys and a dataset of heat exchangers compared to baseline random forest models. Alchemite had higher accuracy when making predictions on sparse data and was more accurate or nearly as accurate as random forests on complete datasets while also quantifying uncertainty. The software was also used to suggest processing steps and design parameters to optimize properties and performance; however, physical validation of the suggested design parameters was beyond the scope of this work. Several useful design insights were gained about the impact of the design parameters on properties and performance including the importance of dopant choice and amount for shape memory alloys and the importance of height and weight on the thermal resistance of heat exchangers.

Machine learning↗

Highly Parallel Solver for Multi-scale Parquet Quantum Modeling of Strongly Correlated Materials

The parquet formalism to calculate the two-particle Green s functions of large systems requires the solution of a large, sparse, complex system of quadratic equations. If Nf Matsubara frequencies are used for a system of size Nc , and Newton s method is used to solve the nonlinear system, the Jacobian system has O(8Nt^3 ) variables and O(40Nt^4 ) complex entries where Nt = Nc Nf . For Nt = 1024, the nonlinear system has over 8.5 billion degrees of freedom and the sparse Jacobian will require over 351 TBytes of memory. The Jacobian is very expensive to store but the matrix-vector products can be computed directly. We are developing a highly scalable parallel solver that uses both OpenMP and MPI to exploit the multicore nodes. We present initial scalability results on the Cray XT5 that suggests the code can be scaled to solve larger problems with Nt 1024.

97 MATHEMATICS AND COMPUTING↗

Towards High Performance Discrete-Event Simulations of Smart Electric Grids

Future electric grid technology is envisioned on the notion of a smart grid in which responsive end-user devices play an integral part of the transmission and distribution control systems. Detailed simulation is often the primary choice in analyzing small network designs, and the only choice in analyzing large-scale electric network designs. Here, we identify and articulate the high-performance computing needs underlying high-resolution discrete event simulation of smart electric grid operation large network scenarios such as the entire Eastern Interconnect. We focus on the simulator's most computationally intensive operation, namely, the dynamic numerical solution for the electric grid state, for both time-integration as well as event-detection. We explore solution approaches using general-purpose dense and sparse solvers, and propose a scalable solver specialized for the sparse structures of actual electric networks. Based on experiments with an implementation in the THYME simulator, we identify performance issues and possible solution approaches for smart grid experimentation in the large.

99 GENERAL AND MISCELLANEOUS↗

Smart Grid Integrity Attacks: Characterizations and Countermeasures

Real power injections at loads and generators, and real power flows on selected lines in a transmission network are monitored, transmitted over a SCADA network to the system operator, and used in state estimation algorithms to make dispatch, re-balance and other energy management system [EMS] decisions. Coordinated cyber attacks of power meter readings can be arranged to be undetectable by any bad data detection algorithm. These unobservable attacks present a serious threat to grid operations. Of particular interest are sparse attacks that involve the compromise of a modest number of meter readings. An efficient algorithm to find all unobservable attacks [under standard DC load flow approximations] involving the compromise of exactly two power injection meters and an arbitrary number of power meters on lines is presented. This requires O(n2m) flops for a power system with n buses and m line meters. If all lines are metered, there exist canonical forms that characterize all 3, 4, and 5-sparse unobservable attacks. These can be quickly detected in power systems using standard graph algorithms. Known secure phase measurement units [PMUs] can be used as countermeasures against an arbitrary collection of cyber attacks. Finding the minimum number of necessary PMUs is NP-hard. It is shown that p + 1 PMUs at carefully chosen buses are sufficient to neutralize a collection of p cyber attacks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

STRUMPACK -- STRUctured Matrices PACKage

STRUMPACK - STRUctured Matrices PACKage - is a package for computations with sparse and dense structured matrix, i.e., matrices that exhibit some kind of low-rank property, in particular Hierarchically Semi Separable structure (HSS). Such matrices appear in many applications, e.g., FEM, BEM, Integral equations. etc. Exploiting this structure using certain compression algorithms allow for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. STRUMPACK has presently two main components: a distributed-memory dense matrix computations package and a shared-memory sparse direct solver.

Source record↗

Automated Dynamic Demand Response Implementation on a Micro-grid

In this paper, we describe a system for real-time automated Dynamic and Sustainable Demand Response with sparse data consumption prediction implemented on the University of Southern California campus microgrid. Supply side approaches to resolving energy supply-load imbalance do not work at high levels of renewable energy penetration. Dynamic Demand Response (D 2 R) is a widely used demand-side technique to dynamically adjust electricity consumption during peak load periods. Our D 2 R system consists of accurate machine learning based energy consumption forecasting models that work with sparse data coupled with fast and sustainable load curtailment optimization algorithms that provide the ability to dynamically adapt to changing supply-load imbalances in near real-time. Our Sustainable DR (SDR) algorithms attempt to distribute customer curtailment evenly across sub-intervals during a DR event and avoid expensive demand peaks during a few sub-intervals. It also ensures that each customer is penalized fairly in order to achieve the targeted curtailment. We develop near linear-time constant-factor approximation algorithms along with Polynomial Time Approximation Schemes (PTAS) for SDR curtailment that minimizes the curtailment error defined as the difference between the target and achieved curtailment values. Our SDR curtailment problem is formulated as an Integer Linear Program that optimally matches customers to curtailment strategies during a DR event while also explicitly accounting for customer strategy switching overhead as a constraint. We demonstrate the results of our D 2 R system using real data from experiments performed on the USC smartgrid and show that 1) our prediction algorithms can very accurately predict energy consumption even with noisy or missing data and 2) our curtailment algorithms deliver DR with extremely low curtailment errors in the 0.01-0.05 kWh range.

Kuppannagari, Sanmukh R.↗

Estimating Highway Volumes Using Vehicle Probe Data - Proof of Concept: Preprint

This paper examines the feasibility of using sampled commercial probe data in combination with validated continuous counter data to accurately estimate vehicle volume across the entire roadway network, for any hour during the year. Currently either real time or archived volume data for roadways at specific times are extremely sparse. Most volume data are average annual daily traffic (AADT) measures derived from the Highway Performance Monitoring System (HPMS). Although methods to factor the AADT to hourly averages for typical day of week exist, actual volume data is limited to a sparse collection of locations in which volumes are continuously recorded. This paper explores the use of commercial probe data to generate accurate volume measures that span the highway network providing ubiquitous coverage in space, and specific point-in-time measures for a specific date and time. The paper examines the need for the data, fundamental accuracy limitations based on a basic statistical model that take into account the sampling nature of probe data, and early results from a proof of concept exercise revealing the potential of probe type data calibrated with public continuous count data to meet end user expectations in terms of accuracy of volume estimates.

25 ENERGY STORAGE↗

Comparison of Mesoscale Model Setups for Offshore Wind Resource Assessment: A New Jersey Case Study

As the offshore wind energy industry begins to emerge on the U.S. northeast coast, there is an urgent need for an accurate characterization of the offshore wind resource. The offshore regime features various resource characteristics not seen onshore, including frequent coastal low-level jets, non-steady surface conditions (e.g. waves), complex air-sea and land-sea interactions, and coastal mesoscale circulations (e.g. sea breeze). An accurate characterization of these phenomena in mesoscale models is critical to support accurate energy production estimates and forecasting for future offshore wind farms. However, a robust validation of mesoscale model performance in the offshore U.S. has been limited due to sparse data and difficulty obtaining offshore measurements. Consequently, it is unclear how mesoscale models perform offshore and which suite of parameterizations and input data are best suited for accurate resource characterization. To begin addressing this knowledge gap, the National Renewable Energy Laboratory, in collaboration with the Rutgers Center for Ocean Observing Leadership, conducted a mesoscale model validation campaign in the offshore environment. The Weather Research and Forecasting (WRF) model was assessed and the New Jersey offshore coastal area served as the validation domain. An ensemble of WRF simulations conducted over a one-year period sampled from a range of model setups, including different reanalysis and forecast data inputs, sea surface temperature data inputs, planetary boundary layer parameterizations, and WRF versions. The performance of each ensemble member was validated against a network of observations including offshore floating lidars, coastal met towers, offshore platform measurements, and offshore buoys. Model performance was assessed on annual, seasonal, and diurnal scales with particular emphasis on the vertical wind speed profile and temperature stratification. Preliminary results from this validation work will be presented here. The key WRF inputs and parameters driving changes in the modeled wind resource will be discussed and preliminary recommendations on WRF setups for offshore wind resource modeling will be proposed. The application of this validation exercise to other proposed offshore wind energy areas in the U.S. will also be discussed. mesoscale circulations (e.g. sea breeze). An accurate characterization of these phenomena in mesoscale models is critical to support accurate energy production estimates and forecasting for future offshore wind farms. However, a robust validation of mesoscale model performance in the offshore U.S. has been limited due to sparse data and difficulty obtaining offshore measurements. Consequently, it is unclear how mesoscale models perform offshore and which suite of parameterizations and input data are best suited for accurate resource characterization. To begin addressing this knowledge gap, the National Renewable Energy Laboratory, in collaboration with the Rutgers Center for Ocean Observing Leadership, conducted a mesoscale model validation campaign in the offshore environment. The Weather Research and Forecasting (WRF) model was assessed and the New Jersey offshore coastal area served as the validation domain. An ensemble of WRF simulations conducted over a one-year period sampled from a range of model setups, including different reanalysis and forecast data inputs, sea surface temperature data inputs, planetary boundary layer parameterizations, and WRF versions. The performance of each ensemble member was validated against a network of observations including offshore floating lidars, coastal met towers, offshore platform measurements, and offshore buoys. Model performance was assessed on annual, seasonal, and diurnal scales with particular emphasis on the vertical wind speed profile and temperature stratification. Preliminary results from this validation work will be presented here. The key WRF inputs and parameters driving changes in the modeled wind resource will be discussed and preliminary recommendations on WRF setups for offshore wind resource modeling will be proposed. The application of this validation exercise to other proposed offshore wind energy areas in the U.S. will also be discussed.

17 WIND ENERGY↗

Reinforcement-based Program Induction in a Neural Virtual Machine

We present a neural virtual machine that can be trained to perform algorithmic tasks. Rather than combining a neural controller with non-neural memory storage as has been done in the past, this architecture is purely neural and emulates tape-based memory via fast associative weights (onestep learning). Here we formally define the architecture, and then extend the system to learn programs using recurrent policy gradient reinforcement learning based on examples of program inputs labeled with corresponding output targets, which are compared against actual output to generate a sparse reward signal. We describe the policy gradient training procedure used, and report its empirical performance on a number of smallscale list processing tasks, such as finding the maximum list element, filtering out certain elements, and reversing the order of the elements. These results show that program induction via reinforcement learning is possible using sparse rewards and solely neural computations.

Katz, Garrett E.↗

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗

Improving scalability of electronic structure code for molecular simulations in the presence of environment

A scalable density functional electronic code with Gaussian basis set, called UTEP-NRLMOL, is developed to perform simulations of molecular systems in the presence of the environment with particular attention to the memory requirements. In the electronic structure calculations, the memory and computation time are proportional to the number of atoms. Memory requirements for density functional calculations scale as N*N, where N is the number of atoms. While the recent advances in HPC offer platforms with large numbers of cores, the limited amount of memory available on a given node and poor scalability of the electronic structure codes hinder their efficient usage of these platforms. We have introduced new scaling and parallelization paradigms using MPI-3 shared-memory functionality combined with usage of sparse algebra and storage of matrices in sparse format. This extends the range of applicability of the UTEP-NRLMOL code to large systems over 10,000 atoms, or using up to 67,000 basis functions, and making use of HPC architectures using over 6,000 processors utilizing all available cores. We have also interfaced code with effective fragment potential and polarizable continuum model libraries. The code was used in simulations of several applications which are published in reputed scientific journals.

74 ATOMIC AND MOLECULAR PHYSICS↗

Cosmic ray muon clustering for the MicroBooNE liquid argon time projection chamber using sMask-RCNN

In this article, we describe a modified implementation of Mask Region-based Convolutional Neural Networks (Mask-RCNN) for cosmic ray muon clustering in a liquid argon TPC and applied to MicroBooNE neutrino data. Our implementation of this network, called sMask-RCNN, uses sparse submanifold convolutions to increase processing speed on sparse datasets, and is compared to the original dense version in several metrics. The networks are trained to use wire readout images from the MicroBooNE liquid argon time projection chamber as input and produce individually labeled particle interactions within the image. These outputs are identified as either cosmic ray muon or electron neutrino interactions. We find that sMask-RCNN has an average pixel clustering efficiency of 85.9% compared to the dense network's average pixel clustering efficiency of 89.1%. We demonstrate the ability of sMask-RCNN used in conjunction with MicroBooNE's state-of-the-art Wire-Cell cosmic tagger to veto events containing only cosmic ray muons. The addition of sMask-RCNN to the Wire-Cell cosmic tagger removes 70% of the remaining cosmic ray muon background events at the same electron neutrino event signal efficiency. This event veto can provide 99.7% rejection of cosmic ray-only background events while maintaining an electron neutrino event-level signal efficiency of 80.1%. In addition to cosmic ray muon identification, sMask-RCNN could be used to extract features and identify different particle interaction types in other 3D-tracking detectors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Pan-sharpening for microscopy

Techniques for generating full-spatial resolution, full spectral resolution image(s) from a 3D spectral-data cube for any spectral value within a given spectral range are provided without requiring the acquisition of all full-spatial resolution, full spectral resolution data by an instrument. The 3D spectral-data cube is generated from a limited number of full-spatial resolution, sparse spectral resolution data and a sparse-spatial resolution, full-spectral resolution data of the same area of the sample. The use of the 3D spectral-data cube reduces the data acquisition time.

Ovchinnikova, Olga S.↗

Inverse transport problem solvers based on regularized and compressive sensing techniques

According to the direct exposure measurements from flash radiographic image, regularized-based method and compressive sensing (CS)-based method for inverse transport equation are presented. The linear absorption coefficients and interface locations of objects are reconstructed directly at the same time. With a large number of measurements, least-square method is utilized to complete the reconstruction. Owing to the ill-posedness of the inverse problems, regularized algorithm is employed. Tikhonov method is applied with an appropriate posterior regularization parameter to get a meaningful solution. However, it's always very costly to obtain enough measurements. With limited measurements, CS sparse reconstruction technique Orthogonal Matching Pursuit (OMP) is applied to obtain the sparse coefficients by solving an optimization problem. This paper constructs and takes the forward projection matrix rather than Gauss matrix as measurement matrix. In the CS-based algorithm, Fourier expansion and wavelet expansion are adopted to convert an underdetermined system to a well-posed system. Simulations and numerical results of regularized method with appropriate regularization parameter and that of CS-based agree well with the reference value, furthermore, both methods avoid amplifying the noise. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Adaptive polynomial chaos techniques for uncertainty quantification of a gas cooled fast reactor transient

Uncertainty quantification plays an increasingly important role in the nuclear community, especially with the rise of Best Estimate Plus Uncertainty methodologies. Sensitivity analysis, surrogate models, Monte Carlo sampling and several other techniques can be used to propagate input uncertainties. In recent years however polynomial chaos expansion has become a popular alternative providing high accuracy at affordable computational cost. This paper presents such polynomial chaos (PC) methods using adaptive sparse grids and adaptive basis set construction, together with an application to a Gas Cooled Fast Reactor transient. Comparison is made between a new sparse grid algorithm and the traditionally used technique proposed by Gerstner. An adaptive basis construction method is also introduced and is proved to be advantageous both from an accuracy and a computational point of view. As a demonstration the uncertainty quantification of a 50% loss of flow transient in the GFR2400 Gas Cooled Fast Reactor design was performed using the CATHARE code system. The results are compared to direct Monte Carlo sampling and show the superior convergence and high accuracy of the polynomial chaos expansion. Since PC techniques are easy to implement, they can offer an attractive alternative to traditional techniques for the uncertainty quantification of large scale problems. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A Multiple Lines of Evidence Approach for Conceptual Site Models in Performance Assessments - 19070

Demonstration of the long-term performance of remediated radioactive waste sites relies on models that evaluate vadose zone and groundwater flow and contaminant transport for thousands of years. Model qualification, verification, and comparisons with data are essential elements to demonstrating the accuracy of long-term performance assessments (PAs). However, comparisons with data are generally limited due to incomplete characterization data and long-time scales. Since PAs support decision making to assure long-term protection of both human health and the environment, a conceptual site model (CSM) is needed to explain the hydrodynamic behavior and account for subsurface heterogeneities in sufficient detail to support confident decisions. In the case of the Waste Management Area (WMA) C PA, where the focus of the effort is on characterizing flow and transport through a thick vadose zone, site-specific data are sparse and larger-scale geologic descriptions are adopted with the risk of losing small scale features that may affect contaminant transport. Features such as horizontal bedding and sloping interfaces between contrasting material types, as well as vertically oriented features such as clastic dikes, may be difficult to delineate from sparse characterization data, but may affect the extent to which contaminants are transported. The PA conducted to identify long-term impacts associated with the closure of the single-shell tank (SST) farm at WMA C adopted an equivalent homogenous medium approach to represent the major stratigraphic units at the site. This approach explicitly represents major stratigraphic units but assigns hydraulic properties that implicitly account for the presence of small-scale heterogeneities and their impact on flow and contaminant transport to the groundwater. The objective of this study is to evaluate the available site-specific and analogue data that can be used to characterize heterogeneity and to assess its impact on fate and transport of contaminants that may lead to different conclusions when compared to the results of the equivalent homogeneous media approach. To this end, a multiple lines of evidence approach was used to construct alternative CSMs based on an evaluation of several types of data. These data include 1) general characteristics and features of the major stratigraphic units from historical descriptions; 2) borehole geologic logs; 3) particle size distribution measurements; 4) moisture content measurements; 5) spectral gamma data; and 6) concentrations of key constituents (i.e., Tc-99) in both the vadose zone and groundwater impacted by past releases. Based on an analysis of the available data, lines of evidence are evaluated for consistency and integrated in a consistent manner into scientifically defensible CSMs. Numerical models are then used to evaluate the impact that the explicit representation of heterogeneities has on contaminant transport. Together, the field data and the numerical modeling results indicate that heterogeneity caused by the small-scale features do not have a significant (i.e. greater than a factor of 2) impact on transport below WMA C relative to peak concentrations and arrival times for potential releases from waste tanks. The results of this study underscore the value of using multiple lines of evidence based on the quantity and quality of available data in developing alternative CSMs and evaluating their relative impact on key transport metrics such as arrival times and peak concentration. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Bayesian Approach to Estimation of Water Table Elevations Using Historical Rasters as Prior Information 2019 - 20430

In cases of complex but only partially known geology and a lack of spatial control in observation well locations, water table elevation estimation is very challenging. In some cases, auxiliary information, such as observations of the movement of tracers, operation of injection and extraction wells, and calibration of groundwater models against the historical elevation data, can be combined with expert judgement to estimate flow directions in areas of sparse data and to aid in the production of more reliable contour maps (and associated rasters) than could be produced by relying on sparse well elevation data alone. Given a historical sequence of these raster maps, the question arises how to automate, to the extent possible, the process of producing new raster maps to reflect data from previous times, the current data and the operation of expert judgement. One solution is to adopt a Bayesian point of view and to regard the historical well elevation data, auxiliary information and historical raster maps as prior information. The well elevations for water table wells, as well as those for injection/extraction wells and the data associated with other relevant variables, can be viewed as predictors for the raster surface. From this prior information, we can, conditional on the values of these predictors for a new time period, compute an expected value map and a standard deviation map for the new raster. These then can be taken to specify a prior predictive distribution for the pixels in the new raster map. Then we condition the pixels, corresponding to water level observation wells within the raster, on the observed values in those wells (which in general will differ from the regression estimate) for the new time period. Given the smoothness of the water table surface, we then smooth the surface of deviations from the mean surface, based on the variograms of the historical rasters, and add this smoothed surface to the regression mean surface. The error structure of the produced raster map is defined by the regression error structure and the error due to smoothing based on the estimated variograms. This methodology has been developed and is being further refined for groundwater monitoring and remediation at LANL. It is a very flexible method that can also be applied with a variety of other predictors applied to model the water level wells in the area of interest over the historical record. The smoothness of the spatial process and its possible evolution over time can then be estimated from the residuals from this regression. This can be augmented by expert hydrogeological opinion based on site topography and hydrogeology. (authors)

54 ENVIRONMENTAL SCIENCES↗

The Iterated Fission Matrix Method

The fission matrix (FM) method has been successfully demonstrated for different applications. One of the interesting features of this method, which is not possible via standard criticality source Monte Carlo calculations, is the capability to calculate higher forward and adjoint Eigenmodes; however, the accuracy of the estimates for higher eigenvalues strongly depends on the spatial discretization adopted for the fission matrix. A fine mesh ensures accurate results but requires matrices of large size. This is considered a limitation to the applicability of the FM method due to the memory requirements for storage of large full matrices. The adoption of sparse matrix storage (e.g., in MCNP) partially overcomes this problem; nonetheless, the sparse matrix indexing increases the complexity of the implementation of the FM algorithm and introduces the additional task of sparsifying the fission matrix. This summary presents a new method, named the iterated fission matrix (IFM), that allows to estimate higher eigenvalues of multiplying systems on much smaller meshes, but with the same level of accuracy in terms of spatial discretization errors, as compared to the FM method. The following Sections describe this new approach and provide a demonstration using two case studies: a PWR fuel assembly, and a 2D PWR core. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗