O objetivo do presente trabalho foi propor métodos de processamento de sinais e reconhecimento de padrões dos sinais de respostas de sensores de gás, utilizando técnicas e modelos da geometria fractal. Foram analisados e estudados os sinais de resposta de dois tipos de sensores. O primeiro sensor foi um dispositivo de óxido de estanho, cujo princípio de funcionamento baseia-se na mudança da resistividade do filme. Este forneceu sinais de respostas com características ruidosas como resposta à interação com as moléculas de gás. O segundo sensor foi um dispositivo Metal-Óxido-Semicondutor (MOS) com princípio de funcionamento baseado na geração de foto corrente, fornecendo respostas imagens bidimensionais. Para as análises dos sinais ruidosos do sensor de óxido de estanho, foi proposto um método de processamento baseado no modelo do movimento Browniano fracionário. Com este método foi possível a discriminação de gases combustíveis com uma taxa de acerto igual a 100%. Para as análises das respostas do tipo imagem do sensor MOS, foram propostos dois diferentes métodos. O primeiro foi embasado no princípio de compressão fractal de imagens e o segundo método proposto, foi baseado na análise e determinação da dimensão fractal multiescala. Ambos os métodos propostos mostram-se eficazes para a determinação da assinatura, como o reconhecimento, de todos os gases que foram utilizados nos experimentos. Os resultados obtidos no presente trabalho abrem novas fronteiras e perspectivas nos paradigmas de processamento de sinais e reconhecimento de padrões, quando utilizada a teoria da geometria fractal. / The aim of the present work was to propose methods for signal possessing and pattern, recognition from the signals response of gas sensors using models and techniques from the fractal geometry. The data studied and analyzed were obtained from two kinds of sensors. The first sensor was the tin oxide device, which detection principle is based on the resistivity changes of the tin oxide film and it provides noisy signals as response to the gas interaction. The second sensor was a metal-oxide-semiconductor (MOS) device, which has as the working principle the photocurrent generation. This sensor provides two-dimensional images signals. A method using a fractional Brownian motion was proposed to analyze the noise signal from the tin oxide device. The fuel gases discrimination employing this model was 100% successful. Two different methods were proposed to analyze the signal response from the MOS device. The first method was based on the fractal image compression technique and the second one was based on the analysis and determination of the multiscale fractal dimension. Both proposed methods have shown to be efficient tools for signature determination as the pattern recognition of all gases that were used in the experiment. The results obtained in the present work open new frontiers and perspectives inside the paradigms of the signal processing and pattern recognition by using the fractal theory.

O objetivo do presente trabalho foi propor métodos de processamento de sinais e reconhecimento de padrões dos sinais de respostas de sensores de gás, utilizando técnicas e modelos da geometria fractal. Foram analisados e estudados os sinais de resposta de dois tipos de sensores. O primeiro sensor foi um dispositivo de óxido de estanho, cujo princípio de funcionamento baseia-se na mudança da resistividade do filme. Este forneceu sinais de respostas com características ruidosas como resposta à interação com as moléculas de gás. O segundo sensor foi um dispositivo Metal-Óxido-Semicondutor (MOS) com princípio de funcionamento baseado na geração de foto corrente, fornecendo respostas imagens bidimensionais. Para as análises dos sinais ruidosos do sensor de óxido de estanho, foi proposto um método de processamento baseado no modelo do movimento Browniano fracionário. Com este método foi possível a discriminação de gases combustíveis com uma taxa de acerto igual a 100%. Para as análises das respostas do tipo imagem do sensor MOS, foram propostos dois diferentes métodos. O primeiro foi embasado no princípio de compressão fractal de imagens e o segundo método proposto, foi baseado na análise e determinação da dimensão fractal multiescala. Ambos os métodos propostos mostram-se eficazes para a determinação da assinatura, como o reconhecimento, de todos os gases que foram utilizados nos experimentos. Os resultados obtidos no presente trabalho abrem novas fronteiras e perspectivas nos paradigmas de processamento de sinais e reconhecimento de padrões, quando utilizada a teoria da geometria fractal. / The aim of the present work was to propose methods for signal possessing and pattern, recognition from the signals response of gas sensors using models and techniques from the fractal geometry. The data studied and analyzed were obtained from two kinds of sensors. The first sensor was the tin oxide device, which detection principle is based on the resistivity changes of the tin oxide film and it provides noisy signals as response to the gas interaction. The second sensor was a metal-oxide-semiconductor (MOS) device, which has as the working principle the photocurrent generation. This sensor provides two-dimensional images signals. A method using a fractional Brownian motion was proposed to analyze the noise signal from the tin oxide device. The fuel gases discrimination employing this model was 100% successful. Two different methods were proposed to analyze the signal response from the MOS device. The first method was based on the fractal image compression technique and the second one was based on the analysis and determination of the multiscale fractal dimension. Both proposed methods have shown to be efficient tools for signature determination as the pattern recognition of all gases that were used in the experiment. The results obtained in the present work open new frontiers and perspectives inside the paradigms of the signal processing and pattern recognition by using the fractal theory.

<div>Given a parametrized family of Iterated Function System (IFS) we give sufficient conditions for a parameter on the boundary of the connectedness locus, M, to be accessible from the complement of M.</div><div>Moreover, we provide a few examples of such parameters and describe how they are connected to Misiurewicz parameter in the Mandelbrot set, i.e. the connectedness locus of the quadratic family z^2+c.<br></div>

In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1, 2. In the binary case, results are extended to codes from neighbourhood designs of the line graphs Li+1(Kn) using certain elementary relations. Codes from incidence designs of complete graphs, Kn, and neighbourhood designs of their line graphs, L1(Kn) (the so-called triangular graphs), have been considered elsewhere by others. We consider codes from incidence designs of L1(Kn) and L2(Kn), and neighbourhood designs of L2(Kn) and L3(Kn). In each case, basic parameters of the codes are determined. Further, we introduce a family of vertex-transitive graphs 􀀀n that are embeddable into the strong product L1(Kn) ⊠ K2, of triangular graphs and K2, a class which at first sight may seem unnatural but, on closer look, is a repository of graphs rich with combinatorial structures. For instance, unlike most regular graphs considered here and elsewhere that only come with incidence and neighbourhood designs, 􀀀n also has what we have termed as 6-cycle designs. These are designs in which the point set contains vertices of the graph and every block contains vertices of a 6-cycle in the graph. Also, binary codes from incidence matrices of these graphs have other minimum words in addition to incidence vectors of the blocks. In addition, these graphs have induced subgraphs isomorphic to the family Hn of complete porcupines (see Definition 4.11). We describe codes from incidence matrices of 􀀀n and Hn and determine their parameters.

In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1, 2. In the binary case, results are extended to codes from neighbourhood designs of the line graphs Li+1(Kn) using certain elementary relations. Codes from incidence designs of complete graphs, Kn, and neighbourhood designs of their line graphs, L1(Kn) (the so-called triangular graphs), have been considered elsewhere by others. We consider codes from incidence designs of L1(Kn) and L2(Kn), and neighbourhood designs of L2(Kn) and L3(Kn). In each case, basic parameters of the codes are determined. Further, we introduce a family of vertex-transitive graphs 􀀀n that are embeddable into the strong product L1(Kn) ⊠ K2, of triangular graphs and K2, a class which at first sight may seem unnatural but, on closer look, is a repository of graphs rich with combinatorial structures. For instance, unlike most regular graphs considered here and elsewhere that only come with incidence and neighbourhood designs, 􀀀n also has what we have termed as 6-cycle designs. These are designs in which the point set contains vertices of the graph and every block contains vertices of a 6-cycle in the graph. Also, binary codes from incidence matrices of these graphs have other minimum words in addition to incidence vectors of the blocks. In addition, these graphs have induced subgraphs isomorphic to the family Hn of complete porcupines (see Definition 4.11). We describe codes from incidence matrices of 􀀀n and Hn and determine their parameters.

The purpose of this thesis is to generalize the growing theory of iterated function systems (IFSs). Earlier, hyperbolic IFSs with finitely many functions have been studied extensively. Also, hyperbolic IFSs with infinitely many functions have been studied. In this thesis, more general IFSs are studied. The Hausdorff pseudometric is studied. This is a generalization of the Hausdorff metric. Wide and narrow limit sets are studied. These are two types of limits of sequences of sets in a complete pseudometric space. Stable Iterated Function Systems, a kind of generalization of hyperbolic IFSs, are defined. Some different, but closely related, types of stability for the IFSs are considered. It is proved that the IFSs with the most general type of stability have unique attractors. Also, invariant sets, addressing, and periodic points for stable IFSs are studied. Hutchinson’s metric (also called Vaserhstein’s metric) is generalized from being defined on a space of probability measures, into a class of norms, the £-norms, on a space of real measures (on certain metric spaces). Under rather general conditions, it is proved that these norms, when they are restricted to positive measures, give rise to complete metric spaces with the metric topology coinciding with the weak*-topology. Then, IFSs with probabilities (IFSPs) are studied, in particular, stable IFSPs. The £-norm-results are used to prove that, as in the case of hyperbolic IFSPs, IFSPs with the most general kind of stability have unique invariant measures. These measures are ”attractive”. Also, an invariant measure is constructed by first ”lifting” the IFSP to the code space. Finally, it is proved that the Random Iteration Algorithm in a sense will ”work” for some stable IFSPs. / <p>Diss. Umeå : Umeå universitet, 1992</p> / digitalisering@umu

Logic-based formalizations of dynamical systems are central to the field of knowledge representation and reasoning. These formalizations can be used to model agents that act, reason,and perceive in a changing and incompletely known environment. A key aspect of reasoning about agents and their behaviors is the notion of joint ability. A team of agents is jointly able to achieve a goal if despite any incomplete knowledge or even false beliefs about the world or each other, they still know enough to be able to get to a goal state, should they choose to do so. A particularly challenging issue associated with joint ability is how team members can coordinate their actions. Existing approaches often require the agents to communicate to agree on a joint plan. In this thesis, we propose an account of joint ability that supports coordination among agents without requiring communication, and that allows for agents to have incomplete (or even false) beliefs about the world or the beliefs of other agents. We use ideas from game theory to address coordination among agents. We introduce the notion of a strategy for each agent which is basically a plan that the agent knows how to follow. Each agent compares her strategies and iteratively discards those that she believes are not good considering the strategies that the other agents have kept. Our account is developed in the situation calculus, a logical language suitable for representing and reasoning about action and change that is extended to support reasoning about multiple agents. Through several examples involving public, private, and sensing actions, we demonstrate how symbolic proof techniques allow us to reason about team ability despite incomplete specifications about the beliefs of agents.

In dieser Arbeit werden Zufallsfeld-Ising-Modelle mit einem eingefrorenen dichotomen symmetrischen Zufallsfeld für den eindimensionalen Fall und das Bethe-Gitter untersucht. Dabei wird die kanonische Zustandssumme zu der eines einzelnen Spins in einem effektiven Feld umformuliert. Im ersten Teil der Arbeit werden das mulktifraktale Spektrum dieses effektiven Feldes untersucht, Übergänge im Spektrum erklärt und Ungleichungen zwischen lokalen und globalen Dimensionsbegriffen bewiesen, die eine weitgehend vollständige Charakterisierung des multifraktalen Spektrums durch eine Reihe von Schranken erlauben. Ein weiterer Teil der Arbeit beschäftigt sich mit einer ähnlichen Charakterisierung des Maßes der lokalen Magnetisierung, das aus dem Maß des effektiven Feldes durch Faltung hervorgeht. In diesem Zusammenhang wird die Faltung von Multifraktalen in einem allgemeineren Rahmen behandelt und Zusammenhänge zwischen den multifraktalen Eigenschaften der Faltung und denen der gefalteten Maße bewiesen. Im dritten Teil der Dissertation wird der Phasenübergang von Ferro- zu Paramagnetismus im Modell auf dem Bethe Gitter untersucht. Neben verbesserten exakten Schranken für die Eindeutigkeit des paramagnetischen Zustands werden im wesentlichen drei Kriterien für die tatsächliche Lage des Übergangs angegeben und numerisch ausgewertet. Die multifraktalen Eigenschaften des effektiven Felds im Modell auf dem Bethe-Gitter schließlich erweisen sich als trivial, da die interessanten Dimensionen nicht existieren. / In this work random field Ising models with quenched dichotomous symmetric random field are considered for the one-dimensional case and on the Bethe lattice. To this end the canonical partition function is reformulated to the partition function of one spin in an effective field. In the first part of the work the multifractal spectrum of this effective field is investigated, transitions in the spectrum are explained and inequalities between local and global generalized fractal dimensions are proven which allow to characterize the multifractal spectrum bei various bounds. A further part of the work is dedicated to the characterization of the measure of the local magnetization which is obtained by convolution of the measure of the effective field with itself. In this context the convolution of multifractals is investigated in a more general setup and relations between the multifractal properties of the convolution and the multifractal properties of the convoluted measures are proven. The phase transition from ferro- to paramagnetismus for the model on the Bethe lattice is investigated in the third part of the thesis. Apart from improved exact bounds for the uniqueness of the paramagnetic state essentially three criteria for the transition are developped and numerically evaluated to determine the transition line. The multifractal properties of the effective field for the model on the Bethe lattice finally turn out to be trivial because the interesting dimensions do not exist.

Theory as an approach to generative composition and interactive computer music. Inspired by the notion of Performance Indeterminacy, software has been developed that attempts to simulate the interactions of improvising performers using a multi-agent system based on the ‘Iterated Prisoner’s Dilemma’. Composition activities and programming activities have formed a symbiotic relationship throughout the creation of the portfolio as each has constantly informed the other. Stylistically, the works presented fall into the experimental genre, although individually they address a wide range of aesthetic goals. The main contribution of this portfolio is a new approach to generative composition based on behavioural models, creating a sense of form bottom-up through modelling the social dynamics of music performance. Through this approach, the direct modelling of musical structures is avoided; instead larger scale forms emerge through the interactions of an ensemble of ‘improvising’ agents. This method offers a departure from previous complex systems work in the area of music, creating computer models of specific musical situations. Links between the Iterated Prisoner’s Dilemma and music are also established and combined with current music technologies. / Thesis(Ph.D.)- University of Adelaide, Elder Conservatorium of Music, 2008

Theory as an approach to generative composition and interactive computer music. Inspired by the notion of Performance Indeterminacy, software has been developed that attempts to simulate the interactions of improvising performers using a multi-agent system based on the ‘Iterated Prisoner’s Dilemma’. Composition activities and programming activities have formed a symbiotic relationship throughout the creation of the portfolio as each has constantly informed the other. Stylistically, the works presented fall into the experimental genre, although individually they address a wide range of aesthetic goals. The main contribution of this portfolio is a new approach to generative composition based on behavioural models, creating a sense of form bottom-up through modelling the social dynamics of music performance. Through this approach, the direct modelling of musical structures is avoided; instead larger scale forms emerge through the interactions of an ensemble of ‘improvising’ agents. This method offers a departure from previous complex systems work in the area of music, creating computer models of specific musical situations. Links between the Iterated Prisoner’s Dilemma and music are also established and combined with current music technologies. / Thesis(Ph.D.)- University of Adelaide, Elder Conservatorium of Music, 2008