The paper presents a new approach to transparent BIST for wordoriented RAMs which is based on the transformation of March transparent test algorithms to the symmetric versions. This approach allows to skip the signature prediction phase inherent to conventional transparent memory testing and therefore to significantly reduce test time. The hardware overhead and fault coverage of the new BIST sc...

The binary hypercube Qn has small diameter, but a relatively large number of links. Because of this, efforts have been made to determine the maximum number of links that can be deleted without increasing the diameter. However, the resulting networks are not vertex-symmetric. We propose a family of vertex-symmetric spanning subnetworks of Qn, whose diameter differs from that of Qn by only a smal...

Protocols to solve several distributed issues, such as name service, mutual exclusion, and creation of an atomic shared register, require two types of subsets with intersection property. Distributed matchmaking provides a method of creating the subsets, and the lower bound of the number of messages t o solve the issues. This paper discusses the fault-tolerant and weighted case, in which a proto...

In this paper we present low -cost, concurrent checking methods for multiple error detection in S-boxes of symmetric block ciphers. These are redundancy-based fault detection schemes. We describe some studies of parity based concurrent error detection in S-boxes. Probability of multiple error detection is analyzed for random data. In this work 48-input, 32-output substitution blocks are taken i...

There is recently an interest in test generation for reversible circuits, but nothing has been published about fault localization in such circuits. This paper deals with fault localization for binary reversible (permutative) circuits. We concentrate on functional test based fault localization, to detect and locate “stuck-at” faults in a reversible circuit by creating an adaptive tree. A strikin...

A small modi cation to the interactive convergence clock synchronization algorithm allows it to tolerate a larger number of simple faults than the standard algorithm, without reducing its ability to tolerate arbitrary or \Byzantine" faults. Because the extended caseanalysis required by the new fault model complicates the already intricate argument for correctness of the algorithm, it has been s...

A small modification to the interactive convergence clock synchronization algorithm allows it to tolerate a larger number of simple faults than the standard algorithm, without reducing its ability to tolerate arbitrary or “Byzantine” faults. Because the extended case-analysis required by the new fault model complicates the already intricate argument for correctness of the algorithm, it has been...

Twenty-one ^110& symmetric tilt grain boundaries ~GB’s! are investigated with atomistic simulations, using an embedded-atom method ~EAM! potential for a low stacking-fault energy fcc metal. Lattice statics simulations with a large number of initial configurations are used to identify both the equilibrium and metastable structures at 0 K. The level of difficulty in finding the equilibrium struct...

in this paper we introduce two symmetric variants of amenability, symmetric module amenability and symmetric connes amenability. we determine symmetric module amenability and symmetric connes amenability of some concrete banach algebras. indeed, it is shown that $ell^1(s)$ is  a symmetric $ell^1(e)$-module amenable if and only if $s$ is amenable, where $s$ is an inverse semigroup with subsemigr...