Iterative distributed fault detection and isolation for linear systems based on moving horizon estimation
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
This work is concerned with the computational complexity of the recognition of ÞPtwo, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of ÞPtwo of particular interest are also studi ...
The authors present a new derivation of exact least-squares multichannel and multidimensional adaptive algorithms, based on explicitly formulating the problem as a state-space estimation problem and then using different square-root versions of the Kalman, ...
This paper proposes a paradigm for specification of virtual human agents` level of autonomy. The idea we present in this paper aims at optimising the required complexity of agents in order to perform realistic simulations. The paradigm is based on the dist ...
Gaussian process (GP) prediction suffers from O(n^3) scaling with the data set size n. By using a finite-dimensional basis to approximate the GP predictor, the computational complexity can be reduced. We derive optimal finite-dimensional predictors under a ...
The paper discusses different possibilities for controlling piezoelectric properties of ferroelectric materials and devices. The piezoelectric properties engineering can be made on different scales. Tuning of the piezoelectric response by controlling contr ...
The Digital Signature Algorithm (DSA) was proposed in 1991 by the US National Institute of Standards and Technology to provide an appropriate core for applications requiring digital signatures. Undoubtedly, many applications will include this standard in t ...
This work is concerned with the computational complexity of the recognition of ÞPtwo, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of ÞPtwo of particular interest are also studi ...
Master's Thesis on “Evaluation of Routing Strategies for AGVs based on Computer Simulation”. Presented at Integrated Manufacturing Systems Engineering Institute, North Carolina State University, Raleigh, NC, USA. ...
An exact analysis of the critically subsampled two-band modelization scheme is given, and it is demonstrated that adaptive cross-filters between the subbands are necessary for modelization with small output errors. It is shown that perfect reconstruction f ...
Institute of Electrical and Electronics Engineers1992
Perfect reconstruction finite impulse-response (FIR) filter banks are analyzed both in the z-transform and time domains, showing the alternatives between designs in the two domains. Various classes of perfect reconstruction schemes are indicated, and relat ...
