Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling algorithms”

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 433 records · Page 24

FTR for: Reducing plug-load electricity footprint of residential buildings through low-cost, non-intrusive sub-metering and personalized feedback technology

The project started in October 2016 and ended in December 2022. The project's principal goals and achievements were: (i) Measure real and reactive electric power consumption in ~400 apartments in multifamily settings of varying size and vintage and publish the data; data was published according to New York State's recommended 15x15 rule continuously from Jan 2019 through December 2022 (10 second time resolution); with the combination of large number of apartments, real and reactive power, as well as high time resolution (10-seconds), the dataset is first of its kind worldwide; because the dataset New York City apartment consumption pre, during, and post pandemic, it further offers unique insights into changes in residential electricity consumption during lockdowns and after modified work from home schedules. (ii) Measure effectiveness of different feedback types to prompt residents to lower their electricity consumption; achieved 11% (kWh-weighted) reduction versus baseline consumption; confirmed previous studies that social comparisons elicit above average responses; showed, for the first time, that the so called boomerang effect in power consumption feedback projects can be explained by a previously hypothesized norm-conforming "magnet effect" (rather than a non-conforming defiance effect), thus substantially advancing the research in the field. (iii) Disaggregate apartment-level consumption to appliance level; because the hardware for electricity consumption unexpectedly allowed only for 10-second time resolution (rather than the 1-second resolution we had planned on), the disaggregation algorithms we developed on sample data could not be applied to the actual field data we collected. The project has yielded high visibility, with a total of 17 publications, from peer reviewed journals, published data sets (free access), blog posts, NY Times, National Public Radio, and CNN.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Assessing and benchmarking the fidelity of posterior inference methods for astrophysics data analysis

In this era of large and complex astronomical survey data, interpreting, validating, and comparing inference techniques becomes increasingly difficult. This is particularly critical for emerging inference methods like Simulation-Based Inference (SBI), which offer significant speedup potential and posterior modeling flexibility, especially when deep learning is incorporated. We present a study to assess and compare the performance and uncertainty prediction capability of Bayesian inference algorithms – from traditional MCMC sampling of analytic functions to deep learning-enabled SBI. We focus on testing the capacity of hierarchical inference modeling in those scenarios. Before we extend this study to cosmology, we first use astrophysical simulation data to ensure interpretability. We demonstrate a probabilistic programming implementation of hierarchical and non-hierarchical Bayesian inference using simulations derived from the DeepBench software library, a benchmarking tool developed by our group that generates simple and controllable astrophysical objects from first principles. This study will enable astronomers and physicists to harness the inference potential of these methods with confidence.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Smart Vision-Aided RICH (Robotic Interface Control and Handling) System for VULCAN

High-flux neutron beams and high-efficiency detectors enable rapid neutron diffraction measurements at the Engineering Materials Diffractometer (VULCAN) at the Spallation Neutron Source (SNS), Oak Ridge National Laboratory (ORNL). To optimize beam time utilization, efficient sample exchange, alignment, and automated measurements are essential. Recent advances in artificial intelligence (AI) have expanded the capabilities of robotic systems. Here, we report the development of a Robotic Interactive Control and Handling (RICH) system for sample handling at VULCAN, designed to support high-throughput experiments and reduce overhead time. The RICH system employs a six-axis desktop robot integrated with AI-based computer vision models capable of recognizing and localizing samples in real time from instrument and depth-resolving cameras. Vision algorithms combine these detections to align samples with designated measurement positions or place them within complex sample environments such as furnaces. This integration of machine learning-assisted vision with robotic handling demonstrates the feasibility of autonomous sample detection and preparation, offering a pathway toward fully unmanned neutron scattering experiments.

automation↗

Material Science Image Analysis using Quant-CT in ImageJ

We introduce a computational analysis workflow to access properties of solid objects using nondestructive imaging techniques that rely on X-ray imaging. The goal is to process and quantify structures from material science sample cross sections. The algorithms can differentiate the porous media (high density material) from the void (background, low density media) using a Boolean classifier, so that we can extract features, such as volume, surface area, granularity spectrum, porosity, among others. Our workflow, Quant-CT, leverages several algorithms from ImageJ, such as statistical region merging and 3D object counter. It also includes schemes for bilateral filtering that use a 3D kernel, for parallel processing of sub-stacks, and for handling over-segmentation using histogram similarities. The Quant-CT supports fast user interaction, providing the ability for the user to train the algorithm via subsamples to feed its core algorithms with automated parameterization. Quant-CT plugin is currently available for testing by personnel at the Advanced Light Source and Earth Sciences Divisions and Energy Frontier Research Center (EFRC), LBNL, as part of their research on porous materials. The goal is to understand the processes in fluid-rock systems for the geologic sequestration of CO2, and to develop technology for the safe storage of CO2 in deep subsurface rock formations. We describe our implementation, and demonstrate our plugin on porous material images. This paper targets end-users, with relevant information for developers to extend its current capabilities.

97 MATHEMATICS AND COMPUTING↗

High Sensitivity Readout and Data Processing for Environmental Spectral Radiation Measurements

We have developed a new version of high sensitivity electronics front end and analog signal processing for use with high pressure ionization chambers in environmental radiation measurements. The readout circuit provides low noise signal readout from individual events of gas ionization. Readout electronics is connected to the analog-to?digital converter providing continuous high rate data sampling. The data processing algorithm allows noise rejection and extraction of pulse shape and amplitude information related to the ionization loss in the gas for each ionization event. The output of the detector could be presented in a traditional way as the accumulated ionization charge per unit time, and as a signal amplitude spectroscopic distribution. Results of the initial evaluation are presented. These results were obtained using the designed electronics connected to the RSS-1013 Reuter-Stokes high pressure ionization chamber filled with Ar at 25 atm. The HPIC detector was tested using cosmic radiation and several external radiation sources. Combined measurements of total ionization and ionization spectrum in the detector provide a new type of powerful instrument capable of better separation between the natural background radiation and the radiation form external sources, as well as the improved low energy gamma radiation detection.

Popov, Vladimir↗

A generalized polynomial chaos based ensemble Kalman filter with high accuracy

As one of the most adopted sequential data assimilation methods in many areas, especially those involving complex nonlinear dynamics, the ensemble Kalman filter (EnKF) has been under extensive investigation regarding its properties and efficiency. Compared to other variants of the Kalman filter (KF), EnKF is straightforward to implement, as it employs random ensembles to represent solution states. This, however, introduces sampling errors that affect the accuracy of EnKF in a negative manner. Though sampling errors can be easily reduced by using a large number of samples, in practice this is undesirable as each ensemble member is a solution of the system of state equations and can be time consuming to compute for large-scale problems. In this paper we present an efficient EnKF implementation via generalized polynomial chaos (gPC) expansion. The key ingredients of the proposed approach involve (1) solving the system of stochastic state equations via the gPC methodology to gain efficiency; and (2) sampling the gPC approximation of the stochastic solution with an arbitrarily large number of samples, at virtually no additional computational cost, to drastically reduce the sampling errors. The resulting algorithm thus achieves a high accuracy at reduced computational cost, compared to the classical implementations of EnKF. Numerical examples are provided to verify the convergence property and accuracy improvement of the new algorithm. We also prove that for linear systems with Gaussian noise, the first-order gPC Kalman filter method is equivalent to the exact Kalman filter.

97 MATHEMATICS AND COMPUTING↗

Adaptive, Active Learning, and Multifidelity Monte Carlo Methods in the MOOSE Stochastic Tools Module

MOOSE is an open-source computational platform for constructing multi-physics models and executing them in a massively parallel fashion. It has a stochastic tools module (STM) for forward/inverse uncertainty quantification (UQ) and surrogate modeling. This presentation details some recent developments to the STM with respect to the implementation of adaptive, active learning, and multifidelity Monte Carlo methods for forward UQ of computational models. Specifically, the adaptive Monte Carlo methods include Markov Chain Monte Carlo (MCMC)-driven algorithms like adaptive importance sampling and parallelized subset simulation for statistical QoI estimation, rare events analysis, and stochastic gradient-free optimization. The active learning methods include Gaussian Process (GP) surrogates and their training via Adam optimization, design of acquisition functions, and integration with samplers like Monte Carlo, adaptive importance, and parallelized subset simulation. These active learning methods are also designed to work in a batch mode, wherein, the required calls to the full computational model are executed in parallel whenever a user-specified batch size is met. The multifidelity methods in STM are broadly divided into two categories: hierarchical, where a defined hierarchy exists among the low-fidelity models, and peer, where all the low-fidelity models are treated equally. A GP surrogate is used to learn the differences between the low- and high-fidelity models in both multifidelity categories, and acquisition functions from the active learning classes are used to decide whether to rely on a low-fidelity model or call the expensive high-fidelity model. Alongside the software description and usage, applications are also presented to nuclear engineering computational models including a TRISO nuclear fuel particle, a reactor pressure vessel, and a heat-pipe microreactor.

97 MATHEMATICS AND COMPUTING↗

A weighted ℓ{sub 1}-minimization approach for sparse polynomial chaos expansions

This work proposes a method for sparse polynomial chaos (PC) approximation of high-dimensional stochastic functions based on non-adapted random sampling. We modify the standard ℓ{sub 1}-minimization algorithm, originally proposed in the context of compressive sampling, using a priori information about the decay of the PC coefficients, when available, and refer to the resulting algorithm as weightedℓ{sub 1}-minimization. We provide conditions under which we may guarantee recovery using this weighted scheme. Numerical tests are used to compare the weighted and non-weighted methods for the recovery of solutions to two differential equations with high-dimensional random inputs: a boundary value problem with a random elliptic operator and a 2-D thermally driven cavity flow with random boundary condition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A slippery slope: systematic uncertainties in the line width baryonic Tully-Fisher relation

The baryonic Tully–Fisher relation (BTFR) is both a valuable observational tool and a critical test of galaxy formation theory. We explore the systematic uncertainty in the slope and the scatter of the observed line-width BTFR utilizing homogeneously measured, unresolved H i observations for 930 isolated galaxies. We measure a fiducial relation of log{sub 10} M{sub baryon}=3.24 log{sub 10} V{sub rot} + 3.21 with observed scatter of 0.25 dex over a baryonic mass range of 10{sup 7.4} to 10{sup 11.3} M{sub ⊙} where V{sub rot} is measured from 20% H i line widths. We then conservatively vary the definitions of M{sub baryon} and V{sub rot}, the sample definition and the linear fitting algorithm. We obtain slopes ranging from 2.64 to 3.53 and scatter measurements ranging from 0.14 to 0.41 dex, indicating a significant systematic uncertainty of 0.25 in the BTFR slope derived from unresolved H i line widths. We next compare our fiducial slope to literature measurements, where reported slopes range from 3.0 to 4.3 and scatter is either unmeasured, immeasurable, or as large as 0.4 dex. Measurements derived from unresolved H i line widths tend to produce slopes of 3.3, while measurements derived strictly from resolved asymptotic rotation velocities tend to produce slopes of 3.9. The single largest factor affecting the BTFR slope is the definition of rotation velocity. The sample definition, the mass range and the linear fitting algorithm also significantly affect the measured BTFR. We find that galaxies in our sample with V{sub rot}<100 km s{sup −1} are consistent with the line-width BTFR of more massive galaxies, but these galaxies drive most of the observed scatter. It is critical when comparing predictions to an observed BTFR that the rotation velocity definition, the sample selection and the fitting algorithm are similarly defined. We recommend direct statistical comparisons between data sets with commensurable properties as opposed to simply comparing BTFR power-law fits.

79 ASTRONOMY AND ASTROPHYSICS↗

A SPECTROSCOPIC SURVEY OF THE FIELDS OF 28 STRONG GRAVITATIONAL LENSES: THE GROUP CATALOG

With a large, unique spectroscopic survey in the fields of 28 galaxy-scale strong gravitational lenses, we identify groups of galaxies in the 26 adequately sampled fields. Using a group-finding algorithm, we find 210 groups with at least 5 member galaxies; the median number of members is 8. Our sample spans redshifts of 0.04 ≤ z {sub grp} ≤ 0.76 with a median of 0.31, including 174 groups with 0.1 < z {sub grp} < 0.6. The groups have radial velocity dispersions of 60 ≤ σ {sub grp} ≤ 1200 km s{sup −1} with a median of 350 km s{sup −1}. We also discover a supergroup in field B0712+472 at z = 0.29 that consists of three main groups. We recover groups similar to ∼85% of those previously reported in these fields within our redshift range of sensitivity and find 187 new groups with at least five members. The properties of our group catalog, specifically, (1) the distribution of σ {sub grp}, (2) the fraction of all sample galaxies that are group members, and (3) the fraction of groups with significant substructure, are consistent with those for other catalogs. The distribution of group virial masses agrees well with theoretical expectations. Of the lens galaxies, 12 of 26 (46%) (B1422+231, B1600+434, B2114+022, FBQS J0951+2635, HE0435-1223, HST J14113+5211, MG0751+2716, MGJ1654+1346, PG 1115+080, Q ER 0047-2808, RXJ1131-1231, and WFI J2033-4723) are members of groups with at least five galaxies, and one more (B0712+472) belongs to an additional, visually identified group candidate. There are groups not associated with the lens that still are likely to affect the lens model; in six of 25 (24%) fields (excluding the supergroup), there is at least one massive ( σ {sub grp} ≥ 500 km s{sup −1}) group or group candidate projected within 2′ of the lens.

79 ASTRONOMY AND ASTROPHYSICS↗

Energy Storage Sizing and Operation of an Integrated Utility-Scale PV+ESS Power Plant

Integration of an energy storage system (ESS) into a large-scale grid-connected photovoltaic (PV) power plant is highly desirable to improve performance of the system and overcome the stochastic nature of PV power generation. Algorithms to size ESS within an integrated PV and ESS ( PV+ESS) power plant, conventionally, require a large number of high-resolution samples of PV generation. These algorithms are computationally expensive. In this paper, a two-day optimization algorithm that utilizes n-step constant power output dispatch every day from the PV+ESS power plant is proposed to size the ESS. Additionally, an n-step power dispatch every day through the one-year timeframe based optimization of the size of ESS is also performed. The proposed methods are computationally cheaper and provide acceptable accuracy with respect to the conventional sizing methods. The economics identified from the proposed methods are compared with the typical day-ahead hourly dispatch-based power production from the PV+ESS power plant. This comparison has shown similar economic performance showcasing the accuracy of the proposed methods in sizing the ESS. It also shows the potential for operating PV+ESS power plant in n-step constant power generation mode.

Xia, Qian↗

Sampling strategies for subsampled segmented EPI PRF thermometry in MR guided high intensity focused ultrasound

Purpose: To investigate k-space subsampling strategies to achieve fast, large field-of-view (FOV) temperature monitoring using segmented echo planar imaging (EPI) proton resonance frequency shift thermometry for MR guided high intensity focused ultrasound (MRgHIFU) applications. Methods: Five different k-space sampling approaches were investigated, varying sample spacing (equally vs nonequally spaced within the echo train), sampling density (variable sampling density in zero, one, and two dimensions), and utilizing sequential or centric sampling. Three of the schemes utilized sequential sampling with the sampling density varied in zero, one, and two dimensions, to investigate sampling the k-space center more frequently. Two of the schemes utilized centric sampling to acquire the k-space center with a longer echo time for improved phase measurements, and vary the sampling density in zero and two dimensions, respectively. Phantom experiments and a theoretical point spread function analysis were performed to investigate their performance. Variable density sampling in zero and two dimensions was also implemented in a non-EPI GRE pulse sequence for comparison. All subsampled data were reconstructed with a previously described temporally constrained reconstruction (TCR) algorithm. Results: The accuracy of each sampling strategy in measuring the temperature rise in the HIFU focal spot was measured in terms of the root-mean-square-error (RMSE) compared to fully sampled “truth.” For the schemes utilizing sequential sampling, the accuracy was found to improve with the dimensionality of the variable density sampling, giving values of 0.65 °C, 0.49 °C, and 0.35 °C for density variation in zero, one, and two dimensions, respectively. The schemes utilizing centric sampling were found to underestimate the temperature rise, with RMSE values of 1.05 °C and 1.31 °C, for variable density sampling in zero and two dimensions, respectively. Similar subsampling schemes with variable density sampling implemented in zero and two dimensions in a non-EPI GRE pulse sequence both resulted in accurate temperature measurements (RMSE of 0.70 °C and 0.63 °C, respectively). With sequential sampling in the described EPI implementation, temperature monitoring over a 192 × 144 × 135 mm{sup 3} FOV with a temporal resolution of 3.6 s was achieved, while keeping the RMSE compared to fully sampled “truth” below 0.35 °C. Conclusions: When segmented EPI readouts are used in conjunction with k-space subsampling for MR thermometry applications, sampling schemes with sequential sampling, with or without variable density sampling, obtain accurate phase and temperature measurements when using a TCR reconstruction algorithm. Improved temperature measurement accuracy can be achieved with variable density sampling. Centric sampling leads to phase bias, resulting in temperature underestimations.

42 ENGINEERING↗

Noise Reduction with Microphone Arrays for Speaker Identification

Reducing acoustic noise in audio recordings is an ongoing problem that plagues many applications. This noise is hard to reduce because of interfering sources and non-stationary behavior of the overall background noise. Many single channel noise reduction algorithms exist but are limited in that the more the noise is reduced; the more the signal of interest is distorted due to the fact that the signal and noise overlap in frequency. Specifically acoustic background noise causes problems in the area of speaker identification. Recording a speaker in the presence of acoustic noise ultimately limits the performance and confidence of speaker identification algorithms. In situations where it is impossible to control the environment where the speech sample is taken, noise reduction filtering algorithms need to be developed to clean the recorded speech of background noise. Because single channel noise reduction algorithms would distort the speech signal, the overall challenge of this project was to see if spatial information provided by microphone arrays could be exploited to aid in speaker identification. The goals are: (1) Test the feasibility of using microphone arrays to reduce background noise in speech recordings; (2) Characterize and compare different multichannel noise reduction algorithms; (3) Provide recommendations for using these multichannel algorithms; and (4) Ultimately answer the question - Can the use of microphone arrays aid in speaker identification?

42 ENGINEERING↗

Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs

In this work, we consider Benders decomposition for solving two-stage stochastic programs with complete recourse based on finite samples of the uncertain parameters. We define the Benders cuts binding at the final optimal solution or the ones significantly improving bounds over iterations as valuable cuts. We propose a learning-enhanced Benders decomposition (LearnBD) algorithm, which adds a cut classification step in each iteration to selectively generate cuts that are more likely to be valuable cuts. The LearnBD algorithm includes two phases: (i) sampling cuts and collecting information from training problems and (ii) solving testing problems with a support vector machine (SVM) cut classifier. We run the LearnBD algorithm on instances of capacitated facility location and multicommodity network design under uncertain demand. Our results show that SVM cut classifier works effectively for identifying valuable cuts, and the LearnBD algorithm reduces the total solving time of all instances for different problems with various sizes and complexities.

97 MATHEMATICS AND COMPUTING↗

A Christoffel function weighted least squares algorithm for collocation approximations

Here, we propose, theoretically investigate, and numerically validate an algorithm for the Monte Carlo solution of least-squares polynomial approximation problems in a collocation framework. Our investigation is motivated by applications in the collocation approximation of parametric functions, which frequently entails construction of surrogates via orthogonal polynomials. A standard Monte Carlo approach would draw samples according to the density defining the orthogonal polynomial family. Our proposed algorithm instead samples with respect to the (weighted) pluripotential equilibrium measure of the domain, and subsequently solves a weighted least-squares problem, with weights given by evaluations of the Christoffel function. We present theoretical analysis to motivate the algorithm, and numerical results that show our method is superior to standard Monte Carlo methods in many situations of interest.

97 MATHEMATICS AND COMPUTING↗

Structure–activity relationship-based chemical classification of highly imbalanced Tox21 datasets

Abstract The specificity of toxicant-target biomolecule interactions lends to the very imbalanced nature of many toxicity datasets, causing poor performance in Structure–Activity Relationship (SAR)-based chemical classification. Undersampling and oversampling are representative techniques for handling such an imbalance challenge. However, removing inactive chemical compound instances from the majority class using an undersampling technique can result in information loss, whereas increasing active toxicant instances in the minority class by interpolation tends to introduce artificial minority instances that often cross into the majority class space, giving rise to class overlapping and a higher false prediction rate. In this study, in order to improve the prediction accuracy of imbalanced learning, we employed SMOTEENN, a combination of Synthetic Minority Over-sampling Technique (SMOTE) and Edited Nearest Neighbor (ENN) algorithms, to oversample the minority class by creating synthetic samples, followed by cleaning the mislabeled instances. We chose the highly imbalanced Tox21 dataset, which consisted of 12 in vitro bioassays for > 10,000 chemicals that were distributed unevenly between binary classes. With Random Forest (RF) as the base classifier and bagging as the ensemble strategy, we applied four hybrid learning methods, i.e., RF without imbalance handling (RF), RF with Random Undersampling (RUS), RF with SMOTE (SMO), and RF with SMOTEENN (SMN). The performance of the four learning methods was compared using nine evaluation metrics, among which F 1 score, Matthews correlation coefficient and Brier score provided a more consistent assessment of the overall performance across the 12 datasets. The Friedman’s aligned ranks test and the subsequent Bergmann-Hommel post hoc test showed that SMN significantly outperformed the other three methods. We also found that a strong negative correlation existed between the prediction accuracy and the imbalance ratio (IR), which is defined as the number of inactive compounds divided by the number of active compounds. SMN became less effective when IR exceeded a certain threshold (e.g., > 28). The ability to separate the few active compounds from the vast amounts of inactive ones is of great importance in computational toxicology. This work demonstrates that the performance of SAR-based, imbalanced chemical toxicity classification can be significantly improved through the use of data rebalancing.

Idakwo, Gabriel↗