Submitted by Erika Demachki (erikademachki@gmail.com) on 2015-01-16T17:13:32Z No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Tese - Marcos Roberto Marcial - 2014.pdf: 1577179 bytes, checksum: ac1649c996b2193bad6b704f05eca30c (MD5) / Approved for entry into archive by Erika Demachki (erikademachki@gmail.com) on 2015-01-16T17:40:15Z (GMT) No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Tese - Marcos Roberto Marcial - 2014.pdf: 1577179 bytes, checksum: ac1649c996b2193bad6b704f05eca30c (MD5) / Made available in DSpace on 2015-01-16T17:40:15Z (GMT). No. of bitstreams: 2 license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Tese - Marcos Roberto Marcial - 2014.pdf: 1577179 bytes, checksum: ac1649c996b2193bad6b704f05eca30c (MD5) Previous issue date: 2014-06-23 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In this work, we study the topological structure of the solution set for a class of problems −Δpu = λ f (u)+μg(u)|∇u|p+Ψ(x) in Ω, u > 0 in Ω, u = 0 on ∂Ω, where Ω ⊂ IRN is a bounded domain with ∂Ω smooth, p, λ, μ are constants with p > 1, λ ≥ 0, μ ∈ IR and f ,g : (0,∞)→IR Ψ : Ω→IR are continuous functions. We will use Variational and Topological Methods, which includes minimization of energy functional and building connected components of solutions in a sense that we will define. Also we will employ arguments about the theory of regularity for p-Laplacian operator, approach arguments , maximum principles, results about sub and supersolutions and also arguments including monotonic type operators. / Neste trabalho estudamos a estrutura topológica do conjunto de soluções da classe de problemas −Δpu = λ f (u)+μg(u)|∇u|p+Ψ(x) em Ω, u > 0 em Ω, u = 0 sobre ∂Ω, onde Ω⊂IRN é um domínio limitado com fronteira ∂Ω regular, p, λ, μ são constantes com p > 1, λ ≥ 0, μ ∈ IR e f ,g : (0,∞)→IR, Ψ : Ω→IR são funções contínuas. Utilizamos Métodos Variacionais e Topológicos, que incluem minimização de funcionais energia e construção de componentes conexas de soluções em um sentido que definiremos. Empregamos também argumentos sobre a teoria da regularidade para o operador p- Laplaciano, argumentos de aproximação, bem como princípios de máximo, resultados sobre sub e supersoluções e também argumentos com operadores tipo monotônico.

Un nombre incalculable de documents est imprimé, numérisé, faxé, photographié chaque jour. Ces documents sont hybrides : ils existent sous forme papier et numérique. De plus les documents numériques peuvent être consultés et modifiés simultanément dans de nombreux endroits. Avec la disponibilité des logiciels d’édition d’image, il est devenu très facile de modifier ou de falsifier un document. Cela crée un besoin croissant pour un système d’authentification capable de traiter ces documents hybrides. Les solutions actuelles reposent sur des processus d’authentification séparés pour les documents papiers et numériques. D’autres solutions reposent sur une vérification visuelle et offrent seulement une sécurité partielle. Dans d’autres cas elles nécessitent que les documents sensibles soient stockés à l’extérieur des locaux de l’entreprise et un accès au réseau au moment de la vérification. Afin de surmonter tous ces problèmes, nous proposons de créer un algorithme de hachage sémantique pour les images de documents. Cet algorithme de hachage devrait fournir une signature compacte pour toutes les informations visuellement significatives contenues dans le document. Ce condensé permettra la création de systèmes de sécurité hybrides pour sécuriser tout le document. Ceci peut être réalisé grâce à des algorithmes d’analyse du document. Cependant ceux-ci ont besoin d’être porté à un niveau de performance sans précédent, en particulier leur fiabilité qui dépend de leur stabilité. Après avoir défini le contexte de l’étude et ce qu’est un algorithme stable, nous nous sommes attachés à produire des algorithmes stables pour la description de la mise en page, la segmentation d’un document, la reconnaissance de caractères et la description des zones graphiques. / An innumerable number of documents is being printed, scanned, faxed, photographed every day. These documents are hybrid : they exist as both hard copies and digital copies. Moreover their digital copies can be viewed and modified simultaneously in many places. With the availability of image modification software, it has become very easy to modify or forge a document. This creates a rising need for an authentication scheme capable of handling these hybrid documents. Current solutions rely on separate authentication schemes for paper and digital documents. Other solutions rely on manual visual verification and offer only partial security or require that sensitive documents be stored outside the company’s premises and a network access at the verification time. In order to overcome all these issues we propose to create a semantic hashing algorithm for document images. This hashing algorithm should provide a compact digest for all the visually significant information contained in the document. This digest will allow current hybrid security systems to secure all the document. This can be achieved thanks to document analysis algorithms. However those need to be brought to an unprecedented level of performance, in particular for their reliability which depends on their stability. After defining the context of this study and what is a stable algorithm, we focused on producing stable algorithms for layout description, document segmentation, character recognition and describing the graphical parts of a document.

From an overview of most commonly used kinematic conceptions of robotic manipulators, the conception of Cartesian robot was identified as the most suitable for the given task of colony picking. A control system consisting of two modular parts has been designed for the colony picking robot. ColonyCounter module is a set of image processing libraries for identification of microbial colonies in image data and precise localization of individual colonies. This has been achieved by combination of multiple methods, most importantly connected components labelling and Hough circular transform. The second module – ColonyPicker – utilizes output of ColonyCounter module to plan the picking and placing of colonies. Subsequently it controls the transfer process itself using an innovative task planning and executing system.