Results 1  10
of
249
Multifractal analysis of Birkhoff averages for some selfaffine IFS
, 2007
"... In this paper we consider selfaffine IFS fSigm0i=1 on the plane of the form Si(x1; x2) = (ix1 + t (1) ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
In this paper we consider selfaffine IFS fSigm0i=1 on the plane of the form Si(x1; x2) = (ix1 + t (1)
On The Diameter Of The Attractor Of An IFS
 C.R. MATH. REP. SCI. CANADA
, 1994
"... We investigate methods for the evaluation of the diameter of the attractor of an IFS. We propose an upper bound for the diameter in ndimensional space. In the case of an affine IFS, we indicate how this upper bound can be calculated. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We investigate methods for the evaluation of the diameter of the attractor of an IFS. We propose an upper bound for the diameter in ndimensional space. In the case of an affine IFS, we indicate how this upper bound can be calculated.
Previous Up Next Article Citations From References: 0 From Reviews: 3
"... Multifractal analysis of Birkhoff averages for some selfaffine IFS. (English summary) ..."
Abstract
 Add to MetaCart
Multifractal analysis of Birkhoff averages for some selfaffine IFS. (English summary)
Mixed IFS: resolution of the inverse problem using Genetic Programming
 COMPLEX SYSTEMS
, 1995
"... We address here the resolution of the socalled inverse problem for IFS. This problem has already been widely considered, and some studies have been performed for affine IFS, using deterministic or stochastic methods (Simulated Annealing or Genetic Algorithm) [17, 10]. When dealing with non affine ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
We address here the resolution of the socalled inverse problem for IFS. This problem has already been widely considered, and some studies have been performed for affine IFS, using deterministic or stochastic methods (Simulated Annealing or Genetic Algorithm) [17, 10]. When dealing with non affine
Affine Invariant Optimization The optimization procedure O is Affine Invariant if:
, 2015
"... The problem at hand is to find θ ∗ minimizing f (θ) when we have samples Wθ; such that, ∇f (θ) = E [Wθ]. (1) A general RobbinsMonro iteration takes the form θ̂n+1 = θ̂n − 1nγ Kn Wn, (2) where Wn is a sample of Wθ̂n. The optimal Kn is the inverse of theHessian of f at the optimal θ ∗ and the optima ..."
Abstract
 Add to MetaCart
The problem at hand is to find θ ∗ minimizing f (θ) when we have samples Wθ; such that, ∇f (θ) = E [Wθ]. (1) A general RobbinsMonro iteration takes the form θ̂n+1 = θ̂n − 1nγ Kn Wn, (2) where Wn is a sample of Wθ̂n. The optimal Kn is the inverse of theHessian of f at the optimal θ ∗ and the optimal γ is 1. We follow Bottou and aim to minimize L = E [f (θ̂n) − f (θ∗)]. (3)
FRACTAL COMPRESSION OF IMAGES WITH PROJECTED IFS
"... Standard fractal image compression, proposed by Jacquin[1], is based on IFS (Iterated Function Systems) defined in R 2. This modelization implies restrictions in the set of images being able to be compressed. These images have to be self similar in R 2. We propose a new model, the projected IFS, to ..."
Abstract
 Add to MetaCart
, to approximate and code grey level images. This model has the ability to define affine IFS in a high dimension space, and to project it through control points, resulting in a non strictly self similar object in R 2. We proposed a method for approximating curves with such a model [2, 3]. In this paper, we extend
IFS Fractals Generated by Affine Transformation with Trigonometric Coefficients and their Transformations
"... In IFS fractals generated by affine transformations with arbitrary coefficients often there is a lot of chaotic noise. In the present paper we study the effect of related trigonometric coefficients on affine transformations in terms of the IFS fractals generated by them. The use of related trigonome ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In IFS fractals generated by affine transformations with arbitrary coefficients often there is a lot of chaotic noise. In the present paper we study the effect of related trigonometric coefficients on affine transformations in terms of the IFS fractals generated by them. The use of related
Bounding the Attractor of an IFS
, 1999
"... Fractal images defined by an iterated function system (IFS) are specified by a finite number of contractive affine transformations. In order to plot the attractor of an IFS on the screen of a digital computer, it is necessary to determine a bounding area for the attractor. Given a point on the plane ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Fractal images defined by an iterated function system (IFS) are specified by a finite number of contractive affine transformations. In order to plot the attractor of an IFS on the screen of a digital computer, it is necessary to determine a bounding area for the attractor. Given a point
Tracking linear and affine resources with Java(X)
 IN EUROPEAN CONFERENCE ON OBJECTORIENTED PROGRAMMING
, 2007
"... Java(X) is a framework for type refinement. It extends Java’s type language with annotations drawn from an algebra X and structural subtyping in terms of the annotations. Each instantiation of X yields a different refinement type system with guaranteed soundness. The paper presents some application ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
is a capability which can grant exclusive write permission for a field in an object and thus facilitates a typestate change (strong update). Propagation of capabilities is either linear or affine (if they are droppable). Thus, Java(X) can perform protocol checking as well as refinement typing. Aliasing
Results 1  10
of
249