Residual Error Rate Research Articles

Research on the integrated failure analysis method of safety and security of fieldbus transmitters

Fieldbus transmitters are commonly used in modern industrial productions, particularly in Safety Instrumented Systems (SIS). Safety and security are critical considerations in the design and operation of these transmitters. Previous research has tended to address safety issues and security issues separately, but with the increasing complexity of network technology, it is important to analyze them simultaneously. In this paper, a systematic framework for comprehensively analyzing random failures and cyber-attack failures is proposed. The framework adopts the FMEA-IMEA method, which combines Failure Modes and Effects Analysis (FMEA) and Intrusion Modes and Effects Analysis (IMEA), to analyze failure modes and effects of fieldbus transmitters. In addition, by extending Reliability Block Diagrams (RBD), the impact of random failures and cyber-attack failures on fieldbus transmitters is quantitatively determined. At the same time, calculation approach of the residual error rate (RER), Component counting method, and Monte Carlo are used to determine random failure rate and cyber-attack failure rate. Using fieldbus pressure transmitter and fieldbus temperature transmitter as examples, the results demonstrate that security issues can significantly impact the safety integrity level. In fact, the safety integrity level is reduced from SIL3 to SIL1 when cyber-attacks are considered. Compared to existing FMEA, the proposed approach offers a more comprehensive analysis of random failures and cyber-attack failures in fieldbus transmitters.

Impact of monitoring approaches on data quality in clinical trials.

Source data verification (SDV) has been reported to account for up to 25% of the budget in clinical trials (CT) and cost-benefit of SDV has been questioned. Guidelines for risk-based monitoring (RBM) were published in 2013 by agencies and in 2016, ICH-GCP-E6-(R2) added a requirement for risk-based approaches. This report will perform a comparison of the impact of RBM vs classic monitoring (CM) on data quality (defined as accuracy of data reporting from source data to final trial data) and expected impact on costs of CTs. Data on residual errors from four, large comparable randomised CTs were examined by post-trial SDV. Observed discrepancies were analysed in the categories of "overall" data, "major efficacy" and "major safety". In each category, the residual error rate was calculated as the number of discrepancies divided by the number of data-fields verified. A total of 1 716 087 data points were verified using CM and 323 174 using RBM. The overall error rate was 0.40% for RBM and 0.37% for CM (P < 0.01). For major efficacy, defined by risk assessment, the error rate was 0.15% and 0.28% (P < 0.0001); in major safety, defined by risk assessment, the error rate was 0.49% and 0.67% (P = 0.15), both in favour of the RBM approach. These empirical data, directly comparing RBM with CM, suggest that RBM improves data quality regarding data-points of major importance to trial outcomes, efficacy and major safety. Overall, the RBM approach showed a correlation to reduced amount of data collection errors with major relevance for interpretation of study results and subject safety as well as reducing on-site monitoring and data cleaning resources.

Splitting Sequences for Coding and Hybrid Incremental ARQ with Fragment Retransmission

This paper proposes a code defined on a finite ring ℤpM, where pM = 2m−1 is a Mersenne prime, and m is a binary size of ring elements. The code is based on a splitting sequence (splitting set) S, defined for the given multiplier set E=±20, ±21,…, ±2m−1. The elements of E correspond to the weights of binary error patterns that can be corrected, with the bidirectional single-bit error being the representative that occurs the most. The splitting set splits the code-word into sub-words, which inspired the name splitting code. Each sub-word, provided with auxiliary control symbols that are a byproduct of the coding procedure, corrects a single symbol error. The code can be defined, with some constraints, for general Mersenne numbers as well, while the multiplier set can be adjusted for adjacent binary errors correction. The application proposed for this code is a hybrid three-stage incremental ARQ procedure that transmits the code-word in the first stage, auxiliary control symbols in the second stage, and retransmits the sub-words detected as incorrect in the third stage. At each stage, error correction can be turned on or off, keeping both the retransmission rate and residual error rate at a low level.

An Adaptive Fuzzy based FEC Algorithm for Robust Video Transmission over Wireless Networks

Forward Error Correction (FEC) is a commonly adopted mechanism to mitigate packet loss/bit error during real-time communication. An adaptive, Fuzzy based FEC algorithm to provide a robust video quality metric for multimedia transmission over wireless networks has been proposed to optimize the redundancy of the generated code words from a Reed-Solomon encoder and to save the bandwidth of the network channel. The scheme is based on probability estimations derived from the data loss rates related to the recovery mechanism at the client end. By applying the adaptive FEC, the server uses the reports to predict the next network loss rate using a curve-fitting technique to generate the optimized number of redundant packets to meet specific residual error rates at the client end. Simulation results in the cellular system show that the video quality is massively adapted to the optimized FEC codes based on the probability of packet loss and packet correlation in a wireless environment.

Clinical Results After Precision Pulse Capsulotomy.

PurposeTo compare residual refractive error and complication rates between eyes undergoing a manual capsulotomy and those receiving a precision pulse capsulotomy using an automated device.Patients and MethodsThis study was a non-interventional two-arm retrospective chart review of clinical results after bilateral cataract surgery or refractive lens exchange (RLE) surgery with a monofocal toric intraocular lens (IOL) or a trifocal IOL where a manual capsulorhexis (Manual) or automated precision pulse capsulotomy (PPC) was performed.ResultsExams from 243 eyes (122 PPC, 121 Manual) from 124 patients were reviewed; about 75% of which had a trifocal IOL implanted. There was no statistically significant difference in the MRSE with either IOL type, or overall. The overall percentage of eyes with residual refractive cylinder ≤ 0.50 D was significantly higher in the PPC group (89% vs. 79% in the manual group, p = 0.03), primarily driven by results with the toric IOL. Best corrected distance visual acuity was not statistically significantly different by group. Capsulotomy-related complications were lower in the PPC group relative to the manual group (4.1% vs. 6.6%), but this result was not statistically significant (p = 0.38).ConclusionSignificantly more eyes had refractive cylinder ≤0.50 D in the PPC group. For all other measures, the automated PPC device produced clinical results equivalent to those achieved with a manual capsulorhexis.

Investigation of viscous dissipation and entropy generation in third grade nanofluid flow over a stretched riga plate with Cattaneo-Christov Double Diffusion (CCDD) model

Fluid flow and heat transport by a stretched surface is most important and significant area of research in mechanical and industrial engineering due to numerous applications. The influence of heat transport is seen in the field of polymer processing, metallurgy and chemical engineering, manufacturing of artificial films, food stuff processing, aerodynamics extrusion of plastic sheets, hot rolling, glass fiber production, metal spinning, metal extrusion, drawing of plastic films and wires and paper production. In view of the above applications, we have modeled two-dimensional, steady and incompressible flow of non-Newtonian fluid (third grade) over a stretched Riga surface with Cattaneo-Christov Double Diffusion (CCDD) model. Stagnation point flow is considered and the flow is generated due to stretched Riga surface. Furthermore, Cattaneo-Christov Double Diffusion concept is used instead of Fourier’s and Fick’s laws to model the energy and concentration equations. Important slip mechanisms of Buongiorno nanofluid model i.e., Brownian motion and thermophoresis diffusion are considered for the transportation of heat and mass transfer. Nield condition is imposed at the stretched boundary surface. Total entropy rate is calculated and discussed through second law of thermodynamics and important pertinent flow parameters. Appropriate similarity variable leads to system of ordinary ones and total residual error and convergence rate are obtained via Optimal Homotopy Analysis Method (OHAM). The influence of parameters on the velocity, temperature, concentration and skin friction coefficient are discussed graphically.

Lightweight hamming product code based multiple bit error correction coding scheme using shared resources for on chip interconnects

In this paper, we present multiple bit error correction coding scheme based on extended Hamming product code combined with type II HARQ using shared resources for on chip interconnect. The shared resources reduce the hardware complexity of the encoder and decoder compared to the existing three stages iterative decoding method for on chip interconnects. The proposed method of decoding achieves 20% and 28% reduction in area and power consumption respectively, with only small increase in decoder delay compared to the existing three stage iterative decoding scheme for multiple bit error correction. The proposed code also achieves excellent improvement in residual flit error rate and up to 58% of total power consumption compared to the other error control schemes. The low complexity and excellent residual flit error rate make the proposed code suitable for on chip interconnection links.

Performance evaluation of a DVB‐S2 system with a digital optical feeder link

SummaryWe investigate the physical layer performance of a DVB‐S2 system with a digital optical feeder link. We consider three scenarios depending on how the DVB‐S2 modulator functionalities are distributed between the optical gateway and the satellite. Our main objective is to specify the residual bit error rate of the optical channel error correction scheme in order to ensure a quasierror free link to the users. To that end, we provide theoretical models and/or simulations results. In two scenarios, our results show that a residual bit error rate of 10−4 (assuming equally distributed errors) gives end‐to‐end physical layer performance compliant with the DVB‐S2 standard. This specification is much higher than typical values in practical systems.

Age-related alterations in inhibitory control investigated using the minimally delayed oculomotor response task.

Healthy, older adults are widely reported to experience cognitive decline, including impairments in inhibitory control. However, this general proposition has recently come under scrutiny because ageing effects are highly variable between individuals, are task dependent, and are sometimes not distinguished from general age-related slowing. We recently developed the minimally delayed oculomotor response (MDOR) task in which participants are presented with a simple visual target step, and instructed to saccade not to the target when it appears (a prosaccade response), but when it disappears (i.e. on target offset). Varying the target display duration (TDD) prevents offset timing being predictable from the time of target onset, and saccades prior to the offset are counted as errors. A comparison of MDOR task performance in a group of 22 older adults (mean age 62 years, range 50–72 years) with that in a group of 39 younger adults (22 years, range 19–27 years) demonstrated that MDOR latency was significantly increased in the older group by 34–68 ms depending on TDD. However, when MDOR latencies were corrected by subtracting the latency observed in a standard prosaccade task, the latency difference between groups was abolished. There was a larger latency modulation with TDD in the older group which was observed even when their generally longer latencies were taken into account. Error rates were significantly increased in the older group. An analysis of the timing distribution of errors demonstrated that most errors were failures to inhibit responses to target onsets. When error distributions were used to isolate clear inhibition failures from other types of error, the older group still exhibited significantly higher error rates as well as a higher residual error rate. Although MDOR latency in older participants may largely reflect a general slowing in the oculomotor system with age, both the latency modulation and error rate results are consistent with an age-related inhibitory control deficit. How this relates to performance on other inhibitory control tasks remains to be investigated.

Efficient learning with intelligent tutoring across cultures

Science and engineering departments face high student attrition due to perceived difficulty of courses in these disciplines. To subdue student attrition, students need to be guided by individual tutors to help them learn, practice and test their understanding of concepts. However, due to the exorbitant cost and time involved, this is not practical. In this article, we argue that computer-based tutors authored by teachers can serve as a useful tool to assist student learning in challenging scientific concepts. About 8,000 fine-grained interactions with our tutor by 72 students in two countries—USA and Philippines—were analysed in the framework of learning curve theory to estimate prior knowledge, learning rate and residual error rate to gauge tutor efficiency. Computer-based tutors accelerate learning and such tutors are viable, effective, and facile options to improve student learning.

Efficient learning with intelligent tutoring across cultures

Science and engineering departments face high student attrition due to perceived difficulty of courses in these disciplines. To subdue student attrition, students need to be guided by individual tutors to help them learn, practice and test their understanding of concepts. However, due to the exorbitant cost and time involved, this is not practical. In this article, we argue that computer-based tutors authored by teachers can serve as a useful tool to assist student learning in challenging scientific concepts. About 8,000 fine-grained interactions with our tutor by 72 students in two countries—USA and Philippines—were analysed in the framework of learning curve theory to estimate prior knowledge, learning rate and residual error rate to gauge tutor efficiency. Computer-based tutors accelerate learning and such tutors are viable, effective, and facile options to improve student learning.Keywords: Intelligent tutoring, physics education, engineering education, educational technology.

Power optimization for multiple QoS, delay, and BER classes relying on finite-delay information theory

Future communication systems will include diffierent types of messages requiring diffierent transmission rates, packet lengths, and service qualities. We address the power-optimization issues of communication systems conveying multiple message types based on finite-delay information theory. Given both the normalized transmission rate and the packet length of a system, the actual residual decoding error rate is a function of the transmission power. We propose a generalized power allocation framework for multiple message types. Two diffierent optimization cost functions are adopted: the number of service-quality violations encountered and the sum log ratio of the residual decoding error rate. We provide the optimal analytical solution for the former cost function and a heuristic solution based on a genetic algorithm for the latter one. Finally, the performance of the proposed solutions are evaluated numerically.

Surface code error correction on a defective lattice

The yield of physical qubits fabricated in the laboratory is much lower than that of classical transistors in production semiconductor fabrication. Actual implementations of quantum computers will be susceptible to loss in the form of physically faulty qubits. Though these physical faults must negatively affect the computation, we can deal with them by adapting error-correction schemes. In this paper we have simulated statically placed single-fault lattices and lattices with randomly placed faults at functional qubit yields of 80%, 90%, and 95%, showing practical performance of a defective surface code by employing actual circuit constructions and realistic errors on every gate, including identity gates. We extend Stace et al's superplaquettes solution against dynamic losses for the surface code to handle static losses such as physically faulty qubits []. The single-fault analysis shows that a static loss at the periphery of the lattice has less negative effect than a static loss at the center. The randomly faulty analysis shows that 95% yield is good enough to build a large-scale quantum computer. The local gate error rate threshold is , and a code distance of seven suppresses the residual error rate below the original error rate at . 90% yield is also good enough when we discard badly fabricated quantum computation chips, while 80% yield does not show enough error suppression even when discarding 90% of the chips. We evaluated several metrics for predicting chip performance, and found that the average of the product of the number of data qubits and the cycle time of a stabilizer measurement of stabilizers gave the strongest correlation with logical error rates. Our analysis will help with selecting usable quantum computation chips from among the pool of all fabricated chips.

A Soft Input Decoding Algorithm for Generalized Concatenated Codes

This paper proposes a soft input decoding algorithm and a decoder architecture for generalized concatenated (GC) codes. The GC codes are constructed from inner nested binary Bose–Chaudhuri–Hocquenghem (BCH) codes and outer Reed–Solomon codes. In order to enable soft input decoding for the inner BCH block codes, a sequential stack decoding algorithm is used. Ordinary stack decoding of binary block codes requires the complete trellis of the code. In this paper, a representation of the block codes based on the trellises of supercodes is proposed in order to reduce the memory requirements for the representation of the BCH codes. This enables an efficient hardware implementation. The results for the decoding performance of the overall GC code are presented. Furthermore, a hardware architecture of the GC decoder is proposed. The proposed decoder is well suited for applications that require very low residual error rates.

New considerations for SIL verification of functional safety fieldbus communication

Safety integrity level (SIL) verification of functional safety fieldbus communication is an essential part of SIL verification of safety instrumented system (SIS), and it requires quantifying residual error probability (RP) and residual error rate of function safety communication. The present quantification method of residual error rate uses RP of cyclic redundancy check (CRC) to approximately replace the total RP of functional safety communication. Since CRC only detects data integrity-related errors and CRC has intrinsically undetected error, some other residual errors are not being considered. This research found some residual errors of the present quantification method. Then, this research presents an extended new approach, which takes the found residual errors into account to determine more comprehensive and reasonable RP and residual error rate. From perspective of the composition of safety message, this research studies RPs of those controlling segments (sequence number, time expectation, etc.) to cover the found residual errors beyond CRC detection coverage, and the influences of insertion/masquerade errors and time window on RP are investigated. The results turn out these residual errors, especially insertion/masquerade errors, may have a great influence on quantification of residual error rate and SIL verification of functional safety communication, and they should be treated seriously.

ACOCO: Adaptive Coding for Approximate Computing on Faulty Memories

With scaling of process technologies and increase in process variations, embedded memories will be inherently unreliable. Approximate computing is a new class of techniques that relax the accuracy requirement of computing systems. In this paper, we present the A daptive Co ding for approximate Co mputing (ACOCO) framework, which provides us with an analysis-guided design methodology to develop adaptive codes for different computations on the data read from faulty memories. In ACOCO, we first compress the data by introducing distortion in the source encoder, and then add redundant bits to protect the data against memory errors in the channel encoder. We are thus able to protect the data against memory errors without additional memory overhead so that the coded data have the same bit-length as the uncoded data. We design the source encoder by first specifying a cost function measuring the effect of the data compression on the system output, and then design the source code according to this cost function. We develop adaptive codes for two types of systems under ACOCO. The first type of systems we consider, which includes many machine learning and graph-based inference systems, is the systems dominated by product operations. We evaluate the cost function statistics for the proposed adaptive codes, and demonstrate its effectiveness via two application examples: max-product image denoising and naive Bayesian classification. Next, we consider another type of systems: iterative decoders with min operation and sign-bit decision, which are widely applied in wireless communication systems. We develop an adaptive coding scheme for the min-sum decoder subject to memory errors. A density evolution analysis and simulations on finite length codes both demonstrate that the decoder with our adaptive code achieves a residual error rate that is on the order of the square of the residual error rate achieved by the nominal min-sum decoder.

Primer ID Validates Template Sampling Depth and Greatly Reduces the Error Rate of Next-Generation Sequencing of HIV-1 Genomic RNA Populations

Validating the sampling depth and reducing sequencing errors are critical for studies of viral populations using next-generation sequencing (NGS). We previously described the use of Primer ID to tag each viral RNA template with a block of degenerate nucleotides in the cDNA primer. We now show that low-abundance Primer IDs (offspring Primer IDs) are generated due to PCR/sequencing errors. These artifactual Primer IDs can be removed using a cutoff model for the number of reads required to make a template consensus sequence. We have modeled the fraction of sequences lost due to Primer ID resampling. For a typical sequencing run, less than 10% of the raw reads are lost to offspring Primer ID filtering and resampling. The remaining raw reads are used to correct for PCR resampling and sequencing errors. We also demonstrate that Primer ID reveals bias intrinsic to PCR, especially at low template input or utilization. cDNA synthesis and PCR convert ca. 20% of RNA templates into recoverable sequences, and 30-fold sequence coverage recovers most of these template sequences. We have directly measured the residual error rate to be around 1 in 10,000 nucleotides. We use this error rate and the Poisson distribution to define the cutoff to identify preexisting drug resistance mutations at low abundance in an HIV-infected subject. Collectively, these studies show that >90% of the raw sequence reads can be used to validate template sampling depth and to dramatically reduce the error rate in assessing a genetically diverse viral population using NGS. Although next-generation sequencing (NGS) has revolutionized sequencing strategies, it suffers from serious limitations in defining sequence heterogeneity in a genetically diverse population, such as HIV-1 due to PCR resampling and PCR/sequencing errors. The Primer ID approach reveals the true sampling depth and greatly reduces errors. Knowing the sampling depth allows the construction of a model of how to maximize the recovery of sequences from input templates and to reduce resampling of the Primer ID so that appropriate multiplexing can be included in the experimental design. With the defined sampling depth and measured error rate, we are able to assign cutoffs for the accurate detection of minority variants in viral populations. This approach allows the power of NGS to be realized without having to guess about sampling depth or to ignore the problem of PCR resampling, while also being able to correct most of the errors in the data set.

Enhanced Low Complex Double Error Correction Coding with Crosstalk Avoidance for Reliable On-Chip Interconnection Link

As the technology scales down, shrinking geometry and layout dimension, on- chip interconnects are exposed to different noise sources such as crosstalk coupling, supply voltage fluctuation and temperature variation that cause random and burst errors. These errors affect the reliability of the on-chip interconnects. Hence, error correction codes integrated with noise reduction techniques are incorporated to make the on-chip interconnects robust against errors. The proposed error correction code uses triplication error correction scheme as crosstalk avoidance code (CAC) and a parity bit is added to it to enhance the error correction capability. The proposed error correction code corrects all the error patterns of one bit error, two bit errors. The proposed code also corrects 7 out of 10 possible three bit error patterns and detects burst errors of three. Hybrid Automatic Repeat Request (HARQ) system is employed when burst errors of three occurs. The performance of the proposed codec is evaluated for residual flit error rate, codec area, power, delay, average flit latency and link energy consumption. The proposed codec achieves four magnitude order of low residual flit error rate and link energy minimization of over 53 % compared to other existing error correction schemes. Besides the low residual flit error rate, and link energy minimization, the proposed codec also achieves up to 4.2 % less area and up to 6 % less codec power consumption compared to other error correction codes. The less codec area, codec power consumption, low link energy and low residual flit error rate make the proposed code appropriate for on chip interconnection link.

On the Design of Hybrid Automatic Repeat Request Schemes with Unreliable Feedback

\gls{HARQ} schemes are employed in mobile communication systems to reduce the residual Frame Error Rate (FER) after channel decoding. If decoding fails, the receiver requests the transmission of additional redundancy about these frames to improve the decoding success. Signaling is carried out over a feedback link from the receiver back to the transmitter. However, errors on the feedback link severely influence the behavior of the HARQ system and may degrade the overall system performance. In this contribution, the impact of HARQ signaling errors on the FER, the average number of HARQ transmissions per frame, and the system throughput is investigated. We derive analytical expressions for all performance measures based on FER simulations of the HARQ system with reliable feedback. The theoretical results are verified by the example of the LTE physical layer, however, they are also applicable to other communication systems. Moreover, target requirements for the maximum tolerable feedback error probabilities are derived which are used to develop design guidelines for HARQ feedback transceivers.

Light brown apple moth (Epiphyas postvittana) (Lepidoptera: Tortricidae) colonization of California

In response to the confirmed detection of the light brown apple moth, Epiphyas postvittana, in California, approximately 53,000 pheromone-baited Jackson traps were deployed and more than 246,000 males were caught (February 2007–February 2010). Approximately 46,000 manually entered catch records were corrected for errors and converted into catch per trap per day. As empty trap data (zeros) were not recorded, we added zeros between first and last catch for each trap based on the stated servicing period (~30,000), before analyzing for trends. Residual data error rate was estimated as 1.5 %. San Francisco and Santa Cruz counties had relatively high trap catches immediately upon trap set, and remained the leading population centers, while most other counties showed a more general trend of a slow build-up in catch over time (12 counties). An exponential increase in trap catch was observed in four counties with sufficient data. The pattern of spread indicated natural, as well as anthropogenic-assisted spread rates, with populations appearing well ahead of the invasion front. This jump dispersal is probably due to movement of host plants, unsurprising since eggs of this polyphagous moth are readily laid on foliage. There was evidence of seasonality in spread, probably linked to the phenology of the insect. There was a positive relationship between catch and known host tree preference, suggesting that trap placement in preferred hosts could add sensitivity to future surveys. Recommendations include the improved provision of data acquisition by telecommunications, standardization of data input, more archiving, and frequent analysis of trap catches. The rapid rate of population growth demonstrated in two counties and spread across many others supports the hypothesis of the recent arrival of E. postvittana in California.