AUSLANDER GENERATORS OF ITERATED TILTED ALGEBRAS

Let A be an iterated tilted algebra. We will construct an Auslander generator M in order to show that the representation dimension of A is three in case A is representation infinite.

Discriminação de fitofisionomias de floresta de várzea a partir do algoritmo Iterated Conditional Modes aplicado aos dados SAR/R99 (QUAD-POL/Banda L)

Utilizando-se dados do sensor aerotransportado SAR R99, adquiridos na banda L (1,28 GHz) em amplitude e com quatro polarizações (HH, VV, HV e VH), avaliou-se a distinção de fitofisionomias de floresta de várzea existentes nas Reservas de Desenvolvimento Sustentável Amanã e Mamirauá e áreas adjacentes, com a aplicação do algoritmo Iterated Conditional Modes (ICM) de classificação polarimétrica pontual/contextual. Os resultados mostraram que o uso das distribuições multivariadas em amplitude, conjuntamente com uma banda de textura, produziu classificações de qualidade superior àquelas obtidas com dados polarimétricos uni/bivariados. Esta abordagem permitiu a obtenção de um índice Kappa de 0,8963, discriminando as três classes vegetacionais de interesse, comprovando assim o potencial dos dados do SAR R99 e do algoritmo ICM no mapeamento de florestas de várzea da Amazônia.

Iterated local search

Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the solutions that are locally optimal for a given optimization engine. The success of Iterated Local Search lies in the biased sampling of this set of local optima. How effective this approach turns out to be depends mainly on the choice of the local search, the perturbations, and the acceptance criterion. So far, in spite of its conceptual simplicity, it has lead to a number of state-of-the-art results without the use of too much problem-specific knowledge. But with further work so that the different modules are well adapted to the problem at hand, Iterated Local Search can often become a competitive or even state of the artalgorithm. The purpose of this review is both to give a detailed description of this metaheuristic and to show where it stands in terms of performance.

Image compression predicated on recurrent iterated function systems

Recurrent iterated function systems (RIFSs) are improvements of iterated function systems (IFSs) using elements of the theory of Marcovian stochastic processes which can produce more natural looking images. We construct new RIFSs consisting substantially of a vertical contraction factor function and nonlinear transformations. These RIFSs are applied to image compression.

Iterated deferred correction for linear two-point boundary value problems

An analysis of iterated deferred correction based on various classes of implicit Runge-Kutta formulae is given. Out of different possibilities considered, it is shown that those based purely on Lobatto formulae have the best stability. The enhanced stability of Lobatto schemes is very important for the efficient integration of excessively stiff boundary value problems and this is demonstrated by means of some numerical results.

An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks

We present a metaheuristic approach which combines constructive heuristics and local searches based on sampling with path relinking. Its effectiveness is demonstrated by an application to the problem of allocating switches in electrical distribution networks to improve their reliability. Our approach also treats the service restoration problem, which has to be solved as a subproblem, to evaluate the reliability benefit of a given switch allocation proposal. Comparisons with other metaheuristics and with a branch-and-bound procedure evaluate its performance. © 2012 Published by Elsevier Ltd.

The Complexity of Non-Iterated Probabilistic Justification Logic

The logic PJ is a probabilistic logic defined by adding (noniterated) probability operators to the basic justification logic J. In this paper we establish upper and lower bounds for the complexity of the derivability problem in the logic PJ. The main result of the paper is that the complexity of the derivability problem in PJ remains the same as the complexity of the derivability problem in the underlying logic J, which is π[p/2] -complete. This implies that the probability operators do not increase the complexity of the logic, although they arguably enrich the expressiveness of the language.