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 271 records · Page 15

Impact of point spread function higher moments error on weak gravitational lensing – II. A comprehensive study

ABSTRACT Weak lensing is one of the most powerful probes for dark matter and dark energy science, although it faces increasing challenges in controlling systematic uncertainties as the statistical errors become smaller. The point spread function (PSF) needs to be precisely modeled to avoid systematic error on the weak lensing measurements. The weak lensing biases induced by errors in the PSF model second moments, i.e. its size and shape, are well-studied. However, Zhang et al. showed that errors in the higher moments of the PSF may also be a significant source of systematics for upcoming weak lensing surveys. Therefore, this work comprehensively investigate the modelling quality of PSF moments from the 3rd to 6th order, and propagate the PSFEx higher moments modelling error in the HSC survey data set to the weak lensing shear–shear correlation functions and their cosmological analyses. The overall multiplicative shear bias associated with errors in PSF higher moments can cause an ∼0.1σ shift on the cosmological parameters for LSST Y10, while the associated additive biases can induce 1σ uncertainties in cosmology parameter inference for LSST Y10, if not accounted. We compare the PSFEx model with PSF in Full FOV, and find similar performance in modelling the PSF higher moments. We conclude that PSF higher moment errors of the future PSF models should be reduced from those in current methods, otherwise needed to be explicitly modeled in the weak lensing analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

Active readout-error mitigation

Mitigating errors is a significant challenge for near-term quantum computers. One of the most important sources of errors is related to the readout of the quantum state into a classical bit stream. A variety of techniques have been proposed to mitigate these errors with post-hoc corrections. Here, we propose a complementary scheme to actively reduce readout errors on a shot-by-shot basis by encoding single qubits, immediately prior to readout, into multiqubit states. The computational resources of our technique are independent of the circuit depth and are compatible with the error rates and connectivity of many current devices. We analyze the potential of our approach using two types of error-correcting codes, and, as a proof of principle, we demonstrate an 80% improvement in readout error on the IBMQ Mumbai quantum computer.

97 MATHEMATICS AND COMPUTING↗

Controlling error orientation to improve quantum algorithm success rates

The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single-parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with coherent errors and comparing algorithm success rates for different choices of two-qubit gates that are constructed from composite pulse sequences, where the residual gate errors are related by a unitary transformation. As a result, all of the sequences have the same error relative to the ideal gate under any distance measure that is invariant under unitary transformations. However, the circuit success can vary dramatically by choosing error orientations that do not affect the final outcome and error orientations that cancel between conjugate controlled-nots, as demonstrated here with Clifford circuits, compiled Toffoli gates, and quantum simulation algorithms. Furthermore, the results point to the utility of both minimizing the error and optimizing the error direction and also to the advantages of using multiple control sequences for the same gate type within a single algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable fermionic error correction in Majorana surface codes

We study the error correcting properties of Majorana surface codes (MSCs), topological quantum codes constructed out of interacting Majorana fermions, which can be used to store quantum information and perform quantum computation. Furthermore, these quantum memories suffer from purely “fermionic” errors, such as quasiparticle poisoning (QP), that have no analog in conventional platforms with bosonic qubits. In physical realizations where QP dominates, we show that errors can be corrected provided that the poisoning rate is below a threshold of ~11%. When QP is highly suppressed and fermionic bilinear (“bosonic”) errors become dominant, we find an error threshold of ~16%, which is much higher than the threshold for spin-based topological memories like the surface code or the color code. In addition, we derive lattice gauge theories to account for measurement errors. These results, together with the inherent error suppression provided by the superconducting gap in physical realizations of the MSCs, makes this a strong candidate for a robust topological quantum memory.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Exploring Autoencoder-based Error-bounded Compression for Scientific Data

Error-bounded lossy compression is becoming an indispensable technique for the success of today's scientific projects with vast volumes of data produced during the simulations or instrument data acquisitions. Not only can it significantly reduce data size, but it also can control the compression errors based on user-specified error bounds. Autoencoder (AE) models have been widely used in image compression, but few AE-based compression approaches support error-bounding features, which are highly required by scientific applications. To address this issue, we explore using convolutional autoencoders to improve error-bounded lossy compression for scientific data, with the following three key contributions. (1) We provide an in-depth investigation of the characteristics of various autoencoder models and develop an error-bounded autoencoder-based framework in terms of the SZ model. (2) We optimize the compression quality for main stages in our designed AE-based error-bounded compression framework, fine-tuning the block sizes and latent sizes and also optimizing the compression efficiency of latent vectors. (3) We evaluate our proposed solution using five real-world scientific datasets and comparing them with six other related works. Experiments show that our solution exhibits a very competitive compression quality from among all the compressors in our tests. In absolute terms, it can obtain a much better compression quality (100%similar to 800% improvement in compression ratio with the same data distortion) compared with SZ2.1 and ZFP in cases with a high compression ratio.

Liu, Jinyang↗

NISQ+: Boosting quantum computing power by approximating quantum error correction

Quantum computers are growing in size, and design decisions are being made now that attempt to squeeze more computation out of these machines. In this spirit, we design a method to boost the computational power of near-term quantum computers by adapting protocols used in quantum error correction to implement "Approximate Quantum Error Correction (AQEC)." By approximating fully-fledged error correction mechanisms, we can increase the compute volume (qubits × gates, or "Simple Quantum Volume (SQV)") of near-term machines. The crux of our design is a fast hardware decoder that can approximately decode detected error syndromes rapidly. Specifically, we demonstrate a proof-of-concept that approximate error decoding can be accomplished online in near-term quantum systems by designing and implementing a novel algorithm in Single-Flux Quantum (SFQ) superconducting logic technology. This avoids a critical decoding backlog, hidden in all offline decoding schemes, that leads to idle time exponential in the number of T gates in a program. Our design utilizes one SFQ processing module per physical qubit. Employing state-of-the-art SFQ synthesis tools, we show that the circuit area, power, and latency are within the constraints of contemporary quantum system designs. Under pure dephasing error models, the proposed accelerator and AQEC solution is able to expand SQV by factors between 3,402 and 11,163 on expected near-term machines. The decoder achieves a 5% accuracy-threshold and pseudo-thresholds of ~ 5%,4.75%,4.5%, and 3.5% physical error-rates for code distances 3,5,7, and 9. Decoding solutions are achieved in a maximum of ~20 nanoseconds on the largest code distances studied. By avoiding the exponential idle time in offline decoders, we achieve a 10x reduction in required code distances to achieve the same logical performance as alternative designs.

97 MATHEMATICS AND COMPUTING↗

Region-adaptive, Error-controlled Scientific Data Compression using Multilevel Decomposition

The increase of computer processing speed is significantly outpacing improvements in network and storage bandwidth, leading to the big data challenge in modern science, where scientific applications can quickly generate much more data than that can be transferred and stored. As a result, big scientific data must be reduced by a few orders of magnitude while the accuracy of the reduced data needs to be guaranteed for further scientific explorations. Moreover, scientists are often interested in some specific spatial/temporal regions in their data, where higher accuracy is required. The locations of the regions requiring high accuracy can sometimes be prescribed based on application knowledge, while other times they must be estimated based on general spatial/temporal variation. In this paper, we develop a novel multilevel approach which allows users to impose region-wise compression error bounds. Our method utilizes the byproduct of a multilevel compressor to detect regions where details are rich and we provide the theoretical underpinning for region-wise error control. With spatially varying precision preservation, our approach can achieve significantly higher compression ratios than single-error bounded compression approaches and control errors in the regions of interest.We conduct the evaluations on two climate use cases – one targeting small-scale, node features and the other focusing on long, areal features. For both use cases, the locations of the features were unknown ahead of the compression. By selecting approximately 16% of the data based on multi-scale spatial variations and compressing those regions with smaller error tolerances than the rest, our approach improves the accuracy of post-analysis by approximately 2 × compared to single-error-bounded compression at the same compression ratio. Using the same error bound for the region of interest, our approach can achieve an increase of more than 50% in overall compression ratio.

Gong, Qian↗

Error Rate Comparison during Polymerase Chain Reaction by DNA Polymerase

As larger-scale cloning projects become more prevalent, there is an increasing need for comparisons among high fidelity DNA polymerases used for PCR amplification. All polymerases marketed for PCR applications are tested for fidelity properties (i.e., error rate determination) by vendors, and numerous literature reports have addressed PCR enzyme fidelity. Nonetheless, it is often difficult to make direct comparisons among different enzymes due to numerous methodological and analytical differences from study to study. We have measured the error rates for 6 DNA polymerases commonly used in PCR applications, including 3 polymerases typically used for cloning applications requiring high fidelity. Error rate measurement values reported here were obtained by direct sequencing of cloned PCR products. The strategy employed here allows interrogation of error rate across a very large DNA sequence space, since 94 unique DNA targets were used as templates for PCR cloning. The six enzymes included in the study, Taq polymerase, AccuPrime-Taq High Fidelity, KOD Hot Start, cloned Pfu polymerase, Phusion Hot Start, and Pwo polymerase, we find the lowest error rates with Pfu , Phusion, and Pwo polymerases. Error rates are comparable for these 3 enzymes and are >10x lower than the error rate observed with Taq polymerase. Mutation spectra are reported, with the 3 high fidelity enzymes displaying broadly similar types of mutations. For these enzymes, transition mutations predominate, with little bias observed for type of transition.

59 BASIC BIOLOGICAL SCIENCES↗

A flexible method to calculate the distributions of discretization errors in operator-split codes with stochastic noise in problem data

This report investigates a technique to calculate the distributions of discretization errors for a model of advection-diffusion-reaction with stochastic noise in problem data. The focus is on operator-split discretization methods. The error is decomposed into components due to the splitting and due to the discretization within each component. We present a method to estimate the distributions of the total discretization error for a quantity of interest as well as the aforementioned error components. These computations require information about the propagation of uncertainty within and between code modules, for which purpose we use a flexible code framework for uncertainty quantification. Computational examples illustrate that in certain cases the distribution of numerical error can have a significant impact on the code output. Using information about the components of the numerical error, decisions can be made regarding discretization parameters to efficiently reduce the impact of numerical error on the distribution of model outputs.

97 MATHEMATICS AND COMPUTING↗

Detecting and Testing for Structural Error in Computer Models with Application to the Community Atmospheric Model

Bayesian calibration/inversion methods for uncertain input parameters to simulation codes have generated an increasing amount of interest in the climate community in the recent years. This approach uses multiple disparate observational datasets related to the output of the simulator of interest to yield a probabilistic constraint on the uncertain inputs (i.e. probability distribution). A major challenge in applying Bayesian calibration methods to simulation codes is related to the possible presence of a large structural error in the output fields of interest; that is, the presence of discrepancy between the observed and the simulated output that is neither explained by the uncertainty in the inputs nor the observations. We present here methods to test for and visualize structural error in an ensemble of input-perturbed simulations. The methods are based on bootstrap (resmpling) test statistics and well-known metrics to quantify the difference between two probability distributions. The proposed methods are demonstrated using selected precipitation output fields of the Community Atmospheric Model (CAM), which are compared to observations provided by the Global Precipitation Climatology Project (GPCP). The methods are found to be useful in identifying regions and seasons with a large structural error. The proposed structural error detection methodology can be used to screen multiple observational datasets of interest for structural error, making it possible to retain only the datasets with a small structural error for use in Bayesian calibration. In addition, information about the amount of structural error can be valuable to model developers.

58 GEOSCIENCES↗

Impact of Measurement Error on Synchrophasor Applications

Phasor measurement units (PMUs), a type of synchrophasor, are powerful diagnostic tools that can help avert catastrophic failures in the power grid. Because of this, PMU measurement errors are particularly worrisome. This report examines the internal and external factors contributing to PMU phase angle and frequency measurement errors and gives a reasonable explanation for them. It also analyzes the impact of those measurement errors on several synchrophasor applications: event location detection, oscillation detection, islanding detection, and dynamic line rating. The primary finding is that dynamic line rating is more likely to be influenced by measurement error. Other findings include the possibility of reporting nonoscillatory activity as an oscillation as the result of error, failing to detect oscillations submerged by error, and the unlikely impact of error on event location and islanding detection.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Solar and Wind Forecast Error Reserve Sharing in a Multi-Utility Region

As electricity systems transition to higher levels of solar and wind generation, electric system operators will likely need to hold additional reserves to manage the forecast error associated with these resources. Because wind and solar forecast errors tend to be poorly correlated across space, system operators can reduce their reserve requirements by sharing reserves. This paper examines the value of forecast error reserve sharing among balancing areas in the Southeast United States. It finds that forecast error reserve requirements increase linearly with growth in solar and wind generation capacity but that reserve sharing can significantly reduce physical (MW) reserve requirements (from 25%-26% to 18%-19% of average load in high solar scenarios). It finds that the value of forecast error reserve sharing declines with higher levels of solar and wind generation, due to lower wholesale energy and reserve prices. Even with declines in wholesale prices, forecast error reserve sharing can still provide substantial value (as much as $\$$400 million per year in a high solar scenario), though with higher levels of solar, wind, and electricity storage, this value is increasingly tied to avoiding scarcity prices. The results suggest the importance of coordinated capacity expansion planning for forecast error reserve sharing.

14 SOLAR ENERGY↗

Searching for the Most Harmful Field Errors in the HSR IR Superconducting Magnets

In this project, we improve beam stability for the Electron-Ion Collider. Magnetic field errors can reduce beam stability, making it essential to identify the field errors that have the greatest impact on accelerator performance. However, this is particularly challenging because beam stability depends on the complex interactions of many magnetic field errors, resulting in a high-dimensional and nonlinear optimization problem. We determine which field errors are the most influential for the large physical aperture superconducting magnet B2PF, a critical magnet in the Interaction Region (IR) in the Hadron Storage Ring (HSR). We complete and analyze nearly 30,000 simulations on the Brookhaven National Laboratory Linux Cluster by varying 18 nonlinear magnetic field errors. We evaluate beam stability using the dynamic aperture and the tune diffusion. We identify the field errors that most strongly influence beam stability and establish quantitative field error tolerances that improve accelerator performance.

43 PARTICLE ACCELERATORS↗

Gravitational Self-force Errors of Poisson Solvers on Adaptively Refined Meshes

An error in the gravitational force that the source of gravity induces on itself (a self-force error) violates both the conservation of linear momentum and the conservation of energy. If such errors are present in a self-gravitating system and are not sufficiently random to average out, the obtained numerical solution will become progressively more unphysical with time: the system will acquire or lose momentum and energy due to numerical effects. In this paper, we demonstrate how self-force errors can arise in the case where self-gravity is solved on an adaptively refined mesh when the refinement is nonuniform. Here, we provide the analytical expression for the self-force error and numerical examples that demonstrate such self-force errors in idealized settings. We also show how these errors can be corrected to an arbitrary order by straightforward addition of correction terms at the refinement boundaries.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Impact of transport model errors on the global and regional methane emissions estimated by inverse modelling

A modelling experiment has been conceived to assess the impact of transport model errors on methane emissions estimated in an atmospheric inversion system. Synthetic methane observations, obtained from 10 different model outputs from the international TransCom-CH4 model inter-comparison exercise, are combined with a prior scenario of methane emissions and sinks, and integrated into the three-component PYVAR-LMDZ-SACS (PYthon VARiational-Laboratoire de Météorologie Dynamique model with Zooming capability-Simplified Atmospheric Chemistry System) inversion system to produce 10 different methane emission estimates at the global scale for the year 2005. The same methane sinks, emissions and initial conditions have been applied to produce the 10 synthetic observation datasets. The same inversion set-up (statistical errors, prior emissions, inverse procedure) is then applied to derive flux estimates by inverse modelling. Consequently, only differences in the modelling of atmospheric transport may cause differences in the estimated fluxes. Here in our framework, we show that transport model errors lead to a discrepancy of 27 Tg yr -1 at the global scale, representing 5% of total methane emissions. At continental and annual scales, transport model errors are proportionally larger than at the global scale, with errors ranging from 36 Tg yr -1 in North America to 7 Tg yr -1 in Boreal Eurasia (from 23 to 48%, respectively). At the model grid-scale, the spread of inverse estimates can reach 150% of the prior flux. Therefore, transport model errors contribute significantly to overall uncertainties in emission estimates by inverse modelling, especially when small spatial scales are examined. Sensitivity tests have been carried out to estimate the impact of the measurement network and the advantage of higher horizontal resolution in transport models. The large differences found between methane flux estimates inferred in these different configurations highly question the consistency of transport model errors in current inverse systems.

54 ENVIRONMENTAL SCIENCES↗

Balancing aggregation and smoothing errors in inverse models

Inverse models use observations of a system (observation vector) to quantify the variables driving that system (state vector) by statistical optimization. When the observation vector is large, such as with satellite data, selecting a suitable dimension for the state vector is a challenge. A state vector that is too large cannot be effectively constrained by the observations, leading to smoothing error. However, reducing the dimension of the state vector leads to aggregation error as prior relationships between state vector elements are imposed rather than optimized. Here we present a method for quantifying aggregation and smoothing errors as a function of state vector dimension, so that a suitable dimension can be selected by minimizing the combined error. Reducing the state vector within the aggregation error constraints can have the added advantage of enabling analytical solution to the inverse problem with full error characterization. We compare three methods for reducing the dimension of the state vector from its native resolution: (1) merging adjacent elements (grid coarsening), (2) clustering with principal component analysis (PCA), and (3) applying a Gaussian mixture model (GMM) with Gaussian pdfs as state vector elements on which the native-resolution state vector elements are projected using radial basis functions (RBFs). The GMM method leads to somewhat lower aggregation error than the other methods, but more importantly it retains resolution of major local features in the state vector while smoothing weak and broad features.

Turner, A. J.↗

Approximate error conjugation gradient minimization methods

In one embodiment, a method includes selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, calculating an approximate error using the subset of rays, and calculating a minimum in a conjugate gradient direction based on the approximate error. In another embodiment, a system includes a processor for executing logic, logic for selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, logic for calculating an approximate error using the subset of rays, and logic for calculating a minimum in a conjugate gradient direction based on the approximate error. In other embodiments, computer program products, methods, and systems are described capable of using approximate error in constrained conjugate gradient minimization problems.

97 MATHEMATICS AND COMPUTING↗

Accelerating Relative-error Bounded Lossy Compression for HPC datasets with Precomputation-Based Mechanisms

Scientific simulations in high-performance computing (HPC) environments are producing vast volume of data, which may cause a severe I/O bottleneck at runtime and a huge burden on storage space for post-analysis. Unlike the traditional data reduction schemes (such as deduplication or lossless compression), not only can error-controlled lossy compression significantly reduce the data size but it can also hold the promise to satisfy user demand on error control. Point-wise relative error bounds (i.e., compression errors depends on the data values) are widely used by many scientific applications in the lossy compression, since error control can adapt to the precision in the dataset automatically. Point-wise relative error bounded compression is complicated and time consuming. In this work, we develop efficient precomputation-based mechanisms in the SZ lossy compression framework. Our mechanisms can avoid costly logarithmic transformation and identify quantization factor values via a fast table lookup, greatly accelerating the relative-error bounded compression with excellent compression ratios. In addition, our mechanisms also help reduce traversing operations for Huffman decoding, and thus significantly accelerate the decompression process in SZ. Experiments with four well-known real-world scientific simulation datasets show that our solution can improve the compression rate by about 30% and decompression rate by about 70% in most of cases, making our designed lossy compression strategy the best choice in class in most cases.

compression rate↗