Displaying 121 – 140 of 207

Showing per page

Multibump solutions for Hamiltonian systems with fast and slow forcing

Vittorio Coti Zelati, Margherita Nolasco (1999)

Bollettino dell'Unione Matematica Italiana

Si dimostra l'esistenza di infinite soluzioni «multi-bump» - e conseguentemente il comportamento caotico - per una classe di sistemi Hamiltoniani del secondo ordine della forma - q ¨ + q = g 1 ω t + g 2 t / ω V q per ω sufficientemente piccolo. Qui q R n , g 1 e g 2 sono funzioni strettamente positive e periodiche e V è un potenziale superquadratico (ad esempio V q = q 4 ).

On a one-dimensional analogue of the Smale horseshoe

Ryszard Rudnicki (1991)

Annales Polonici Mathematici

We construct a transformation T:[0,1] → [0,1] having the following properties: 1) (T,|·|) is completely mixing, where |·| is Lebesgue measure, 2) for every f∈ L¹ with ∫fdx = 1 and φ ∈ C[0,1] we have φ ( T n x ) f ( x ) d x φ d μ , where μ is the cylinder measure on the standard Cantor set, 3) if φ ∈ C[0,1] then n - 1 i = 0 n - 1 φ ( T i x ) φ d μ for Lebesgue-a.e. x.

On almost specification and average shadowing properties

Marcin Kulczycki, Dominik Kwietniak, Piotr Oprocha (2014)

Fundamenta Mathematicae

We study relations between the almost specification property, the asymptotic average shadowing property and the average shadowing property for dynamical systems on compact metric spaces. We show implications between these properties and relate them to other important notions such as shadowing, transitivity, invariant measures, etc. We provide examples showing that compactness is a necessary condition for these implications to hold. As a consequence, we also obtain a proof that limit shadowing in...

On the anti–synchronization detection for the generalized Lorenz system and its applications to secure encryption

Volodymyr Lynnyk, Sergej Čelikovský (2010)

Kybernetika

In this paper, a modified version of the Chaos Shift Keying (CSK) scheme for secure encryption and decryption of data will be discussed. The classical CSK method determines the correct value of binary signal through checking which initially unsynchronized system is getting synchronized. On the contrary, the new anti-synchronization CSK (ACSK) scheme determines the wrong value of binary signal through checking which already synchronized system is loosing synchronization. The ACSK scheme is implemented...

Currently displaying 121 – 140 of 207