A theory for ungrounded electrical grids and its application to the geophysical exploration of layered strata
Actuator fault diagnosis for flat systems: A constraint satisfaction approach
This paper describes a robust set-membership-based Fault Detection and Isolation (FDI) technique for a particular class of nonlinear systems, the so-called flat systems. The proposed strategy consists in checking if the expected input value belongs to an estimated feasible set computed using the system model and the derivatives of the measured output vector. The output derivatives are computed using a numerical differentiator. The set-membership estimator design for the input vector takes into account...
Adaptive identification in Torii in the King lattice.
Address sequences and backgrounds with different Hamming distances for multiple run March tests
It is widely known that pattern sensitive faults are the most difficult faults to detect during the RAM testing process. One of the techniques which can be used for effective detection of this kind of faults is the multi-background test technique. According to this technique, multiple-run memory test execution is done. In this case, to achieve a high fault coverage, the structure of the consecutive memory backgrounds and the address sequence are very important. This paper defines requirements which...
Algorithmes de plus courts chemins pour traiter des données floues
An algorithm for model reduction in large electric power systems.
An efficient connected dominating set algorithm in wsns based on the induced tree of the crossed cube
The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced tree of...
An Enumerative Problem in Threshold Logic
An unscented Kalman filter in designing dynamic GMDH neural networks for robust fault detection
This paper presents an identification method of dynamic systems based on a group method of data handling approach. In particular, a new structure of the dynamic multi-input multi-output neuron in a state-space representation is proposed. Moreover, a new training algorithm of the neural network based on the unscented Kalman filter is presented. The final part of the work contains an illustrative example regarding the application of the proposed approach to robust fault detection of a tunnel furnace....
Analýsa elektrických obvodů v ustáleném stavu pomocí samočinného číslicového počítače
Application de la théorie des graphes au choix des investissements à court terme dans un réseau électrique sujet à avaries
Application of certain properties of matrices over GF(2) to the description of linear switching networks
Arithmetic unit based on impulse counting
Asymptotic spectral analysis of generalized Erdős-Rényi random graphs
Motivated by the Watts-Strogatz model for a complex network, we introduce a generalization of the Erdős-Rényi random graph. We derive a combinatorial formula for the moment sequence of its spectral distribution in the sparse limit.
Baire classification and infinite perceptrons
Balancing cyclic -ary Gray codes.
Balancing cyclic -ary Gray codes. II.
Bifurcation analysis of a van der Pol-Duffing circuit with parallel resistor.
Boolean functions represented by random formulas
Bounded expansion in web graphs
In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.