Search

Your search keyword '"KULeuven - ESAT"' showing total 20 results
Start Over Author "KULeuven - ESAT"
20 results on '"KULeuven - ESAT"'

2. Identifying positive real models in subspace identification by using regularization

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Goethals, I., Van Gestel, T., Suykens, Johan, Van Dooren, Paul, Proccedings 13th IFAC symposium on system identification (SYSID 2003), KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Goethals, I., Van Gestel, T., Suykens, Johan, Van Dooren, Paul, and Proccedings 13th IFAC symposium on system identification (SYSID 2003)

Published
2003

3. Imposing stability in subspace identification by regularization

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Van Gestel, T., Suykens, J., Van Dooren, Paul, De Moor, B., KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Van Gestel, T., Suykens, J., Van Dooren, Paul, and De Moor, B.

Abstract

In subspace methods for system identification, the system matrices are usually estimated by least squares, based on estimated Kalman filter state sequences and the observed inputs and outputs. For an infinite number of data points and a correct choice of the system order, this least squares estimate of the system matrices is unbiased. However, when using subspace identification on a finite number of data points, the estimated model can become unstable, for a given deterministic system which is known to be stable. In this paper, stability of the estimated model is imposed by adding a regularization term to the least squares cost function. The regular- ization term used here is the trace of a matrix which involves the dynamical system matrix and a positive (semi-)definite weighting matrix. The amount of regularization needed can be determined by solving a generalized eigenvalue problem. It is shown that the so-called data augmentation method proposed by Chui and Maciejowski corresponds to adding regularization terms with specific choices for the weighting matrix. The choice of the identity matrix for the weighting matrix is motivated by simulation results.

Published
2000

4. Least squares support vector machine classifiers: a large scale algorithm

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Suykens, J., Lukas, L., Van Dooren, Paul, Vandewalle, J., Proceedings European Conference Circ.Th. Des. ECCTD'99, KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Suykens, J., Lukas, L., Van Dooren, Paul, Vandewalle, J., and Proceedings European Conference Circ.Th. Des. ECCTD'99

Abstract

Support vector machines (SVM's) have been introduced in literature as a method for pattern recognition and function estimation, within the framework of statistical learning theory and structural risk minimization. A least squares version (LSSVM) has been recently reported which expresses the training in terms of solving a set of linear equations instead of quadratic programming as for the standard SVM case. In this paper we present an iterative training algorithm for LS-SVM's which is based on a conjugate gradient method. This enables solving large scale classification problems which is illustrated on a multi two-spiral benchmark problem. Keywords. Support vector machines, classification, neural networks, RBF kernels, conjugate gradient method.

Published
1999

5. A systolic array for SVD updating

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, Vandewalle, J., KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, and Vandewalle, J.

Abstract

In an earlier paper, an approximate SVD updating scheme has been derived as an interlacing of a QR updating on the one hand and a Jacobi-type SVD procedure on the other hand, possibly supplemented with a certain re-orthogonalization scheme. This paper maps this updating algorithm onto a systolic array with O(n2) parallelism for O(n2) complexity, resulting in an O(n0) throughput. Furthermore, it is shown how a square root-free implementation is obtained by combining modified Givens rotations with approximate SVD schemes.

Published
1998

6. Generalizations of the singular value and QR decompositions

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, De Moor, B., Van Dooren, Paul, KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, De Moor, B., and Van Dooren, Paul

Published
1993

7. A systolic array for SVD updating

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, Vandewalle, J., KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, and Vandewalle, J.

Published
1993

8. An SVD updating algorithm for subspace tracking

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, Vandewalle, J., KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, and Vandewalle, J.

Published
1992

9. A systolic algorithm for QSVD updating

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, Vandewalle, J., KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, and Vandewalle, J.

Published
1991

10. Jacobi-type algorithms for LDU and Cholesky factorization

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, Vandewalle, J., KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, and Vandewalle, J.

Published
1991

11. SLICOT, a subroutine library for control and system theory

Author

TU Eindhoven - EE Dept, NAG - Numerical Analysis, Univ Gent - EE Dept, TU Eindhoven - Comp. Sc., UCL - FSA/INMA - Département d'ingénierie mathématique, Philips Research Lab Brussels - Applied Mathematics, KULeuven - ESAT, van den Boom, A., Brown, A., Dumortier , F., Geurts, A., Hammarling, S., Kool, R., Vanbegin, M., Van Dooren, Paul, Van Huffel, S., IFAC 1991 CADCS Conference, TU Eindhoven - EE Dept, NAG - Numerical Analysis, Univ Gent - EE Dept, TU Eindhoven - Comp. Sc., UCL - FSA/INMA - Département d'ingénierie mathématique, Philips Research Lab Brussels - Applied Mathematics, KULeuven - ESAT, van den Boom, A., Brown, A., Dumortier , F., Geurts, A., Hammarling, S., Kool, R., Vanbegin, M., Van Dooren, Paul, Van Huffel, S., and IFAC 1991 CADCS Conference

Published
1991

12. SVD-updating for tracking slowly time-varying systems

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, Vandewalle, J., KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Moonen, M., Van Dooren, Paul, and Vandewalle, J.

Published
1990

13. A reduced observer for descriptor systems

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Verhaegen, M., Van Dooren, Paul, KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Verhaegen, M., and Van Dooren, Paul

Published
1986

14. Condensed forms for efficient time invariant Kalman filtering

Author

UCL - FSA/INMA - Département d'ingénierie mathématique, KULeuven - ESAT, Van Dooren, Paul, Verhaegen, M., UCL - FSA/INMA - Département d'ingénierie mathématique, KULeuven - ESAT, Van Dooren, Paul, and Verhaegen, M.

Abstract

In this paper, new numerical implementations are developed for several "classical" types of Kalman filters. These implementations are based on the choice of an initial state transformation which "condenses" the original model and are therefore mainly meant for time-invariant systems. Since unitary transformations are used to generate these condensed forms, no loss of accuracy is thereby incurred. The use of these forms may lead to a complexity reduction of a factor of 7 in the subsequent recursions to compute the stationary solution of the discrete Riccati equation. It is shown that therefore these new implementations become competitive with the so-called "fast Chandrasekhar" implementation.

Published
1988

15. A theoretical analysis of the round-off propagation in different Kalman filter implementations

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Verhaegen, M., Van Dooren, Paul, 1986 American Control Conference, KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Verhaegen, M., Van Dooren, Paul, and 1986 American Control Conference

Abstract

A theoretical analysis is made of the error propagation due to numerical round-off for four different Kalman filter implementations: the conventional Kalman filter, the square root covariance filter, the square root information filter and the Chandrasekhar square root filter. From these error models, new insights about the applicability of the different filters and their sensitivity to round-off, is obtained. It is shown that the CKF may become completely unreliable when the original plant is unstable, and that this is easily circumvented by a number of techniques. The square root filters, often quoted to possess a conditioning or sensitivity that is the square root of that of the CKF, are shown to possess this property only for the computation of the covariance of the filtered signal and not for the computation of the Kalman gain or the filtered estimate. Finally, the Chandrasekhar filter is shown to be numerically unstable.

Published
1986

16. The use of condensed forms in linear system theory

Author

UCL - FSA/INMA - Département d'ingénierie mathématique, KULeuven - ESAT, Van Dooren, Paul, Verhaegen, M., Workshop on Reliable Numerical Methods in Control System Design, UCL - FSA/INMA - Département d'ingénierie mathématique, KULeuven - ESAT, Van Dooren, Paul, Verhaegen, M., and Workshop on Reliable Numerical Methods in Control System Design

Published
1983

17. Numerical aspects of different Kalman filter implementations

Author

KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Verhaegen, M., Van Dooren, Paul, KULeuven - ESAT, UCL - FSA/INMA - Département d'ingénierie mathématique, Verhaegen, M., and Van Dooren, Paul

Published
1986

18. On the use of unitary state-space transformations

Author

UCL - FSA/INMA - Département d'ingénierie mathématique, KULeuven - ESAT, Van Dooren, Paul, Verhaegen, M., Linear Algebra and its Role in Linear System Theory, UCL - FSA/INMA - Département d'ingénierie mathématique, KULeuven - ESAT, Van Dooren, Paul, Verhaegen, M., and Linear Algebra and its Role in Linear System Theory

Published
1985

19. A thin-film microprocessor with inkjet print-programmable memory.

Author

Myny K, Smout S, Rockelé M, Bhoolokam A, Ke TH, Steudel S, Cobb B, Gulati A, Gonzalez Rodriguez F, Obata K, Marinkovic M, Pham DV, Hoppe A, Gelinck GH, Genoe J, Dehaene W, and Heremans P

Abstract

The Internet of Things is driving extensive efforts to develop intelligent everyday objects. This requires seamless integration of relatively simple electronics, for example through 'stick-on' electronics labels. We believe the future evolution of this technology will be governed by Wright's Law, which was first proposed in 1936 and states that the cost of a product decreases with cumulative production. This implies that a generic electronic device that can be tailored for application-specific requirements during downstream integration would be a cornerstone in the development of the Internet of Things. We present an 8-bit thin-film microprocessor with a write-once, read-many (WORM) instruction generator that can be programmed after manufacture via inkjet printing. The processor combines organic p-type and soluble oxide n-type thin-film transistors in a new flavor of the familiar complementary transistor technology with the potential to be manufactured on a very thin polyimide film, enabling low-cost flexible electronics. It operates at 6.5 V and reaches clock frequencies up to 2.1 kHz. An instruction set of 16 code lines, each line providing a 9 bit instruction, is defined by means of inkjet printing of conductive silver inks.

Published
2014
Full Text
View/download PDF

20. Discovering transcriptional modules from motif, chip-chip and microarray data.

Author

De Bie T, Monsieurs P, Engelen K, De Moor B, Cristianini N, and Marchal K

Subjects
Algorithms, Cell Cycle genetics, Fungal Proteins genetics, Models, Genetic, Reproducibility of Results, Ribosomes genetics, Saccharomyces cerevisiae cytology, Oligonucleotide Array Sequence Analysis, Saccharomyces cerevisiae genetics, Transcription, Genetic
Abstract

We present a method for inference of transcriptional modules from heterogeneous data sources. It allows identifying the responsible set of regulators in combination with their corresponding DNA recognition sites (motifs) and target genes. Our approach distinguishes itself from previous work in literature because it fully exploits the knowledge of three independently acquired data sources: ChIP-chip data; motif information as obtained by phylogenetic shadowing; and gene expression profiles obtained using microarray experiments. Moreover, these three data sources are dealt with in a new and fully integrated manner. By avoiding approaches that take the different data sources into account sequentially or iteratively, the transparency of the method and the interpretability of the results are ensured. Using our method on biological data demonstrated the biological relevance of the inference.

Published
2005

Catalog

Books, media, physical & digital resources
See catalog results