Coordinated Atomic Actions have been proven successful for building dependable distributed systems due to their support for error recovery for both competitive and cooperative concurrent activities. This chapter introduces the formal specification of Coordinated Atomic Actions emphasizing the formalization of proposed dependability mechanisms using the B formal method. The specification then al...

This paper derives an improved sphere-packing (ISP) bound targeting codes of short to moderate block lengths. We first review the 1967 sphere-packing (SP67) bound for discrete memoryless channels, and a recent improvement by Valembois and Fossorier. These concepts are used for the derivation of a new lower bound on the decoding error probability (referred to as the ISP bound) which is uniformly...

A system making optimal use of available information in incremental language comprehension might be expected to use linguistic knowledge together with current input to revise beliefs about previous input. Under some circumstances, such an error-correction capability might induce comprehenders to adopt grammatical analyses that are inconsistent with the true input. Here we present a formal model...

Spectral deferred correction (SDC) methods for solving ordinary differential equations (ODEs) were introduced by Dutt, Greengard and Rokhlin, [3]. In this paper, we study the properties of these integral deferred correction methods, constructed using high order integrators in the prediction and correction loops, and various distributions of quadrature nodes. The smoothness of the error vector a...

Misspelling and misconception resulting from similar pronunciation appears frequently in Chinese texts. Without double check-up, this situation will be getting worse even with the help of Chinese input editor. It is hoped that the quality of Chinese writing would be enhanced if an effective automatic error detection and correction mechanism is embedded in text editor. Therefore, the burden of m...

The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed. They also introduce a novel trellis design procedure for the proposed codes. It is shown that the trellises of the designed codes are similar to...

In this paper, we introduce a novel technique to improve surface mesh quality while maintaining all essential surface characteristics. In contrast to previous methods we do not constrain node movement to the underlying discrete surface. Instead our approach allows keeping resultant mesh very close to the surface approximated by the original mesh. Proposed method is explicit, that is we do not n...

This paper considers the problem of channel coding with a given (possibly suboptimal) decoding rule. Finite-length upper and lower bounds on the random-coding error probability for a general codeword distribution are given. These bounds are applied to three random-coding ensembles: i.i.d., constant-composition, and cost-constrained. Ensembletight error exponents are presented for each ensemble,...

The CA action concept has been proven successful for building dependable distributed systems due to its support for error recovery for both competitive and cooperative concurrent actions. This paper introduces the formal specification of dependability mechanisms offered by CA actions using the B formal method, from which an XML-based language is derived. The resulting language then allows devel...

Page 146ff. Section 3.1.2.1 Different Strategies for Deriving Edge Correction Weights Both, “Stoyan edge correction” and “Ohser edge correction” were published by Ohser and Stoyan (1981). The Stoyan edge correction is also called “translation edge correction”, and the “Ripley edge correction” is also called “Isotropic edge correction”. An early summary of edge correction methods is given in Rip...