Approximate Agreement is an important issue in faulttolerant distributed computing where non-faulty processes exchange and vote upon their local values, to arrive at values which are within the range of the initial values of the nonfaulty processes and within a predefined tolerance of each other. Results to date in Approximate Agreement, however, are not capable of exploiting omission faults. O...

We propose a new approach to quantifying fault system geometry, using an objective fit of the fault geometry to a test function, specifically here a fault branch. Fitting a “Y” shaped object using a cost function to dextral faults in California, we find a number of significant results arising from using a systematic, objective, quantitative approach. (1) The largest angle of the branch structur...

in this research, a new mathematical modeling on strength changes due to reservoir elastic stresses across the preexisting fault plane is introduced. the method has been applied to the dalpari fault, which is one of the potential seismic sources in the vicinity of the karkheh reservoir. in this method the distribution of total stress across the fault cannot be determined because the initial str...

Recursive dual-net (RDN) is a newly proposed interconnection network for massive parallel computers. The RDN is based on recursive dual-construction of a symmetric base-network. A k-level dualconstruction for k > 0 creates a network containing (2n0) k /2 nodes with node-degree d0 + k, where n0 and d0 are the number of nodes and the node-degree of the base network, respectively. The RDN is a sym...

A video transmission system is presented based on the 3-D SPIHT algorithm for video compression and turbo codes for channel error protection. The channel considered is a binary symmetric channel with packet erasures, used for modeling the concatenation of a congested wired link followed by a noisy wireless hop. Unequal error protection with turbo codes is used for providing strong channel prote...

The security of cryptographic algorithms can be considered in two contexts. On the one hand, these algorithms can be proven secure mathematically. On the other hand, physical attacks can weaken the implementation of an algorithm yet proven secure. Under the common name of physical attacks, different attacks are regrouped: side channel attacks and fault injection attacks. This paper presents a c...

A method for improving the fault-tolerance of cache coherent multiprocessors is proposed. By dynamically verifying coherence operations in hardware, errors caused by manufacturing faults, soft errors, and design mistakes can be detected. Analogous to the DIVA concept for singleprocessor systems, a simple version of the protocol functions as a checker for the aggressive implementation. An exampl...

We introduce a new model of fault tolerance for Boolean circuits. We consider synchronized circuits and we allow an adversary to choose a small constant fraction of the gates at each level of the circuit to be faulty. We require that even in the presence of such faults the circuit compute a \loose version" of the given function. We show that every symmetric function has a small (size O(n), dept...

An adaptive tracking control problem is investigated for a class of nonlinear system with non-symmetric actuator dead-zone fault. Based on adaptive compensation algorithm, a new adaptive controller specially designed is employed without constructing the dead-zone inverse. This paper studies the dead-zone fault model is more universal. The restrictions that the dead-zone slopes and the boundarie...