Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Randomized 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 1,027 records · Page 57

Time-series machine-learning error models for approximate solutions to parameterized dynamical systems

This work proposes a machine-learning framework for modeling the error incurred by approximate solutions to parameterized dynamical systems. In particular, we extend the machine-learning error models (MLEM) framework proposed in Ref. Freno and Carlberg (2019) to dynamical systems. The proposed Time-Series Machine-Learning Error Modeling (T-MLEM) method constructs a regression model that maps features – which comprise error indicators that are derived from standard a posteriori error-quantification techniques – to a random variable for the approximate-solution error at each time instance. The proposed framework considers a wide range of candidate features, regression methods, and additive noise models. We consider primarily recursive regression techniques developed for time-series modeling, including both classical time-series models (e.g., autoregressive models) and recurrent neural networks (RNNs), but also analyze standard non-recursive regression techniques (e.g., feed-forward neural networks) for comparative purposes. Finally, numerical experiments conducted on multiple benchmark problems illustrate that the long short-term memory (LSTM) neural network, which is a type of RNN, outperforms other methods and yields substantial improvements in error predictions over traditional approaches.

42 ENGINEERING↗

A Comparison of Two Balance Calibration Model Building Methods

Simulated strain-gage balance calibration data is used to compare the accuracy of two balance calibration model building methods for different noise environments and calibration experiment designs. The first building method obtains a math model for the analysis of balance calibration data after applying a candidate math model search algorithm to the calibration data set. The second building method uses stepwise regression analysis in order to construct a model for the analysis. Four balance calibration data sets were simulated in order to compare the accuracy of the two math model building methods. The simulated data sets were prepared using the traditional One Factor At a Time (OFAT) technique and the Modern Design of Experiments (MDOE) approach. Random and systematic errors were introduced in the simulated calibration data sets in order to study their influence on the math model building methods. Residuals of the fitted calibration responses and other statistical metrics were compared in order to evaluate the calibration models developed with different combinations of noise environment, experiment design, and model building method. Overall, predicted math models and residuals of both math model building methods show very good agreement. Significant differences in model quality were attributable to noise environment, experiment design, and their interaction. Generally, the addition of systematic error significantly degraded the quality of calibration models developed from OFAT data by either method, but MDOE experiment designs were more robust with respect to the introduction of a systematic component of the unexplained variance.

DeLoach, Richard↗

Robust PCA-Deep Belief Network Surrogate Model for Distribution System Topology Identification with DERs

With the expansion of distribution networks and increased penetration of distributed energy resources (DERs), it is becoming increasingly important to obtain accurate distribution network topology in real-time. In this paper, a robust principal component analysis coupled deep belief network (PCA-DBN) surrogate model is proposed for distribution system topology identification. It integrates the benefits of robust feature extraction from PCA to deal with data quality issues and filter out noise, and the strength of DBN in capturing the nonlinear relationship between voltage amplitudes and the binary states of switchable connections. This also significantly reduces the DBN training complexity without loss of accuracy. It is shown that the widely used standard deviation of voltage drop and the voltage covariance matrix features yield less accuracy as compared to that of the voltage amplitudes in presence of high penetration of DERs and ZIP loads. Comparison results with other alternatives, such as the random forest (RF), multi-output regression (MOR) and the traditional DBN methods demonstrate that the proposed method can achieve a much higher topology identification accuracy while maintaining robustness to missing data and measurement noise under various penetration levels of DERs.

deep belief network↗

Detecting and tracking drift in quantum information processors

Abstract If quantum information processors are to fulfill their potential, the diverse errors that affect them must be understood and suppressed. But errors typically fluctuate over time, and the most widely used tools for characterizing them assume static error modes and rates. This mismatch can cause unheralded failures, misidentified error modes, and wasted experimental effort. Here, we demonstrate a spectral analysis technique for resolving time dependence in quantum processors. Our method is fast, simple, and statistically sound. It can be applied to time-series data from any quantum processor experiment. We use data from simulations and trapped-ion qubit experiments to show how our method can resolve time dependence when applied to popular characterization protocols, including randomized benchmarking, gate set tomography, and Ramsey spectroscopy. In the experiments, we detect instability and localize its source, implement drift control techniques to compensate for this instability, and then demonstrate that the instability has been suppressed.

97 MATHEMATICS AND COMPUTING↗

Vectorization techniques for probability distribution functions using VecCore

Probability distribution functions (PDFs) are very used in modeling random processes and physics simulations. Improving the performance of algorithms that generate many random numbers under complex PDFs is often a very challenging task when methods as direct functions are not available. In this work we present general strategies on how to vectorize some PDFs using VecCore library. We show the results for the Exponential, Gaussian, discrete Poisson and Gamma probability distributions.

Chaparro Amaro, Oscar R.↗

Simulations of classical three-body thermalization in one dimension

One-dimensional systems, such as nanowires or electrons moving along strong magnetic field lines, have peculiar thermalization physics. The binary collision of pointlike particles, typically the dominant process for reaching thermal equilibrium in higher-dimensional systems, cannot thermalize a 1D system. We study how dilute classical 1D gases thermalize through three-body collisions. We consider a system of identical classical point particles with pairwise repulsive inverse power-law potential V ij ∝ 1/|x i –x j | n or the pairwise Lennard-Jones potential. Using Monte Carlo methods, we compute a collision kernel and use it in the Boltzmann equation to evolve a perturbed thermal state with temperature T toward equilibrium. We explain the shape of the kernel and its dependence on the system parameters. Additionally, we implement molecular dynamics simulations of a many-body gas and show agreement with the Boltzmann evolution in the low-density limit. For the inverse power-law potential, the rate of thermalization is proportional to ρ 2 ⁢T$\frac{1}{2}$ – $\frac{1}{n}$, where ρ is the number density. Furthermore, the corresponding proportionality constant decreases with increasing n.

1-dimensional systems↗

Machine Learning Approach for Spatiotemporal Multivariate Optimization of Environmental Monitoring Sensor Locations

Abstract Long-term environmental monitoring is critical for managing the soil and groundwater at contaminated sites. Recent improvements in state-of-the-art sensor technology, communication networks, and artificial intelligence have created opportunities to modernize this monitoring activity for automated, fast, robust, and predictive monitoring. In such modernization, it is required that sensor locations be optimized to capture the spatiotemporal dynamics of all monitoring variables as well as to make it cost-effective. The legacy monitoring datasets of the target area are important to perform this optimization. In this study, we have developed a machine-learning approach to optimize sensor locations for soil and groundwater monitoring based on ensemble supervised learning and majority voting. For spatial optimization, Gaussian process regression (GPR) is used for spatial interpolation, while the majority voting is applied to accommodate the multivariate temporal dimension. Results show that the algorithms significantly outperform the random selection of the sensor locations for predictive spatiotemporal interpolation. While the method has been applied to a four-dimensional dataset (with two-dimensional space, time, and multiple contaminants), we anticipate that it can be generalizable to higher-dimensional datasets for environmental monitoring sensor location optimization.

Siddiquee, Masudur R.↗

Questionable Benchmarks [Slides]

An investigation and initial review of ‘questionable benchmarks’ was performed at LANL. Multiple methods were used, including machine learning techniques, to identify 'questionable benchmarks' and/or benchmarks with low uncertainties. Those benchmarks were then reviewed for obvious errors. This is not a recommendation to ICSBEP, but can be used as a starting point for a more comprehensive review. A journal paper is being written on this work.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The LSST AGN Data Challenge: Selection Methods

Abstract Development of the Rubin Observatory Legacy Survey of Space and Time (LSST) includes a series of Data Challenges (DCs) arranged by various LSST Scientific Collaborations that are taking place during the project's preoperational phase. The AGN Science Collaboration Data Challenge (AGNSC-DC) is a partial prototype of the expected LSST data on active galactic nuclei (AGNs), aimed at validating machine learning approaches for AGN selection and characterization in large surveys like LSST. The AGNSC-DC took place in 2021, focusing on accuracy, robustness, and scalability. The training and the blinded data sets were constructed to mimic the future LSST release catalogs using the data from the Sloan Digital Sky Survey Stripe 82 region and the XMM-Newton Large Scale Structure Survey region. Data features were divided into astrometry, photometry, color, morphology, redshift, and class label with the addition of variability features and images. We present the results of four submitted solutions to DCs using both classical and machine learning methods. We systematically test the performance of supervised models (support vector machine, random forest, extreme gradient boosting, artificial neural network, convolutional neural network) and unsupervised ones (deep embedding clustering) when applied to the problem of classifying/clustering sources as stars, galaxies, or AGNs. We obtained classification accuracy of 97.5% for supervised models and clustering accuracy of 96.0% for unsupervised ones and 95.0% with a classic approach for a blinded data set. We find that variability features significantly improve the accuracy of the trained models, and correlation analysis among different bands enables a fast and inexpensive first-order selection of quasar candidates.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

On the robustness of a Bayes estimate

This paper examines the robustness of a Bayes estimator with respect to the assigned prior distribution. A Bayesian analysis for a stochastic scale parameter of a Weibull failure model is summarized in which the natural conjugate is assigned as the prior distribution of the random parameter. The sensitivity analysis is carried out by the Monte Carlo method in which, although an inverted gamma is the assigned prior, realizations are generated using distribution functions of varying shape. For several distributional forms and even for some fixed values of the parameter, simulated mean squared errors of Bayes and minimum variance unbiased estimators are determined and compared. Results indicate that the Bayes estimator remains squared-error superior and appears to be largely robust to the form of the assigned prior distribution.

Canavos, G. C.↗

Effect of mid- and high-spatial frequencies on optical performance

In many of today's telescopes the effects of surface errors on image quality and scattered light are very important. The influence of optical fabrication surface errors on the performance of an optical system is discussed. The methods developed by Hopkins (1957) for aberration tolerancing and Barakat (1972) for random wavefront errors are extended to the examination of mid- and high-spatial frequency surface errors. The discussion covers a review of the basic concepts of image quality, an examination of manufacturing errors as a function of image quality performance, a demonstration of mirror scattering effects in relation to surface errors, and some comments on the nature of the correlation functions. Illustrative examples are included.

Noll, R. J.↗

The design of optimum remote-sensing instruments

Remote-sensing instruments allow values for certain properties of a target to be retrieved from measurements of radiation emitted, reflected or transmitted by the target. The retrieval accuracy is affected by random variations in the many target properties which affect the measurements. A method is described, by which statistical properties of the target and theoretical models of its electromagnetic behavior can be used to choose values for the instrument parameters which maximize the retrieval accuracy. The technique is applicable to a wide range of remote-sensing instruments.

Peckham, G. E.↗

Random scattering approach to gravitational microlensing

Small random deflections of a narrow beam of radiation due to gravitational scattering by stars randomly distributed within the deflector plane are considered. Using a Fouriere transform method, the probability of scattering is obtained as a function of scattering angle for an arbitrary number of stars with an arbitrary distribution of masses. The probability density, expressed in proper units, depends on one parameter only: the effective number of stars. At small scattering angles the density is a Gaussian, and at large angles it falls off as the scattering angle to the minus fourth power. The probability distribution for scatterings is simply related to the angular distribution of the surface brightness of a macroimage, averaged over many microimages. The isophotes are ellipses, with the ratio of the major axis to the minor axis, determined by the dimensionless surface mass density and the shear of the lensing system. The number of stars that has to be included in the modeling of microlensing is proportional to the amplification due to the macrolens, and to the square of the dimensionless surface mass density.

Katz, N.↗

Beyond the Kirchhoff approximation

The three most successful models for describing scattering from random rough surfaces are the Kirchhoff approximation (KA), the small-perturbation method (SPM), and the two-scale-roughness (or composite roughness) surface-scattering (TSR) models. In this paper it is shown how these three models can be derived rigorously from one perturbation expansion based on the extinction theorem for scalar waves scattering from perfectly rigid surface. It is also shown how corrections to the KA proportional to the surface curvature and higher-order derivatives may be obtained. Using these results, the scattering cross section is derived for various surface models.

Rodriguez, Ernesto↗

Towards large eddy and direct simulation of complex turbulent flows

Recent advances in the methodology for direct numerical simulation of turbulent flows and some of the current applications are reviewed. It is argued that high-order finite difference schemes yield solutions with comparable accuracy to the spectral methods with the same number of degrees of freedom. The effects of random inflow conditions on the downstream evolution of turbulence are discussed.

Moin, Parviz↗