Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data reduction methods”

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 631 records · Page 35

OPTIMAL STRATEGIES FOR CONTINUOUS GRAVITATIONAL WAVE DETECTION IN PULSAR TIMING ARRAYS

Supermassive black hole binaries (SMBHBs) are expected to emit a continuous gravitational wave signal in the pulsar timing array (PTA) frequency band (10{sup -9} to 10{sup -7} Hz). The development of data analysis techniques aimed at efficient detection and characterization of these signals is critical to the gravitational wave detection effort. In this paper, we leverage methods developed for LIGO continuous wave gravitational searches and explore the use of the F-statistic for such searches in pulsar timing data. Babak and Sesana have used this approach in the context of PTAs to show that one can resolve multiple SMBHB sources in the sky. Our work improves on several aspects of prior continuous wave search methods developed for PTA data analysis. The algorithm is implemented fully in the time domain, which naturally deals with the irregular sampling typical of PTA data and avoids spectral leakage problems associated with frequency domain methods. We take into account the fitting of the timing model and have generalized our approach to deal with both correlated and uncorrelated colored noise sources. We also develop an incoherent detection statistic that maximizes over all pulsar-dependent contributions to the likelihood. To test the effectiveness and sensitivity of our detection statistics, we perform a number of Monte Carlo simulations. We produce sensitivity curves for PTAs of various configurations and outline an implementation of a fully functional data analysis pipeline. Finally, we present a derivation of the likelihood maximized over the gravitational wave phases at the pulsar locations, which results in a vast reduction of the search parameter space.

79 ASTRONOMY AND ASTROPHYSICS↗

Decision Science for Machine Learning (DeSciML)

The increasing use of machine learning (ML) models to support high-consequence decision making drives a need to increase the rigor of ML-based decision making. Critical problems ranging from climate change to nonproliferation monitoring rely on machine learning for aspects of their analyses. Likewise, future technologies, such as incorporation of data-driven methods into the stockpile surveillance and predictive failure analysis for weapons components, will all rely on decision-making that incorporates the output of machine learning models. In this project, our main focus was the development of decision scientific methods that combine uncertainty estimates for machine learning predictions, with a domain-specific model of error costs. Other focus areas include uncertainty measurement in ML predictions, designing decision rules using multiobjecive optimization, the value of uncertainty reduction, and decision-tailored uncertainty quantification for probability estimates. By laying foundations for rigorous decision making based on the predictions of machine learning models, these approaches are directly relevant to every national security mission that applies, or will apply, machine learning to data, most of which entail some decision context.

97 MATHEMATICS AND COMPUTING↗

A differentiable approach to the maximum independent set problem using dataless neural networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. Here, in this paper, we propose a different approach in that no data is required for training the neural networks that produce the solution. In this sense, what we present is not a machine learning solution, but rather one that is dependent on neural networks and where backpropagation is applied to a loss function defined by the structure of the neural network architecture as opposed to a training dataset. In particular, we reduce the popular combinatorial optimization problem of finding a maximum independent set to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. Additionally, we propose a universal graph reduction procedure to handle large-scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental results on both real and synthetic graphs demonstrate that our proposed method performs on par or outperforms state-of-the-art learning-based methods in terms of the size of the found set without requiring any training data.

97 MATHEMATICS AND COMPUTING↗

Scale effects on core design, fuel costs, and spent fuel volume of pressurized water reactors

The desire to improve the economic competitiveness and deployment pace of nuclear energy through modularization, manufacturing, and series production had led to the development of smaller size reactors. As the standard 17x17 fuel technology is mainly maintained in the pressurized water reactors (PWRs) category, this translates into a lower number of fuel assemblies in the core and sometimes a reduced fuel height. To assess the impact of such scale change in core design on fuel cycle cost and spent fuel volume, a scoping analysis tool is developed based on infinite lattice calculations, leakage, fuel management reduced models, and levelized unit cost of electricity (LCOE) estimate. As such, cost dynamics driven by fuel specific power, burnup, core leakage, feed, cycle length, fuel assembly height as well as uranium market data are captured with consistent set of assumptions and analysis methods. A selection of 5 reactor designs representative of leading PWR developers is assessed and compared. Pursuing higher specific powers and optimal burnups are highlighted as the main fuel cost reduction drivers, nevertheless, practical limitations and opportunities must be evaluated to establish the feasibility of such enhanced fuel operation. In consequence, a detailed core design is performed using SIMULATE3 code for 5 PWR variations including natural and forced coolant circulation modes, two reactor scales, power densities of 73, 112, and 123 kW/l and higher discharge burnups. Design and optimization are performed at the lattice level, for the reflector, and at the core loading level. Satisfactory steady-state operation including power distribution, coolant operating limits, and reactivity requirements are analyzed and reported in this paper. The fuel economics of the detailed core designs confirm the scoping analysis findings. Despite the unlocked power uprates in small PWRs, the achievable burnup for a given fuel specific power requires more enrichment and shorter fuel height results in higher fabrication costs per mass of fuel, which makes scaling down core size a more expensive endeavor on the fuel cycle front. Spent fuel volumes are reported for the PWRs designed in this paper. Furthermore, these volumes are driven by the core average discharge burnup regardless of the scale in consideration. Additional cost and core performance aspects related to heavy reflector gains, fuel-reflector substitution, and disposal cost policy in the U.S. are examined.

42 ENGINEERING↗

Projection pursuit adaptation on polynomial chaos expansions

Here, the present work addresses the issue of accurate stochastic approximations in high-dimensional parametric space using tools from uncertainty quantification (UQ). The basis adaptation method and its accelerated algorithm in polynomial chaos expansions (PCE) were recently proposed to construct low-dimensional approximations adapted to specific quantities of interest (QoI). The present paper addresses one difficulty with these adaptations, namely their reliance on quadrature point sampling, which limits the reusability of potentially expensive samples. Projection pursuit (PP) is a statistical tool to find the “interesting” projections in high-dimensional data and thus bypass the curse-of-dimensionality. In the present work, we combine the fundamental ideas of basis adaptation and projection pursuit regression (PPR) to propose a novel method to simultaneously learn the optimal low-dimensional spaces and PCE representation from given data. While this projection pursuit adaptation (PPA) can be entirely data-driven, the constructed approximation exhibits mean-square convergence to the solution of an underlying governing equation and thus captures the supports and probability distributions associated with the physics constraints. The proposed approach is demonstrated on a borehole problem and a structural dynamics problem, demonstrating the versatility of the method and its ability to discover low-dimensional manifolds with high accuracy with limited data. In addition, the method can learn surrogate models for different quantities of interest while reusing the same data set.

97 MATHEMATICS AND COMPUTING↗

Reduced-basis method for few-body bound-state emulation

Recent advances in both theoretical and computational methods have enabled large-scale, precision calculations of the properties of atomic nuclei. With the growing complexity of modern nuclear theory, however, also comes the need for novel methods to perform systematic studies and quantify the uncertainties of models when confronted with experimental data. Here, this study presents an application of such an approach, the reduced basis method, to substantially lower computational costs by constructing a significantly smaller Hamiltonian subspace informed by previous solutions. Our method shows comparable efficiency and accuracy to other dimensionality reduction techniques on an artificial three-body bound system while providing a richer representation of physical information in its projection and training subspace. This methodological advancement can be applied in other contexts and has the potential to greatly improve our ability to systematically explore theoretical models and thus enhance our understanding of the fundamental properties of nuclear systems.

cluster models↗

PMDT: AI-Enabled Predictive Maintenance Digital Twins for Advanced Nuclear Reactors

Our team made substantial technical progress on various fronts during the course of the program. Multiple milestones were geared towards demonstrating the feasibility of machine learning based predictive maintenance digital twins towards reducing O&M costs, whereas some other milestones actually focused on identifying technical gaps and developing technologies such as humble AI to provide necessary robustness to the ML-based models. We were able to demonstrate in many cases that Machine learning-based methods can be successfully adapted for Nuclear plant environments especially for remote monitoring applications. Detailed analyses were carried out with plant and full scope simulation data along with capabilities of enhanced analytics to assess and set realistic expectations on cost reductions in O&M. These assessments are paving the way for investments towards reactor design improvements as well project planning for SMR projects as they develop and mature in the next few years. Technology developed under this program got direct visibility to GE Hitachi and their utility customers and resulted in positive intents to deploy some of the elements from design phase. The project additionally resulted in several reports, publications, software and data generation that will be useful in deployment and O&M services for BWRX300 fleets.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

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↗

NEW TECHNIQUES FOR HIGH-CONTRAST IMAGING WITH ADI: THE ACORNS-ADI SEEDS DATA REDUCTION PIPELINE

We describe Algorithms for Calibration, Optimized Registration, and Nulling the Star in Angular Differential Imaging (ACORNS-ADI), a new, parallelized software package to reduce high-contrast imaging data, and its application to data from the SEEDS survey. We implement several new algorithms, including a method to register saturated images, a trimmed mean for combining an image sequence that reduces noise by up to {approx}20%, and a robust and computationally fast method to compute the sensitivity of a high-contrast observation everywhere on the field of view without introducing artificial sources. We also include a description of image processing steps to remove electronic artifacts specific to Hawaii2-RG detectors like the one used for SEEDS, and a detailed analysis of the Locally Optimized Combination of Images (LOCI) algorithm commonly used to reduce high-contrast imaging data. ACORNS-ADI is written in python. It is efficient and open-source, and includes several optional features which may improve performance on data from other instruments. ACORNS-ADI requires minimal modification to reduce data from instruments other than HiCIAO. It is freely available for download at www.github.com/t-brandt/acorns-adi under a Berkeley Software Distribution (BSD) license.

79 ASTRONOMY AND ASTROPHYSICS↗

Machine Learning for Memory Reduction in the Implicit Monte Carlo Simulations of Thermal Radiative Transfer [Slides]

Project Goal: Use parametric Machine Learning methods in order to reduce memory requirements at checkpointing & restarting in the IMC simulations of Thermal Radiative Transfer using: Expectation Maximization and Weighted Gaussian Mixture Model-based approach for `particle-data compression', introduced in Plasma Physics to model Maxwellian particle distributions by Luis Chacon and Guangye Chen; Expectation Maximization with Weighted Hyper-Erlang Model in order to compress isotropic IMC particle data in the frequency domain; and Expectation Maximization and von Mises-Fisher Mixture Model for compression of anisotropic IMC particle data in the angular domain (work-in-progress).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Salt-stone Oxidation Study: Leaching Method - 13092

Cementitious waste forms can be designed to chemically stabilize selected contaminants, such as Tc{sup +7} and Cr{sup +6}, by chemically reduction to lower valance states, Tc{sup +4} and Cr{sup +3}, respectively, and precipitation of these species in alkaline media as low solubility solid phases. Data for oxidation of this type of cementitious waste form cured under field conditions as a function of time is required for predicting the performance of the waste form and disposal facility. The rate of oxidation (oxidation front advancement) is an important parameter for predicting performance because the solubilities of some radionuclide contaminants, e.g., technetium, are a function of the oxidation state. A non-radioactive experiment was designed for quantifying the oxidation front advancement using chromium, as an approximate redox-sensitive surrogate (Cr{sup +6} / Cr{sup +3}) for technetium (Tc{sup +7} / Tc{sup +4}). Nonradioactive cementitious waste forms were prepared in the laboratory and cured under both laboratory and 'field conditions'. Laboratory conditions were ambient temperature and sealed sample containers. Field conditions were approximated by curing samples in open containers which were placed inside a plastic container stored outdoors at SRS. The container had a lid and was instrumented with temperature and humidity probes. Sub-samples as thin as 0.2 mm were taken as a function of distance from the exposed surface of the as-cast sample. The sub-samples were leached and the leachates were analyzed for chromium, nitrate, nitrite and sodium. Nitrate, nitrite, and sodium concentrations were used to provide baseline data because these species are not chemically retained in the waste form matrix to any significant extent and are not redox sensitive. 'Effective' oxidation fronts for Cr were measured for samples containing 1000, 500 and 20 mg/kg Cr added as soluble sodium chromate, Na{sub 2}CrO{sub 4}. For a sample cured for 129 days under field conditions, leachable Cr (assumed to be the oxidized form, i.e., Cr{sup +6} was detected in the top 15 to 20 mm of the sample spiked with 1000 mg/kg Cr. Below about 20 mm, the Cr concentrations in leachates were below the detection limit (< 0.010 mg/L) which indicates that the oxidation as the result of exposure to air was limited to the top 20 mm of the sample after exposure for 129 days and that the bulk of the waste form was not affected, i.e., the Cr was stabilized and insoluble. For samples cured in the laboratory, leachable Cr was detected in the top 8 mm of the Cr 1000 sample cured in the laboratory for 37 days. Between 8 and 14 mm, the concentration Cr in the leachate dropped by a factor of about 20 to just above the detection limit. These depth of penetration results indicate that the rate of advancement of the oxidation front for samples spiked with 1000 mg/kg Cr cured under 'field conditions' for 129 days is less than that for the sample cured in the laboratory for 37 days, i.e., 0.156 and 0.216 mm/day, respectively. Additional data are presented for samples spiked with 500 and 20 mg/kg Cr. In summary, cementitious waste forms are porous solids with a network of interconnected pores ranging in diameter from 10 E-10 m to greater than a few mm. The oxidation process is assumed to occur as the result of oxygen transport through the interconnected porosity which may be filled with air, aqueous salt solution, or both. Upon oxidation, the Cr becomes soluble and can be transported in solution through aqueous pore fluid or leachate. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Reducing Interanalyst Variability in Photovoltaic Degradation Rate Assessments

The economic return on investment of a commercial photovoltaic system depends greatly on its performance over the long term and, hence, its degradation rate. Many methods have been proposed for assessing system degradation rates from outdoor performance data. However, comparing reported values from one analyst and research group to another requires a common baseline of performance; consistency between methods and analysts can be a challenge. An interlaboratory study was conducted involving different volunteer analysts reporting on the same photovoltaic performance data using different methodologies. Initial variability of the reported degradation rates was so high that analysts could not come to a consensus whether a system degraded or not. More consistent values are received when written guidance is provided to each analyst. Further improvements in analyst variance was accomplished by using the free open-source software RdTools, allowing a reduction in variance between analysts by more than two orders of magnitude over the first round, where multiple analysis methods are allowed. This article highlights many pitfalls in conducting 'routine' degradation analysis, and it addresses some of the factors that must be considered when comparing degradation results reported by different analysts or methods.

14 SOLAR ENERGY↗

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↗

Robust primary modulation-based scatter estimation for cone-beam CT

Purpose: Scattered radiation is one of the major problems facing image quality in flat detector cone-beam computed tomography (CBCT). Previously, a new scatter estimation and correction method using primary beam modulation has been proposed. The original image processing technique used a frequency-domain-based analysis, which proved to be sensitive to the accuracy of the modulator pattern both spatially and in amplitude as well as to the frequency of the modulation pattern. In addition, it cannot account for penumbra effects that occur, for example, due to the finite focal spot size and the scatter estimate can be degraded by high-frequency components of the primary image. Methods: In this paper, the authors present a new way to estimate the scatter using primary modulation. It is less sensitive to modulator nonidealities and most importantly can handle arbitrary modulator shapes and changes in modulator attenuation. The main idea is that the scatter estimation can be expressed as an optimization problem, which yields a separation of the scatter and the primary image. The method is evaluated using simulated and experimental CBCT data. The scattering properties of the modulator itself are analyzed using a Monte Carlo simulation. Results: All reconstructions show strong improvements of image quality. To quantify the results, all images are compared to reference images (ideal simulations and collimated scans). Conclusions: The proposed modulator-based scatter reduction algorithm may open the field of flat detector-based imaging to become a quantitative modality. This may have significant impact on C-arm imaging and on image-guided radiation therapy.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Model-based iterative reconstruction with adaptive regularization for artifact reduction in electron tomography

Obtaining high-quality 3D reconstructions from electron tomography of crystalline particles embedded in lighter support elements is crucial for various material systems such as catalysts for fuel cell applications. However, significant challenges arise due to the limited tilt range, sparse and low signal-to-noise ratio of the measurements. In addition, small metal particles can cause strong streaking and shading artifacts in the 3D reconstructions when using conventional reconstruction algorithms due to the presence of Bragg diffraction and the large scattering cross-section difference between the materials of the particles and the background support regions. These artifacts lead to errors in the downstream characterization affecting extraction of critical features such as the size of the metal particles, their distribution and the volume of the lighter support regions. In this paper, we present a two-stage algorithm based on metal artifact reduction, utilizing model-based iterative reconstruction methods with adaptive adjustment of regularization parameters. Our approach yields high-quality 3D reconstructions compared to traditional algorithms, accurately capturing both the metal particles as well as the background support. We demonstrate the effectiveness of our algorithm through simulated and experimental bright-field electron tomography data, showing significant improvements in reconstruction quality compared to traditional methods.

97 MATHEMATICS AND COMPUTING↗

A set of parallel, implicit methods for a reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids

A set of implicit methods are proposed for a third-order hierarchical WENO reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids. An attractive feature in these methods are the application of the Jacobian matrix based on the P1 element approximation, resulting in a huge reduction of memory requirement compared with DG (P2). Also, three approaches -- analytical derivation, divided differencing, and automatic differentiation (AD) are presented to construct the Jacobian matrix respectively, where the AD approach shows the best robustness. A variety of compressible flow problems are computed to demonstrate the fast convergence property of the implemented flow solver. Furthermore, an SPMD (single program, multiple data) programming paradigm based on MPI is proposed to achieve parallelism. The numerical results on complex geometries indicate that this low-storage implicit method can provide a viable and attractive DG solution for complicated flows of practical importance.

97 MATHEMATICS AND COMPUTING↗

“Best” Iterative Coupled-Cluster Triples Model? More Evidence for 3CC

To follow up on the unexpectedly good performance of several coupled-cluster models with approximate inclusion of 3-body clusters we performed a more complete assessment of the 3CC method for accurate computational thermochemistry in the standard HEAT framework. New spin-integrated implementation of the 3CC method applicable to closed- and open-shell systems utilizes a new automated toolchain for derivation, optimization, and evaluation of operator algebra in many-body electronic structure. We found that with a double-ζ basis set the 3CC correlation energies and their atomization energy contributions are almost always more accurate (with respect to the CCSDTQ reference) than the CCSDT model as well as the standard CCSD(T) model. The mean absolute errors in cc-pVDZ {3CC, CCSDT, and CCSD(T)} electronic (per valence electron) and atomization energies relative to the CCSDTQ reference for the HEAT data set, were {24, 70, 122} μE h /e and {0.46, 2.00, 2.58} kJ/mol, respectively. The mean absolute errors in the complete-basis-set limit {3CC, CCSDT, and CCSD(T)} atomization energies relative to the HEAT model reference, were {0.52, 2.00, and 1.07} kJ/mol, The significant and systematic reduction of the error by the 3CC method and its lower cost than CCSDT suggests it as a viable candidate for post- CCSD(T) thermochemistry applications, as well as the preferred alternative to CCSDT in general.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A flexible class of priors for orthonormal matrices with basis function-specific structure

Statistical modeling of high-dimensional matrix-valued data motivates the use of a low-rank representation that simultaneously summarizes key characteristics of the data and enables dimension reduction. Low-rank representations commonly factor the original data into the product of orthonormal basis functions and weights, where each basis function represents an independent feature of the data. However, the basis functions in these factorizations are typically computed using algorithmic methods that cannot quantify uncertainty or account for basis function correlation structure a priori. While there exist Bayesian methods that allow for a common correlation structure across basis functions, empirical examples motivate the need for basis function-specific dependence structure. We propose a prior distribution for orthonormal matrices that can explicitly model basis function-specific structure. The prior is used within a general probabilistic model for singular value decomposition to conduct posterior inference on the basis functions while accounting for measurement error and fixed effects. We discuss how the prior specification can be used for various scenarios and demonstrate favorable model properties through synthetic data examples. Finally, we apply our method to two-meter air temperature data from the Pacific Northwest, enhancing our understanding of the Earth system’s internal variability.

97 MATHEMATICS AND COMPUTING↗