Results 131 to 140 of about 5,506 (181)
Some of the next articles are maybe not open access.
Descriptor- and Non-Descriptor Controllers in H ∞ Control of Descriptor Systems
IFAC Proceedings Volumes, 2000Abstract In this paper H ∞ control of high index and non-regular linear descriptor systems is addressed. Based on a generalization of the bounded real lemma (BRL) it is shown how the standard, i.e. non-descriptor, H ∞ control problem can be can be generalized to descriptor systems.
A. Rehm, F. Allgöwer
openaire +1 more source
Affine invariant shape descriptors: The ICA-Fourier descriptor and the PCA-Fourier descriptor
2008 19th International Conference on Pattern Recognition, 2008In this paper, we propose two new affine invariant shape descriptors, the ICA-Fourier descriptor and the PCA-Fourier descriptor. We tested the descriptors by using them as features for shape based silhouette image retrieval. Experiments on a 1000 silhouette image database show promising retrieval rates of 95.41% and 93.63%, using the ICA-Fourier ...
Ye Mei, Dimitrios Androutsos
openaire +1 more source
Studia Logica, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2016
Despite the number of available chemicals growing exponentially, testing of their toxicological and environmental behavior is often a critical issue and alternative strategies are required. Additionally, there is the need to predict properties of not yet synthesized compounds to reduce the costs of synthesis, selecting only those that have the maximal ...
Mauri, A +2 more
openaire +1 more source
Despite the number of available chemicals growing exponentially, testing of their toxicological and environmental behavior is often a critical issue and alternative strategies are required. Additionally, there is the need to predict properties of not yet synthesized compounds to reduce the costs of synthesis, selecting only those that have the maximal ...
Mauri, A +2 more
openaire +1 more source
The Dimensionality Of Psychopathology Descriptors
Multivariate Behavioral Research, 1981This study identified five stable dimensions that judges utilized in making similarity judgments of a set of 26 psychopathology descriptors from a diverse domain representing traditional psychopathology descriptions such as lay labels, and diagnostic categories from the second edition of the Diagnostic and Statistical Manual (DSM II), as well as ...
M J, Paquin, D N, Jackson
openaire +2 more sources
International Journal of Systems Science, 1999
A unifying framework of steady-state Kalman filtering, smoothing and prediction for descriptor systems is presented by using the innovation analysis method in the time domain. The descriptor Kalman estimators are presented on the basis of the autoregressive moving-average innovation model and white-noise estimators.
Zi-Li Deng, Yu-Mei Liu
openaire +1 more source
A unifying framework of steady-state Kalman filtering, smoothing and prediction for descriptor systems is presented by using the innovation analysis method in the time domain. The descriptor Kalman estimators are presented on the basis of the autoregressive moving-average innovation model and white-noise estimators.
Zi-Li Deng, Yu-Mei Liu
openaire +1 more source
Descriptor systems approximation
International Journal of General Systems, 2004Two singular value decomposition (SVD)-based techniques to construct different types of lower degree approximants of a singular system are presented. Such techniques enable preservation of the key properties of the original system, such as stability, and give a quantization of approximation error.
Amel B. H. Adamou-Mitiche +2 more
openaire +1 more source
Rethinking the sGLOH Descriptor
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2018sGLOH (shifting GLOH) is a histogram-based keypoint descriptor that can be associated to multiple quantized rotations of the keypoint patch without any recomputation. This property can be exploited to define the best distance between two descriptor vectors, thus avoiding computing the dominant orientation.
Fabio Bellavia, Carlo Colombo
openaire +3 more sources

