The problem of confining the trajectory of a linear discrete-time system in a given polyhedral domain is addressed through the concept of (A, B)-invariance. First, an explicit characterization of (A, B)-invariance of convex ...

Let G be a group, S = {Si, i ∈ I} a non empty family of (not necessarily distinct) subgroups of infinite index in G and M a ℤ2 G-module. In [4] the authors defined a homological invariant E∗ (G, S, M), which is “dual” to ...

Let G be a group, S = {S-i, i is an element of I} a non empty family of (not necessarily distinct) subgroups of infinite index in G and M a Z(2)G-module. In [4] the authors defined a homological invariant E,(G,S,M), which ...

We consider brightness/contrast-invariant and rotation-discriminating template matching that searches an image to analyze A for a query image Q We propose to use the complex coefficients of the discrete Fourier transform ...

In this article we study the structure of Γ-invariant spaces of L2(S). Here S is a second countable LCA group. The invariance is with respect to the action of Γ, a non commutative group in the form of a semidirect product ...

In (Jafari et al, Phys Lett A 377(9):699-702, 2013) the authors gave the expressions of seventeen classes of quadratic differential systems defined in R3, depending on one real parameter a, which present chaotic behavior ...

We consider a complete metric space (X, d) and a countable number of contraction mappings on X, F = {Fi : i ∈ N}. We show the existence of a smallest invariant set (with respect to inclusion) for F. If the maps Fi are of ...

Template matching is a technique widely used for finding patterns in digital images. A good template matching should be able to detect template instances that have undergone geometric transformations. In this paper, we ...

Nowadays, Petri net and this extensions has been used for modeling and verification of complex systems, used as a sound description language. Algorithms derived from this modeling framework can facilitate the analysis and ...