Search NASA⌕ Search

SEARCH · Search NASA

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Laser-Induced Spectrochemical Assay for Uranium Enrichment (LISA-UE)

Uranium hexafluoride (UF6) is the uranium compound typically involved in uranium enrichment process. As the first line of defense against nuclear proliferation, accurate determinations of the uranium enrichment ratio in UF6 are critical for materials verification, accounting and safeguards. Shipping gaseous UF6 samples off-site for analysis with mass spectrometry is cumbersome and costly, and results are not available for some time (months). In-field UF6 enrichment assay has the potential to substantially reduce the time, logistics and expense of sample handling. At present, COMPUCEA is the only accepted method for UF6 enrichment assay in the field. Laser-Induced Spectrochemical Assay for Uranium Enrichment (LISA-UE) is an all-optical (based on laser induced plasma emission) analytical technique intended for fieldable, accurate, precise and rapid UF6 enrichment assay. In its operation, laser induced plasma is created directly in the gaseous UF6 sample. Because different U isotopes emit at slightly different wavelengths, the isotopic information of the UF6 sample is inherently encoded in the atomic emission from the plasma. Isotopic emissions from 235U and 238U are measured simultaneously, which eliminate correlated noise from the laser induced plasma. Isotopic information of the UF6 sample can be extracted from the acquired spectrum with theoretical multi-variable non-linear spectral fitting. To date, advances made by the LISA-UE research team include optimization of the spectral window for direct gaseous UF6 enrichment assay with laser induced plasma, development of data reduction algorithms, and demonstrations of the LISA-UE technique with gaseous UF6 samples. In this presentation, the technical aspect of LISA-UE will be overviewed, the data reduction algorithm will be described, and performance of the technique will be discussed.

Chan, George↗
DOE OSTI2019

Protein and RNA dynamical fingerprinting

Protein structural vibrations impact biology by steering the structure to functional intermediate states; enhancing tunneling events; and optimizing energy transfer. Strong water absorption and a broad continuous vibrational density of states have prevented optical identification of these vibrations. Recently spectroscopic signatures that change with functional state were measured using anisotropic terahertz microscopy. The technique however has complex sample positioning requirements and long measurement times, limiting access for the biomolecular community. Here we demonstrate that a simplified system increases spectroscopic structure to dynamically fingerprint biomacromolecules with a factor of 6 reduction in data acquisition time. Using this technique, polarization varying anisotropy terahertz microscopy, we show sensitivity to inhibitor binding and unique vibrational spectra for several proteins and an RNA G-quadruplex. The technique’s sensitivity to anisotropic absorbance and birefringence provides rapid assessment of macromolecular dynamics that impact biology.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Inductive predictions of hydrologic events using a Long Short-Term Memory network and the Soil and Water Assessment Tool

We present machine learning methods to predict hydrologic features such as streamflow and soil moisture from spatially and temporally varying hydrological and meteorological data. Here, we used a temporal reduction technique to reduce computation and memory requirements and trained a Long Short-Term Memory (LSTM) network to predict soil moisture and streamflow over multiple watersheds. We show LSTM networks can be trained in a fraction of the time required by complex process-based and attention-based models such as Soil and Water Assessment Tool (SWAT) and GeoMAN without sacrificing accuracy. We also demonstrate that outside data - sourced from a watershed other than the target - can be used to train LSTM to comparable or even superior prediction accuracy. The success of LSTM in such spatially-inductive settings shows hydrologic features can be predicted with minimal prior knowledge of the watershed in question. Finally, we make all methodologies of this work publicly available as an end-to-end software pipeline that facilitates rapid prototyping of hydrologic learners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Optical spectroscopy of molten fluorides: Methods, electronic and vibrational data, structural interpretation, and relevance to radiative heat transfer

In this study, to help address the need for predicting radiative heat transfer (RHT) behavior of molten salts, we conducted a comprehensive review of methods and data from optical spectroscopic measurements on molten fluoride salts. Transmittance, reflectance, and trans-reflectance experimental methods are discussed, along with the corresponding data reduction methodology and the limitations of each technique. Optical spectroscopy is a convenient indirect probe for changes in structural parameters with temperature and composition. Electronic and vibrational absorption data for transition-metal, lanthanide, and actinide solutes and vibrational absorption data for alkali and alkaline earth fluoride solvents are compiled, and the corresponding structural interpretation is discussed and compared with other experimental and theoretical work. We find that solvent and solute vibrational absorption can be significant in the mid-infrared, resulting in near-infrared edges of significance to RHT. Extrapolation and averaging of existing edge data leads to estimated gray absorption coefficient values at 700 °C of 546 m —1 for FLiBe and 276 m —1 for FLiNaK, both within the range of 1 – 6000 m —1 identified to be of engineering relevance for radiative heat transfer analysis.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Fast and accurate reduced-order modeling of a MOOSE-based additive manufacturing model with operator learning

One predominant challenge in additive manufacturing (AM) is to achieve specific material properties by manipulating manufacturing process parameters during the runtime. Such manipulation tends to increase the computational load imposed on existing simulation tools employed in AM. The goal of the present work is to construct a fast and accurate reduced-order model (ROM) for an AM model developed within the Multiphysics Object-Oriented Simulation Environment (MOOSE) framework, ultimately reducing the time/cost of AM control and optimization processes. Our adoption of the operator learning (OL) approach enabled us to learn a family of differential equations produced by altering process variables in the laser’s Gaussian point heat source. More specifically, we used the Fourier neural operator (FNO) and deep operator network (DeepONet) to develop ROMs for time-dependent responses. Furthermore, we benchmarked the performance of these OL methods against a conventional deep neural network (DNN)-based ROM. Ultimately, we found that OL methods offer comparable performance and, in terms of accuracy and generalizability, even outperform DNN at predicting scalar model responses. The DNN-based ROM afforded the fastest training time. Furthermore, all the ROMs were faster than the original MOOSE model yet still provided accurate predictions. FNO had a smaller mean prediction error than DeepONet, with a larger variance for time-dependent responses. Unlike DNN, both FNO and DeepONet were able to simulate time series data without the need for dimensionality reduction techniques. Finally, the present work can help facilitate the AM optimization process by enabling faster execution of simulation tools while still preserving evaluation accuracy.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Ultra-Long Distance BOTDA Sensor System Employing Hybrid Amplification and Advanced Noise Reduction Techniques

Brillouin Optical Time Domain Analysis (BOTDA) sensor system play a pivotal role in distributed sensing, which enables precise measurements of strain and temperature across extensive fiber lengths. Nonetheless, challenges emerge as distances grow due to signal attenuation and noise interference resulting in measurement errors. This research offers a comprehensive strategy to extend the sensing range of BOTDA systems beyond 10’s of kilometers while maintaining high spatial resolutions. Such enhanced sensing is realized through the integration of distributed Raman amplification, inline amplification using erbium-doped fiber amplifiers (EDFA), and advanced noise reduction techniques. Leveraging inherent redundancy in measured data as a function of frequency and fiber distance, the non-local means (NLM) filter removes noise while preserving essential physical information. This approach proves particularly advantageous in BOTDA systems, where accurate measurement of Brillouin scattering signals is paramount for long-range sensing, while concurrently safeguarding high spatial resolutions. In summary, this research has shown a holistic exploration of extending BOTDA's distance sensing capabilities up to 150 km with spatial resolutions of 8 meters.

Bhatta, Hari↗
DOE OSTI2020

PyDA: A Hands-On Introduction to Dynamical Data Assimilation with Python

Dynamic data assimilation offers a suite of algorithms that merge measurement data with numerical simulations to predict accurate state trajectories. Meteorological centers rely heavily on data assimilation to achieve trustworthy weather forecast. With the advance in measurement systems, as well as the reduction in sensor prices, data assimilation (DA) techniques are applicable to various fields, other than meteorology. However, beginners usually face hardships digesting the core ideas from the available sophisticated resources requiring a steep learning curve. In this tutorial, we lay out the mathematical principles behind DA with easy-to-follow Python module implementations so that this group of newcomers can quickly feel the essence of DA algorithms. We explore a series of common variational, and sequential techniques, and highlight major differences and potential extensions. We demonstrate the presented approaches using an array of fluid flow applications with varying levels of complexity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Grassmannian Diffusion Maps--Based Dimension Reduction and Classification for High-Dimensional Data

This work introduces the Grassmannian diffusion maps (GDMaps), a novel nonlinear dimensionality reduction technique that defines the affinity between points through their representation as low-dimensional subspaces corresponding to points on the Grassmann manifold. Here, the method is designed for applications, such as image recognition and data-based classification of constrained high-dimensional data where each data point itself is a high-dimensional object (i.e., a large matrix) that can be compactly represented in a lower-dimensional subspace. The GDMaps is composed of two stages. The first is a pointwise linear dimensionality reduction wherein each high-dimensional object is mapped onto the Grassmann manifold representing the low-dimensional subspace on which it resides. The second stage is a multipoint nonlinear kernel-based dimension reduction using diffusion maps to identify the subspace structure of the points on the Grassmann manifold. To this end, an appropriate Grassmannian kernel is used to construct the transition matrix of a random walk on a graph connecting points on the Grassmann manifold. Spectral analysis of the transition matrix yields low-dimensional Grassmannian diffusion coordinates embedding the data into a low-dimensional reproducing kernel Hilbert space. Further, a novel data classification/recognition technique is developed based on the construction of an overcomplete dictionary of reduced dimension whose atoms are given by the Grassmannian diffusion coordinates. Three examples are considered. First, a "toy" example shows that the GDMaps can identify an appropriate parametrization of structured points on the unit sphere. The second example demonstrates the ability of the GDMaps to revealing the intrinsic subspace structure of high-dimensional random field data. In the last ex- ample, a face recognition problem is solved considering face images subject to varying illumination conditions, changes in face expressions, and occurrence of occlusions. The technique presented high recognition rates (i.e., 95% in the best case) using a fraction of the data required by conventional methods.

42 ENGINEERING↗
DOE OSTI2019

Visual Analytics for Deep Embeddings of Large Scale Molecular Dynamics Simulations

Molecular Dynamics (MD) simulation have been emerging as an excellent candidate for understanding complex atomic and molecular scale mechanism of bio-molecules that control essential bio-physical phenomenon in a living organism. But this MD technique produces large-size and long-timescale data that are inherently high-dimensional and occupies many terabytes of data. Processing this immense amount of data in a meaningful way is becoming increasingly difficult. Therefore, specific dimensionality reduction algorithm using deep learning technique has been employed here to embed the high-dimensional data in a lower-dimension latent space that still preserves the inherent molecular characteristics i.e. retains biologically meaningful information. Subsequently, the results of the embedding models are visualized for model evaluation and analysis of the extracted underlying features. However, most of the existing visualizations for embeddings have limitations in evaluating the embedding models and understanding the complex simulation data. We propose an interactive visual analytics system for embeddings of MD simulations to not only evaluate and explain an embedding model but also analyze various characteristics of the simulations. Our system enables exploration and discovery of meaningful and semantic embedding results and supports the understanding and evaluation of results by the quantitatively described features of the MD simulations (even without specific labels).

Chae, Junghoon↗
DOE OSTI2023

A Machine Learning–Based Tire Life Prediction Framework for Increasing Life of Commercial Vehicle Tires

In the commercial freight industry, tire retreading decisions are often conservative due to limited knowledge of a tire’s remaining service life. This practice leads to increased costs and material waste. This paper proposes a machine learning–based approach for estimating tire casing life and retreadability, focusing on usage data rather than wear information. This approach could extend the tire’s lifespan and reduce landfill waste. Data integration from diverse tire casing measurement sources presents challenges, including imbalanced removal data. Our methodology addresses these challenges by using historical inspection, telematics, and finite element modeling (FEM) datasets. We introduce “Tire Casing Energy” as a comprehensive usage input and apply a Variance-Reduction Synthetic Minority Oversampling Technique (VR-SMOTE) for data imbalance rectification. A random forest model is used to estimate the state of the tire casing and the casing removal probability, with Bayesian optimization applied for hyperparameter tuning, enhancing model accuracy. Here, the proposed prediction framework is able to differentiate different truck fleets and tire locations based on their usage parameters. With the aid of this machine learning model, the importance and sensitivity of different tire usage parameters can be obtained, which is beneficial to maximize tire life.

Data balancing↗
DOE OSTI2022

Cost function for low-dimensional manifold topology assessment

Abstract In reduced-order modeling, complex systems that exhibit high state-space dimensionality are described and evolved using a small number of parameters. These parameters can be obtained in a data-driven way, where a high-dimensional dataset is projected onto a lower-dimensional basis. A complex system is then restricted to states on a low-dimensional manifold where it can be efficiently modeled. While this approach brings computational benefits, obtaining a good quality of the manifold topology becomes a crucial aspect when models, such as nonlinear regression, are built on top of the manifold. Here, we present a quantitative metric for characterizing manifold topologies. Our metric pays attention to non-uniqueness and spatial gradients in physical quantities of interest, and can be applied to manifolds of arbitrary dimensionality. Using the metric as a cost function in optimization algorithms, we show that optimized low-dimensional projections can be found. We delineate a few applications of the cost function to datasets representing argon plasma, reacting flows and atmospheric pollutant dispersion. We demonstrate how the cost function can assess various dimensionality reduction and manifold learning techniques as well as data preprocessing strategies in their capacity to yield quality low-dimensional projections. We show that improved manifold topologies can facilitate building nonlinear regression models.

42 ENGINEERING↗
DOE OSTI2025

CV4Quantum

CV4Quantum is a statistical technique for reducing the sampling overhead in probabilistic error cancellation, which is an error mitigation technique used in quantum computing. CV4Quantum is based on the control variates method, which is a Monte Carlo variance reduction technique. This repository contains the code and data associated with a demonstration of CV4Quantum using simulation experiments.

Shyamsundar, Prasanth [Fermi National Accelerator ↗
DOE OSTI2021

An integrated manifold learning approach for high-dimensional data feature extractions and its applications to online process monitoring of additive manufacturing

As an effective dimension reduction and feature extraction technique, manifold learning has been successfully applied to high-dimensional data analysis. With the rapid development of sensor technology, a large amount of high-dimensional data such as image streams can be easily available. Thus, a promising application of manifold learning is in the field of sensor signal analysis, particular for the applications of online process monitoring and control using high-dimensional data. The objective of this study is to develop a manifold learning-based feature extraction method for process monitoring of Additive Manufacturing (AM) using online sensor data. Due to the non-parametric nature of most existing manifold learning methods, their performance in terms of computational efficiency, as well as noise resistance has yet to be improved. To address this issue, this study proposes an integrated manifold learning approach termed multi-kernel metric learning embedded isometric feature mapping (MKML-ISOMAP) for dimension reduction and feature extraction of online high-dimensional sensor data such as images. Based on the extracted features with the utilization of supervised classification and regression methods, an online process monitoring methodology for AM is implemented to identify the actual process quality status. Finally, in the numerical simulation and real-world case studies, the proposed method demonstrates excellent performance in both prediction accuracy and computational efficiency.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Manifold Learning-Based Polynomial Chaos Expansions for High-Dimensional Surrogate Models

In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantities of interest of the computational or analytical model. For this purpose, we employ Grassmannian diffusion maps, a two-step nonlinear dimension reduction technique which allows us to reduce the dimensionality of the data and identify meaningful geometric descriptions in a parsimonious and inexpensive manner. Polynomial chaos expansion is then used to construct a mapping between the stochastic input parameters and the diffusion coordinates of the reduced space. An adaptive clustering technique is proposed to identify an optimal number of clusters of points in the latent space. The similarity of points allows us to construct a number of geometric harmonic emulators which are finally utilized as a set of inexpensive pretrained models to perform an inverse map of realizations of latent features to the ambient space and thus perform accurate out-of-sample predictions. Thus, the proposed method acts as an encoder-decoder system which is able to automatically handle very high-dimensional data while simultaneously operating successfully in the small-data regime. The method is demonstrated on two benchmark problems and on a system of advection-diffusion-reaction equations which model a first-order chemical reaction between two species. In all test cases, the proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.

42 ENGINEERING↗
DOE OSTI2022

AMM: Adaptive Multilinear Meshes

Adaptive representations are increasingly indispensable for reducing the in-memory and on-disk footprints of large-scale data. Usual solutions are designed broadly along two themes: reducing data precision, e.g., through compression, or adapting data resolution, e.g., using spatial hierarchies. Additionally, recent research suggests that combining the two approaches, i.e., adapting both resolution and precision simultaneously, can offer significant gains over using them individually. However, there currently exist no practical solutions to creating and evaluating such representations at scale. In this work, we present a new resolution-precision-adaptive representation to support hybrid data reduction schemes and offer an interface to existing tools and algorithms. Through novelties in spatial hierarchy, our representation, Adaptive Multilinear Meshes (AMM), provides considerable reduction in the mesh size. AMM creates a piecewise multilinear representation of uniformly sampled scalar data and can selectively relax or enforce constraints on conformity, continuity, and coverage, delivering a flexible adaptive representation. AMM also supports representing the function using mixed-precision values to further the achievable gains in data reduction. We describe a practical approach to creating AMM incrementally using arbitrary orderings of data and demonstrate AMM on six types of resolution and precision datastreams. By interfacing with state-of-the-art rendering tools through VTK, we demonstrate the practical and computational advantages of our representation for visualization techniques. With an open-source release of our tool to create AMM, we make such evaluation of data reduction accessible to the community, which we hope will foster new opportunities and future data reduction schemes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Radiation dose rate distributions of spent fuel dry casks estimated with MAVRIC based on detailed geometry and continuous-energy models

This study presents a detailed comparison of the dose rate distributions of a dry TN–32 fuel cask with two geometry models and two cross-sectional datasets. The accuracies of radiation dose rate estimation and computational efficiencies of each geometry model with two cross-sectional data-sets are compared. The use of automated variance reduction techniques can significantly improve the computational efficiency of such a realistic, deep penetration problem that involves radiation transport from different volumetric sources, thereby eliciting only a small statistical error. Monaco with Automated Variance Reduction using Importance Calculations (MAVRIC) is a computational sequence within the SCALE 6.2 code package based on consistent adjoint driven importance sampling (CADIS), a type of automated variance reduction technique. Homogenous and full fuel assembly models are built herein, and two nuclear cross-section libraries (V7–200N47G and continuous energy) are applied in this work. Based on the detailed comparisons, we found that neutron dose rate estimation is more dependent on geometry modeling than on cross-section data. For neutron-induced gamma rays, the dose rate distribution depends on both the spatial self-shielding effect and the cross-section library. The primary gamma rays respectively contribute to the total dose rate by ~91% and ~ 99% on side and top surfaces, and the dose rate accuracy is more dependent on the cross-section library than on geometry modeling. In terms of the computation efficiency and efforts spent on geometry modeling, the homogenous fuel assembly model with the MG library can produce an acceptable dose rate distribution, but the detailed fuel assembly model with the continuous-energy library is required for more precise dose rate estimation.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2025

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗
DOE OSTI2016

A Data Mining Approach to Predict In Situ Detoxification Potential of Chlorinated Ethenes

Despite advances in physicochemical remediation technologies, in situ bioremediation treatment based on Dehalococcoides mccartyi (Dhc) reductive dechlorination activity remains a cornerstone approach to remedy sites impacted with chlorinated ethenes. Selecting the best remedial strategy is challenging due to uncertainties and complexity associated with biological and geochemical factors influencing Dhc activity. Guidelines based on measurable biogeochemical parameters have been proposed, but contemporary efforts fall short of meaningfully integrating the available information. Extensive groundwater monitoring data sets have been collected for decades, but have not been systematically analyzed and used for developing tools to guide decision-making. In the present study, geochemical and microbial data sets collected from 35 wells at five contaminated sites were used to demonstrate that a data mining prediction model using the classification and regression tree (CART) algorithm can provide improved predictive understanding of a site’s reductive dechlorination potential. The CART model successfully predicted the 3-month-ahead reductive dechlorination potential with 75.8% and 69.5% true positive rate (i.e., sensitivity) for the training set and the test set, respectively. The machine learning algorithm ranked parameters by relative importance for assessing in situ reductive dechlorination potential. The abundance of Dhc 16S rRNA genes, CH 4 , Fe 2+ , NO 3 – , NO 2 – , and SO 4 2– concentrations, total organic carbon (TOC) amounts, and oxidation–reduction potential (ORP) displayed significant correlations (p < 0.01) with dechlorination potential, with NO 3 – , NO 2 – , and Fe 2+ concentrations exhibiting precedence over other parameters. Contrary to prior efforts, the power of data mining approaches lies in the ability to discern synergetic effects between multiple parameters that affect reductive dechlorination activity. Overall, these findings demonstrate that data mining techniques (e.g., machine learning algorithms) effectively utilize groundwater monitoring data to derive predictive understanding of contaminant degradation, and thus have great potential for improving decision-making tools. Finally, a major need for realizing the predictive capabilities of data mining approaches is a curated, open-access, up-to-date and comprehensive collection of biogeochemical groundwater monitoring data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗