157 resultados para Hausdorff frattali Mandelbrot
Resumo:
This paper investigates detection of architectural distortion in mammographic images using support vector machine. Hausdorff dimension is used to characterise the texture feature of mammographic images. Support vector machine, a learning machine based on statistical learning theory, is trained through supervised learning to detect architectural distortion. Compared to the Radial Basis Function neural networks, SVM produced more accurate classification results in distinguishing architectural distortion abnormality from normal breast parenchyma.
Resumo:
Starting with the work of Lapidus and van Frankenhuysen a number of papers have introduced zeta functions as a way of capturing multifractal information. In this paper we propose a new multifractal zeta function and show that under certain conditions the abscissa of convergence yields the Hausdorff multifractal spectrum for a class of measures.
Resumo:
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.
Resumo:
Let X be a compact Hausdorff space, phi: X -> S(n) a continuous map into the n-sphere S(n) that induces a nonzero homomorphism phi*: H(n)(S(n); Z(p)) -> H(n)(X; Z(p)), Y a k-dimensional CW-complex and f: X -> a continuous map. Let G a finite group which acts freely on S`. Suppose that H subset of G is a normal cyclic subgroup of a prime order. In this paper, we define and we estimate the cohomological dimension of the set A(phi)(f, H, G) of (H, G)-coincidence points of f relative to phi.
Resumo:
We construct a two-point selection f : [P](2) -> P, where P is the set of the irrational numbers, such that the space (P, tau(f)) is not normal and it is not collectionwise Hausdorff either. Here, tau(f) denotes the topology generated by the two-point selection f. This example answers a question posed by V. Gutev and T. Nogura. We also show that if f :[X](2) -> X is a two-point selection such that the topology tau(f) has countable pseudocharacter, then tau(f) is a Tychonoff topology. (C) 2008 Elsevier B.V. All rights reserved.
Resumo:
Let F be a singular Riemannian foliation on a compact Riemannian manifold M. By successive blow-ups along the strata of F we construct a regular Riemannian foliation (F) over cap on a compact Riemannian manifold (M) over cap and a desingularization map (rho) over cap : (M) over cap -> M that projects leaves of (F) over cap into leaves of F. This result generalizes a previous result due to Molino for the particular case of a singular Riemannian foliation whose leaves were the closure of leaves of a regular Riemannian foliation. We also prove that, if the leaves of F are compact, then, for each small epsilon > 0, we can find (M) over cap and (F) over cap so that the desingularization map induces an epsilon-isometry between M/F and (M) over cap/(F) over cap. This implies in particular that the space of leaves M/F is a Gromov-Hausdorff limit of a sequence of Riemannian orbifolds {((M) over cap (n)/(F) over cap (n))}.
Resumo:
Let X be a compact Hausdorff space, Y be a connected topological manifold, f : X -> Y be a map between closed manifolds and a is an element of Y. The vanishing of the Nielsen root number N(f; a) implies that f is homotopic to a root free map h, i.e., h similar to f and h(-1) (a) = empty set. In this paper, we prove an equivariant analog of this result for G-maps between G-spaces where G is a finite group. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
The definition of semi-hyperbolic dynamical systems generated by Lipschitz continuous and not necessarily invertible mappings in Banach spaces is presented in this thesis. Like hyperbolic mappings, they involve a splitting into stable and unstable spaces, but a slight leakage from the strict invariance of the spaces is possible and the unstable subspaces are assumed to be finite dimensional. Bi-shadowing is a combination of the concepts of shadowing and inverse shadowing and is usually used to compare pseudo-trajectories calculated by a computer with the true trajectories. In this thesis, the concept of bi-shadowing in a Banach space is defined and proved for semi-hyperbolic dynamical systems generated by Lipschitz mappings. As an application to the concept of bishadowing, linear delay differential equations are shown to be bi-shadowing with respect to pseudo-trajectories generated by nonlinear small perturbations of the linear delay equation. This shows robustness of solutions of the linear delay equation with respect to small nonlinear perturbations. Complicated dynamical behaviour is often a consequence of the expansivity of a dynamical system. Semi-hyperbolic dynamical systems generated by Lipschitz mappings on a Banach space are shown to be exponentially expansive, and explicit rates of expansion are determined. The result is applied to a nonsmooth noninvertible system generated by delay differential equation. It is shown that semi-hyperbolic mappings are locally φ-contracting, where -0 is the Hausdorff measure of noncompactness, and that a linear operator is semi-hyperbolic if and only if it is φ-contracting and has no spectral values on the unit circle. The definition of φ-bi-shadowing is given and it is shown that semi-hyperbolic mappings in Banach spaces are φ-bi-shadowing with respect to locally condensing continuous comparison mappings. The result is applied to linear delay differential equations of neutral type with nonsmooth perturbations. Finally, it is shown that a small delay perturbation of an ordinary differential equation with a homoclinic trajectory is ‘chaotic’.
Resumo:
Mandelbrot (1971) demonstrou a importância de considerar dependências de longo prazo na precificação de ativos - o método tradicional para mensurá-las, encontrado em Hurst (1951), faz uso da estatística R/S. Paralelamente a isso, Box e Jenkins (1976; edição original de 1970) apresentaram sua famosa metodologia para determinação da ordem dos parâmetros de modelos desenvolvidos no contexto de processos com memória de curto prazo, conhecidos por ARIMA (acrônimo do inglês Autoregressive Integrated Moving Average). Estimulados pela percepção de que um modelo que pretenda representar fielmente o processo gerador de dados deva explicar tanto a dinâmica de curto prazo quanto a de longo prazo, Granger e Joyeux (1980) e Hosking (1981) introduziram os modelos ARFIMA (de onde o F adicionado vem de Fractionally), uma generalização da classe ARIMA, nos quais a dependência de longo prazo estimada é relacionada ao valor do parâmetro de integração. Pode-se dizer que a partir de então processos com alto grau de persistência passaram a atrair cada vez mais o interesse de pesquisadores, o que resultou no desenvolvimento de outros métodos para estimá-la, porém sem que algum tenha se sobressaído claramente – e é neste ponto que o presente trabalho se insere. Por meio de simulações, buscou-se: (1) classificar diversos estimadores quanto a sua precisão, o que nos obrigou a; (2) determinar parametrizações razoáveis desses, entendidas aqui como aquelas que minimizam o viés, o erro quadrático médio e o desvio-padrão. Após rever a literatura sobre o tema, abordar estes pontos se mostrou necessário para o objetivo principal: elaborar estratégias de negociação baseadas em projeções feitas a partir da caracterização de dependências em dados intradiários, minuto a minuto, de ações e índices de ações. Foram analisadas as séries de retornos da ação Petrobras PN e do Índice Bovespa, com dados de 01/04/2013 a 31/03/2014. Os softwares usados foram o S-Plus e o R.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
The complex behavior of a wide variety of phenomena that are of interest to physicists, chemists, and engineers has been quantitatively characterized by using the ideas of fractal and multifractal distributions, which correspond in a unique way to the geometrical shape and dynamical properties of the systems under study. In this thesis we present the Space of Fractals and the methods of Hausdorff-Besicovitch, box-counting and Scaling to calculate the fractal dimension of a set. In this Thesis we investigate also percolation phenomena in multifractal objects that are built in a simple way. The central object of our analysis is a multifractal object that we call Qmf . In these objects the multifractality comes directly from the geometric tiling. We identify some differences between percolation in the proposed multifractals and in a regular lattice. There are basically two sources of these differences. The first is related to the coordination number, c, which changes along the multifractal. The second comes from the way the weight of each cell in the multifractal affects the percolation cluster. We use many samples of finite size lattices and draw the histogram of percolating lattices against site occupation probability p. Depending on a parameter, ρ, characterizing the multifractal and the lattice size, L, the histogram can have two peaks. We observe that the probability of occupation at the percolation threshold, pc, for the multifractal is lower than that for the square lattice. We compute the fractal dimension of the percolating cluster and the critical exponent β. Despite the topological differences, we find that the percolation in a multifractal support is in the same universality class as standard percolation. The area and the number of neighbors of the blocks of Qmf show a non-trivial behavior. A general view of the object Qmf shows an anisotropy. The value of pc is a function of ρ which is related to its anisotropy. We investigate the relation between pc and the average number of neighbors of the blocks as well as the anisotropy of Qmf. In this Thesis we study likewise the distribution of shortest paths in percolation systems at the percolation threshold in two dimensions (2D). We study paths from one given point to multiple other points
Resumo:
The complex behavior of a wide variety of phenomena that are of interest to physicists, chemists, and engineers has been quantitatively characterized by using the ideas of fractal and multifractal distributions, which correspond in a unique way to the geometrical shape and dynamical properties of the systems under study. In this thesis we present the Space of Fractals and the methods of Hausdorff-Besicovitch, box-counting and Scaling to calculate the fractal dimension of a set. In this Thesis we investigate also percolation phenomena in multifractal objects that are built in a simple way. The central object of our analysis is a multifractal object that we call Qmf . In these objects the multifractality comes directly from the geometric tiling. We identify some differences between percolation in the proposed multifractals and in a regular lattice. There are basically two sources of these differences. The first is related to the coordination number, c, which changes along the multifractal. The second comes from the way the weight of each cell in the multifractal affects the percolation cluster. We use many samples of finite size lattices and draw the histogram of percolating lattices against site occupation probability p. Depending on a parameter, ρ, characterizing the multifractal and the lattice size, L, the histogram can have two peaks. We observe that the probability of occupation at the percolation threshold, pc, for the multifractal is lower than that for the square lattice. We compute the fractal dimension of the percolating cluster and the critical exponent β. Despite the topological differences, we find that the percolation in a multifractal support is in the same universality class as standard percolation. The area and the number of neighbors of the blocks of Qmf show a non-trivial behavior. A general view of the object Qmf shows an anisotropy. The value of pc is a function of ρ which is related to its anisotropy. We investigate the relation between pc and the average number of neighbors of the blocks as well as the anisotropy of Qmf. In this Thesis we study likewise the distribution of shortest paths in percolation systems at the percolation threshold in two dimensions (2D). We study paths from one given point to multiple other points. In oil recovery terminology, the given single point can be mapped to an injection well (injector) and the multiple other points to production wells (producers). In the previously standard case of one injection well and one production well separated by Euclidean distance r, the distribution of shortest paths l, P(l|r), shows a power-law behavior with exponent gl = 2.14 in 2D. Here we analyze the situation of one injector and an array A of producers. Symmetric arrays of producers lead to one peak in the distribution P(l|A), the probability that the shortest path between the injector and any of the producers is l, while the asymmetric configurations lead to several peaks in the distribution. We analyze configurations in which the injector is outside and inside the set of producers. The peak in P(l|A) for the symmetric arrays decays faster than for the standard case. For very long paths all the studied arrays exhibit a power-law behavior with exponent g ∼= gl.
Resumo:
In this work we present the principal fractals, their caracteristics, properties abd their classification, comparing them to Euclidean Geometry Elements. We show the importance of the Fractal Geometry in the analysis of several elements of our society. We emphasize the importance of an appropriate definition of dimension to these objects, because the definition we presently know doesn t see a satisfactory one. As an instrument to obtain these dimentions we present the Method to count boxes, of Hausdorff- Besicovich and the Scale Method. We also study the Percolation Process in the square lattice, comparing it to percolation in the multifractal subject Qmf, where we observe som differences between these two process. We analize the histogram grafic of the percolating lattices versus the site occupation probability p, and other numerical simulations. And finaly, we show that we can estimate the fractal dimension of the percolation cluster and that the percolatin in a multifractal suport is in the same universality class as standard percolation. We observe that the area of the blocks of Qmf is variable, pc is a function of p which is related to the anisotropy of Qmf