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 289 records · Page 16

Computationally efficient CFD prediction of bubbly flow using physics-guided deep learning

To realize efficient computational fluid dynamics (CFD) prediction of two-phase flow, a multi-scale framework was proposed in this paper by applying a physics-guided data-driven approach. Instrumental to this framework, Feature Similarity Measurement (FSM) technique was developed for error estimation in two-phase flow simulation using coarse-mesh CFD, to achieve a comparable accuracy as fine-mesh simulations with fast-running feature. In this work, by defining physics-guided parameters and variable gradients as physical features, FSM has the capability to capture the underlying local patterns in the coarse-mesh CFD simulation. Massive low-fidelity data and respective high-fidelity data are used to explore the underlying information relevant to the main simulation errors and the effects of phenomenological scaling. By learning from previous simulation data, a surrogate model using deep feedforward neural network (DFNN) can be developed and trained to estimate the simulation error of coarse-mesh CFD. In a demonstration case of two-phase bubbly flow, the DFNN model well captured and corrected the unphysical “peaks” in the velocity and void fraction profiles near the wall in the coarse-mesh configuration, even for extrapolative predictions. The research documented supports the feasibility of the physics-guided deep learning methods for coarse mesh CFD simulations which has a potential for the efficient industrial design.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Matched filtering and parameter estimation of ringdown waveforms

Using recent results from numerical relativity simulations of nonspinning binary black hole mergers, we revisit the problem of detecting ringdown waveforms and of estimating the source parameters, considering both LISA and Earth-based interferometers. We find that Advanced LIGO and EGO could detect intermediate-mass black holes of mass up to {approx}10{sup 3}M{sub {center_dot}} out to a luminosity distance of a few Gpc. For typical multipolar energy distributions, we show that the single-mode ringdown templates presently used for ringdown searches in the LIGO data stream can produce a significant event loss (>10% for all detectors in a large interval of black hole masses) and very large parameter estimation errors on the black hole's mass and spin. We estimate that more than {approx}10{sup 6} templates would be needed for a single-stage multimode search. Therefore, we recommend a ''two-stage'' search to save on computational costs: single-mode templates can be used for detection, but multimode templates or Prony methods should be used to estimate parameters once a detection has been made. We update estimates of the critical signal-to-noise ratio required to test the hypothesis that two or more modes are present in the signal and to resolve their frequencies, showing that second-generation Earth-based detectors and LISA have the potential to perform no-hair tests.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Sensitivity of back‐projection algorithm (BPA) synthetic aperture radar (SAR) image formation to initial position, velocity, and attitude navigation errors

Abstract The Back‐Projection Algorithm (BPA) is a time‐domain‐matched filtering technique to form synthetic aperture radar (SAR) images. To produce high‐quality BPA images, precise navigation data for the radar platform must be known. Errors in position, velocity, or attitude result in improperly formed images that are corrupted by shifting and blurring. The contribution of this paper is the development of analytical expressions that characterise the relationship between navigation errors and image formation errors from an inertial navigation point of view, where trajectory estimation errors in position, velocity, and attitude propagate through time and cause compounding errors in the vehicle state vector. These analytical expressions are verified via simulated image formation and real‐data image formation.

Lindstrom, Colton↗

Comparative analysis of three-dimensional structures of homodimers of uridine phosphorylase from Salmonella typhimurium in the unligated state and in a complex with potassium ion

The spatial organization of the homodimer of unligated uridine phosphorylase from Salmonella typhimurium (St UPh) was determined with high accuracy. The structure was refined at 1.80 A resolution to R{sub work} = 16.1% and R{sub free} = 20.0%. The rms deviations for the bond lengths, bond angles, and chiral angles are 0.006 A, 1.042{sup o}, and 0.071{sup o}, respectively. The coordinate error estimated by the Luzzati plot is 0.166 A. The coordinate error based on the maximum likelihood is 0.199 A. A comparative analysis of the spatial organization of the homodimer in two independently refined structures and the structure of the homodimer St UPh in the complex with a K{sup +} ion was performed. The substrate-binding sites in the homodimers StUPhs in the unligated state were found to act asynchronously. In the presence of a potassium ion, the three-dimensional structures of the subunits in the homodimer are virtually identical, which is apparently of importance for the synchronous action of both substrate-binding sites. The atomic coordinates of the refined structure of the homodimer and structure factors have been deposited in the Protein Data Bank (PDB ID code 3DPS).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Distributed quantum sensing enhanced by continuous-variable error correction

Abstract A distributed sensing protocol uses a network of local sensing nodes to estimate a global feature of the network, such as a weighted average of locally detectable parameters. In the noiseless case, continuous-variable (CV) multipartite entanglement shared by the nodes can improve the precision of parameter estimation relative to the precision attainable by a network without shared entanglement; for an entangled protocol, the root mean square estimation error scales like 1/ M with the number M of sensing nodes, the so-called Heisenberg scaling, while for protocols without entanglement, the error scales like 1 / M . However, in the presence of loss and other noise sources, although multipartite entanglement still has some advantages for sensing displacements and phases, the scaling of the precision with M is less favorable. In this paper, we show that using CV error correction codes can enhance the robustness of sensing protocols against imperfections and reinstate Heisenberg scaling up to moderate values of M . Furthermore, while previous distributed sensing protocols could measure only a single quadrature, we construct a protocol in which both quadratures can be sensed simultaneously. Our work demonstrates the value of CV error correction codes in realistic sensing scenarios.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

LTAU-FF: Loss Trajectory Analysis for Uncertainty in atomistic Force Fields

Model ensembles are effective tools for estimating prediction uncertainty in deep learning atomistic force fields. However, their widespread adoption is hindered by high computational costs and overconfident error estimates. In this work, we address these challenges by leveraging distributions of per-sample errors obtained during training and employing a distance-based similarity search in the model latent space. Our method, which we call LTAU (Loss Trajectory Analysis for Uncertainty), efficiently estimates the full probability distribution function of errors for any test point using the logged training errors, achieving speeds that are 2–3 orders of magnitudes faster than typical ensemble methods and allowing it to be used for tasks where training or evaluating multiple models would be infeasible. We apply LTAU towards estimating parametric uncertainty in atomistic force fields (LTAU-FF), demonstrating that it produces well-calibrated confidence intervals and predicts errors that correlate strongly with the true errors for data near the training domain. Furthermore, we show that the errors predicted by LTAU-FF can be used in practical applications for detecting out-of-domain data, tuning model performance, and predicting failure during simulations. We believe that LTAU will be a valuable tool for uncertainty quantification in atomistic force fields and is a promising method that should be further explored in other domains of machine learning.

97 MATHEMATICS AND COMPUTING↗

BrachyView, a novel in-body imaging system for HDR prostate brachytherapy: Experimental evaluation

Purpose: This paper presents initial experimental results from a prototype of high dose rate (HDR) BrachyView, a novel in-body source tracking system for HDR brachytherapy based on a multipinhole tungsten collimator and a high resolution pixellated silicon detector array. The probe and its associated position estimation algorithms are validated and a comprehensive evaluation of the accuracy of its position estimation capabilities is presented. Methods: The HDR brachytherapy source is moved through a sequence of positions in a prostate phantom, for various displacements in x, y, and z. For each position, multiple image acquisitions are performed, and source positions are reconstructed. Error estimates in each dimension are calculated at each source position and combined to calculate overall positioning errors. Gafchromic film is used to validate the accuracy of source placement within the phantom. Results: More than 90% of evaluated source positions were estimated with an error of less than one millimeter, with the worst-case error being 1.3 mm. Experimental results were in close agreement with previously published Monte Carlo simulation results. Conclusions: The prototype of HDR BrachyView demonstrates a satisfactory level of accuracy in its source position estimation, and additional improvements are achievable with further refinement of HDR BrachyView’s image processing algorithms.

60 APPLIED LIFE SCIENCES↗

Compact finite difference schemes for the time fractional diffusion equation with nonlocal boundary conditions

Fourth-order compact finite difference schemes for solving the time fractional diffusion equation with nonlocal boundary conditions are considered in this paper. The second-order derivative in one space variable is approximated by a fourth-order compact finite difference. Two different time derivatives, the Caputo derivative and Riemann–Liouville derivative are considered in the equations that we discuss. The Caputo time derivative is discretized by the L1-approximation and a second-order approximation is used for the Riemann–Liouville derivative. Stability analysis using the discrete energy method for Scheme I is given, and error estimation of this scheme is derived by conducting the local truncation error analysis, using the stability result. Numerical results are provided to show that both two fully discrete schemes have fourth-order accuracy in space, and 2−γ order of accuracy in time for Scheme I with γ being the order of the fractional derivative, while Scheme II has second-order accuracy in time when the theoretical solutions are smooth with zero initial values.

97 MATHEMATICS AND COMPUTING↗

Optimum Full Information, Unlimited Complexity, Invariant and Minimax Clock Skew and Offset Estimators for IEEE 1588

This paper presents the problem of clock skew and offset estimation for the IEEE 1588 precision time protocol. Built on the classical two-way message exchange scheme, IEEE 1588 is a prominent synchronization protocol for packet switched networks. Because of the presence of random queuing delays in a packet switched network, the joint recovery of clock skew and offset from the received packet timestamps can be viewed as a statistical estimation problem. Recently, assuming perfect clock skew information, minimax optimum clock offset estimators were developed for IEEE 1588. Building on this work, we first develop joint optimum invariant clock skew and offset estimators for IEEE 1588 for known queuing delay statistics and unlimited computational complexity. We then show the developed estimators are minimax optimum, i.e., these estimators minimize the maximum skew normalized mean square estimation error over all possible values of the unknown parameters. Minimax optimum estimators that utilize information from past timestamps to improve accuracy are also introduced. The developed optimum estimators provide useful fundamental limits for evaluating the performance of clock skew and offset estimation schemes. These performance limits can aid system designers to develop algorithms with the desired computational complexity that achieve performance close to the performance of the optimum estimators. If a designer finds an approach with a complexity they find acceptable and which provides performance close to the optimum performance, they can use it and know they have near optimum performance. This is precisely the approach used in communications when comparing to capacity.

Cellular networks↗

Limited‐memory adaptive snapshot selection for proper orthogonal decomposition

Summary Reduced order models are useful for accelerating simulations in many‐query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models (ROMs) can have prohibitively expensive memory and floating‐point operation costs in high‐performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time‐stepping ordinary differential equation solvers. The error estimator used in this work is related to theory bounding the approximation error in time of proper orthogonal decomposition‐based ROMs, and memory usage is minimized by computing the singular value decomposition using a single‐pass incremental algorithm. Results for a viscous Burgers' test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full‐order model is recovered to within discretization error. A parallel version of the resulting method can be used on supercomputers to generate proper orthogonal decomposition‐based ROMs, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space. Copyright © 2016 John Wiley & Sons, Ltd.

Oxberry, Geoffrey M.↗

Limited-memory adaptive snapshot selection for proper orthogonal decomposition

Reduced order models are useful for accelerating simulations in many-query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models can have prohibitively expensive memory and floating-point operation costs in high-performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time-stepping ordinary differential equation solvers. The error estimator used in this work is related to theory bounding the approximation error in time of proper orthogonal decomposition-based reduced order models, and memory usage is minimized by computing the singular value decomposition using a single-pass incremental algorithm. Results for a viscous Burgers’ test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full order model is recovered to within discretization error. The resulting method can be used on supercomputers to generate proper orthogonal decomposition-based reduced order models, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space.

97 MATHEMATICS AND COMPUTING↗

An Algebra of Machine Learners with Applications

Machine learning (ML) methods are increasingly being applied to solve complex, data-driven problems in diverse areas, by exploiting the physical laws derived from first principles such as thermal hydraulics and the abstract laws developed recently for data and computing infrastructures. These physical and abstract laws encapsulate, typically in compact algebraic forms, the critical knowledge that complements data-driven ML models. We present a unified perspective of these laws and ML methods using an abstract algebra (A;⊕,Ⓧ), wherein the performance estimation and classification tasks are characterized by the additive ⊕ operations, and the diagnosis, reconstruction, and optimization tasks are characterized by the difference Ⓧ operations. This abstraction provides ML codes and their performance characterizations that are transferable across different areas. We describe practical applications of these abstract operations using examples of throughput profile estimation tasks in data transport infrastructures, and power-level and sensor error estimation tasks in nuclear reactor systems.

Rao, Nageswara↗

LAMOST DR1: Stellar Parameters and Chemical Abundances with SP-Ace

We present a new analysis of the LAMOST DR1 survey spectral database performed with the code SP-Ace, which provides the derived stellar parameters T{sub eff}, logg, [Fe/H], and [α/H] for 1,097,231 stellar objects. We tested the reliability of our results by comparing them to reference results from high spectral resolution surveys. The expected errors can be summarized as ∼120 K in T{sub eff}, ∼0.2 in logg, ∼0.15 dex in [Fe/H], and ∼0.1 dex in [α/Fe] for spectra with S/N > 40, with some differences between dwarf and giant stars. SP-Ace provides error estimations consistent with the discrepancies observed between derived and reference parameters. Some systematic errors are identified and discussed. The resulting catalog is publicly available at the LAMOST and CDS websites.

79 ASTRONOMY AND ASTROPHYSICS↗

Multiview marker-free registration of forest terrestrial laser scanner data with embedded confidence metrics

Terrestrial laser scanning has demonstrated increasing potential for rapid comprehensive measurement of forest structure, especially when multiple scans are spatially registered in order to reduce the limitations of occlusion. Although marker-based registration techniques (based on retro-reflective spherical targets) are commonly used in practice, a blind marker-free approach is preferable, insofar as it supports rapid operational data acquisition. To support these efforts, we extend the pairwise registration approach of our earlier work, and develop a graph-theoretical framework to perform blind marker-free global registration of multiple point cloud data sets. Pairwise pose estimates are weighted based on their estimated error, in order to overcome pose conflict while exploiting redundant information and improving precision. The proposed approach was tested for eight diverse New England forest sites, with 25 scans collected at each site. Quantitative assessment was provided via a novel embedded confidence metric, with a mean estimated root-mean-square error of 7.2 cm and 89% of scans connected to the reference node. Lastly, this paper assesses the validity of the embedded multiview registration confidence metric and evaluates the performance of the proposed registration algorithm.

47 OTHER INSTRUMENTATION↗

Dynamically accumulated dose and 4D accumulated dose for moving tumors

Purpose: The purpose of this work was to investigate the relationship between dynamically accumulated dose (dynamic dose) and 4D accumulated dose (4D dose) for irradiation of moving tumors, and to quantify the dose uncertainty induced by tumor motion. Methods: The authors established that regardless of treatment modality and delivery properties, the dynamic dose will converge to the 4D dose, instead of the 3D static dose, after multiple deliveries. The bounds of dynamic dose, or the maximum estimation error using 4D or static dose, were established for the 4D and static doses, respectively. Numerical simulations were performed (1) to prove the principle that for each phase, after multiple deliveries, the average number of deliveries for any given time converges to the total number of fractions (K) over the number of phases (N); (2) to investigate the dose difference between the 4D and dynamic doses as a function of the number of deliveries for deliveries of a 'pulsed beam'; and (3) to investigate the dose difference between 4D dose and dynamic doses as a function of delivery time for deliveries of a 'continuous beam.' A Poisson model was developed to estimate the mean dose error as a function of number of deliveries or delivered time for both pulsed beam and continuous beam. Results: The numerical simulations confirmed that the number of deliveries for each phase converges to K/N, assuming a random starting phase. Simulations for the pulsed beam and continuous beam also suggested that the dose error is a strong function of the number of deliveries and/or total deliver time and could be a function of the breathing cycle, depending on the mode of delivery. The Poisson model agrees well with the simulation. Conclusions: Dynamically accumulated dose will converge to the 4D accumulated dose after multiple deliveries, regardless of treatment modality. Bounds of the dynamic dose could be determined using quantities derived from 4D doses, and the mean dose difference between the dynamic dose and 4D dose as a function of number of deliveries and/or total deliver time was also established.

60 APPLIED LIFE SCIENCES↗

THE SLOAN LENS ACS SURVEY. IX. COLORS, LENSING, AND STELLAR MASSES OF EARLY-TYPE GALAXIES

We present the current photometric data set for the Sloan Lens ACS (SLACS) Survey, including Hubble Space Telescope (HST) photometry from Advanced Camera for Surveys, WFPC2, and NICMOS. These data have enabled the confirmation of an additional 15 grade 'A' (certain) lens systems, bringing the number of SLACS grade 'A' lenses to 85; including 13 grade 'B' (likely) systems, SLACS has identified nearly 100 lenses and lens candidates. Approximately 80% of the grade 'A' systems have elliptical morphologies while approx10% show spiral structure; the remaining lenses have lenticular morphologies. Spectroscopic redshifts for the lens and source are available for every system, making SLACS the largest homogeneous data set of galaxy-scale lenses to date. We have created lens models using singular isothermal ellipsoid mass distributions for the 11 new systems that are dominated by a single mass component and where the multiple images are detected with sufficient signal to noise; these models give a high precision measurement of the mass within the Einstein radius of each lens. We have developed a novel Bayesian stellar population analysis code to determine robust stellar masses with accurate error estimates. We apply this code to deep, high-resolution HST imaging and determine stellar masses with typical statistical errors of 0.1 dex; we find that these stellar masses are unbiased compared to estimates obtained using SDSS photometry, provided that informative priors are used. The stellar masses range from 10{sup 10.5} to 10{sup 11.8} M{sub sun} and the typical stellar mass fraction within the Einstein radius is 0.4, assuming a Chabrier initial mass function. The ensemble properties of the SLACS lens galaxies, e.g., stellar masses and projected ellipticities, appear to be indistinguishable from other SDSS galaxies with similar stellar velocity dispersions. This further supports that SLACS lenses are representative of the overall population of massive early-type galaxies with M{sub *} approx> 10{sup 11} M{sub sun}, and are therefore an ideal data set to investigate the kpc-scale distribution of luminous and dark matter in galaxies out to z approx 0.5.

79 ASTRONOMY AND ASTROPHYSICS↗

TU-G-BRA-05: Predicting Volume Change of the Tumor and Critical Structures Throughout Radiation Therapy by CT-CBCT Registration with Local Intensity Correction

Purpose: The purpose of this study is to develop an accurate and effective technique to predict and monitor volume changes of the tumor and organs at risk (OARs) from daily cone-beam CTs (CBCTs). Methods: While CBCT is typically used to minimize the patient setup error, its poor image quality impedes accurate monitoring of daily anatomical changes in radiotherapy. Reconstruction artifacts in CBCT often cause undesirable errors in registration-based contour propagation from the planning CT, a conventional way to estimate anatomical changes. To improve the registration and segmentation accuracy, we developed a new deformable image registration (DIR) that iteratively corrects CBCT intensities using slice-based histogram matching during the registration process. Three popular DIR algorithms (hierarchical B-spline, demons, optical flow) augmented by the intensity correction were implemented on a graphics processing unit for efficient computation, and their performances were evaluated on six head and neck (HN) cancer cases. Four trained scientists manually contoured nodal gross tumor volume (GTV) on the planning CT and every other fraction CBCTs for each case, to which the propagated GTV contours by DIR were compared. The performance was also compared with commercial software, VelocityAI (Varian Medical Systems Inc.). Results: Manual contouring showed significant variations, [-76, +141]% from the mean of all four sets of contours. The volume differences (mean±std in cc) between the average manual segmentation and four automatic segmentations are 3.70±2.30(B-spline), 1.25±1.78(demons), 0.93±1.14(optical flow), and 4.39±3.86 (VelocityAI). In comparison to the average volume of the manual segmentations, the proposed approach significantly reduced the estimation error by 9%(B-spline), 38%(demons), and 51%(optical flow) over the conventional mutual information based method (VelocityAI). Conclusion: The proposed CT-CBCT registration with local CBCT intensity correction can accurately predict the tumor volume change with reduced errors. Although demonstrated only on HN nodal GTVs, the results imply improved accuracy for other critical structures. This work was supported by NIH/NCI under grant R42CA137886.

60 APPLIED LIFE SCIENCES↗

Multi-Physics Surrogate Modeling with Dimensionality Reduction

This summary provides a new algorithm to construct surrogate models for multi-physics, nonlinear, high dimensional models which typically suffer from the curse of dimensionality. To deal with the high computational cost and difficult error estimation, we employ recent advances in reduced order modeling (ROM) techniques to do an error-preserving reduction for the number of influential model parameters, followed by a conventional surrogate construction process. To implement ROM for a multiphysics model, a range finding algorithm (RFA) is used to identify a linear transformation in which the number of influential parameters can be minimized and the errors resulting from the non-influential parameters can be upper-bounded. The proposed algorithm is applied to the MAMMOTH coupled code system developed at the Idaho National Laboratory. In particular, we investigate the reducibility of Rattlesnake and BISON codes and their multi-physics coupling. The most important result of this work is that the reduction obtained with coupled physics is more significant than that with individual physics models. This summary explores the application of ROM techniques on multi-physics coupling codes system. Concise methodology is provided and selected numerical results are provided to show that coupling system provides additional reduction at interfaces. Future work could be invested to determine the optimum surrogate model format. (authors)

97 MATHEMATICS AND COMPUTING↗