Counterexamples for IFS-attractors

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Similarity dimension for IFS-attractors

Moran’s Theorem is one of the milestones in Fractal Geometry. It allows the calculation of the similarity dimension of any (strict) self-similar set lying under the open set condition. Throughout a new fractal dimension we provide in the context of fractal structures, we generalize such a classical result for attractors which are required to satisfy no separation properties.

متن کامل

Time-delay Embeddings of Ifs Attractors

A modified type of iterated function system (IFS) has recently been shown to generate images qualitatively similar to “classical” chaotic attractors. Here, we use time-delay embedding reconstructions of time-series from this system to generate three-dimentional projections of IFS attractors. These reconstructions may be used to access the topological structure of the periodic orbits embedded wi...

متن کامل

Manipulation of Non-Linear IFS attractors using Genetic Programming

Non-linear Iterated Function Systems (IFSs) are very powerful mathematical objects related to fractal theory, that can be used in order to generate (or model) very irregular shapes. We investigate in this paper how Genetic Programming techniques can be efficiently exploited in order to generate randomly or interactively artistic “fractal” 2D shapes. Two applications are presented for different ...

متن کامل

Generalized IFS for Signal Processing

Several methods have been proposed to estimate theHölder exponents of signals [1, 4]. In this paper, we propose a new approach, based on a generalization of iterated functions system (IFS), which is well adapted to irregular continuous 1D signals. We also use these generalized IFS to build parsimonious models of complex signals and to perform segmentation on them. This paper is organized as fol...

متن کامل

Counterexamples for Expected Rewards

The computation of counterexamples for probabilistic systems has gained a lot of attention during the last few years. All of the proposed methods focus on the situation when the probabilities of certain events are too high. In this paper we investigate how counterexamples for properties concerning expected costs (or, equivalently, expected rewards) of events can be computed. We propose methods ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chaos, Solitons & Fractals

سال: 2016

ISSN: 0960-0779

DOI: 10.1016/j.chaos.2015.12.006