Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-03-06T11:57:32Z No. of bitstreams: 1 grasielereginaduarte.pdf: 2553018 bytes, checksum: e0b9afbcc0b18965321f8db8ea7d38b8 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-03-06T20:19:40Z (GMT) No. of bitstreams: 1 grasielereginaduarte.pdf: 2553018 bytes, checksum: e0b9afbcc0b18965321f8db8ea7d38b8 (MD5) / Made available in DSpace on 2017-03-06T20:19:40Z (GMT). No. of bitstreams: 1 grasielereginaduarte.pdf: 2553018 bytes, checksum: e0b9afbcc0b18965321f8db8ea7d38b8 (MD5) Previous issue date: 2015-03-06 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Os problemas de otimização estão presentes em diversas áreas de atuação da sociedade e o uso de algoritmos bio-inspirados para a resolução de problemas complexos deste tipo vem crescendo constantemente. O Algoritmo Colônia de Abelhas Artificiais (ABC – do inglês Artificial Bee Colony) é um algoritmo bio-inspirado proposto em 2005 para a resolução de problemas de otimização multimodais e multidimensionais. O fenômeno natural que inspirou o desenvolvimento do ABC foi o comportamento inteligente observado em colônias de abelhas, mais especificamente no forrageamento. O ABC foi proposto inicialmente para ser aplicado na resolução de problemas sem restrições. Este trabalho avalia o desempenho do ABC quando aplicado na resolução de problemas de otimização com restrições. Para o tratamento das restrições, métodos de penalização serão incorporados ao ABC. São analisados diversos métodos de penalização, de diferentes tipos, com o objetivo de identificar com qual deles o algoritmo apresenta melhor desempenho. Além disto, são avaliadas possíveis limitações e cuidados que devem ser tomados ao combinar métodos de penalização ao ABC. O algoritmo proposto é avaliado através da resolução de problemas de otimização encontrados na literatura. Vários experimentos computacionais são realizados e gráficos e tabelas são gerados para demonstração dos resultados obtidos que também são discutidos. / Optimization problems are present in several areas of society and the use of bio-inspired algorithms to solve complex problems of this type has been growing constantly. The Artificial Bee Colony Algorithm (ABC) is a bio-inspired algorithm proposed in 2005 for solving multimodal and multidimensional optimization problems. The natural phenomenon that inspired the development of the ABC was intelligent behavior observed in bee colonies, more specifically in foraging. The ABC was initially proposed to be applied to solve unconstrained problems. This study evaluates the performance of ABC when applied in solving constrained optimization problems. For the treatment of constraints, penalty methods will be incorporated into the ABC. Several penalty methods, of different types, are analyzed with the goal of identifying which of these penalty methods offers better performance. Furthermore, possible limitations and care that should be taken when combining penalty methods to ABC are evaluated. The proposed algorithm is evaluated by solving optimization problems found in the literature. Several computational experiments are performed and graphs and tables are generated for demonstration of the obtained results which are also discussed.

Orientadores: Alessandro dos Santos Farias, Leonilda Maria Barbosa dos Santos / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Biologia / Made available in DSpace on 2018-08-23T01:58:27Z (GMT). No. of bitstreams: 1 Pradella_Fernando_M.pdf: 4468527 bytes, checksum: 63d6760bd0ea06c5fcab94d1421da291 (MD5) Previous issue date: 2013 / Resumo: O resumo poderá ser visualizado no texto completo da tese digital / Abstract: The abstract is available with the full electronic document / Mestrado / Imunologia / Mestre em Genética e Biologia Molecular

L’Etat moderne qui articule le principe de souveraineté avec l’affirmation des droits subjectifs et qui rompt avec le modèle impérial du pouvoir, est contemporain de la découverte et de l’exploitation du Nouveau Monde. Il s’agit ici de montrer que les deux processus sont solidaires et qu’il est possible de reconsidérer les différentes élaborations théoriques justifiant la formation des souverainetés étatiques, à partir du rapport au Nouveau Monde traversé par la tension structurante entre cosmopolitisme et impérialisme. Une première partie examine la genèse du droit des gens moderne, et la question du cosmopolitisme, à partir de la réflexion de Vitoria sur les « titres » de la conquête et de la colonisation de l’Amérique par l’Espagne. Cette partie s’efforce également de restituer les enjeux liés à la pratique de la piraterie. Celle-ci ne saurait être réduite à sa dimension criminelle : elle correspond à cette époque à une lutte pour la liberté des mers ainsi qu’à l’expérimentation de nouvelles formes d’association et de liberté qui font écho à la pensée utopique. Une seconde partie met en lumière le rôle des enjeux coloniaux dans l’élaboration de la théorie du pouvoir souverain (sous la forme de la monarchie absolue). Les auteurs convoqués sont Bacon et Hobbes. Enfin une troisième partie prend en charge l’irruption du concept de peuple dans les théories de l’Etat et examine là encore la manière dont les expériences coloniales informent ce concept (les références sont alors Locke et Rousseau). La Révolution de Saint-Domingue est évoquée en toute fin pour son exemplarité dans la manière dont elle questionne tous les concepts constitutifs de l’Etat de droit moderne. / It is worth considering that when the modern State reconciles the principle of sovereignty with the assertion of subjective rights, and consequently breaks with the imperial government system, it is doing so at the very time when the New World is being discovered and exploited. The point here is to show that these two processes are interdependent, and that it is possible to reconsider the different theoretical elaborations which have so far accounted for the emergence of state sovereignty, by referring to the structuring tension between cosmopolitism and imperialism, which characterizes the New World. What is dealt with the first part is the birth of international law, and the issue of cosmopolitism, revisited in the light of Vitoria’s study about the titles of the Spanish conquest and colonization. It is also devoted to restoring the stakes of piracy practice. The later cannot be reduced to its criminal dimension: at the time it means a fight for freedom on sea, together with the experimentation of new forms of association and liberty, which echo the utopian way of thinking. The second part is devoted to emphasizing the role of colonial stakes in the construction of the theory of sovereign power (as Absolute Monarchy). The authors referred to are Bacon and Hobbes. A third part is devoted to the emergence of the concept of People in the State theories, together with a study of the way this concept feeds from the colonial experience (the authors referred to this time being Locke and Rousseau). The Revolution in Santo-Domingo is mentioned in the very end, due to its exemplarity in the way it questions all the concepts that make out the modern state under the rule of law.

In this study, three different algorithms are implemented to solve thecapacitated vehicle routing problem with and without time windows:ant colony optimization, a genetic algorithm and a genetic algorithmwith self-organizing map. For the capacitated vehicle routing problemthe Augerat et al’s benchmark problems were used and for the capaci-tated vehicle routing problem with time windows the Solomon’sbenchmark problems. All three algorithms were tuned over thirtyinstances per problem with the tuners SPOT and ParamILS. The tuningresults from all instances were combined to the final parameter valuesand tested on a larger set of instances. The test results were used tocompare the algorithms and tuners against each other. The ant colonyoptimization algorithm outperformed the other algorithms on bothproblems when considering all instances. The genetic algorithm withself-organizing map found more best known solutions than any otheralgorithm when using parameters, on the capacitated vehicle routingproblem. The algorithms performed well and several new best knownresults were discovered for the capacitated vehicle routing problem andnew best solutions found by heuristics were discovered for the 100customer Solomon problems. When comparing the tuners they bothworked well and no clear winner emerged.

En un siècle troublé, né du séisme de 1789, le bagne, lieu de fracture, peut se comprendre comme le modèle spatial du doute, de la contrainte et de la souffrance, des fins et des commencements. Surtout, il est le fondateur du forçat, personnage de tous les paradoxes, repoussant les limites, animé de la fièvre des résurrections. Dans un roman cherchant à affirmer son identité, au milieu des récriminations d’une Histoire en mouvement, que signifie le surgissement en littérature, comme une invitation à imaginer l’inimaginable, de cet homme déchu, de ce coupable révélé, qui ne se satisfait d’aucune finitude et représente pourtant la finitude elle-même ? A la frontière de la réalité et du mythe, le bagnard, cet être du dehors, éclairé de la lumière étrange que projette sur lui le lieu extrême du bagne, apparaît comme un personnage nécessaire à la mise en place du roman, pêle-mêle vindicatif d’observations et d’inventions, composé du silence et de la parole. Il réunit en effet les cheminements de la différence et de la quête propres aux drames romanesques. Cet être de l’opposition – chez Victor Hugo, Balzac, Paul Féval ou encore George Sand – s’impose donc ainsi qu’un héros. L’imagination des romanciers le transfigure et lui offre le pouvoir du symbole. Comme le Titan révolté de l’Antiquité, le forçat romanesque du XIXe siècle suggère la vérité mythique d’une humanité à la recherche du sens. / In a troubled century, ensuing from the upheaval of 1789, the penal colony, place of divide, can be interpreted as a spatial model of doubt, constraint and suffering, of endings and beginnings. Above all, it is the founder of the convict, character of multiple paradoxes, pushing back the limits, motivated by the heat of resurrections of a History in motion, what is the meaning of the emergence, in literature, as an invitation to imagine the unimaginable, of that fallen man, that uncovered culprit, who is not satisfied with any finiteness yet stands for finiteness himself? Halfway through reality and myth, the convict, that man from outside, lit up by the weird light that the extreme place that is the penal colony sheds on him, appears as a necessary character for the setting up of the novel, vindictive hodge-podge of observations and inventions, made of silence and speech. It links, indeed, the development of the notions of difference and quest that are inherent to fictional drama. This being of opposition – in the works of Victor Hugo, Balzac, Paul Féval or else George Sand – imposes himself as a hero. The imagination of the novelist transfigures him and gives him the power of the symbol. As the rebellious Titan of Antiquity, the convict of the 19th century suggests the mythic truth of mankind in search of meaning.

Les nanomatériaux combinant des fonctions de ciblage, d'imagerie, de thérapie et de détection font l'objet de nombreuses recherches dans le domaine de la santé. Les travaux présentés dans cette thèse concernent la multi‐fonctionnalisation de nanoparticules (NPs) par un procédé de synthèse supportée. Le support solide développé dans cette étude est constitué d'un matériau poreux en verre sur lequel sont greffées de manière temporaire des nanoparticules de silice. La fonctionnalisation de la surface des nanoparticules a été réalisée de façon automatisée par une chimie de synthèse dite aux phosphoramidites. Dans un premier temps, cette technique a permis d'obtenir des densités de greffage de l'ordre de 5000 à 7000 oligonucléotides par nanoparticule, ce qui représente une fonctionnalisation 10 à 20 fois supérieure à celles obtenues par des méthodes de greffage en solution. Les brins d'ADN synthétisés sur les NPs ont montré une bonne accessibilité pour l'hybridation avec un brin d'ADN complémentaire, ouvrant la voie à des applications thérapeutiques ou à l'intégration de ces objets dans des systèmes de détection. La deuxième partie de ces travaux est consacrée à la vectorisation d'une protéine thérapeutique, le G‐CSF (facteur de croissance de colonies de granulocytes), par des nanoparticules présentant également des propriétés d'imagerie. Ces nanovecteurs thérapeutiques ont montré des propriétés de stimulation cellulaire in vitro et de ciblage de la rate, organe réservoir de neutrophiles, in vivo. Enfin il a été démontré que la modification de NPs sur support ouvre des perspectives intéressantes pour la préparation d'assemblages complexes de nanoparticules (dimères et NPs dissymétriques) / Nanomaterials combining targeting, imaging, therapy and sensing properties are of growing interest for biomedical applications. The work reported in this thesis concerns nanoparticle (NP) multifunctionalization by solid phase synthesis. The solid support developed in this study is composed of a porous glass material on which silica NPs are temporarily grafted. Nanoparticle surface functionalization was performed by automated synthesis using phosphoramidite chemistry. Firstly, high surface loadings from 5000 to 7000 oligonucleotides per NP were achieved, representing a functionalization 10 to 20‐fold greater than those obtained by coupling methods in solution. DNA strands synthesized on NPs showed a good accessibility for hybridization with a complementary DNA strand, paving the way for therapeutic applications or integration of these objects in detection systems. The second part of this work was devoted to the vectorization of a therapeutic protein, GCSF (Granulocyte‐Colony Stimulating Factor) by nanoparticles that also exhibited imaging properties. These therapeutic nanocarriers showed cell stimulating properties in vitro and spleen targeting, which is a reservoir of neutrophils, in vivo. Finally, it was demonstrated that the solid phase modification of NPs opens interesting perspectives for the production of complex nanoparticle assemblies (dimers and asymmetric NPs)

Particulièrement lors de collaborations dans le cadre de chaînes logistiques ou d'entreprises virtuelles, établir les workflows collaboratifs est une étape laborieuse car souvent réalisée soit de façon humaine, soit avec des méthodes manquant de flexibilité. Sur la base d'un réseau social d'entreprises, cette thèse vise à faciliter cette étape en proposant un service de déduction de processus collaboratifs inter-organisationnels. Cela soulève trois problèmes: (i) trouver les activités qui doivent être exécutées pour remplir les objectifs de la collaboration (Quoi?), (ii) sélectionner les partenaires pouvant réaliser ces activités (Qui?) et (iii) ordonner ces activités en un processus métier collaboratif (Quand?). Dans le cadre d'un réseau social, il est attendu que plusieurs organisations soient capables de fournir les mêmes activités. Dans un tel contexte de concurrence entre les organisations, une optimisation globale permet de trouver un processus final quasi-optimal, en prenant en compte ces trois questions de manière simultanée : trouver l'ensemble des "meilleurs" partenaires et leurs activités dans un contexte de collaboration spécifique. A cette fin, des ontologies de collaboration ont été développées et permettent de représenter et collecter des connaissances sur les collaborations. Ainsi, quand les utilisateurs remplissent leurs profils sur le réseau social, le système peut comprendre (i) les attentes des utilisateurs lorsqu'ils fournissent leurs objectifs de collaboration et (ii) les capacités qu'ils peuvent fournir. Un outil d'aide à la décision, basé sur un algorithme d'optimisation par colonies de fourmis permet ensuite d'exploiter les ontologies de collaboration afin de trouver un processus quasi-optimal répondant aux attentes et objectifs de la collaboration. Les résultats de cette thèse s'inscrivent au sein du projet FUI OpenPaaS dont le but est d'établir un nouveau réseau social d'entreprises visant à faciliter leurs collaborations intra et inter-organisationnelles. / Especially in the context of collaborative supply chains and virtual enterprises, the step of designing the collaborative workflows remains laborious because either it is still carried out humanly or the methods lack of flexibility. Based on an enterprise social network, this thesis aims at facilitating this step by proposing a service for the deduction of collaborative processes. It raises three main issues: (i) finding the activities to execute that answer the objectives of the collaboration (What?), (ii) selecting the corresponding partners (Who?) and (iii) ordering the activities into a collaborative business process (When?). Moreover, it is expected that many companies could be able to provide the same activities, on the enterprise social network. In this competitive context, a global optimization should be set up in order to find the quasi-optimal collaborative process that answer these three questions simultaneously. A three-dimensional solution is proposed here. First, a non-functional framework has been set up in order to determine the criteria that make a « good » partner in a specific collaborative context. Then, collaborative ontologies have been implemented and enable the representation and the acquisition of collaborative knowledge, so that the IT system can understand (a) the user's needs when they model their objectives of collaboration and (b) the user's capabilities when they model their profiles on the enterprise social network. And finally, a tool for decision support has been implemented thanks to an ant colony optimization algorithm that exploits the collaborative ontologies in order to provide a quasi-optimal process that fits the context of the collaboration and answers its objective. The results are in line with the FUI French project OpenPaaS which aims at offering an enterprise social network to facilitate their collaborations.

Recently, continuous-valued optimization problems have received a great amount of focus, resulting in optimization algorithms which are very efficient within the continuous-valued space. Many optimization problems are, however, defined within the binary-valued problem space. These continuous-valued optimization algorithms can not operate directly on a binary-valued problem representation, without algorithm adaptations because the mathematics used within these algorithms generally fails within a binary problem space. Unfortunately, such adaptations may alter the behavior of the algorithm, potentially degrading the performance of the original continuous-valued optimization algorithm. Additionally, binary representations present complications with respect to increasing problem dimensionality, interdependencies between dimensions, and a loss of precision. This research investigates the possibility of applying continuous-valued optimization algorithms to solve binary-valued problems, without requiring algorithm adaptation. This is achieved through the application of a mapping technique, known as angle modulation. Angle modulation effectively addresses most of the problems associated with the use of a binary representation by abstracting a binary problem into a four-dimensional continuous-valued space, from which a binary solution is then obtained. The abstraction is obtained as a bit-generating function produced by a continuous-valued algorithm. A binary solution is then obtained by sampling the bit-generating function. This thesis proposes a number of population-based angle-modulated continuous-valued algorithms to solve binary-valued problems. These algorithms are then compared to binary algorithm counterparts, using a suite of benchmark functions. Empirical analysis will show that the angle-modulated continuous-valued algorithms are viable alternatives to binary optimization algorithms. Copyright 2012, University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. Please cite as follows: Pamparà, G 2012, Angle modulated population based algorithms to solve binary problems, MSc dissertation, University of Pretoria, Pretoria, viewed yymmdd < http://upetd.up.ac.za/thesis/available/etd-02242012-090312 / > C12/4/188/gm / Dissertation (MSc)--University of Pretoria, 2012. / Computer Science / unrestricted

Il n’existe pas, à proprement parler, une histoire des Français de l’étranger. La définition même de ce terme reste floue et connaît de nombreuses variantes selon les auteurs qui se sont penchés sur le sujet ; ces derniers sont d’ailleurs rarement des historiens. Autre constat, le concept de présence française recouvre une multitude de réalités. C’est un terme polysémique qui n’a pas encore reçu, chez les historiens du moins, de définition claire et précise. Pour explorer ces pistes, il a semblé que Hong Kong dans l’entre-deux-guerres était un terrain propice.C’est une parenthèse active sur un territoire aux influences multiples ; la colonie britannique est aux portes de la Chine, voisine de l’Indochine, et elle connaît des développements et des remous nombreux entre 1918 et1941.L’ambition de ce travail est d’assembler les différentes formes de la présence française, souvent étudiées individuellement dans d’autres cadres chronologiques ou géographiques, pour offrir un tableau complet de ce que signifie réellement ce terme et réfléchir aux concepts contemporains de Français de l’étranger et de culture tierce. Au regard des spécificités géographiques et politiques de Hong Kong dans l’entre-deux-guerres, en quoi peut-on dire que la colonie britannique joue un rôle particulier pour la France, et qu’à ce titre, elle est un observatoire privilégié de la vie des Français de l’étranger à cette époque ? Cette interrogation cache évidemment de multiples articulations car la présence française suppose l’existence d’une communauté vivante et hétérogène, mais aussi une implantation purement matérielle et parfois abstraite. / Strictly speaking, the History of French people abroad does not exist. The meaning of this term in itself is quite vague and there are lots of variations, depending on the scholars who may have flown over this subject; seldom are they historians. Another significant aspect is that the notion of French presence also covers many different realities. It is a polysemous term which, as yet, has never been given a clear and proper definition yet, at least among historians. In order to explore those tracks, using Hong Kong during interwar period as a search field was thought to be relevant.It is an active parenthesis on a territory animated by multiple influences; the British colony is on China’s doorstep, a neighbour of Indochina, and it has known quite a number of developments and upheavals between 1918and 1941.The purpose of this work is to gather different forms of the French presence, often studied separately and individuallyin other geographical and historic contexts, in order to offer a complete picture of what this concept really means. This is an opportunity to debate on the contemporary notions of fFrench people abroad and Third Culture. Because of the geographical and political specificities of Hong Kong during the interwar period, in what way can we consider that the British colony is playing a particular role for France in the area ? And, on this basis, how can it be considered a privileged observatory of the life of French people abroad at that time? Those questions are obviously hiding many others because French presences suppose the existence of a lively and heterogeneous community, but also a material and sometimes abstract implantation.

L'optimisation difficile représente une classe de problèmes dont la résolution ne peut être obtenue par une méthode exacte en un temps polynomial.Trouver une solution en un temps raisonnable oblige à trouver un compromis quant à son exactitude.Les métaheuristiques sont une classe d'algorithmes permettant de résoudre de tels problèmes, de manière générique et efficiente (i.e. trouver une solution satisfaisante selon des critères définis: temps, erreur, etc.).Le premier chapitre de cette thèse est notamment consacré à la description de cette problématique et à l'étude détaillée de deux familles de métaheuristiques à population, les algorithmes évolutionnaires et les algorithmes d'intelligence en essaim.Afin de proposer une approche innovante dans le domaine des métaheuristiques, ce premier chapitre présente également la notion d'analyse de sensibilité.L'analyse de sensibilité permet d'évaluer l'influence des paramètres d'une fonction sur son résultat.Son étude caractérise globalement le comportement de la fonction à optimiser (linéarité, influence, corrélation, etc.) sur son espace de recherche.L'incorporation d'une méthode d'analyse de sensibilité au sein d'une métaheuristique permet d'orienter sa recherche le long des dimensions les plus prometteuses.Deux algorithmes réunissant ces notions sont proposés aux deuxième et troisième chapitres.Pour le premier algorithme, ABC-Morris, la méthode de Morris est introduite dans la métaheuristique de colonie d'abeilles artificielles (ABC).Cette inclusion est dédiée, les méthodes reposant sur deux équations similaires.Afin de généraliser l'approche, une nouvelle méthode, NN-LCC, est ensuite développée et son intégration générique est illustrée sur deux métaheuristiques, ABC avec taux de modification et évolution différentielle.L'efficacité des approches proposées est testée sur le jeu de données de la conférence CEC 2013. L'étude se réalise en deux parties: une analyse classique de la méthode vis-à-vis de plusieurs algorithmes de la littérature, puis vis-à-vis de l'algorithme d'origine en désactivant un ensemble de dimensions, provoquant une forte disparité des influences / Hard optimization stands for a class of problems which solutions cannot be found by an exact method, with a polynomial complexity.Finding the solution in an acceptable time requires compromises about its accuracy.Metaheuristics are high-level algorithms that solve these kind of problems. They are generic and efficient (i.e. they find an acceptable solution according to defined criteria such as time, error, etc.).The first chapter of this thesis is partially dedicated to the state-of-the-art of these issues, especially the study of two families of population based metaheuristics: evolutionnary algorithms and swarm intelligence based algorithms.In order to propose an innovative approach in metaheuristics research field, sensitivity analysis is presented in a second part of this chapter.Sensitivity analysis aims at evaluating arameters influence on a function response. Its study characterises globally a objective function behavior (linearity, non linearity, influence, etc.), over its search space.Including a sensitivity analysis method in a metaheuristic enhances its seach capabilities along most promising dimensions.Two algorithms, binding these two concepts, are proposed in second and third parts.In the first one, ABC-Morris, Morris method is included in artificial bee colony algorithm.This encapsulation is dedicated because of the similarity of their bare bone equations, With the aim of generalizing the approach, a new method is developped and its generic integration is illustrated on two metaheuristics.The efficiency of the two methods is tested on the CEC 2013 conference benchmark. The study contains two steps: an usual performance analysis of the method, on this benchmark, regarding several state-of-the-art algorithms and the comparison with its original version when influences are uneven deactivating a subset of dimensions