Thesis(M.S.)--Auburn University, 2005. / Abstract. Vita. Includes bibliographic references (p.30-31).

Thesis (Ph. D., Bioinformatics and Computational Biology)--University of Idaho, December 2006. / Major professor: Robert B. Heckendorn. Includes bibliographical references (leaves 66-71). Also available online (PDF file) by subscription or by purchasing the individual file.

Thesis (M.S.)--University of Tennessee, Knoxville, 2008. / Title from title page screen (viewed on Mar. 5, 2009). Thesis advisor: Shih-Lung Shaw. Vita. Includes bibliographical references.

Thesis (M.Sc.)--York University, 2006. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 117-130). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR29613

Thesis (M.S.)--Rochester Institute of Technology, 2010. / Typescript. Includes bibliographical references (leaves 52-58).

Thesis (D. M. A.)--Ohio State University, 2005. / Title from first page of PDF file. Document formatted into pages; contains vii, 133 p.; also includes graphics (some col.). Includes bibliographical references (p. 47-48). Available online via OhioLINK's ETD Center.

Made available in DSpace on 2015-07-22T20:49:51Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-03-30 / A idéia central desta dissertação de mestrado foi contribuir para a modernização do sistema de vigilância epidemiológica por meio do desenvolvimento de um modelo para o estudo da evolução da Tuberculose (TB) no tempo, disponibilizando este modelo em um ambiente computacional. O modelo citado foi desenvolvido para suportar experimentos controlados com estimativas realísticas, parametrizado segundo a mobilidade e interação da tuberculose com a população, bem como pelo seu desenvolvimento entre os hospedeiros. O modelo de disseminação da tuberculose foi baseado em um autômato celular probabilístico, projetado para explorar explicitamente o comportamento espaço-temporal de uma população heterogênea. As regras de transição mimetizaram os tipos de interação relacionados ao desenvolvimento da doença nessa população. Os resultados obtidos indicaram que a vacina, no que diz respeito à tuberculose, não influencia no seu desaparecimento e que apesar de apresentar um impacto muito grande na tuberculose primária, não tem poder relevante sobre a tuberculose secundária (pulmonar), sendo essa, a forma que transporta a doença de um individuo para outro. Apenas com tratamentos completamente realizados será possível o ver recrudescimento da TB. / TEDE / BV UNIFESP: Teses e dissertações

Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico / This paper presents a method for generating estimates of temporal changes in the surrounding area of a highway located in the Amazon, using the technique Cellular Automata and explanatory variables, only attributes of the land. The proposed model uses vector images (obtained from the National Institute for Space Research in Brazil), which are converted to grid type files â raster image, representing a series of spatial changes in the region of study. With this proposition, it is expected to assist decision makers in order to meet the requests of CONAMA Resolution 01, relating to environmental impacts, more specifically, as regards the construction of models which consider scenarios with and without the project, and that the process of construction / rehabilitation of roads can be made in view of the legal norms in order to minimize potential environmental and social impacts. The model generated from the CAs showed promise in generating future estimates of deforestation and a good quantitative and qualitative indicators to support the decision making process to consider future deforestation being caused by construction and / or paving of road in the Amazon. / Este trabalho apresenta um mÃtodo para a estimativa de mudanÃas espaÃo temporais no entorno de uma rodovia localizada na AmazÃnia, utilizando para tanto a tÃcnica AutÃmatos Celulares adaptada em ambiente SIG, onde as variÃveis explicativas do modelo serÃo somente os atributos do terreno. O modelo proposto usa imagens vetoriais (obtidas junto ao Instituto Nacional de Pesquisas Espaciais) que posteriormente sÃo convertidas para arquivos tipo grid â em formato raster, com a sÃrie histÃrica das mudanÃas espaciais na regiÃo objeto de estudo. Espera-se auxiliar os tomadores de decisÃo no atendimento das solicitaÃÃes da resoluÃÃo CONAMA 01/86 relativas à concepÃÃo de modelos que considerem cenÃrios com e sem o empreendimento, e que os processos de construÃÃo/recuperaÃÃo de rodovias possam ser realizados atendendo Ãs normas legais, visando minimizar os potenciais impactos sÃcio ambientais. O modelo gerado a partir dos ACs mostrou-se promissor na geraÃÃo de estimativas futuras de desmatamento e um bom indicador quantitativo e qualitativo para suporte no processo de tomada de decisÃo que pondere o desmatamento futuro a ser causado pela construÃÃo e/ou pavimentaÃÃo de uma rodovia na AmazÃnia.

Abstract This thesis presents extensions to the local binary pattern (LBP) texture analysis operator. The operator is defined as a gray-scale invariant texture measure, derived from a general definition of texture in a local neighborhood. It is made invariant against the rotation of the image domain, and supplemented with a rotation invariant measure of local contrast. The LBP is proposed as a unifying texture model that describes the formation of a texture with micro-textons and their statistical placement rules. The basic LBP is extended to facilitate the analysis of textures with multiple scales by combining neighborhoods with different sizes. The possible instability in sparse sampling is addressed with Gaussian low-pass filtering, which seems to be somewhat helpful. Cellular automata are used as texture features, presumably for the first time ever. With a straightforward inversion algorithm, arbitrarily large binary neighborhoods are encoded with an eight-bit cellular automaton rule, resulting in a very compact multi-scale texture descriptor. The performance of the new operator is shown in an experiment involving textures with multiple spatial scales. An opponent-color version of the LBP is introduced and applied to color textures. Good results are obtained in static illumination conditions. An empirical study with different color and texture measures however shows that color and texture should be treated separately. A number of different applications of the LBP operator are presented, emphasizing real-time issues. A very fast software implementation of the operator is introduced, and different ways of speeding up classification are evaluated. The operator is successfully applied to industrial visual inspection applications and to image retrieval.

Les problèmes traités et les résultats obtenus dans ce travail s'inscrivent essentiellement dans le domaine de la théorie des automates, la logique mathématique et leurs applications. Dans un premier temps on utilise les automates finis pour démontrer l'automaticité de plusieurs structures logiques sur des mots finis écrits dans un alphabet infini dénombrable. Ceci nous permet de déduire la décidabilité des théories logiques associées à ces structures. On a considéré par exemple la structure $X=(Sigma^*;prec,clone)$ où $Sigma^*$ désigne l'ensemble des mots finis sur l'alphabet infini dénombrable $Sigma$, $prec$ désigne la relation de préfixe et $clone$ désigne le prédicat qui est vrai pour un mot se terminant par deux lettres identiques. On a démontré l'automaticité de la structure $X$ et la décidabilité de sa théorie du premier ordre et de sa théorie monadique du second ordre. On a aussi considéré des extensions de la structure $X$ obtenues en ajoutant des prédicats comme $sim$ qui est vrai pour deux mots de même longueur. Nous avons en particulier démontré la $M$-automaticité de la structure $(Sigma^*;prec,clone,sim)$, d'où la décidabilité de sa théorie du premier ordre. On a par ailleurs étudié des structures qui comportent le prédicat $diff$ qui est vrai pour un mot dont les lettres sont toutes distinctes. En particulier on a démontré l'automaticité de la structure $D=(Sigma^*;prec,clone,diff)$ et la décidabilité de sa théorie du premier ordre et de sa théorie monadique du second ordre. On a également obtenu, par interprétation logique, des résultats de décidabilité et des résultats d'indécidabilité pour plusieurs variantes des structures $X$ et $D$, ainsi que pour des familles de structures appelées emph{structure d'applications exclusives} et emph{structure de décomposition}.Dans un deuxième temps on s'est intéressé au problème de la réduction du nombre de transitions dans les automates finis. On a commencé par étendre le concept de emph{Common Follow Sets} d'une expression régulière aux automates finis homogènes. On a montré comment établir une liaison assez directe entre des systèmes de CFS spécifiques et les arbres binaires complets. Ce lien est prouvé en utilisant un objet combinatoire appelé emph{triangle d'Ératosthène - Pascal}. Cette correspondance permet de transformer la valeur qui nous intéresse (le nombre de transitions) en une valeur assez naturelle associée aux arbres (le poids d'un arbre). En effet, construire un automate ayant un minimum de transitions revient à trouver un arbre de poids minimal. On a montré, d'une part, que ce nombre de transitions est asymptotiquement équivalent à $n(log_2 n)^2$ (la borne inférieure). D'autre part, les tests expérimentaux montrent que pour les petites valeurs de $n$, les automates minimaux en nombre de transitions coïncident (en nombre et en taille) avec ceux obtenus par notre construction. Cela nous mène à suggérer que notre réduction est finalement une minimisation pour les automates triangulaires. Dans un dernier temps on a présenté une étude expérimentale concernant l'application des automates à trous dans le domaine de la recherche approchée de motif dans les dictionnaires de mots. Contrairement aux complexités théoriques, temps de recherche et espace de stockage exponentiels, nos expérimentations montrent la linéarité de l'automate à trous / This work deals mainly with automata theory, mathematical logic and their applications. In the first part, we use finite automata to prove the automaticity of several logical structures over finite words written in a countable infinite alphabet. These structures involve predicates like $pred$, $clone$ and $diff$, where $x pred y$ holds if $x$ is a strict prefix of $y$, $clone(x)$ holds when the two last letters of $x$ are equal, and $diff(x)$ holds when all letters of $x$ are pairwise distinct. The automaticity results allow to deduce the decidability of logical theories associated with these structures. Other related decidability/undecidability results are obtained by logical interpretation. In the second part, we generalize the concept of Common Follow Sets of a regular expression to homogeneous finite automata. Based on this concept and a particular class of binary trees, we devise an efficient algorithm to reduce/minimize the number of transitions of triangular automata. On the one hand, we prove that the produced reduced automaton is asymptotically minimal, in the sense that for an automaton with $n$ states, the number of transitions in the reduced automaton is equivalent to $n(log_2 n)^2$ , which corresponds at the same time to the upper and the lower known bounds. On the other hand, experiments reveal that for small values of $n$, all minimal automata are exactly those obtained by our reduction, which lead us to conjecture that our construction is not only a reduction but a minimization. In the last part, we present an experimental study on the use of special automata on partial words for the approximate pattern matching problem in dictionaries. Despite exponential theoretical time and space upper bounds, our experiments show that, in many practical cases, these automata have a linear size and allow a linear search time