Search results for "Chaotic"
showing 10 items of 297 documents
Heuristic algorithms for a storage location assignment problem in a chaotic warehouse
2014
The extensive application of emerging technologies is revolutionizing warehouse management. These technologies facilitate working with complex and powerful warehouse management models in which products do not have assigned fixed locations (random storage). Random storage allows the utilization of the available space to be optimized. In this context, and motivated by a real problem, this article presents a model that looks for the optimal allocation of goods in order to maximize the storage space availability within the restrictions of the warehouse. For the proposed model a construction method, a local search algorithm and different metaheuristics have been developed. The introduced algorit…
Looking More Closely at the Rabinovich-Fabrikant System
2016
Recently, we looked more closely into the Rabinovich–Fabrikant system, after a decade of study [Danca & Chen, 2004], discovering some new characteristics such as cycling chaos, transient chaos, chaotic hidden attractors and a new kind of saddle-like attractor. In addition to extensive and accurate numerical analysis, on the assumptive existence of heteroclinic orbits, we provide a few of their approximations.
Mammographic images segmentation based on chaotic map clustering algorithm
2013
Background: This work investigates the applicability of a novel clustering approach to the segmentation of mammographic digital images. The chaotic map clustering algorithm is used to group together similar subsets of image pixels resulting in a medically meaningful partition of the mammography. Methods: The image is divided into pixels subsets characterized by a set of conveniently chosen features and each of the corresponding points in the feature space is associated to a map. A mutual coupling strength between the maps depending on the associated distance between feature space points is subsequently introduced. On the system of maps, the simulated evolution through chaotic dynamics leads…
Connectivity Influences on Nonlinear Dynamics in Weakly-Synchronized Networks: Insights from Rössler Systems, Electronic Chaotic Oscillators, Model a…
2019
Natural and engineered networks, such as interconnected neurons, ecological and social networks, coupled oscillators, wireless terminals and power loads, are characterized by an appreciable heterogeneity in the local connectivity around each node. For instance, in both elementary structures such as stars and complex graphs having scale-free topology, a minority of elements are linked to the rest of the network disproportionately strongly. While the effect of the arrangement of structural connections on the emergent synchronization pattern has been studied extensively, considerably less is known about its influence on the temporal dynamics unfolding within each node. Here, we present a compr…
Scaling behaviour of non-hyperbolic coupled map lattices
2006
Coupled map lattices of non-hyperbolic local maps arise naturally in many physical situations described by discretised reaction diffusion equations or discretised scalar field theories. As a prototype for these types of lattice dynamical systems we study diffusively coupled Tchebyscheff maps of N-th order which exhibit strongest possible chaotic behaviour for small coupling constants a. We prove that the expectations of arbitrary observables scale with \sqrt{a} in the low-coupling limit, contrasting the hyperbolic case which is known to scale with a. Moreover we prove that there are log-periodic oscillations of period \log N^2 modulating the \sqrt{a}-dependence of a given expectation value.…
Scattering lengths and universality in superdiffusive L\'evy materials
2012
We study the effects of scattering lengths on L\'evy walks in quenched one-dimensional random and fractal quasi-lattices, with scatterers spaced according to a long-tailed distribution. By analyzing the scaling properties of the random-walk probability distribution, we show that the effect of the varying scattering length can be reabsorbed in the multiplicative coefficient of the scaling length. This leads to a superscaling behavior, where the dynamical exponents and also the scaling functions do not depend on the value of the scattering length. Within the scaling framework, we obtain an exact expression for the multiplicative coefficient as a function of the scattering length both in the a…
Polarization-domain-wall complexes in fiber lasers
2013
To study the possible build-up of polarization-domain-walls (PDWs) in fiber laser cavities, an erbium-doped fiber ring laser was used and a wide range of vector polarization dynamics that can be selected at a given pump power, by using the degrees of freedom of two intracavity polarization controllers (PC) was investigated. A simple theoretical model that explains polarization switching in fiber ring lasers featuring a normally dispersive cavity with a typical, moderate, level of birefringence is presented. Such polarization dynamics, based on a special class of polarization-domain-wall structures, agrees qualitatively well with experimental observations. The paper stresses on the complex a…
CHAOTIC POLYNOMIALS IN SPACES OF CONTINUOUS AND DIFFERENTIABLE FUNCTIONS
2008
AbstractWe construct chaotic m-homogeneous maps acting on $\mathcal{C}^{r}_{\mathtt{+}}( [0,\infty ))$ for any m ≥ 2, $r\in\mathbb{N}\cup\{0\},$ and on the Fréchet spaces $\mathcal{C}_{\mathbb{R}}(\mathbb{R})$ for odd values of m ≥ 3 and $\mathcal{C}_{\mathbb{C}}(\mathbb{R})$ for any m ≥ 2.
The pianigiani-yorke measure for topological markov chains
1997
We prove the existence of a Pianigiani-Yorke measure for a Markovian factor of a topological Markov chain. This measure induces a Gibbs measure in the limit set. The proof uses the contraction properties of the Ruelle-Perron-Frobenius operator.
A fractal set from the binary reflected Gray code
2005
The permutation associated with the decimal expression of the binary reflected Gray code with $N$ bits is considered. Its cycle structure is studied. Considered as a set of points, its self-similarity is pointed out. As a fractal, it is shown to be the attractor of a IFS. For large values of $N$ the set is examined from the point of view of time series analysis