Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “data reduction techniques”

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 163 records · Page 9

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even with gradient information provided. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this work, we propose a novel Bayesian stochastic inversion methodology, characterized by a tight coupling between a gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated spatial random field. Moreover, non-Gaussian full posterior probability distribution functions are estimated via an efficient LMCMC method on both the projected low-dimensional feature space and the recovered high-dimensional parameter space. We demonstrate this computational framework by integrating and adapting recent developments such as data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to solve inverse problems in linear elasticity.

97 MATHEMATICS AND COMPUTING↗

The Cost of Decarbonization and Energy Upgrade Retrofits for US Homes

Cost is a major barrier when upgrading homes to reduce carbon emissions required to meet DOE’s climate-related goals. This report summarizes a nationwide effort to gather home energy upgrade project cost data along with household energy performance data. The goal was to develop cost benchmarks and to guide future R&D efforts aimed at cost compression and scaling of the residential upgrade market. The cost data were compiled for both total project costs and costs of individual measures. The majority of energy savings were modeled, with some models using measured site data for calibration. The database was analyzed using clustering techniques to find common energy and CO2 reduction approaches. The individual measures were combined into archetypal solutions to determine least-cost approaches to maximizing energy and carbon savings. Several financial analyses were preformed to examine other cost metrics beyond first cost. Project data was obtained for 1,739 projects, from 15 states and 12 energy programs, with a total of 10,512 individual measures. The database includes a wide-array of projects, ranging from single-measure HVAC upgrades to net-zero energy whole home remodels. Projects were predominantly single-family detached dwellings with wood frame construction. Most of the data was obtained from energy programs because they had recorded the necessary information and were willing to share with this study. This sample of convenience can provide broad guidance and national cost benchmarks, but lacks sufficient detail to draw more disaggregated conclusions, such as geographical trends. The majority of data contributions were obtained without compensation from sources where the required data was already in some sort of structured format. We compensated sources to enter data from individual projects into a structured data format for about 500 projects, with an average cost of about $40 per project. The database was highly skewed to lower cost, lower impact projects due to the nature of the sample of convenience. Less than 10% of projects had savings greater than 50%. The cost data for individual measures in the database are being used in other DOE efforts on residential energy use/decarbonization. This data collection effort should continue in order to provide the best-informed guidance for DOE and industry R&D, as well as deployment efforts (including policy and program planning).

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Using Machine Learning to Discern Eruption in Noisy Environments: A Case Study Using CO2-Driven Cold-Water Geyser in Chimayó, New Mexico

In this paper, we present an approach based on machine learning (ML) to distinguish eruption and precursory signals of Chimayó geyser (New Mexico, U.S.A.) under noisy environmental conditions. This geyser can be considered a natural analog of CO 2 intrusion into shallow water aquifers. By studying this geyser, we can understand upwelling of CO 2 -rich fluids from depth, which has relevance to leak monitoring in a CO 2 sequestration project. ML methods such as random forests (RFs) are known to be robust multiclass classifiers and perform well under unfavorable, noisy conditions. However, the extent of the RF method’s accuracy is poorly understood for this CO 2 -driven geysering application. The current study aims to quantify the performance of RF classifiers to discern the geyser state. Toward this goal, we first present the data collected from the seismometer that is installed near the Chimayó geyser. The seismic signals collected at this site contain different types of noises such as daily temperature variations, animal movement near the geyser, and human activity. First, we filter the signals from these noises by combining the Butterworth high-pass (BH) filter and an autoregressive (AR) method in a multilevel fashion. We show that by combining these filtering techniques in a hierarchical fashion leads to a reduction in noise in the seismic data without removing the precursors and eruption event signals. We then use RF on the filtered data to classify the state of geyser into three classes: remnant noise, precursor, and eruption states. RF classifier is constructed based on the comprehensive features extracted using the Tsfresh Python package. We show that the classification accuracy using RF on the filtered data is greater than 90%. We also evaluate the accuracy of other classical time-series methods such as dynamic time warping (DTW) on filtered data along with RF on partially filtered data in which we remove the daily trends. Classification accuracy shows that DTW performs poorly (44%) and RF on partially filtered data performs decently (87%). Denoising seismic signals from both daily trends and human activity enhances RF classifier performance by 7%. Finally, these aspects make the proposed ML framework attractive for event discrimination and signal enhancement under noisy conditions, with strong potential for application to monitor leaks in CO 2 sequestration.

58 GEOSCIENCES↗

Forecasting district-scale energy dynamics through integrating building network and long short-term memory learning algorithm

With the development of data-driven techniques, building energy prediction on a district level has attracted increasing attention in recent years for revealing energy use patterns and reduction potentials. However, data acquisition in large building groups is difficult and adjacent buildings also interact with each other. To reduce data cost and incorporate the inter-building impact with the data-driven building energy model, this study proposes a deep learning predictive approach that fuses the building network model with a long short-term memory learning model for district-scale building energy modeling. The building network was constructed based on correlations between the energy use intensity of buildings, which can significantly reduce the computational complexity of the deep learning models for energy dynamic prediction. Five typical building groups with energy use data from 2015 to 2018 on two institutional campuses were selected to perform the validation experiment with TensorFlow. Based on the prediction error assessments, the results suggest that for total building energy use intensity prediction, the proposed model can achieve a mean absolute percentage error of 6.66% and a root mean square error of 0.36 kWh/m 2 , compared to 12.05% and 0.63 kWh/m 2 of the conventional artificial neural network model and to 11.06% and 0.89 kWh/m 2 for the support vector regression model.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Efficient Dimension Reduction of Complex Three-dimensional CO2 Saturation using Deep Learning Models

In the domain of deep learning (DL), dimension reduction is crucial for enhancing training efficiency and mitigating overfitting, particularly when managing complex data such as three-dimensional (3D) saturation data. The 3D saturation data in the context of geological carbon storage (GCS) presents unique challenges due to its inherent sparsity and the abrupt transitions at plume boundaries, known as shock fronts. To address the challenges, we proposed a novel DL framework that integrates dimension reduction with advanced 3D reconstruction techniques. Our model leveraged latent variables derived from 2D average saturation data, offering a robust and efficient solution tailored to the intricate dynamics of 3D saturation fields. The proposed framework can extract the critical features of the high-dimensional data while reducing the variable numbers, which is more tractable for DL models and enhances the model robustness and accuracy. Therefore, it provides a novel approach for modeling and analyses in complex geological scenarios, which finds great potential applications in environmental monitoring and energy storage.

Wang, Hongsheng↗

Efficient and Flexible Hierarchical Data Layouts for a Unified Encoding of Scalar Field Precision and Resolution

To address the problem of ever-growing scientific data sizes making data movement a major hindrance to analysis, we introduce a novel encoding for scalar fields: a unified tree of resolution and precision, specifically constructed so that valid cuts correspond to sensible approximations of the original field in the precision-resolution space. Furthermore, we introduce a highly flexible encoding of such trees that forms a parameterized family of data hierarchies. We discuss how different parameter choices lead to different trade-offs in practice, and show how specific choices result in known data representation schemes such as zfp[52], idx[58], and jpeg2000 [76]. Lastly, we provide system-level details and empirical evidence on how such hierarchies facilitate common approximate queries with minimal data movement and time, using real-world data sets ranging from a few gigabytes to nearly a terabyte in size. Experiments suggest that our new strategy of combining reductions in resolution and precision is competitive with state-of-the-art compression techniques with respect to data quality, while being significantly more flexible and orders of magnitude faster, and requiring significantly reduced resources.

97 MATHEMATICS AND COMPUTING↗

Novel Histogram Based Unsupervised Classification Technique to Determine Natural Classes From Biophysically Relevant Fit Parameters to Hyperspectral Data

Hyperspectral image analysis has benefited from an array of methods that take advantage of the increased spectral depth compared to multispectral sensors; however, the focus of these developments has been on supervised classification methods. Lack of a priori knowledge regarding land cover characteristics can make unsupervised classification methods preferable under certain circumstances. An unsupervised classification technique is presented in this paper that utilizes physically relevant basis functions to model the reflectance spectra. These fit parameters used to generate the basis functions allow clustering based on spectral characteristics rather than spectral channels and provide both noise and data reduction. Histogram splitting of the fit parameters is then used as a means of producing an unsupervised classification. Unlike current unsupervised classification techniques that rely primarily on Euclidian distance measures to determine similarity, the unsupervised classification technique uses the natural splitting of the fit parameters associated with the basis functions creating clusters that are similar in terms of physical parameters. The data set used in this work utilizes the publicly available data collected at Indian Pines, Indiana. This data set provides reference data allowing for comparisons of the efficacy of different unsupervised data analysis. The unsupervised histogram splitting technique presented in this paper is shown to be better than the standard unsupervised ISODATA clustering technique with an overall accuracy of 34.3/19.0% before merging and 40.9/39.2% after merging. Finally, this improvement is also seen as an improvement of kappa before/after merging of 24.8/30.5 for the histogram splitting technique compared to 15.8/28.5 for ISODATA.

58 GEOSCIENCES↗

SNS: A Solution-Based Nonlinear Subspace Method for Time-Dependent Model Order Reduction

Several reduced order models have been successfully developed for nonlinear dynamical systems. To achieve a considerable speed-up, a hyper-reduction step is needed to reduce the computational complexity due to nonlinear terms. Many hyper-reduction techniques require the construction of nonlinear term basis, which introduces a computationally expensive offline phase. A novel way of constructing nonlinear term basis within the hyper-reduction process is introduced. In contrast to the traditional hyper-reduction techniques where the collection of nonlinear term snapshots is required, the SNS method avoids collecting the nonlinear term snapshots. Instead, it uses the solution snapshots that are used for building a solution basis, which enables avoiding an extra data compression of nonlinear term snapshots. As a result, the SNS method provides a more efficient offline strategy than the traditional model order reduction techniques, such as the DEIM, GNAT, and ST-GNAT methods. The SNS method is theoretically justified by the conforming subspace condition and the subspace inclusion relation. It is useful for model order reduction of large-scale nonlinear dynamical problems to reduce the offline cost. It is especially useful for ST-GNAT that has shown promising results, such as a good accuracy with a considerable online speed-up for hyperbolic problems in a recent paper by Choi and Carlberg [SIAM J. Sci. Comput., 41 (2019), pp. A26--A58], because ST-GNAT involves an expensive offline cost related to collecting nonlinear term snapshots. Error analysis for the SNS method is presented. Numerical results support that the accuracy of the solution from the SNS method is comparable to the traditional methods and a considerable speed-up (i.e., a factor of two to a hundred) is achieved in the offline phase.

97 MATHEMATICS AND COMPUTING↗

Developing Ultrahigh-Resolution E3SM Land Model for GPU Systems

Designing and refactoring complex scientific code, such as the E3SM land model (ELM), for new computing architectures is challenging. This paper presents design strategies and technical approaches to develop a data-oriented, GPU-ready ELM model using compiler directives (OpenACC/OpenMP). We first analyze the datatypes and processes in the original ELM code. Then we present design considerations for ultrahigh-resolution ELM (uELM) development for massive GPU systems. These techniques include the global data-oriented simulation workflow, domain partition, code porting and data copy, memory reduction, parallel loop restructure and flattening, and race condition detection. We implemented the first version of uELM using OpenACC targeting the NVidia GPUs in the Summit supercomputer at Oak Ridge National Laboratory. During the implementation, we developed a software tool (named SPEL) to facilitate code generation, verification, and performance tuning using these techniques. The first uELM implementation for Nvidia GPUs on Summit delivered promising results: 1) over 98% of the ELM code was automatically generated and tuned by scripts. Most ELM modules had better computational performances than the original ELM code for CPUs. The GPU-ready uELM is more scalable than the CPU code on fully-loaded Summit nodes. Example profiling results from several modules are also presented to illustrate the performance improvements and race condition detection. The lessons learned and toolkit developed in the study are also suitable for further uELM deployment using OpenMP on the first US exascale computer, Frontier, equipped with AMD CPUs and GPUs.

Schwartz, Peter↗

High resolution dual detector volume-of-interest cone beam breast CT - Demonstration with a bench top system

Purpose: In this study, we used a small field high resolution detector in conjunction with a full field flat panel detector to implement and investigate the dual detector volume-of-interest (VOI) cone beam breast computed tomography (CBCT) technique on a bench-top system. The potential of using this technique to image small calcifications without increasing the overall dose to the breast was demonstrated. Significant reduction of scatter components in the high resolution projection image data of the VOI was also shown. Methods: With the regular flat panel based CBCT technique, exposures were made at 80 kVp to generate an air kerma of 6 mGys at the isocenter. With the dual detector VOI CBCT technique, a high resolution small field CMOS detector was used to scan a cylindrical VOI (2.5 cm in diameter and height, 4.5 cm off-center) with collimated x-rays at four times of regular exposure level. A flat panel detector was used for full field scan with low x-ray exposures at half of the regular exposure level. The low exposure full field image data were used to fill in the truncated space in the VOI scan data and generate a complete projection image set. The Feldkamp-Davis-Kress (FDK) filtered backprojection algorithm was used to reconstruct high resolution images for the VOI. Two scanning techniques, one breast centered and the other VOI centered, were implemented and investigated. Paraffin cylinders with embedded thin aluminum (Al) wires were imaged and used in conjunction with optically stimulated luminescence (OSL) dose measurements to demonstrate the ability of this technique to image small calcifications without increasing the mean glandular dose (MGD). Results: Using exposures that produce an air kerma of 6 mGys at the isocenter, the regular CBCT technique was able to resolve the cross-sections of Al wires as thin as 254 {mu}m in diameter in the phantom. For the specific VOI studied, by increasing the exposure level by a factor of 4 for the VOI scan and reducing the exposure level by a factor of 2 for the full filed scan, the dual-detector CBCT technique was able to resolve the cross-sections of Al wires as thin as 152 {mu}m in diameter. The CNR evaluated for the entire Al wire cross-section was found to be improved from 5.5 in regular CBCT to 14.4 and 16.8 with the breast centered and VOI centered scanning techniques, respectively. Even inside VOI center, the VOI scan resulted in significant dose saving with the dose reduced by a factor of 1.6 at the VOI center. Dose saving outside the VOI was substantial with the dose reduced by a factor of 7.3 and 7.8 at the breast center for the breast centered and VOI centered scans, respectively, when compared to full field scan at the same exposure level. The differences between the two dual detector techniques in terms of dose saving and scatter reduction were small with VOI scan at 4x exposure level and full field scan at 0.5x exposure level. The MGDs were only 94% of that from the regular CBCT scan. Conclusions: For the specific VOI studied, the dual detector VOI CBCT technique has the potential to provide high quality images inside the VOI with MGD similar to or even lower than that of full field breast CBCT. It was also found that our results were compromised by the use of inadequate detectors for the VOI scan. An appropriately selected detector would better optimize the image quality improvement that can be achieved with the VOI CBCT technique.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Tailored Convolutional Neural Network for Nonlinear Manifold Learning of Computational Physics Data Using Unstructured Spatial Discretizations

In this work, we propose a nonlinear manifold learning technique based on deep convolutional autoencoders that is appropriate for model order reduction of physical systems in complex geometries. Convolutional neural networks have proven to be highly advantageous for compressing data arising from systems demonstrating a slow-decaying Kolmogorov n-width. However, these networks are restricted to data on structured meshes. Unstructured meshes are often required for performing analyses of real systems with complex geometry. Our custom graph convolution operators based on the available differential operators for a given spatial discretization effectively extend the application space of deep convolutional autoencoders to systems with arbitrarily complex geometry that are typically discretized using unstructured meshes. We propose sets of convolution operators based on the spatial derivative operators for the underlying spatial discretization, making the method particularly well suited to data arising from the solution of partial differential equations. We demonstrate the method using examples from heat transfer and fluid mechanics and show better than an order of magnitude improvement in accuracy over linear methods.

97 MATHEMATICS AND COMPUTING↗

On the effect of metal loading on the reducibility and redox chemistry of ceria supported Pd catalysts

The effect of Pd loading on the redox characteristics of a ceria support was examined using in situ Pd K-edge XAS, Ce L 3 -edge XAS and in situ X-ray diffraction techniques. Analysis of the data obtained from these techniques indicates that the onset temperature for the partial reduction of Ce(IV) to Ce(III), by exposure to H 2 , varies inversely with the loading of Pd. Whilst the onset and completion temperatures of the reduction of Ce(IV) to Ce(III) are different, both samples yield the same maximal fraction of Ce(III) formation independent of Pd loading. Furthermore, the partial reduction of Ce is found to be concurrent with the reduction of PdO and demonstrated that the presence of metallic Pd is necessary for the reduction of the CeO 2 support. Upon passivation by room temperature oxidation, a full oxidation of the reduced ceria support was observed. However, only a mild surface oxidation of Pd was identified. The mild passivation of the Pd is found to lead to a highly reactive sample upon a second reduction by H 2 . The onset of the reduction of Pd and Ce has been demonstrated to be independent of the Pd loading after a mild passivation with both samples exhibiting near room temperature reduction in the presence of H 2 .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mitigation of LEO Satellite Brightness and Trail Effects on the Rubin Observatory LSST

In this work, we report studies on the mitigation of optical effects of bright low-Earth-orbit (LEO) satellites on Vera C. Rubin Observatory and its Legacy Survey of Space and Time (LSST). These include options for pointing the telescope to avoid satellites, laboratory investigations of bright trails on the Rubin Observatory LSST camera sensors, algorithms for correcting image artifacts caused by bright trails, experiments on darkening SpaceX Starlink satellites, and ground-based follow-up observations. The original Starlink v0.9 satellites are g ~ 4.5 mag, and the initial experiment "DarkSat" is g ~ 6.1 mag. Future Starlink darkening plans may reach g ~ 7 mag, a brightness level that enables nonlinear image artifact correction to well below background noise. However, the satellite trails will still exist at a signal-to-noise ratio ~ 100, generating systematic errors that may impact data analysis and limit some science. For the Rubin Observatory 8.4 m mirror and a satellite at 550 km, the full width at half maximum of the trail is about 3'' as the result of an out-of-focus effect, which helps avoid saturation by decreasing the peak surface brightness of the trail. For 48,000 LEOsats of apparent magnitude 4.5, about 1% of pixels in LSST nautical twilight images would need to be masked.

79 ASTRONOMY AND ASTROPHYSICS↗

The fusion code XGC: Enabling kinetic study of multi-scale edge turbulent transport in ITER

The XGC fusion gyrokinetic code combines state-of-the-art, portable computational and algorithmic technologies to enable complicated multiscale simulations of turbulence and transport dynamics in ITER edge plasma on the largest US open-science computer, the CRAY XK7 Titan, at its maximal heterogeneous capability, which have not been possible before due to a factor of over 10 shortage in the time-to-solution for less than 5 days of wall-clock time for one physics case. Frontier techniques such as nested OpenMP parallelism, adaptive parallel I/O, staging I/O and data reduction using dynamic and asynchronous applications interactions, dynamic repartitioning.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The fusion code XGC: Enabling kinetic study of multi-scale edge turbulent transport in ITER [Book Chapter]

The XGC fusion gyrokinetic code combines state-of-the-art, portable computational and algorithmic technologies to enable complicated multiscale simulations of turbulence and transport dynamics in ITER edge plasma on the largest US open-science computer, the CRAY XK7 Titan, at its maximal heterogeneous capability, which have not been possible before due to a factor of over 10 shortage in the time-to-solution for less than 5 days of wall-clock time for one physics case. Frontier techniques such as nested OpenMP parallelism, adaptive parallel I/O, staging I/O and data reduction using dynamic and asynchronous applications interactions, dynamic repartitioning for balancing computational work in pushing particles and in grid related work, scalable and accurate discretization algorithms for non-linear Coulomb collisions, and communication-avoiding subcycling technology for pushing particles on both CPUs and GPUs are also utilized to dramatically improve the scalability and time-to-solution, hence enabling the difficult kinetic ITER edge simulation on a present-day leadership class computer.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Implementing efficient data compression and encryption in a persistent key-value store for HPC

Recently, persistent data structures, like key-value stores (KVSs), which are stored in a high-performance computing (HPC) system’s nonvolatile memory, provide an attractive solution for a number of emerging challenges like limited I/O performance. Data compression and encryption are two well-known techniques for improving several properties of such data-oriented systems. This article investigates how to efficiently integrate data compression and encryption into persistent KVSs for HPC with the ultimate goal of hiding their costs and complexity in terms of performance and ease of use. Our compression technique exploits deep memory hierarchy in an HPC system to achieve both storage reduction and performance improvement. Our encryption technique provides a practical level of security and enables sharing of sensitive data securely in complex scientific workflows with nearly imperceptible cost. We implement the proposed techniques on top of a distributed embedded KVS to evaluate the benefits and costs of incorporating these capabilities along different points in the dataflow path, illustrating differences in effective bandwidth, latency, and additional computational expense on Swiss National Supercomputing Centre’s Grand Tavé and National Energy Research Scientific Computing Center’s Cori.

97 MATHEMATICS AND COMPUTING↗

Generative learning of densities on manifolds

A generative modeling framework is proposed that combines diffusion models and manifold learning to efficiently sample data densities on manifolds. The approach utilizes Diffusion Maps to uncover possible low-dimensional underlying (latent) spaces in the high-dimensional data (ambient) space. Two approaches for sampling from the latent data density are described. The first is a score-based diffusion model, which is trained to map a standard normal distribution to the latent data distribution using a neural network. The second one involves solving an Itô stochastic differential equation in the latent space. Additional realizations of the data are generated by lifting the samples back to the ambient space using Double Diffusion Maps , a recently introduced technique typically employed in studying dynamical system reduction; here the focus lies in sampling densities rather than system dynamics. The proposed approaches enable sampling high dimensional data densities restricted to low-dimensional, a priori unknown manifolds. The efficacy of the proposed framework is demonstrated through a benchmark problem and a material with multiscale structure.

Double diffusion maps↗