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 1,711 records · Page 95
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

On the errors in measuring the particle density by the light absorption method

The accuracy of absorption measurements of the density of particles in a given quantum state as a function of the light absorption coefficient is analyzed. Errors caused by the finite accuracy in measuring the intensity of the light passing through a medium in the presence of different types of noise in the recorded signal are considered. Optimal values of the absorption coefficient and the factors capable of multiplying errors when deviating from these values are determined.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms

Although mixed precision arithmetic has recently garnered interest for training dense neural networks, many other applications could benefit from the speedups and lower storage cost if applied appropriately. The growing interest in employing mixed precision computations motivates the need for rounding error analysis that properly handles behavior from mixed precision arithmetic. We develop mixed precision variants of existing Householder QR algorithms and show error analyses supported by numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Memory Errors in Modern Systems: The Good, The Bad, and The Ugly

Several recent publications have shown that hardware faults in the memory subsystem are commonplace. These faults are predicted to become more frequent in future systems that contain orders of magnitude more DRAM and SRAM than found in current memory subsystems. These memory subsystems will need to provide resilience techniques to tolerate these faults when deployed in high-performance computing systems and data centers containing tens of thousands of nodes. Therefore, it is critical to understand the efficacy of current hardware resilience techniques to determine whether they will be suitable for future systems. In this paper, we present a study of DRAM and SRAM faults and errors from the field. We use data from two leadership-class high-performance computer systems to analyze the reliability impact of hardware resilience schemes that are deployed in current systems. Our study has several key findings about the efficacy of many currently deployed reliability techniques such as DRAM ECC, DDR address/command parity, and SRAM ECC and parity. We also perform a methodological study, and find that counting errors instead of faults, a common practice among researchers and data center operators, can lead to incorrect conclusions about system reliability. Lastly, we use our data to project the needs of future large-scale systems. We find that SRAM faults are unlikely to pose a significantly larger reliability threat in the future, while DRAM faults will be a major concern and stronger DRAM resilience schemes will be needed to maintain acceptable failure rates similar to those found on today's systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Reducing Soft-error Vulnerability of Caches using Data Compression

With ongoing chip miniaturization and voltage scaling, particle strike-induced soft errors present increasingly severe threat to the reliability of on-chip caches. In this paper, we present a technique to reduce the vulnerability of caches to soft-errors. Our technique uses data compression to reduce the number of vulnerable data bits in the cache and performs selective duplication of more critical data-bits to provide extra protection to them. Microarchitectural simulations have shown that our technique is effective in reducing architectural vulnerability factor (AVF) of the cache and outperforms another technique. For single and dual-core system configuration, the average reduction in AVF is 5.59X and 8.44X, respectively. Also, the implementation and performance overheads of our technique are minimal and it is useful for a broad range of workloads.

Mittal, Sparsh↗
DOE OSTI2019

BonVoision: Leveraging Spatial Data Smoothness For Recovery From Memory Soft Errors

The increasing soft error rates in memory systems raise an emerging concern for modern computing systems. As a result, detectable but uncorrectable errors (DUEs) become potentially more frequent and affect HPC applications. Today, upon encountering a DUE, HPC applications crash, incurring significant performance, storage, and energy overheads. In this paper, we propose a technique to continue application execution past a DUE through the repair of the corrupted memory data by leveraging spatial data smoothness. We present BonVoision, a run-time system that intercepts DUE events, analyzes the binary to identify data elements in the structural neighborhood of the event, and fixes the corrupted data elements by interpolating from the values in their neighborhood. Our evaluation demonstrates that BonVoision incurs negligible overhead and outperforms other recovery strategies by a factor of 2×, on average. We demonstrate that BonVoision also improves the efficiency of existing checkpointing/restart schemes by approximately increasing the optimal checkpoint interval by 23%.

Fang, Bo↗
DOE OSTI2025

CaliQEC: In-situ Qubit Calibration for Surface Code Quantum Error Correction

Quantum Error Correction (QEC) is essential for fault-tolerant, large-scale quantum computation. However, error drift in qubits undermines QEC performance during long computations, necessitating frequent calibration. Conventional calibration methods disrupt quantum states, requiring system downtime and rendering in situ calibration impractical. To address this challenge, we propose QECali, a novel framework that enables in situ calibration for surface codes. Our evaluation demonstrates that QECali introduces modest qubit overhead and negligible increases in execution time, offering the first practical solution for in situ calibration in surface code based quantum computation.

Fang, Xiang [University of California, Santa Barba↗
DOE OSTI2013

MPI Runtime Error Detection with MUST: Advances in Deadlock Detection

The widely used Message Passing Interface (MPI) is complex and rich. As a result, application developers require automated tools to avoid and to detect MPI programming errors. We present the Marmot Umpire Scalable Tool (MUST) that detects such errors with significantly increased scalability. We present improvements to our graph-based deadlock detection approach for MPI, which cover future MPI extensions. Our enhancements also check complex MPI constructs that no previous graph-based detection approach handled correctly. Finally, we present optimizations for the processing of MPI operations that reduce runtime deadlock detection overheads. Existing approaches often require 𝒪( p ) analysis time per MPI operation, for p processes. We empirically observe that our improvements lead to sub-linear or better analysis time per operation for a wide range of real world applications.

Hilbrich, Tobias↗
DOE OSTI2024

Identifying Meteorological Drivers for Errors in Modeled Winds along the Northern California Coast

Abstract An accurate wind resource dataset is required for assessing the potential energy yield of floating offshore wind farms that are expected along the California outer continental shelf. The National Renewable Energy Laboratory has developed and disseminated an updated wind resource dataset offshore of California, using the Weather Research and Forecasting Model, referred to as the CA20 dataset. As compared to buoy lidar measurements that have become available recently, the CA20 dataset showed significant positive biases for 100-m wind speeds along Northern California wind energy lease areas. To investigate the meteorological drivers for the model errors, we first consider two 1-yr simulations run with two different planetary boundary layer (PBL) parameterizations: the Mellor–Yamada–Nakanishi–Niino (MYNN) PBL scheme (the chosen configuration in the CA20 dataset) and the Yonsei University PBL scheme (which significantly reduces the bias in modeled winds). By comparing the 1-yr simulations to the concurrent lidar buoy observations, we find that errors are larger with the MYNN PBL scheme in warm seasons. We then dive deeper into the analysis by running simulations for short-term (3-day) case studies to evaluate the sensitivity of initial/boundary condition forcings on model results. By analyzing the short-term simulations, we find that during synoptic-scale northerly flows driven by the North Pacific high and inland thermal low, a coastal warm bias in the MYNN simulation is mainly responsible for the modeled wind speed bias by altering the boundary layer thermodynamics. The results of our analysis will help guide the creation of an updated version of the CA20 dataset.

17 WIND ENERGY↗
DOE OSTI2023

Evaluating the Interplay between Trajectory Segmentation and Mode Inference Error

Travel behavior changes are essential to transportation decarbonization. Travel diaries, consisting of sequences of trips between places, are typically used to instrument human travel behavior. However, these diaries are only as accurate as the underlying methods used to construct them. Travel diary algorithms have been a popular research topic since the advent of Global Positioning System tracking surveys. These algorithms have typically been validated using prompted recall of presegmented trips, thus disregarding the continuity of mode inference. Phone operating systems have adopted battery-conserving techniques, but the resulting data collection errors have not been studied extensively. We introduce a framework to evaluate the accuracy of trip length computations and mode inference by analyzing continuous mode-segmented trajectories for groups of trips. We then use the framework to identify the input data quality and the impact of postprocessing. Our primary inputs to this evaluation are MobilityNet, a public dataset containing information from three artificial timelines covering 15 different travel modes, and sample open-source travel diary creation algorithms from the OpenPATH project. Our framework concretely shows that the variance of the distance error drops from (0.217, 0.0848) to (o.011, 0.0407) (Android, iOS) after postprocessing. Similarly, the weighted F-scores for mode inference increase from (0.25, 0.29) to (0.60, 0.74) (iOS, Android) between random forest and geographic information system-based models. We hope that this standardized method will be adapted to evaluate other, potentially proprietary, travel diary algorithms. Finally, the results can be used to understand and improve the state of the art in the travel diary creation field.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2017

Simplified model of pinhole imaging for quantifying systematic errors in image shape

In this paper, we examine systematic errors in x-ray imaging by pinhole optics for quantifying uncertainties in the measurement of convergence and asymmetry in inertial confinement fusion implosions. We present a quantitative model for the total resolution of a pinhole optic with an imaging detector that more effectively describes the effect of diffraction than models that treat geometry and diffraction as independent. This model can be used to predict loss of shape detail due to imaging across the transition from geometric to diffractive optics. We find that fractional error in observable shapes is proportional to the total resolution element we present and inversely proportional to the length scale of the asymmetry being observed. Finally, we have experimentally validated our results by imaging a single object with differently sized pinholes and with different magnifications.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

Two-color pyrometry system to eliminate optical errors for spatially resolved measurements in flames

Two color (2C) pyrometry has long been used to measure flame temperature and soot concentration from radiative emission in flames. While 2C pyrometry is not an absolute measurement in non-axisymmetric flames (such as diesel spray combustion) it is a desirable diagnostic for semi-quantitative or qualitative measurements since it requires minimal optical access and can utilize high-speed imaging to attain exceptional temporal and spatial resolution. In this work, an improved optical configuration of 2C pyrometry is presented that 1) eliminates optical errors inherent in other designs, and 2) uses off-the-shelf optics and a single camera . In particular, this work analyzes the impact of parallax and path length differences on the 2C pyrometry measurement and exemplifies how the present design eliminates associated errors by design rather than in post-processing. Finally, the theoretical range of measurements were generated a priori and overlaid with experimental data to illustrate the dynamic range over which 2C pyrometry can determine the soot concentration and temperature in theory and in practice.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Towards a study protocol: A data-driven workflow to identify error sources in direct ink write mechatronics

Abstract Using Direct Ink Write (DIW) technology in a rapid and large-scale production requires reliable quality control for printed parts. Data streams generated during printing, such as print mechatronics, are massive and diverse which impedes extracting insights. In our study protocol approach, we developed a data-driven workflow to understand the behavior of sensor-measured X- and Y- axes positional errors with process parameters, such as print velocity and velocity control. We uncovered patterns showing that instantaneous changes in the velocity, when the build platform accelerates and decelerates, largely influence the positional errors, especially in the X- axis due to the hardware architecture. Since DIW systems share similar mechatronic inputs and outputs, our study protocol approach is broadly applicable and scalable across multiple systems. Graphical abstract

36 MATERIALS SCIENCE↗
DOE OSTI2017

Identifying and Correcting Timing Errors at Seismic Stations in and around Iran

A fundamental component of seismic research is the use of phase arrival times, which are central to event location, Earth model development, and phase identification, as well as derived products. Hence, the accuracy of arrival times is crucial. However, errors in the timing of seismic waveforms and the arrival times based on them may go unidentified by the end user, particularly when seismic data are shared between different organizations. Here, we present a method used to analyze travel-time residuals for stations in and around Iran to identify time periods that are likely to contain station timing problems. For the 14 stations with the strongest evidence of timing errors lasting one month or longer, timing corrections are proposed to address the problematic time periods. Finally, two additional stations are identified with incorrect locations in the International Registry of Seismograph Stations, and one is found to have erroneously reported arrival times in 2011.

58 GEOSCIENCES↗
DOE OSTI2023

Status of Error Correction Studies in Support of FFA@CEBAF

In pursuit of higher energy at the Continuous Electron Beam Accelerator Facility (CEBAF), the FFA@CEBAF energy upgrade study is considering the implementation of a novel technology to recirculate electron beam through the accelerating gradient of the machine more times. The technology in question is Fixed-Field Alternating-gradient (FFA) bending accelerator arcs: these arcs may replace the present highest energy electromagnetic (EM) arcs, and due to a much wider energy acceptance allow several more passes. The survey and beam error tolerance of the FFA arcs need to be well understood prior to commissioning, in addition to the limits of planned correction magnets and diagnostics. This work explores the current state of error tolerance and correction studies in FFA arcs at CEBAF.

Benesch, J.↗
DOE OSTI2024

FFA@CEBAF beam transport error and tolerance simulation studies

The Continuous Electron Beam Accelerator Facility (CEBAF) is a 12 GeV recirculating electron accelerator at the Thomas Jefferson National Accelerator Facility (JLAB). Major upgrades to the accelerator are being investigated which include a new 650 MeV injection beamline and state-of-the-art fixed-field alternating (FFA) gradient recirculation arcs. The upgrade will extend the energy of the electron beam to over 20 GeV. In this paper, we provide an error and tolerance simulation study of the amended beam optics transport of the existing accelerator tuned for 22 GeV operation. The study is conducted with the particle tracking codes elegant and Bmad in two parts. In the first part, we treat each section of the accelerator (electromagnetic arcs and linacs) modularly with ideal conditions at the beginning. The second part is a pseudo start-to-end (S2E) simulation with accumulated errors propagating from one beamline to the next.

Accelerator Physics↗
DOE OSTI2024

Error-correcting codes for fermionic quantum simulation

Utilizing the framework of \mathbb{Z}_2 ℤ 2 lattice gauge theories in the context of Pauli stabilizer codes, we present methodologies for simulating fermions via qubit systems on a two-dimensional square lattice. We investigate the symplectic automorphisms of the Pauli module over the Laurent polynomial ring. This enables us to systematically increase the code distances of stabilizer codes while fixing the rate between encoded logical fermions and physical qubits. We identify a family of stabilizer codes suitable for fermion simulation, achieving code distances of d=2,3,4,5,6,7, allowing correction of any \lfloor \frac{d-1}{2} \rfloor ⌊ d − 1 2 ⌋ -qubit error. In contrast to the traditional code concatenation approach, our method can increase the code distances without decreasing the (fermionic) code rate. In particular, we explicitly show all stabilizers and logical operators for codes with code distances of d=3,4,5. We provide syndromes for all Pauli errors and invent a syndrome-matching algorithm to compute code distances numerically.

Physics↗
DOE OSTI2013

Precomparator and postcomparator errors in monopulse.

Monopulse radar is a well-established technique for extracting accurate target location information in the presence of target scintillation. It relies on the comparison of at least two patterns being received simultaneously by the antenna. These two patterns are designed to differ in the direction in which we wish to obtain the target angle information. The two patterns are compared to each other through a standard method, typically by forming the ratio of the difference of the patterns to the sum of the patterns. The key to accurate angle information using monopulse is that the mapping function from the target angle to this ratio is well-behaved and well-known. Errors in the amplitude and phase of the signals prior and subsequent to the comparison operation affect the mapping function. The purpose of this report is to provide some intuition into these error effects upon the mapping function.

Bickel, Douglas Lloyd↗
DOE OSTI2015

Detecting Soft Errors in Stencil based Computations

Given the growing emphasis on system resilience, it is important to develop software-level error detectors that help trap hardware-level faults with reasonable accuracy while minimizing false alarms as well as the performance overhead introduced. We present a technique that approaches this idea by taking stencil computations as our target, and synthesizing detectors based on machine learning. In particular, we employ linear regression to generate computationally inexpensive models which form the basis for error detection. Our technique has been incorporated into a new open-source library called SORREL. In addition to reporting encouraging experimental results, we demonstrate techniques that help reduce the size of training data. We also discuss the efficacy of various detectors synthesized, as well as our future plans.

97 MATHEMATICS AND COMPUTING↗