Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error estimation”

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 325 records · Page 18

Solution verification, goal-oriented adaptive methods for stochastic advection–diffusion problems

A goal-oriented analysis of linear, stochastic advection–diffusion models is presented which provides both a method for solution verification as well as a basis for improving results through adaptation of both the mesh and the way random variables are approximated. A class of model problems with random coefficients and source terms is cast in a variational setting. Specific quantities of interest are specified which are also random variables. A stochastic adjoint problem associated with the quantities of interest is formulated and a posteriori error estimates are derived. These are used to guide an adaptive algorithm which adjusts the sparse probabilistic grid so as to control the approximation error. Numerical examples are given to demonstrate the methodology for a specific model problem.

97 MATHEMATICS AND COMPUTING↗

Precision and Accuracy in PDV and VISAR

This is a technical report discussing our current level of understanding of a wide and varying distribution of uncertainties in velocity results from Photonic Doppler Velocimetry in its application to gas gun experiments. Using propagation of errors methods with statistical averaging of photon number fluctuation in the detected photocurrent and subsequent addition of electronic recording noise, we learn that the velocity uncertainty in VISAR can be written in closed form. For PDV, the non-linear frequency transform and peak fitting methods employed make propagation of errors estimates notoriously more difficult to write down in closed form expect in the limit of constant velocity and low time resolution (large analysis-window width). An alternative method of error propagation in PDV is to use Monte Carlo methods with a simulation of the time domain signal based on results from the spectral domain. A key problem for Monte Carlo estimation for an experiment is a correct estimate of that portion of the time-domain noise associated with the peak-fitting region-of-interesting in the spectral domain. Using short-time Fourier transformation spectral analysis and working with the phase dependent real and imaginary parts allows removal of amplitude-noise cross terms that invariably show up when working with correlation-based methods or FFT power spectra. Estimation of the noise associated with a given spectral region of interest is then possible. At this level of progress, we learn that Monte Carlo trials with random recording noise and initial (uncontrolled) phase yields velocity uncertainties that are not as large as those observed. In a search for additional noise sources, a speckleinterference modulation contribution with off axis rays was investigated, and was found to add a velocity variation beyond that from the recording noise (due to random interference between off axis rays), but in our experiments the speckle modulation precision was not as important as the recording noise precision. But from these investigations we do appreciate that the velocity-uncertainty itself has a wide distribution of values that varies with signal-amplitude modulation (is not a single value). To provide a rough rule of thumb for the velocity uncertainty, we computed the average of the relative standard deviation distributions from 60 recorded traces (with distributions of uncertainties roughly between 0.1 % to 1 % in each trace) and found a mean of the distribution of uncertainties for our experiments is not better than 0.4 % at an analysis window width of 5 ns (although for brief intervals it can be as good as 0.1 %). Further imagination and testing may be needed to reveal other possible hydrodynamics-related sources of velocity error in PDV.

47 OTHER INSTRUMENTATION↗

Improved estimates of coordinate error for molecular replacement

A function for estimating the effective root-mean-square deviation in coordinates between two proteins has been developed that depends on both the sequence identity and the size of the protein and is optimized for use with molecular replacement in Phaser. A top peak translation-function Z-score of over 8 is found to be a reliable metric of when molecular replacement has succeeded. The estimate of the root-mean-square deviation (r.m.s.d.) in coordinates between the model and the target is an essential parameter for calibrating likelihood functions for molecular replacement (MR). Good estimates of the r.m.s.d. lead to good estimates of the variance term in the likelihood functions, which increases signal to noise and hence success rates in the MR search. Phaser has hitherto used an estimate of the r.m.s.d. that only depends on the sequence identity between the model and target and which was not optimized for the MR likelihood functions. Variance-refinement functionality was added to Phaser to enable determination of the effective r.m.s.d. that optimized the log-likelihood gain (LLG) for a correct MR solution. Variance refinement was subsequently performed on a database of over 21 000 MR problems that sampled a range of sequence identities, protein sizes and protein fold classes. Success was monitored using the translation-function Z-score (TFZ), where a TFZ of 8 or over for the top peak was found to be a reliable indicator that MR had succeeded for these cases with one molecule in the asymmetric unit. Good estimates of the r.m.s.d. are correlated with the sequence identity and the protein size. A new estimate of the r.m.s.d. that uses these two parameters in a function optimized to fit the mean of the refined variance is implemented in Phaser and improves MR outcomes. Perturbing the initial estimate of the r.m.s.d. from the mean of the distribution in steps of standard deviations of the distribution further increases MR success rates.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A mixed $\ell_1$ regularization approach for sparse simultaneous approximation of parameterized PDEs

We introduce and assess a novel sparse polynomial technique for the simultaneous approximation of parameterized partial differential equations (PDEs) with deterministic and stochastic inputs. Our approach treats the numerical solution as a jointly sparse reconstruction problem through the reformulation of the standard basis pursuit denoising, where the set of jointly sparse vectors is infinite. To achieve global reconstruction of sparse solutions to parameterized elliptic PDEs over both physical and parametric domains, we combine the standard measurement scheme developed for compressed sensing in the context of bounded orthonormal systems with a novel mixed-norm based $\ell_1$ regularization method that exploits both energy and sparsity. Moreover, we are able to prove that, with minimal sample complexity, error estimates comparable to the best $s$-term and quasi-optimal approximations are achievable, while requiring only {\em a priori} bounds on polynomial truncation error with respect to the energy norm.Finally, we perform extensive numerical experiments on several high-dimensional parameterized elliptic PDE models to demonstrate the superior recovery properties of the proposed approach.

97 MATHEMATICS AND COMPUTING↗

Red–green–blue Boolean image analysis of particulate debris laced with luminescent tracers

Abstract Particulate mass estimation from 3-pixel images is desirable in many fields. Red–green–blue (RGB) analysis and Boolean logic were shown to estimate the mass of luminescent tracers in microscopic images. With a controlled background intensity, an estimation error of 1.8 to 3.5% was achieved; in uncontrolled backgrounds, an error of about 18% was achieved. RGB analysis is a valuable tool for spatial location of particulates. This work shows it is possible to estimate the particulate mass in an image and gives RGB an extension into mass quantification that has far-reaching impacts in fields involving the fate and transport of particulate matter. Graphical abstract

36 MATERIALS SCIENCE↗

Counting independent sets using the Bethe approximation

The authors consider the problem of counting the number of independent sets or the partition function of a hard-core model in a graph. The problem in general is computationally hard (P hard). They study the quality of the approximation provided by the Bethe free energy. Belief propagation (BP) is a message-passing algorithm can be used to compute fixed points of the Bethe approximation; however, BP is not always guarantee to converge. As the first result, they propose a simple message-passing algorithm that converges to a BP fixed pont for any grapy. They find that their algorithm converges within a multiplicative error 1 + {var_epsilon} of a fixed point in {Omicron}(n{sup 2}E{sup -4} log{sup 3}(nE{sup -1})) iterations for any bounded degree graph of n nodes. In a nutshell, the algorithm can be thought of as a modification of BP with 'time-varying' message-passing. Next, they analyze the resulting error to the number of independent sets provided by such a fixed point of the Bethe approximation. Using the recently developed loop calculus approach by Vhertkov and Chernyak, they establish that for any bounded graph with large enough girth, the error is {Omicron}(n{sup -{gamma}}) for some {gamma} > 0. As an application, they find that for random 3-regular graph, Bethe approximation of log-partition function (log of the number of independent sets) is within o(1) of corret log-partition - this is quite surprising as previous physics-based predictions were expecting an error of o(n). In sum, their results provide a systematic way to find Bethe fixed points for any graph quickly and allow for estimating error in Bethe approximation using novel combinatorial techniques.

97 MATHEMATICS AND COMPUTING↗

Spatial distribution of soil carbon stocks in a semi-arid region of India

We predicted total carbon (TC) stocks in the 0–30 cm soil depth of two southern states in India using field observations, environmental covariates and geospatial approaches. We compared the Geographically Weighted Regression Kriging (GWRK) with Linear Regression Kriging (LRK) approach to predict the TC stocks. Greater spatial heterogeneity in TC stocks (2–15 kg m –2 ) were predicted with lower estimation errors (RMSE = 2 kg m –2 R 2 = 0.63) in GWRK in comparison to the LRK approach (RMSE = 3 kg m –2 , R 2 = 0.55). The average decrease in the prediction error was 39% in GWRK in comparison to the LRK approach. The total TC stock in the 0–30 cm depth of the study area was estimated at 1.5 Pg C with upper and lower prediction intervals of 1 and 2 Pg C, respectively. The cropland stored largest (65%, 1 Pg C) amount of TC stocks followed by forest (21%, 0.31 Pg C) and plantation (8%, 0.12 Pg C) land cover types. Among soil types the Alfisols stored largest (33%, 0.49 Pg C) amount of TC stocks followed by Inceptisols (23%; 0.35 Pg C) and Entisols (18%, 0.27 Pg C). The uncertainty in TC stock predictions ranged from 41 to 75% and 69 to 91% under various land covers and soil types, respectively. Highest uncertainties in predicted TC stocks were associated with the forest land cover type and Mollisols soil order. Similarly, lowest uncertainties were found in the built up areas and Aridisols soil order. Our results suggest that GWRK is a useful approach to spatially predict the TC stocks at regional scales.

58 GEOSCIENCES↗

Evaluation of nonrigid registration models for interfraction dose accumulation in radiotherapy

Purpose: Interfraction dose accumulation is necessary to evaluate the dose distribution of an entire course of treatment by adding up multiple dose distributions of different treatment fractions. This accumulation of dose distributions is not straightforward as changes in the patient anatomy may occur during treatment. For this purpose, the accuracy of nonrigid registration methods is assessed for dose accumulation based on the calculated deformations fields. Methods: A phantom study using a deformable cubic silicon phantom with implanted markers and a cylindrical silicon phantom with MOSFET detectors has been performed. The phantoms were deformed and images were acquired using a cone-beam CT imager. Dose calculations were performed on these CT scans using the treatment planning system. Nonrigid CT-based registration was performed using two different methods, the Morphons and Demons. The resulting deformation field was applied on the dose distribution. For both phantoms, accuracy of the registered dose distribution was assessed. For the cylindrical phantom, also measured dose values in the deformed conditions were compared with the dose values of the registered dose distributions. Finally, interfraction dose accumulation for two treatment fractions of a patient with primary rectal cancer has been performed and evaluated using isodose lines and the dose volume histograms of the target volume and normal tissue. Results: A significant decrease in the difference in marker or MOSFET position was observed after nonrigid registration methods (p<0.001) for both phantoms and with both methods, as well as a significant decrease in the dose estimation error (p<0.01 for the cubic phantom and p<0.001 for the cylindrical) with both methods. Considering the whole data set at once, the difference between estimated and measured doses was also significantly decreased using registration (p<0.001 for both methods). The patient case showed a slightly underdosed planning target volume and an overdosed bladder volume due to anatomical deformations. Conclusions: Dose accumulation using nonrigid registration methods is possible using repeated CT imaging. This opens possibilities for interfraction dose accumulation and adaptive radiotherapy to incorporate possible differences in dose delivered to the target volume and organs at risk due to anatomical deformations.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Real-Time Distribution System State Estimation with Asynchronous Measurements

We report state estimation is a fundamental task in power systems. Although distribution systems are increasingly equipped with sensing devices and smart meters, measurements are typically reported at different rates and asynchronously; these aspects pose severe strains on workhorse state estimation algorithms, which are designed to process batches of data collected in a synchronous manner from all the measurement units. In this paper, we develop a novel state estimation algorithm to continuously update the estimate of the state based on measurements received in an asynchronous manner from measurement units. The synthesis of the algorithm hinges on a proximal-point type method, implemented in an online fashion, and capable of processing measurements received sequentially from sensors. A performance analysis is presented by providing bounds on the estimation error in terms of the mean and variance that hold at each iteration and asymptotically. The scheme is also compared with a more traditional Weighted Least Squares estimator that compensates for the lack of measurement data by using, as pseudo measurements, the measurement retrieved during a certain time window. Numerical simulations on the IEEE 37-bus feeder corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Forecasting battery capacity and power degradation with multi-task learning

Lithium-ion batteries degrade due to usage and exposure to environmental conditions, which affects their capability to store energy and supply power. Accurately predicting the capacity and power fade of lithium-ion battery cells is challenging due to intrinsic manufacturing variances and coupled nonlinear ageing mechanisms. In this paper, we propose a data-driven prognostics framework to predict both capacity and power fade simultaneously with multi-task learning. The model is able to predict the degradation trajectory of both capacity and internal resistance together with knee-points and end-of-life points accurately at early-life stage. The validation shows an average percentage error of 2.37% and 1.24% for the prediction of capacity fade and resistance rise, respectively. The model's ability to accurately predict the degradation, facing capacity and resistance estimation errors, further demonstrates the model's robustness and generalizability. Compared with single-task learning models for forecasting capacity and power degradation, the model shows a significant prediction accuracy improvement and computational cost reduction. This work presents the highlights of multi-task learning in the degradation prognostics for lithium-ion batteries.

25 ENERGY STORAGE↗

Development of a nine spatial point, multipulse Thomson scattering diagnostic

A Thomson scattering diagnostic has been developed for the C-2 field-reversed configuration device. Based on a multipulse ruby laser, the system measures the electron temperature at nine spatial points. These points are chosen from 22 selectable positions covering r{approx_equal}1-41 cm. Twin collection lenses couple the scattered photons to nine optical fiber pairs. Extra fiber lengths delay the signals from different spatial points relative to each other, allowing up to three points to be analyzed by a single polychromator. The polychromator, using compact photomultipliers as detectors, has six spectral channels covering the range of 685-725 nm and is able to estimate electron temperatures of {approx_equal}10-200 eV. The photomultiplier output signals are recorded by digital storage oscilloscopes integrated with the main MDSplus database, with temperature and error estimates generated automatically at the conclusion of each plasma discharge.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

IAC-POP: FINDING THE STAR FORMATION HISTORY OF RESOLVED GALAXIES

IAC-pop is a code designed to solve the star formation history (SFH) of a complex stellar population system, like a galaxy, from the analysis of the color-magnitude diagram (CMD). It uses a genetic algorithm to minimize a {chi}{sup 2} merit function comparing the star distributions in the observed CMD and the CMD of a synthetic stellar population. A parameterization of the CMDs is used, which is the main input of the code. In fact, the code can be applied to any problem in which a similar parameterization of an experimental set of data and models can be made. The method's internal consistency and robustness against several error sources, including observational effects, data sampling, and stellar evolution library differences, are tested. It is found that the best stability of the solution and the best way to estimate errors are obtained by several runs of IAC-pop with varying the input data parameterization. The routine MinnIAC is used to control this process. IAC-pop is offered for free use and can be downloaded from the site http://iac-star.iac.es/iac-pop. The routine MinnIAC is also offered under request, but support cannot be provided for its use. The only requirement for the use of IAC-pop and MinnIAC is referencing this paper and crediting as indicated in the site.

79 ASTRONOMY AND ASTROPHYSICS↗

Addressing Angular Single-Event Effects in the Estimation of On-Orbit Error Rates

Our study describes complications introduced by angular direct ionization events on space error rate predictions. In particular, prevalence of multiple-cell upsets and a breakdown in the application of effective linear energy transfer in modern-scale devices can skew error rates approximated from currently available estimation models. Moreover, this paper highlights the importance of angular testing and proposes a methodology to extend existing error estimation tools to properly consider angular strikes in modern-scale devices. Finally, these techniques are illustrated with test data provided from a modern 28 nm SRAM-based device.

42 ENGINEERING↗

Polynomial meta-models with canonical low-rank approximations: Numerical insights and comparison to sparse polynomial chaos expansions

The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input dimension, a situation that is often encountered in real-life problems. By introducing the conditional generalization error, we further demonstrate that canonical LRA tend to outperform sparse PCE in the prediction of extreme model responses, which is critical in reliability analysis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Covariance operator estimation via adaptive thresholding

This paper studies sparse covariance operator estimation for nonstationary processes with sharply varying marginal variance and small correlation lengthscale. We introduce a covariance operator estimator that adaptively thresholds the sample covariance function using an estimate of the variance component. Building on recent results from empirical process theory, we derive an operator norm bound on the estimation error in terms of the sparsity level of the covariance and the expected supremum of a normalized process. Furthermore, our theory and numerical simulations demonstrate the advantage of adaptive threshold estimators over universal threshold and sample covariance estimators in nonstationary settings.

Al-Ghattas, Omar [University of Chicago, IL (Unite↗

Performance Analysis of HF Band FB-MC-SS

Abstract—In a recent paper [1] the filter bank multicarrier spread spectrum (FB-MC-SS) waveform was proposed for wideband spread spectrum HF communications. A significant benefit of this waveform is robustness against narrow and partial band interference. Simulation results in [1] demonstrated good performance in a wideband HF channel over a wide range of conditions. In this paper we present a theoretical analysis of the bit error probably for this system. Our analysis tailors the results from [2] where BER performance was analyzed for maximum ration combining systems that accounted for correlation between subcarriers and channel estimation error. Equations are give for BER that closely match the simulated performance in most situations.

Analysis↗

Measurement of D-T Neutron Source Flux by SelfNeutron Activation Analysis with a LaBr3 Detector

Conclusions: • Decay of 78Br produced from the 79Br(n,2n) reaction in LaBr3 is present in the spectrum plotted in the time domain. • The neutron production rate reconstructed from preliminary LaBr3 estimate is smaller than the generator output. • Generator characterization may become more routine if a simple and robust method is made available for applications. Ongoing work: • Implementing bootstrapping to improve error estimates. • Examining threshold and edge effects of LaBr3

SMITH, MURRY↗

Learning high-dimensional parametric maps via reduced basis adaptive residual networks

We propose a scalable framework for the learning of high-dimensional parametric maps via adaptively constructed residual network (ResNet) maps between reduced bases of the inputs and outputs. When just few training data are available, it is beneficial to have a compact parametrization in order to ameliorate the ill-posedness of the neural network training problem. By linearly restricting high-dimensional maps to informed reduced bases of the inputs, one can compress high-dimensional maps in a constructive way that can be used to detect appropriate basis ranks, equipped with rigorous error estimates. A scalable neural network learning framework is thus to learn the nonlinear compressed reduced basis mapping. Unlike the reduced basis construction, however, neural network constructions are not guaranteed to reduce errors by adding representation power, making it difficult to achieve good practical performance. Inspired by recent approximation theory that connects ResNets to sequential minimizing flows, we present an adaptive ResNet construction algorithm. This algorithm allows for depth-wise enrichment of the neural network approximation, in a manner that can achieve good practical performance by first training a shallow network and then adapting. We prove universal approximation of the associated neural network class for $L^2_v$ functions on compact sets. Our overall framework allows for constructive means to detect appropriate breadth and depth, and related compact parametrizations of neural networks, significantly reducing the need for architectural hyperparameter tuning. Numerical experiments for parametric PDE problems and a 3D CFD wing design optimization parametric map demonstrate that the proposed methodology can achieve remarkably high accuracy for limited training data, and outperformed other neural network strategies we compared against.

42 ENGINEERING↗