Real-time systems are being increasingly used in several applications which are time-critical in nature. Fault tolerance is an essential requirement of such systems, due to the catastrophic consequences of not tolerating faults. In this paper, we study a scheme that guarantees the timely recovery from multiple faults within hard real-time constraints in uniprocessor systems. Assuming earliest-d...

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...

[1] We systematically investigate the velocity contrast along the Calaveras fault that ruptured during the 1984 Morgan Hill earthquake using fault zone head waves (FZHW) that refract along the fault interface. We stack waveforms in 353 sets of repeating clusters, and align the peaks or troughs of the direct P waves assuming rightlateral strike-slip focal mechanisms. The obtained velocity contra...

A feed forward neural network (FFNN) has been trained to discriminate between power transformer magnetizing inrush and fault currents. The training algorithm used was back-propagation, assuming initially a sigmoid transfer function for the network’s processing units (“neurons”). Once the network was trained the units’ transfer function was changed to hard limiters with thresholds equal to the b...

If f(x1, ..., xn) ∈ Z[x1, ..., xn] has the property that every integer specialization gives an integral square value, then f is itself the square of a polynomial. We also give an effective version of this result by using an effective version of a classical theorem of E. Noether along with a theorem of Lang and Weil.

The ability to detect and deal with errors when manipulating quantum systems is a fundamental requirement for fault-tolerant quantum computing. Unlike classical bits that are subject to only digital bit-flip errors, quantum bits are susceptible to a much larger spectrum of errors, for which any complete quantum error-correcting code must account. Whilst classical bit-flip detection can be reali...

Robotic manipulators working in remote or hazardous environments require additional measures to ensure their usability upon the failure of an actuator. This work considers failure modes that result in an immobilized joint and uses the concept of worst-case dexterity to deene kinematic and dynamic fault tolerance measures for redundant manipulators. These measures are then used to specify the op...

A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing depth-first search wave protocol for arbitrary rooted networks. In this protocol, a wave of computation is initiated by the root. In this wave, all the processors are sequentially visited in depth-first search order. After th...

A method for stabilizing the computation of stereo correspondences is presented in this paper. Delaunay triangulation is employed to partition the input images into small, localized regions. Instead of simply assuming that the surface patches viewed from these small triangles are locally planar, we explicitly examine the planarity hypothesis in the 3D space. To perform the planarity test robust...