We consider exact system identification in the behavioral setting: Given an (noise-free) finite time series, find set of bounded complexity linear time-invariant systems that fit data exactly. First, we modify notion most powerful unfalsified model for case by fixing number inputs and minimizing order. Then, give necessary sufficient identifiability conditions, i.e., conditions under which true...

With these assumptions we have T defined for every integer n as a 1-1, onto, bimeasurable transformation. Henceforth we shall assume that every set considered is measurable, i.e. an element of a. We shall say that P is invariant if P(A) =P(TA) for every set A, P is ergodic if P is invariant and if P(U^L_oo TA) = 1 for every set A for which P(A) > 0 , and finally P is strongly mixing if P is inv...

This paper presents some general representations for set mappings based on Mathematical Morphology. A generalization of the concept of kernel , proposed originaly by Matheron for translation invariant. mappings, will be presented here in order to prove that any set mapping (not necessarily translation invariant.) can be decomposed by a set of (non-translation invariant.) sup-generating mappings...

One step towards understanding the structure of a flow involves describing the behavior of orbits near selected invariant sets ; particularly that behavior common to all nearby flows. The invariant set chosen is often an isolated invariant set, which means it is the largest invariant set in some (closed) neighborhood of itself, (cf. [1]) A typical example is a hyperbolic (elementary) rest point...

Given measured data generated by a discrete-time linear system, we propose a model consisting of a linear time-invariant system affected by norm-bounded perturbation. Under mild assumptions, the plants belonging to the resulting uncertain family form a convex set. The approach depends on two key parameters: an a priori given bound of the perturbation and the input used to generate the data. It ...

In this paper, we give connection between the order of the generalized Baer-invariant of a pair of finite groups and its factor groups, when ? is considered to be the specific variety. Moreover, we give a necessary and sufficient condition in which the generalized Baer-invariant of a pair of groups can be embedded into the generalized Baer-invariant of pair of its factor groups.

Sensitivity analysis is one of the most interesting and preoccupying areas in optimization. Many attempts are made to investigate the problem’s behavior when the input data changes. Usually variation occurs in the right hand side of the constraints and/or the objective function coefficients. Degeneracy of optimal solutions causes considerable difficulties in sensitivity analysis. In this paper ...

The paper describes the Invariant Pixel Set Signature (IPSS) method for object recognition. Test are carried out on COIL-20, a publicly available database of 72 views of 20 natural object taken on a rotating turntable. With a model built from a single view, recognition performance measured by the average match percentile is above 98% in the ( 20;+20) interval and above 96% for 30 degrees. For s...

In this paper we study the closed-loop dynamics of linear time-invariant systems with feedback control laws that are described by set-valued maximal monotone maps. The class of systems considered in this work is subject to both, unknown exogenous disturbances and parameter uncertainty. It is shown how the design of conventional sliding mode controllers can be achieved using maximal monotone ope...

It is common that an efficient constrained plant operation under full range of disturbance inputs requires meeting different sets of control objectives. This calls for application of multiple model predictive controllers each of them being best fit into specific operating conditions. It is inevitable then to switch between the controllers during the plant operation. A simple immediate hard swit...