Evolutionary Design of Digital Circuits Using Improved Multi Expression Programming (IMEP).
Exactly solvable and unsolvable shortest network problems in 3D-space.
Existence of feasible potentials on infinite networks.
Extensions of Foster's averaging formula to infinite networks with moderate growth.
Failure of random networks.
Fault diagnosis and fault tolerant control using set-membership approaches: Application to real case studies
This paper reviews the use of set-membership methods in fault diagnosis (FD) and fault tolerant control (FTC). Setmembership methods use a deterministic unknown-but-bounded description of noise and parametric uncertainty (interval models). These methods aims at checking the consistency between observed and predicted behaviour by using simple sets to approximate the exact set of possible behaviour (in the parameter or the state space). When an inconsistency is detected between the measured and predicted...
Fault location in EHV transmission lines using artificial neural networks
This paper deals with the application of artificial neural networks (ANNs) to fault detection and location in extra high voltage (EHV) transmission lines for high speed protection using terminal line data. The proposed neural fault detector and locator were trained using various sets of data available from a selected power network model and simulating different fault scenarios (fault types, fault locations, fault resistances and fault inception angles) and different power system data (source capacities,...
Finding the conductors in circular networks from boundary measurements
Finite-time consensus problem for multiple non-holonomic mobile agents
In this paper, the problem of finite time consensus is discussed for multiple non-holonomic mobile agents. The objective is to design a distributed finite time control law such that the controlled multiple non-holonomic mobile agents can reach consensus within any given finite settling time. We propose a novel switching control strategy with the help of time-rescalling technique and graph theory. The numerical simulations are presented to show the effectiveness of the method.
Fonctions booléennes très incomplètes. Représentation par des sommes de monômes
Fully connected PLL networks: how filter determines the number of nodes.
Galois correspondences for closed classes of functions with delay. I.
Gate circuits in the algebra of transients
We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating s and s; it represents a changing signal. In the algebra of transients, gates process transients instead of s and s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...
Gate circuits in the algebra of transients
We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating 0s and 1s; it represents a changing signal. In the algebra of transients, gates process transients instead of 0s and 1s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...
Generador de seqüències de test per circuits integrats NMOS.
El generador de secuencias de ensayo que se presenta en este artículo utiliza una descripción del circuito a nivel de transistor que representa las redes de transistores de enriquecimiento de las funciones lógicas NMOS mediante grafos no orientados. Para la generación de vectores de ensayo se emplea el algoritmo D, habiendo desarrollado un método enumerativo de búsqueda de caminos en la parte superior del grafo, a partir del camino mínimo que pasa por el flanco que representa el transistor afectado...
Generalized Schauder frames
Schauder frames were introduced by Han and Larson [9] and further studied by Casazza, Dilworth, Odell, Schlumprecht and Zsak [2]. In this paper, we have introduced approximative Schauder frames as a generalization of Schauder frames and a characterization for approximative Schauder frames in Banach spaces in terms of sequence of non-zero endomorphism of finite rank has been given. Further, weak* and weak approximative Schauder frames in Banach spaces have been defined. Finally, it has been proved...
Generalized ternary simulation of sequential circuits
Gibbs Phenomenon on Sampling Series Based on Shannon's and Meyer's Wavelet Analysis.
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and Markov chains with restart, a particular kind of Markov chains that include the PageRank one as a special case. This fact provides constraints on the...
Hierarchical residue number systems with small moduli and simple converters
In this paper, a new class of Hierarchical Residue Number Systems (HRNSs) is proposed, where the numbers are represented as a set of residues modulo factors of 2k ± 1 and modulo 2k . The converters between the proposed HRNS and the positional binary number system can be built as 2-level structures using efficient circuits designed for the RNS (2k-1, 2k, 2k+1). This approach allows using many small moduli in arithmetic channels without large conversion overhead. The advantages resulting from the...