Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ERRORS”

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 235 records · Page 13

A note on the reliability of goal-oriented error estimates for Galerkin finite element methods with nonlinear functionals

Here, we consider estimating the discretization error in a nonlinear functional J (u) in the setting of an abstract variational problem: find u ϵ $\mathscr{V}$ such that B (u, φ) = L (φ) ∀φ ϵ $\mathscr{V}$, as approximated by a Galerkin finite element method. Here, $\mathscr{V}$ is a Hilbert space, B (. , .) is a bilinear form, and L (∙) is a linear functional. We consider well-known error estimates η of the form J (u) - J (u h ) ≈ η = L (z) - B (u h , z), where u h denotes a finite element approximation to u, and z denotes the solution to an auxiliary adjoint variational problem. We show that there exist nonlinear functionals for which error estimates of this form are not reliable, even in the presence of an exact adjoint solution z. An estimate η is said to be reliable if there exists a constant C ϵ $\mathbb{R}$ >0 independent of u h such that |J (u) - J (u h )| ≤ C|η|. We present several example pairs of bilinear forms and nonlinear functionals where reliability of η is not achieved.

A posteriori↗

Stochastic modeling and statistical calibration with model error and scarce data

This paper introduces a procedure to assess the predictive accuracy of stochastic models subject to model error and sparse data. Model error is introduced as uncertainty on the coefficients of appropriate polynomial chaos expansions (PCE). The error associated with finite sample size allows us to conceive of these coefficients as statistics of the data that we describe as random variables whose influence on output quantities of interest is evaluated through the extended polynomial chaos expansion (EPCE). A Bayesian data assimilation scheme is introduced to update these expansions by considering the resulting nested chaos expansion as a hierarchical probabilistic model. Stochastic models of quantities of interest (QoI) are thus constructed and efficiently evaluated. Here, the Metropolis–Hastings Markov chain Monte Carlo procedure is used to sample the posterior. Two illustrative analytical and numerical problems are used to demonstrate the proposed approach.

Bayesian inference↗

Optimal local truncation error method for 3-D elasticity interface problems

The paper deals with a new effective numerical technique on unfitted Cartesian meshes for simulations of heterogeneous elastic materials. Here, we develop the optimal local truncation error method (OLTEM) with 27- point stencils (similar to those for linear finite elements) for the 3-D time-independent elasticity equations with irregular interfaces. Only displacement unknowns at each internal Cartesian grid point are used. The interface conditions are added to the expression for the local truncation error and do not change the width of the stencils. The unknown stencil coefficients are calculated by the minimization of the local truncation error of the stencil equations and yield the optimal second order of accuracy for OLTEM with the 27-point stencils on unfitted Cartesian meshes. A new post-processing procedure for accurate stress calculations has been developed. Similar to basic computations it uses OLTEM with the 27-point stencils and the elasticity equations. The post-processing procedure can be easily extended to unstructured meshes and can be independently used with existing numerical techniques (e.g., with finite elements). Numerical experiments show that at an accuracy of 0.1% for stresses, OLTEM with the new post-processing procedure significantly (by 10 5 -10 9 times) reduces the number of degrees of freedom compared to linear finite elements. OLTEM with the 27-point stencils yields even more accurate results than high-order finite elements with wider stencils.

42 ENGINEERING↗

Noise and error analysis and optimization in particle-based kinetic plasma simulations

In this paper we analyze the noise in macro-particle methods used in plasma physics and fluid dynamics, leading to approaches for minimizing the total error, focusing on electrostatic models in one dimension. We begin by describing kernel density estimation for continuous values of the spatial variable x, expressing the kernel in a form in which its shape and width are represented separately. The covariance matrix of the noise in the density is computed, first for uniform true density. The bandwidth of the covariance matrix C(x,y) is related to the width of the kernel. A feature that stands out is the presence of constant negative terms in the elements of the covariance matrix both on and off-diagonal. These negative correlations are related to the fact that the total number of particles is fixed at each time step; they also lead to the property ∫C(x,y)dy = 0. We investigate the effect of these negative correlations on the electric field computed by Gauss's law, finding that the noise in the electric field is related to a process called the Ornstein-Uhlenbeck bridge, leading to a covariance matrix of the electric field with variance significantly reduced relative to that of a Brownian process. For non-constant density, p(x), still with continuous x, we analyze the total error in the density estimation and discuss it in terms of bias-variance optimization (BVO). For some characteristic length l, determined by the density and its second derivative, and kernel width h, having too few particles within h leads to too much variance; for h that is large relative to l, there is too much smoothing of the density. The optimum between these two limits is found by BVO. For kernels of the same width, it is shown that this optimum (minimum) is weakly sensitive to the kernel shape. Next, we repeat the analysis for x discretized on a grid. In this case the charge deposition rule is determined by a particle shape. An important property to be respected in the discrete system is the exact preservation of total charge on the grid; this property is necessary to ensure that the electric field is equal at both ends, consistent with periodic boundary conditions. We find that if the particle shapes satisfy a partition of unity property, the particle charge deposited on the grid is conserved exactly. Further, if the particle shape is expressed as the convolution of a kernel with another kernel that satisfies the partition of unity, then the particle shape obeys the partition of unity. This property holds for kernels of arbitrary width, including widths that are not integer multiples of the grid spacing. Furthermore, we show results relaxing the approximations used to do BVO optimization analytically, by doing numerical computations of the total error as a function of the kernel width, on a grid in x. The comparison between numerical and analytical results shows good agreement over a range of particle shapes. We discuss the practical implications of our results, including the criteria for design and implementation of computationally efficient particle shapes that take advantage of the developed theory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Study of interconnect errors, network congestion, and applications characteristics for throttle prediction on a large scale HPC system

Today’s High Performance Computing (HPC) systems contain thousand of nodes which work together to provide performance in the order of petaflops. The performance of these systems depends on various components like processors, memory, and interconnect. Among all, interconnect plays a major role as it glues together all the hardware components in an HPC system. A slow interconnect can impact a scientific application running on multiple processes severely as they rely on fast network messages to communicate and synchronize frequently. Unfortunately, the HPC community lacks a study that explores different interconnect errors, congestion events and applications characteristics on a large-scale HPC system. In our previous work, we process and analyze interconnect data of the Titan supercomputer to develop a thorough understanding of interconnects faults, errors, and congestion events. In this work, we first show how congestion events can impact application performance. We then investigate application characteristics interaction with interconnect errors and network congestion to predict applications encountering congestion with more than 90% accuracy.

97 MATHEMATICS AND COMPUTING↗

Application of Artificial Intelligence in Detection and Mitigation of Human Factor Errors in Nuclear Power Plants: A Review

Human factors and ergonomics have played an essential role in increasing the safety and performance of operators in the nuclear energy industry. In this critical review, we examine how artificial intelligence (AI) technologies can be leveraged to mitigate human errors, thereby improving the safety and performance of operators in nuclear power plants (NPPs). First, we discuss the various causes of human errors in NPPs. Next, we examine the ways in which AI has been introduced to and incorporated into different types of operator support systems to mitigate these human errors. We specifically examine (1) operator support systems, including decision support systems, (2) sensor fault detection systems, (3) operation validation systems, (4) operator monitoring systems, (5) autonomous control systems, (6) predictive maintenance systems, (7) automated text analysis systems, and (8) safety assessment systems. Finally, we provide some of the shortcomings of the existing AI technologies and discuss the challenges still ahead for their further adoption and implementation to provide future research directions.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

SPIDARman: System-Level Physics-Informed Detection of Anomalies in Reactor Collected Data Considering Human Errors

In nuclear power plants (NPPs), anomalies arising from sensors or human errors (HEs) can undermine the performance and reliability of plant operations. Anomaly detection models can be employed to detect sensor errors and HEs. Additionally, physics-informed machine learning models can utilize the known physics of the system, as described by mathematical equations, to ensure that sensor values are consistent with physical laws. Hence, we propose SPIDARman: System-level Physics-Informed Detection of Anomalies in Reactor Collected Data Considering Human Errors, a holistic physics-informed anomaly detection approach based on generative adversarial networks (GANs) to detect anomalies in both automatically collected sensor data and manually collected surveillance data. Here we test our approach on data collected from a flow loop testbed, showcasing its potential to detect anomalies. Results demonstrate that the proposed model performs better than the baseline GAN-based models in detecting sensor and surveillance anomalies, suggesting the potential of physics-informed anomaly detection GAN models in NPPs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Error field identification through torque balance on a saturated island in DIII-D

Measurement of the electromagnetic torque on a magnetic island could be an attractive method for error field identification in the early phase of ITER operation. Previous DIII-D experiments (Strait 2014 Nucl. Fusion 54 073004; Shiraki et al 2015 Plasma Phys. Control. Fusion 57 025016) have demonstrated the principle of this approach using a stationary or slowly rotating island, while recent developments in magnetic data analysis (Sweeney and Strait 2019 Phys. Plasmas 26 012509) allow the field of a rapidly rotating island to be readily distinguished from that of the wall currents induced by its rotation. In a recent experiment, a rotating n = 1 magnetic perturbation forced a saturated magnetic island to rotate, thus sampling all toroidal phases periodically in a single discharge. The phase and amplitude of the error field are inferred from analysis of the time-dependent torque balance on the island, including torques from the error field, the applied magnetic perturbation, and the wall currents induced by rotation of the applied perturbation and the island. Furthermore, results agree well with those from more conventional methods.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum utility-scale error mitigation for quantum quench dynamics in Heisenberg spin chains

Here, we implement a quantum error mitigation method termed self-mitigation, which is comparable to zero-noise extrapolation, at large scales to achieve quantum utility on near-term, noisy quantum computers. We investigate the effectiveness of several quantum error mitigation strategies, including self-mitigation, by simulating quantum quench dynamics for Heisenberg spin chains with system sizes up to 104 qubits using IBM quantum processors. In particular, we discuss the limitations of zero-noise extrapolation and the advantages offered by self-mitigation at large scales. The self-mitigation method demonstrates stable accuracy with large systems of 104 qubits comprising more than 3,000 CNOT gates. Also, we combine the discussed quantum error mitigation methods with practical entanglement entropy measuring methods, and it shows a good agreement with the theoretical estimation. Our study illustrates the usefulness of near-term noisy quantum hardware in examining the quantum quench dynamics of many-body systems at large scales and lays the groundwork for surpassing classical simulations with quantum methods prior to the development of fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗

Quantum error mitigation by hidden inverses protocol in superconducting quantum devices

We present a method to improve the convergence of variational algorithms based on hidden inverses (HIs) to mitigate coherent errors. In the context of error mitigation, this means replacing the hardware implementation of certain Hermitian gates with their inverses. Doing so results in noise cancellation and a more resilient quantum circuit. This approach improves performance in a variety of two-qubit error models where the noise operator also inverts with the gate inversion. We apply the mitigation scheme on superconducting quantum processors running the variational quantum eigensolver (VQE) algorithm to find the H 2 ground-state energy. When implemented on superconducting hardware we find that the mitigation scheme effectively reduces the energy fluctuations in the parameter learning path in VQE, reducing the number of iterations for a converged value. We also provide a detailed numerical simulation of VQE performance under different noise models and explore how HIs and randomized compiling affect the underlying loss landscape of the learning problem. These simulations help explain our experimental hardware outcomes, helping to connect lower-level gate performance to application-specific behavior in contrast to metrics like fidelity which often do not provide an intuitive insight into observed high level performance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Error detection on quantum computers improving the accuracy of chemical calculations

The ultimate goal of quantum error correction is to achieve the fault-tolerance threshold beyond which quantum computers can be made arbitrarily accurate. This requires extraordinary resources and engineering efforts. We show that even without achieving full fault-tolerance, quantum error detection is already useful on the current generation of quantum hardware. We demonstrate this by executing an end-to-end chemical calculation for the hydrogen molecule encoded in the [[4, 2, 2]] quantum error-detecting code. The encoded calculation with logical qubits significantly improves the accuracy of the molecular ground-state energy.

97 MATHEMATICS AND COMPUTING↗

Extending quantum probabilistic error cancellation by noise scaling

Here, we propose a general framework for quantum error mitigation that combines and generalizes two techniques: probabilistic error cancellation (PEC) and zero-noise extrapolation (ZNE). Similar to PEC, the proposed method represents ideal operations as linear combinations of noisy operations that are implementable on hardware. However, instead of assuming a fixed level of hardware noise, we extend the set of implementable operations by noise scaling. By construction, this method encompasses both PEC and ZNE as particular cases and allows us to investigate a larger set of hybrid techniques. For example, gate extrapolation can be used to implement PEC without requiring knowledge of the device’s noise model, e.g., avoiding gate-set tomography. Alternatively, probabilistic error reduction can be used to estimate expectation values at intermediate virtual noise strengths (below the hardware level), leading to partially mitigated results at a lower sampling cost. Moreover, multiple results obtained with different noise-reduction factors can be further postprocessed with ZNE to better approximate the zero-noise limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computationally efficient zero-noise extrapolation for quantum-gate-error mitigation

Zero noise extrapolation (ZNE) is a widely used technique for gate error mitigation on near term quantum computers because it can be implemented in software and does not require knowledge of the quantum computer noise parameters. Traditional ZNE requires a significant resource overhead in terms of quantum operations. A recent proposal using a targeted (or random) instead of fixed identity insertion method (riim versus fiim) requires significantly fewer quantum gates for the same formal precision. We start by showing that riim can allow for ZNE to be deployed on deeper circuits than fiim but requires many more measurements to maintain the same statistical uncertainty. We develop two extensions to fiim and riim. The List Identity Insertion Method (liim) allows to mitigate the error from certain cnot gates, typically those with the largest error. Set Identity Insertion Method (siim) naturally interpolates between the measurement-efficient fiim and the gate-efficient riim allowing to trade off fewer cnot gates for more measurements. Finally, we investigate a way to boost the number of measurements, namely to run ZNE in parallel, utilizing as many quantum devices as are available. We explore the performance of riim in a parallel setting where there is a non-trivial spread in noise across sets of qubits within or across quantum computers.

97 MATHEMATICS AND COMPUTING↗

Self-calibration strategies for reducing systematic slope measurement errors of autocollimators in deflectometric profilometry

Deflectometric profilometers are used to precisely measure the form of beam shaping optics of synchrotrons and X-ray free-electron lasers. They often utilize autocollimators which measure slope by evaluating the displacement of a reticle image on a detector. Based on our privileged access to the raw image data of an autocollimator, novel strategies to reduce the systematic measurement errors by using a set of overlapping images of the reticle obtained at different positions on the detector are discussed. It is demonstrated that imaging properties such as, for example, geometrical distortions and vignetting, can be extracted from this redundant set of images without recourse to external calibration facilities. This approach is based on the fact that the properties of the reticle itself do not change – all changes in the reticle image are due to the imaging process. Firstly, by combining interpolation and correlation, it is possible to determine the shift of a reticle image relative to a reference image with minimal error propagation. Secondly, the intensity of the reticle image is analysed as a function of its position on the CCD and a vignetting correction is calculated. Thirdly, the size of the reticle image is analysed as a function of its position and an imaging distortion correction is derived. It is demonstrated that, for different measurement ranges and aperture diameters of the autocollimator, reductions in the systematic errors of up to a factor of four to five can be achieved without recourse to external measurements.

47 OTHER INSTRUMENTATION↗

SZ3: A Modular Framework for Composing Prediction-Based Error-Bounded Lossy Compressors

Today's scientific simulations require a significant reduction of data volume because of extremely large amounts of data they produce and the limited I/O bandwidth and storage space. Here, error-bounded lossy compression has been considered one of the most effective solutions to the above problem. In practice, however, the best-fit compression method often needs to be customized or optimized in particular because of diverse characteristics in different datasets and various user requirements on the compression quality and performance. In this paper, we address this issue with a novel modular, composable compression framework named SZ3. Our contributions are four-folds. (1) We develop SZ3 which features an innovative modular abstraction for the prediction-based compression framework, such that compression modules can be plugged in easily to create new compressors based on characteristics of data and user requirements. (2) We create a new compression pipeline by SZ3 for GAMESS data, which significantly improves the compression ratios over state-of-the-art compressors. (3) We develop an adaptive compression pipeline by SZ3 for APS data with minimal efforts, which leads to the best rate-distortion among all existing error-bounded lossy compressors for any bit-rate. (4) We compare the sustainability of SZ3 with leading error-bounded prediction-based compressors, and then demonstrate the necessity of diverse pipelines by integrating and evaluating several compression pipelines on diverse scientific datasets from multiple disciplines. Experiments show that SZ3 incurs very limited overhead in compressor integration and our customized compression pipelines lead to up to 20% improvement in compression ratios under the same data distortion, when compared with the best existing approach.

97 MATHEMATICS AND COMPUTING↗

Layer-Dependent Bit Error Variation in 3-D NAND Flash Under Ionizing Radiation

In this paper, we studied the total ionization dose (TID) effects on the multilevel-cell (MLC) 3-D NAND flash memory using Co-60 gamma radiation. We found a significant page-to-page bit error variation within a physical memory block of the irradiated memory chip. Our analysis showed that the origin of the bit error variation is the unique vertical layer-dependent TID response of the 3-D NAND. We found that the memory pages located at the upper and lower layers of the 3-D stack show higher fails compared to the middle-layer pages of a given memory block. We confirmed our findings by comparing radiation response of four different chips of the same specification. In addition, we compared the TID response of the MLC 3-D NAND with that of the 2-D NAND chip, which showed less page-to-page variation in bit error within a given memory block. We discuss the possible application of our findings for the radiation-tolerant smart memory controller design.

3-D NAND flash↗

Effects of error, chimera, bias, and GC content on the accuracy of amplicon sequencing

ABSTRACT Targeted amplicon sequencing is widely used in microbial ecology studies. However, sequencing artifacts and amplification biases are of great concern. To identify sources of these artifacts, a systematic analysis was performed using mock communities comprised of 16S rRNA genes from 33 bacterial strains. Our results indicated that while sequencing errors were generally isolated to low-abundance operational taxonomic units, chimeric sequences were a major source of artifacts. Singleton and doubleton sequences were primarily chimeras. Formation of chimeric sequences was significantly correlated with the GC content of the targeted sequences. Low-GC-content mock community members exhibited lower rates of chimeric sequence formation. GC content also had a large impact on sequence recovery. The quantitative capacity was notably limited, with substantial recovery variations and weak correlation between anticipated and observed strain abundances. The mock community strains with higher GC content had higher recovery rates than strains with lower GC content. Amplification bias was also observed due to the differences in primer affinity. A two-step PCR strategy reduced the number of chimeric sequences by half. In addition, comparative analyses based on the mock communities showed that several widely used sequence processing pipelines/methods, including DADA2, Deblur, UCLUST, UNOISE, and UPARSE, had different advantages and disadvantages in artifact removal and rare species detection. These results are important for improving sequencing quality and reliability and developing new algorithms to process targeted amplicon sequences. IMPORTANCE Amplicon sequencing of targeted genes is the predominant approach to estimate the membership and structure of microbial communities. However, accurate reconstruction of community composition is difficult due to sequencing errors, and other methodological biases and effective approaches to overcome these challenges are essential. Using a mock community of 33 phylogenetically diverse strains, this study evaluated the effect of GC content on sequencing results and tested different approaches to improve overall sequencing accuracy while characterizing the pros and cons of popular amplicon sequence data processing approaches. The sequencing results from this study can serve as a benchmarking data set for future algorithmic improvements. Furthermore, the new insights on sequencing error, chimera formation, and GC bias from this study will help enhance the quality of amplicon sequencing studies and support the development of new data analysis approaches.

59 BASIC BIOLOGICAL SCIENCES↗

A Survey on Error-Bounded Lossy Compression for Scientific Datasets

Error-bounded lossy compression has been effective in significantly reducing the data storage/transfer burden while preserving the reconstructed data fidelity very well. Many error-bounded lossy compressors have been developed for a wide range of parallel and distributed use cases for years. They are designed with distinct compression models and principles, such that each of them features particular pros and cons. In this article, we provide a comprehensive survey of emerging error-bounded lossy compression techniques. The key contribution is fourfold. (1) We summarize a novel taxonomy of lossy compression into six classic models. (2) We provide a comprehensive survey of 10 commonly used compression components/modules. (3) We summarized pros and cons of 47 state-of-the-art lossy compressors and present how state-of-the-art compressors are designed based on different compression techniques. (4) We discuss how customized compressors are designed for specific scientific applications and use-cases. We believe this survey is useful to multiple communities including scientific applications, high-performance computing, lossy compression, and big data.

Error-Bounded Lossy Compression↗