An N ร N Benes network B(n) (n = log 2 N), being a rearrangeable network, can realize any N ร N permutation in a single pass. But even in the presence of a single switch fault in B(n), two passes are necessary to realize any NรN permutation. In this paper, we attempt to characterize the switch fault
Fault identification in resistive and reactive networks
โ Scribed by L. Gefferth
- Publisher
- John Wiley and Sons
- Year
- 1974
- Tongue
- English
- Weight
- 184 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0098-9886
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
In this paper we present a method for identifying a faulty component in resistive and reactive networks. Our assumption is that the value of only one component may differ from the nominal value. This method is based on the fact that two network functions suitably chosen are in linear relation. One of them is plotted against the other. So we get a set of straight lines. The two functions of the faulty network will be measured. The measured values give a point on the set of loci from which the faulty component can be identified.
๐ SIMILAR VOLUMES
This paper proposes two event correlation schemes for fault identification in communication networks. The causality graph model is used to describe the cause-and-effect relationships between network events.
Bayesian formulated neural networks are implemented using hybrid Monte-Carlo method for probabilistic fault identi"cation in structures. Each of the 20 nominally identical cylindrical shells is arbitrarily divided into three substructures. Holes of 10}15 mm diameter are introduced in each of the sub
When vibration data are used to identify faults in structures it is not completely clear whether to use either frequency response functions or modal parameters. This paper presents a committee of neural networks technique, which employs both frequency response functions and modal data simultaneously
The complexity of communication networks and the amount of information transferred in these networks have made the management of such networks increasingly di$cult. Since faults are inevitable, quick detection, identi"cation, and recovery are crucial to make the systems more robust and their operati
A number of di!erent fundamental problems in fault detection and fault identi"cation are formulated in this paper. The fundamental problems include exact, almost, generic and class-wise fault detection and identi"cation. Necessary and su$cient conditions for the solvability of the fundamental proble