Related Experiment Videos
Perfect fault tolerance of the n-k-n network
Elko B Tchernev1, Rory G Mulvaney, Dhananjay S Phatak
1Computer Science and Electrical Engineering Department, University of Maryland Baltimore County, Baltimore, MD 21250, USA. etcher1@umbc.edu
Abstract:
It was shown in Phatak, Choi, and Koren (1993) that the neural network implementation of the n-k-n encoder-decoder has a minimal size of k = 2, and it was shown how to construct the network. A proof was given in Phatak and Koren (1995) that in order to achieve perfect fault tolerance by replicating the hidden layer, the required number of replications is at least three. In this note, exact lower bounds are derived for the number of replications as a function of n, for the n-2-n network and for the n- log2n-n network.
Related Concept Videos
Bus Impedance Matrix
In the first circuit, all machine voltage sources are short-circuited, leaving only the prefault voltage source at the fault location. The positive-sequence bus impedance matrix can be determined by solving the nodal equations,...
Fault Types
For line-to-line faults occurring between phases B and C, the...
Multimachine Stability
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
Network Function of a Circuit
Equivalent Resistance
Norton's Theorem