Some uniform stability and convergence results for integral equations on the real line and projection methods for their solution

The paper considers second kind equations of the form (abbreviated x=y + K2x) in which and the factor z is bounded but otherwise arbitrary so that equations of Wiener-Hopf type are included as a special case. Conditions on a set are obtained such that a generalized Fredholm alternative is valid: if W satisfies these conditions and I − Kz, is injective for each z ε W then I − Kz is invertible for each z ε W and the operators (I − Kz)−1 are uniformly bounded. As a special case some classical results relating to Wiener-Hopf operators are reproduced. A finite section version of the above equation (with the range of integration reduced to [−a, a]) is considered, as are projection and iterated projection methods for its solution. The operators (where denotes the finite section version of Kz) are shown uniformly bounded (in z and a) for all a sufficiently large. Uniform stability and convergence results, for the projection and iterated projection methods, are obtained. The argument generalizes an idea in collectively compact operator theory. Some new results in this theory are obtained and applied to the analysis of projection methods for the above equation when z is compactly supported and k(s − t) replaced by the general kernel k(s,t). A boundary integral equation of the above type, which models outdoor sound propagation over inhomogeneous level terrain, illustrates the application of the theoretical results developed.

Small time Chung-type LIL for Lévy processes

We prove Chung-type laws of the iterated logarithm for general Lévy processes at zero. In particular, we provide tools to translate small deviation estimates directly into laws of the iterated logarithm. This reveals laws of the iterated logarithm for Lévy processes at small times in many concrete examples. In some cases, exotic norming functions are derived.

Uniqueness of signature for simple curves

We propose a topological approach to the problem of determining a curve from its iterated integrals. In particular, we prove that a family of terms in the signature series of a two dimensional closed curve with finite p-variation, 1≤p<2, are in fact moments of its winding number. This relation allows us to prove that the signature series of a class of simple non-smooth curves uniquely determine the curves. This implies that outside a Chordal SLEκ null set, where 0<κ≤4, the signature series of curves uniquely determine the curves. Our calculations also enable us to express the Fourier transform of the n-point functions of SLE curves in terms of the expected signature of SLE curves. Although the techniques used in this article are deterministic, the results provide a platform for studying SLE curves through the signatures of their sample paths.

The uniqueness of signature problem in the non-Markov setting

We establish a general framework for a class of multidimensional stochastic processes over [0,1] under which with probability one, the signature (the collection of iterated path integrals in the sense of rough paths) is well-defined and determines the sample paths of the process up to reparametrization. In particular, by using the Malliavin calculus we show that our method applies to a class of Gaussian processes including fractional Brownian motion with Hurst parameter H>1/4, the Ornstein–Uhlenbeck process and the Brownian bridge.

On univoque points for self-similar sets

Let K⊆R be the unique attractor of an iterated function system. We consider the case where K is an interval and study those elements of K with a unique coding. We prove under mild conditions that the set of points with a unique coding can be identified with a subshift of finite type. As a consequence, we can show that the set of points with a unique coding is a graph-directed self-similar set in the sense of Mauldin and Williams (1988). The theory of Mauldin and Williams then provides a method by which we can explicitly calculate the Hausdorff dimension of this set. Our algorithm can be applied generically, and our result generalises the work of Daróczy, Kátai, Kallós, Komornik and de Vries.

Tokamak magnetic field lines described by simple maps

The magnetic field line structure in a tokamak can be obtained by direct numerical integration of the field line equations. However, this is a lengthy procedure and the analysis of the solution may be very time-consuming. Otherwise we can use simple two-dimensional, area-preserving maps, obtained either by approximations of the magnetic field line equations, or from dynamical considerations. These maps can be quickly iterated, furnishing solutions that mirror the ones obtained from direct numerical integration, and which are useful when long-term studies of field line behavior are necessary (e.g. in diffusion calculations). In this work we focus on a set of simple tokamak maps for which these advantages are specially pronounced.

Iteration of closed geodesics in stationary Lorentzian manifolds

Following the lines of Bott in (Commun Pure Appl Math 9:171-206, 1956), we study the Morse index of the iterates of a closed geodesic in stationary Lorentzian manifolds, or, more generally, of a closed Lorentzian geodesic that admits a timelike periodic Jacobi field. Given one such closed geodesic gamma, we prove the existence of a locally constant integer valued map Lambda(gamma) on the unit circle with the property that the Morse index of the iterated gamma(N) is equal, up to a correction term epsilon(gamma) is an element of {0,1}, to the sum of the values of Lambda(gamma) at the N-th roots of unity. The discontinuities of Lambda(gamma) occur at a finite number of points of the unit circle, that are special eigenvalues of the linearized Poincare map of gamma. We discuss some applications of the theory.

AFRODITE: ambiente de simulação baseado em agentes com emoções

Este trabalho está relacionado às áreas de Sistemas Multiagentes, Simulação Computacional e Emoções. A partir do estudo destas áreas de pesquisa, foi proposto e desenvolvido um protótipo para um ambiente de simulação baseado em agentes com emoções. Os sistemas multiagentes têm sido utilizados nas mais diversas áreas de pesquisa, não apenas para a área acadêmica, mas também para fins comerciais. Isso ocorre devido a características importantes que estes possuem, como flexibilidade e cooperação. Estas características são úteis para um grande número de aplicações, como para simulação de situações reais, pois os modelos de simulação desenvolvidos utilizando a tecnologia de agentes são muito eficazes e versáteis no estudo dos mais diferentes problemas. Emoções vêm sendo estudadas há algum tempo, pois elas influenciam a tomada de decisão de todas as suas atividades. A tentativa de expressar emoções é algo complexo, dependendo de diversos fatores, tanto sociais como fisiológicos. Objetivando a abrangência das pesquisas na área de sistemas multiagentes, este trabalho propõe o desenvolvimento de um protótipo para um ambiente de simulação baseado em agentes com emoções, utilizando como base para a estruturação das emoções o modelo OCC. Este novo ambiente é chamado AFRODITE. De forma a melhor definir como o AFRODITE seria implementado, foram estudados quatro ambientes de simulação baseados em agentes existentes - SIEME, SWARM, SeSAm e SIMULA, e alguns aspectos destes foram utilizados na construção do novo ambiente. Para demonstrar como o AFRODITE é utilizado, três exemplos de aplicações de áreas de conhecimentos diferentes foram modelados: o IPD (Iterated Prisoner’s Dilemma), da área de Teoria dos Jogos; Simulação de Multidões, da área de Engenharia de Segurança; e Venda de aparelhos celulares com serviço WAP, da área de Telecomunicações. Através dos três exemplos modelados foi possível demonstrar que o ambiente proposto é de fácil utilização e que a tarefa de inserção de emoções nas regras de comportamento pode ser realizada pelo usuário de forma transparente.

Estimação em classes de processos estocásticos com decaimento hiperbólico da função de autocorrelação

Neste trabalho analisamos processos estocásticos com decaimento polinomial (também chamado hiperbólico) da função de autocorrelação. Nosso estudo tem enfoque nas classes dos Processos ARFIMA e dos Processos obtidos à partir de iterações da transformação de Manneville-Pomeau. Os objetivos principais são comparar diversos métodos de estimação para o parâmetro fracionário do processo ARFIMA, nas situações de estacionariedade e não estacionariedade e, além disso, obter resultados similares para o parâmetro do processo de Manneville-Pomeau. Entre os diversos métodos de estimação para os parâmetros destes dois processos destacamos aquele baseado na teoria de wavelets por ser aquele que teve o melhor desempenho.

On the iteration of Katsuno and Mendelzon update

In this dissertation we present a model for iteration of Katsuno and Mendelzon’s Update, inspired in the developments for iteration in AGM belief revision. We adapt Darwiche and Pearls’ postulates of iterated belief revision to update (as well as the independence postulate proposed in [BM06, JT07]) and show two families of such operators, based in natural [Bou96] and lexicographic revision [Nay94a, NPP03]. In all cases, we provide a possible worlds semantics of the models.

Lobatto deferred correction for stiff two-point boundary value problems

An iterated deferred correction algorithm based on Lobatto Runge-Kutta formulae is developed for the efficient numerical solution of nonlinear stiff two-point boundary value problems. An analysis of the stability properties of general deferred correction schemes which are based on implicit Runge-Kutta methods is given and results which are analogous to those obtained for initial value problems are derived. A revised definition of symmetry is presented and this ensures that each deferred correction produces an optimal increase in order. Finally, some numerical results are given to demonstrate the superior performance of Lobatto formulae compared with mono-implicit formulae on stiff two-point boundary value problems. (C) 1998 Elsevier B.V. Ltd. All rights reserved.

Generating Birth and Death Processes

Associated with an ordered sequence of an even number 2N of positive real numbers is a birth and death process (BDP) on {0, 1, 2,..., N} having these real numbers as its birth and death rates. We generate another birth and death process from this BDP on {0, 1, 2,..., 2N}. This can be further iterated. We illustrate with an example from tan(kz). In BDP, the decay parameter, viz., the largest non-zero eigenvalue is important in the study of convergence to stationarity. In this article, the smallest eigenvalue is found to be useful.

Boundary of the rauzy fractal sets in R x C generated by P(x)=x(4)-x(3)-x(2)-x-1

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

On the number of singularities in generic deformations of map germs

Let f:C-n, 0 --> C-p, 0 be a K-finite map germ, and let i = (i(1),..., i(k)) be a Boardman symbol such that Sigma(i) has codimension n in the corresponding jet space J(k)(n, p). When its iterated successors have codimension larger than n, the paper gives a list of situations in which the number of Sigma(i) points that appear in a generic deformation of f can be computed algebraically by means of Jacobian ideals of f. This list can be summarised in the following way: f must have rank n - i(1) and, in addition, in the case p = 6, f must be a singularity of type Sigma(i2.i2).

Uma nova heurística para o problema de minimização de trocas de ferramentas

O problema de minimização de troca de ferramentas (MTSP) busca uma sequência de processamento de um conjunto de tarefas, de modo a minimizar o número de trocas de ferramentas requeridas. Este trabalho apresenta uma nova heurística para o MTSP, capaz de produzir bons limitantes superiores para um algoritmo enumerativo. Esta heurística possui duas fases: uma fase construtiva que é baseada em um grafo em que os vértices correspondem a ferramentas e existe um arco k = (i, j) que liga os vértices i e j se e somente se as ferramentas i e j são necessárias para a execução de alguma tarefa k; e uma fase de refinamento baseada na meta-heurística Busca Local Iterativa. Resultados computacionais mostram que a heurística proposta tem um bom desempenho para os problemas testados, contribuindo para uma redução significativa no número de nós gerados de um algoritmo enumerativo.