Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error detection”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1980

Software reliability: A comparison of results obtained from established software reliability models

Two models of the software error detection process are compared, the Jelinski-Moranda model and a Bayes inference model. Simulation techniques are used to generate software related system failure data which is analyzed by both models. Point estimates and confidence limits are compared. It is demonstrated that uncertainty may be considerable for reasonable samples sizes and should be considered in any application of these techniques. The Jelinski-Moranda model is sensitive to the failure of data to follow internal assumptions of the model, often not providing any point estimates, a factor which may limit its usefulness in many real world situations. The Bayes model is shown to respond to the introduction of additional errors in the software correction process, a condition where error counting models such as the Jelinski-Moranda generally fail to converge.

Horn, M. H.↗
NASA NTRS1984

ARQ schemes for data transmission in mobile radio systems

The problem of providing data communications over a land mobile radio channel is considered, taking into account error detection combined with retransmission on request as a means of obtaining reliability in digital data transmission. The considered systems are referred to as automatic RQ (repeat-request) or ARQ. It is pointed out that the distinguishing features of a land mobile radio (LMR) system, as far as the ARQ protocol is concerned, are a frequency or pair of frequencies shared by a large population of half-duplex users which cannot transmit and receive simultaneously. A description is presented of those variations of ARQ which are adaptable to an LMR system. A new channel model for a fading LMR channel is developed, and several ARQ protocols and some new protocol combinations are described. The relationships are developed for a description of the various protocols in terms of channel failure probabilities. Undetected error probabilities are developed and compared.

Comroe, R. A.↗
DOE OSTI2024

Robust cooperative control strategy for a platoon of connected and autonomous vehicles against sensor errors and control errors simultaneously in a real-world driving environment

In a real-world driving environment, a platoon of connected and autonomous vehicles (CAVs) is subject to many internal and external disturbances, resulting in uncertain vehicle dynamics. In general, the disturbances can be categorized into two types: disturbances due to vehicle sensor errors (e.g., GPS error) and disturbances due to vehicle control errors (e.g., actuator delay). In the literature, many control strategies have been proposed to improve the robustness of the CAV platoon against uncertain vehicle dynamics induced by these disturbances. However, most of these strategies only consider one type of disturbance and cannot tackle both types of disturbances simultaneously. Furthermore, they are designed to maximize the benefits of each vehicle in the platoon independently, which can deteriorate the performance of the platoon. Here, to address these problems, this study proposes a robust cooperative control (RCC) strategy to maneuver the vehicles in the platoon cooperatively to counteract the impacts of both types of disturbances. The RCC strategy is developed based on a minimax problem, where the maximization subproblem seeks to find the worst inputs for the uncertainty terms in the vehicle dynamics equation to minimize the platoon performance, while the minimization subproblem seeks to find the optimal control decisions for all subsequent vehicles to maximize the platoon performance in the worst case. To solve the minimax problem, this study proposes a globally convergent solution algorithm. It can solve the minimax problem very efficiently to enable real time deployment of the RCC strategy. Numerical application indicates that compared to the existing methods, the RCC strategy can dramatically improve the robustness of the CAV platoon against the uncertain vehicle dynamics induced by both vehicle state detection errors and vehicle control errors. Therefore, it can maneuver the CAV platoon safely and efficiently in a real-world driving environment.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

Cluster-Graph Fingerprinting: A Framework for Quantitative Analysis of Machine-Learned Interatomic Model Training and Simulation Data

Machine-learned interatomic models represent a significant advancement in simulation methods, extending the predictive ability of first-principles methods to previously inaccessible length and time scales. However, the data-driven nature of these models can lead to difficult-to-detect errors that can compromise prediction accuracy. To address this challenge, we introduce a novel fingerprinting approach based on the Chebyshev Interaction Model for Efficient Simulation (ChIMES) ML-IAM graph-based descriptor. Our strategy enables efficient and statistically rigorous analysis of system configurations used in ML-IAM training and those generated by their application, e.g., in molecular dynamics simulations. We demonstrate that these fingerprints can effectively assess novelty of a configuration relative to an existing data set and determine dissimilarity among individual configurations, which are two key tasks in workflows for active learning-based ML-IAM training, data set curation, and on-the-fly uncertainty quantification.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Probing the Kitaev honeycomb model on a neutral-atom quantum computer

Quantum simulations of many-body systems are among the most promising applications of quantum computers. In particular, models based on strongly correlated fermions are central to our understanding of quantum chemistry and materials problems, and can lead to exotic, topological phases of matter. However, owing to the non-local nature of fermions, such models are challenging to simulate with qubit devices. Here we realize a digital quantum simulation architecture for two-dimensional fermionic systems based on reconfigurable atom arrays. We utilize a fermion-to-qubit mapping based on Kitaev’s model on a honeycomb lattice, in which fermionic statistics are encoded using long-range entangled states. We prepare these states efficiently using measurement and feedforward, realize subsequent fermionic evolution through Floquet engineering with tunable entangling gates interspersed with atom rearrangement, and improve results with built-in error detection. Leveraging this fermion description of the Kitaev spin model, we efficiently prepare topological states across its complex phase diagram and verify the non-Abelian spin-liquid phase by evaluating an odd Chern number. We further explore this two-dimensional fermion system by realizing tunable dynamics and directly probing fermion exchange statistics. Finally, we simulate strong interactions and study the dynamics of the Fermi–Hubbard model on a square lattice. These results pave the way for digital quantum simulations of complex fermionic systems for materials science, chemistry and high-energy physics.

atomic and molecular physics↗
DOE OSTI2024

Dynamically generated decoherence-free subspaces and subsystems on superconducting qubits

Abstract Decoherence-free subspaces and subsystems (DFS) preserve quantum information by encoding it into symmetry-protected states unaffected by decoherence. An inherent DFS of a given experimental system may not exist; however, through the use of dynamical decoupling (DD), one can induce symmetries that support DFSs. Here, we provide the first experimental demonstration of DD-generated decoherence-free subsystem logical qubits. Utilizing IBM Quantum superconducting processors, we investigate two and three-qubit DFS codes comprising up to six and seven noninteracting logical qubits, respectively. Through a combination of DD and error detection, we show that DFS logical qubits can achieve up to a 23% improvement in state preservation fidelity over physical qubits subject to DD alone. This constitutes a beyond-breakeven fidelity improvement for DFS-encoded qubits. Our results showcase the potential utility of DFS codes as a pathway toward enhanced computational accuracy via logical encoding on quantum processors.

Physics↗
DOE OSTI2025

Classical Non-Markovian Noise in Symmetry-Preserving Quantum Dynamics

In quantum dynamics, symmetries are vital for identifying and assessing conserved quantities that govern the evolution of a quantum system. When promoted to the open quantum system setting, dynamical symmetries can be negatively altered by system-environment interactions, thus, complicating their analysis. Previous work on noisy symmetric quantum dynamics has focused on the Markovian setting, despite the ubiquity of non-Markovian noise in a number of widely used quantum technologies. Here, in this Letter, we develop a framework for quantifying the impact of non-Markovian noise on symmetric quantum evolution via root space decompositions and the filter function formalism. We demonstrate analytically that symmetry-preserving noise maintains the symmetric subspace, while nonsymmetric noise leads to highly specific leakage errors that are block diagonal in the symmetry representation. We support our findings with numerical studies of a transverse-field Ising model and a quantum error detecting code subject to spatiotemporally correlated multiaxis noise. Our results are broadly applicable, providing new analytic insights into the control and characterization of open quantum system dynamics.

decoherence↗
DOE OSTI2024

Understanding Mixed Precision GEMM with MPGemmFI: Insights into Fault Resilience

Emerging deep learning workloads urgently need fast general matrix multiplication (GEMM). Thus, one of the critical features of machine-learning-specific accelerators such as NVIDIA Tensor Cores, AMD Matrix Cores, and Google TPUs is the support of mixed-precision enabled GEMM. For DNN models, lower-precision FP data formats and computation offer acceptable correctness but significant performance, area, and memory footprint improvement. While promising, the mixed-precision computation on error resilience remains unexplored. To this end, we develop a fault injection framework that systematically injects fault into the mixed-precision computation results. We investigate how the faults affect the accuracy of machine learning applications. Based on the characteristics of error resilience, we offer lightweight error detection and correction solutions that significantly improve the overall model accuracy by 75% if the models experience hardware faults. The solutions can be efficiently integrated into the accelerator's pipelines.

Fang, Bo↗
DOE OSTI2022

A Fast-Response High-Accuracy Overvoltage Protection Circuit for Soft-Switching Current-Source Converters

Although voltage-source converters (VSCs) have been a focus of research for decades and are widely applied in numerous applications, they face great challenges in short-circuit failures, high dv/dt and electromagnetic interference (EMI), especially using wide bandgap devices. Instead, current-source converters (CSCs) are attracting increasing attention in recent years owing to their friendliness to short-circuit faults, improved EMI, etc. For CSCs, overvoltage is the most catastrophic failure since the semiconductor devices can hardly withstand an overvoltage for a short pulse. In this paper, a fast-response high-accuracy overvoltage protection (OVP) circuit is proposed to protect CSCs from overvoltage damage. It also features a small form factor, good noise-immunity, friendly retrofit capability, and no need for active switches. In this paper, the operating principle and design guideline of the proposed OVP circuit is introduced. Its effectiveness is validated in soft-switching solid-state transformer (S4T) at 500 V. In experiments, the voltage detection error of less than 5% and a propagation delay of fewer than 400 ns have been achieved.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2024

Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

81-beam coherent combination using a programmable array generator

We have generated 81 independently controllable beams using a spatial light modulator and combined them on a diffractive combiner, to characterize the combiner and develop a fast phase error detection scheme. A key parameter of the diffractive combiner is measured in a new way, enabling an efficient combination when programming calibrated phases of each beam. This testbed provides a platform for development of advanced feedback phase control of high channel-count beam combination.

Du, Qiang (ORCID:0000000221969801)↗
DOE OSTI2023

Blockchain for Fault-Tolerant Grid Operations Version 2.0

This report explores the potential of distributed ledger technology (DLT) as a transformative tool to enhance fault-tolerant operations in electrical distribution systems. Leveraging DLT's core attributes, including an immutable decentralized ledger, distributed consensus mechanisms, and state replication capabilities, this study focuses on three critical use cases. A central aspect of this research centers on the utilization of a consensus-driven ledger, providing actors within the system, such as distributed resources, with access to a reliable data repository. This empowers these actors to collaborate effectively and make informed decisions, all securely recorded on the blockchain. The first use case concentrates on data configuration, utilizing mathematical criteria---particularly, the chi-squared test for gross error detection---to identify trustworthy sensors for advanced decision-making. Building upon this foundation of trust, the second use case, topology identification, accurately determines circuit breaker states, unveiling the distribution network's topology. Ultimately, the third use case leverages this trust to execute switching actions, reconfiguring feeders and restoring power to disconnected customers after fault events. The concept of trust serves as a cornerstone in this approach, marking a departure from traditional fault location, isolation, and service restoration (FLISR) methods. Additionally, the blockchain-based architecture introduces decentralization, empowering disconnected areas to make autonomous decisions, even when communication with a central control center is disrupted. The primary contributions of this report are twofold: (1) a novel approach for evaluating distribution system voltage areas while preserving data ownership and (2) the implementation of interactions between distribution network areas using the actor model. Unlike the previous sequential approach for evaluating the area connection voltages, which required a radial network topology, this study's area model reduction enables a more versatile approach. The area model reduction addresses issues of prolonged data waiting times and multiple points of failure within the previous approach. Notably, the presented evaluation for the reduced network model area connection reveals a significant increase in the differences in voltage magnitudes. Simulation and evaluation of area agents across four distinct cases elucidate the area-level interaction behavior during a fault event. Simulations demonstrate that the proposed distributed FLISR (DFLISR) approach can successfully restore service to an affected area. Varying message delays and message loss probabilities in each simulation case underscore their impacts on restoration times, ranging from 3 min and 32 s to 6 min and 19 s. In contrast, power is not restored in an area in one of our simulation cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1967

A decommutation compiler

Decommutation compiler for generating machine- language instructions and error detection in compiler language

MACHINE LANGUAGE↗
NASA NTRS1968

Self-correcting, synchronizing ring counter using integrated circuit devices

Three nand gate circuits are used to add error detection and reset logic circuitry for initiating and retaining the correct binary state in the flip-flop circuits of a ring counter. As the input signals are counted, the position of the specified state moves in ordered sequence around circuit loop.

Maasberg, W. A.↗
NASA NTRS1969

Image position sensor

Preliminary design calculations for a proposed fine guidance experiment telescope containing a four-sided pyramidal reflector indicate that 0.01 arc sec pointing, at 0.003 arc sec sensing resolution, could be achieved by viewing a +10.0 magnitude star where the total collected light energy would be applied for fine error detection.

Rosett, B.↗