O Dilema do Prisioneiro (DP) é o jogo mais proeminente da Teoria dos Jogos devido à emergência da cooperação entre jogadores egoístas. O comportamento de cada jogador depende da estratégia que ele adotada e do seu ganho, que é determinado em função dos parâmetros do DP (T, R, P e S) e do número z de vizinhos com que ele joga. Portanto, a estrutura espacial dos jogadores não é relevante. Em nosso trabalho, utilizamos um autômato celular unidimensional onde cada jogador pode cooperar ou desertar ao interagir, simetricamente, com seus z vizinhos mais próximos. O sistema proposto nos permitiu realizar um estudo exaustivo do espaço de parâmetros para as estratégias evolucionárias Darwiniana (EED) e a Pavloviana (EEP) e compara-las. A geometria unidimensional nos possibilita obter os mesmos resultados dos sistemas em dimensionalidade arbitrária d, além de apresentar várias vantagens em relação a elas. No sistema que propomos os efeitos de borda são menores, exige menos tempo para a execução das simulações numéricas, permite variar o valor de z e é fácil obter uma representação visual da evolução temporal do sistema. Tal visualização simplifica a compreensão das interações entre os jogadores, pois surgem padrões nos agrupamentos de cooperadores/desertores, semelhantes aos pertencentes às classes dos autômatos celulares elementares. O estudo destes padrões nos permite compreender simplesmente a emergência da cooperação ou deserção nos sistemas. A evolução temporal do sistema que adota a EED gera um diagrama de fases muito rico com a presença das fases cooperadora, desertora e caótica. Já para a EEP, obtivemos um novo resultado analítico para as transições de fase, que neste caso são: cooperadora e quasi-regular. O estudo numérico exaustivo determinou as regiões do espaço de parâmetros onde acontecem cada uma das fases, e os efeitos da auto-interação podendo assim validar os resultados teóricos. O estudo do caso particular T = 1, tradicionalmente considerado como trivial, mostrou que ele apresenta comportamentos inusitados. Nossa principal contribuição para o estudo do DP é a obtenção de um novo paradigma. A geometria unidimensional com interação de vizinhos simétricos permitiu a visualização da evolução de padrões de cooperadores e desertores, o cálculo analítico de Tc para a EEP e o estudo de T = 1 para tais sistemas. / The Prisoner Dilemma (PD) is the most prominent game of the Game Theory due to emergency of the cooperation between selfish players. The behavior of each player depends on his/her strategy and the payoff, which is determined in function of the PD parameters (T, R, P and S) and by the number z of neighbors with whom he/she plays. Therefore, the spatial structure of the players does not matter. In our work, we have used a one-dimensional cellular automaton where each player can cooperate or defect when interacting, symmetrically, with his/her z nearest neighbors. The considered system allowed us to carry out an exhaustive exploration of the parameters space for the Darwinian Evolutionary Strategy (EED) and Pavlovian (EEP) and compares them. One-dimensional geometry makes possible to us get the same results of the systems in arbitrary d dimensional networks, besides, it presents some advantages. For the system that we proposed compared to the others dimensional networks, the boundary effects are less present, it needs less time for run the numerical simulations, it allows to vary the z value and is easier to get the visual representation of the system temporal evolution. Such visualization simplifies the understanding of the interactions between the players, therefore patterns appear in the clusters of cooperator/defectors, and these patterns belong to the elementary cellular automata classes. The study of these patterns allows them to understand in an easy way the emergence of the cooperation or defection in the systems. The temporal evolution of the system that adopts the EED yields a very rich phases diagram with the presence of cooperative, defective and chaotic phases. By the other hand, for the EEP, we have got a new analytical result for the phase transitions that in this case are: quasi-regular and cooperative. The exhaustive exploration study determines the regions on the parameters space where happen each phases occurs, and the effect of the self-interaction and thus validate the theoretical results. The study of the particular case T = 1, traditionally considered as trivial one, showed that it presents unusual behaviors, that we will present. Our main contribution for the study of the DP is the attainment of a new paradigm. One-dimensional geometry with interaction of symmetrical neighbors allowed to visualizes the evolution of cooperators and defectors patterns, the analytical result for Tc for the EEP and the study of T = 1 for such systems.

Un automate cellulaire probabiliste (ACP) est une chaîne de Markov sur un espace symbolique. Le temps est discret, les cellules évoluent de manière synchrone, et le nouvel état de chaque cellule est choisi de manière aléatoire, indépendamment des autres cellules, selon une distribution déterminée par les états d'un nombre fini de cellules situées dans le voisinage. Les ACP sont utilisés en informatique comme modèle de calcul, ainsi qu'en biologie et en physique. Ils interviennent aussi dans différents contextes en probabilités et en combinatoire. Un ACP est ergodique s'il a une unique mesure invariante qui est attractive. Nous prouvons que pour les AC déterministes, l'ergodicité est équivalente à la nilpotence, ce qui fournit une nouvelle preuve de l'indécidabilité de l'ergodicité pour les ACP. Alors que la mesure invariante d'un AC ergodique est triviale, la mesure invariante d'un ACP ergodique peut être très complexe. Nous proposons un algorithme pour échantillonner parfaitement cette mesure. Nous nous intéressons à des familles spécifiques d'ACP, ayant des mesures de Bernoulli ou des mesures markoviennes invariantes, et étudions les propriétés de leurs diagrammes espace-temps. Nous résolvons le problème de classification de la densité sur les grilles de dimension supérieure ou égale à 2 et sur les arbres. Enfin, nous nous intéressons à d'autres types de problèmes. Nous donnons une caractérisation combinatoire des mesures limites pour des marches aléatoires sur des produits libres de groupes. Nous étudions les mesures d'entropie maximale de sous-décalages de type fini sur les réseaux et sur les arbres. Les ACP interviennent à nouveau dans ce dernier travail.

Les changements climatiques ont des impacts considérables sur le temps, les océans et les rivages, la vie sauvage. Ils amènent des problèmes désormais considérés comme majeurs par les gouvernements et organisations internationales. Ces efforts ont fourni un cadre à cette thèse, qui propose de procéder en boucle fermée de l’observation d’insectes ravageurs, avec des centaines de capteurs en réseau ("light traps"), au système d’information, et enfin à des décisions de lutte, manuelles ou automatiques. Le point d’appui pratique est la conception d’un système de comptage d’insectes proliférant dans les cultures de riz (BPH). L’abstraction que nous développons est celle d’une machine environnementale de grande taille, distribuée, qui capte et synthétise l’information, élabore des connaissances, et prend des décisions. Autour de cette abstraction, nous avons élaboré un système de vision "fisheye" effectuant le comptage des insectes. Nous proposons un système d’information géographique directement connecté au réseau de capteurs. Le couplage direct, "cyber-physique", entre les systèmes d’information et l’observation de l’environnement à échelle régionale est une nouveauté transposable, qui permet de comprendre et contrôler quantité d’évolutions. / Climate changes bring problems related to nature evolutions. Global warming has an impact on sea level, weather patterns, and wild life. A number of national and international organizations are developing research programs in these directions, including threats on cultures and insect proliferation. Monitoring these phenomena, observing consequences, elaborating counteracted strategies are critical for the economy and society.The initial motivation of this work was the understanding of change impacts in the Mekong Delta region. From there, automatic observation tools were designed with a real time information system able to integrate environmental measures, then to support knowledge production.Tracking environment evolutions is distributed sensing, which can be the association of efficient sensors and radio communications, operated under the control of an information system. Sensing insects is very complex due to their diversity and dispersion. However, this is feasible in the case of intensive agricultural production as it is the case of rice, having a small number of pests. An automatic vision observatory is proposed to observe the main threats for the rice, as an evolution of manual light traps. Radio communication weaves these observatories into a network with connection to databases storing measures and possible counteractions. An example observatory has a fisheye camera and insect counting algorithms for the BPH practical case in Vietnam.By considering the observation system as an input for an abstract machine, and considering decision and actions taken as a possible control on the environment, we obtain a framework for knowledge elaboration that can be useful in lots of other situations.

O Dilema do Prisioneiro (DP) é o jogo mais proeminente da Teoria dos Jogos devido à emergência da cooperação entre jogadores egoístas. O comportamento de cada jogador depende da estratégia que ele adotada e do seu ganho, que é determinado em função dos parâmetros do DP (T, R, P e S) e do número z de vizinhos com que ele joga. Portanto, a estrutura espacial dos jogadores não é relevante. Em nosso trabalho, utilizamos um autômato celular unidimensional onde cada jogador pode cooperar ou desertar ao interagir, simetricamente, com seus z vizinhos mais próximos. O sistema proposto nos permitiu realizar um estudo exaustivo do espaço de parâmetros para as estratégias evolucionárias Darwiniana (EED) e a Pavloviana (EEP) e compara-las. A geometria unidimensional nos possibilita obter os mesmos resultados dos sistemas em dimensionalidade arbitrária d, além de apresentar várias vantagens em relação a elas. No sistema que propomos os efeitos de borda são menores, exige menos tempo para a execução das simulações numéricas, permite variar o valor de z e é fácil obter uma representação visual da evolução temporal do sistema. Tal visualização simplifica a compreensão das interações entre os jogadores, pois surgem padrões nos agrupamentos de cooperadores/desertores, semelhantes aos pertencentes às classes dos autômatos celulares elementares. O estudo destes padrões nos permite compreender simplesmente a emergência da cooperação ou deserção nos sistemas. A evolução temporal do sistema que adota a EED gera um diagrama de fases muito rico com a presença das fases cooperadora, desertora e caótica. Já para a EEP, obtivemos um novo resultado analítico para as transições de fase, que neste caso são: cooperadora e quasi-regular. O estudo numérico exaustivo determinou as regiões do espaço de parâmetros onde acontecem cada uma das fases, e os efeitos da auto-interação podendo assim validar os resultados teóricos. O estudo do caso particular T = 1, tradicionalmente considerado como trivial, mostrou que ele apresenta comportamentos inusitados. Nossa principal contribuição para o estudo do DP é a obtenção de um novo paradigma. A geometria unidimensional com interação de vizinhos simétricos permitiu a visualização da evolução de padrões de cooperadores e desertores, o cálculo analítico de Tc para a EEP e o estudo de T = 1 para tais sistemas. / The Prisoner Dilemma (PD) is the most prominent game of the Game Theory due to emergency of the cooperation between selfish players. The behavior of each player depends on his/her strategy and the payoff, which is determined in function of the PD parameters (T, R, P and S) and by the number z of neighbors with whom he/she plays. Therefore, the spatial structure of the players does not matter. In our work, we have used a one-dimensional cellular automaton where each player can cooperate or defect when interacting, symmetrically, with his/her z nearest neighbors. The considered system allowed us to carry out an exhaustive exploration of the parameters space for the Darwinian Evolutionary Strategy (EED) and Pavlovian (EEP) and compares them. One-dimensional geometry makes possible to us get the same results of the systems in arbitrary d dimensional networks, besides, it presents some advantages. For the system that we proposed compared to the others dimensional networks, the boundary effects are less present, it needs less time for run the numerical simulations, it allows to vary the z value and is easier to get the visual representation of the system temporal evolution. Such visualization simplifies the understanding of the interactions between the players, therefore patterns appear in the clusters of cooperator/defectors, and these patterns belong to the elementary cellular automata classes. The study of these patterns allows them to understand in an easy way the emergence of the cooperation or defection in the systems. The temporal evolution of the system that adopts the EED yields a very rich phases diagram with the presence of cooperative, defective and chaotic phases. By the other hand, for the EEP, we have got a new analytical result for the phase transitions that in this case are: quasi-regular and cooperative. The exhaustive exploration study determines the regions on the parameters space where happen each phases occurs, and the effect of the self-interaction and thus validate the theoretical results. The study of the particular case T = 1, traditionally considered as trivial one, showed that it presents unusual behaviors, that we will present. Our main contribution for the study of the DP is the attainment of a new paradigm. One-dimensional geometry with interaction of symmetrical neighbors allowed to visualizes the evolution of cooperators and defectors patterns, the analytical result for Tc for the EEP and the study of T = 1 for such systems.

Made available in DSpace on 2016-03-15T19:37:54Z (GMT). No. of bitstreams: 1 MAURICIO VERARDO DA COSTA.pdf: 829862 bytes, checksum: 7cb233efb8692b0820e30cf2bdbf4a76 (MD5) Previous issue date: 2015-02-10 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / The notion of a template for representing cellular automata (CA) rules is introduced. This enhances the standard representation based on a rule table, in that it refers to families of cellular automata, instead of a rule alone. Operations applicable to the templates are defined herein, and their use is exemplified in the context of finding representations for rule sets that share properties. Wolfram Mathematica's functional nature and built-in equation-solving capabilities are central to develop these algorithms. The perspectives for using templates in further contexts are also discussed, along with possible extensions to the present work. As a support to the template concept, a Wolfram Mathematica package called CATemplates is presented, shared with the community using a public repository. / A noção de representação de autômatos celulares (ACs) por meio de templates é aqui introduzida. Ela consiste em uma generalização da tabela de transições de estado clássica, permitindo a representação de subespaços de autômatos celulares, ao invés de apenas indivíduos isolados. São definidas operações aplicáveis aos templates, e seu uso é exemplificado por meio da obtenção de algoritmos que encontram subespaços de regras que apresentam propriedades em comum. Para o desenvolvimento destes algoritmos, a utilização do software Wolfram Mathematica é central, dada sua capacidade de resolução automática de sistemas de equações, além da natureza funcional e simbólica da Wolfram Language, linguagem de programação a ele associada. Também são discutidas as vantagens e desvantagens da utilização deste tipo de representação em outros contextos, e possiblidades de extensão para o trabalho. Como apoio ao conceito dos templates, é apresentada a biblioteca para o Wolfram Mathematica chamada CATemplates, disponibilizada em um repositório público.

Abstract Not Available.

La dynamique des courants de turbidité est fortement contrôlée par la morphologie du fond marin. Les turbidites issues de ces courants constituent des réservoirs d’hydrocarbures très importants dans les bassins sédimentaires à travers le monde. L'objectif principal de ce travail est de comprendre comment le paleorelief a contrôlé la géométrie et l'architecture des réservoirs turbiditiques, en utilisant comme zone d'étude les réservoirs du Crétacé d'un champ pétrolier du bassin de Campos (offshore du Brésil), où la tectonique a été en partie dominée par l'halocinèse. La méthodologie utilisée dans cette thèse a couplé deux approches. La première a inclus à la fois la description des séquences sédimentaires, à partir de données de sismique-réflexion et de puits, et les restaurations structurales. Six horizons régionaux et quatre unités-réservoirs ont été identifiés et cartographiés afin de construire un modèle géologique multi-2D. Ces surfaces ont ensuite été aussi restaurées. Les résultats de cette étape suggèrent que les failles liées à l'halocinèse ont contraint la paléotopographie pour le dépôt des réservoirs plus anciens et que des structures tectoniques et un canyon ont formés les contraintes paléotopographiques pour la distribution des réservoirs plus jeunes. La seconde approche a été l'analyse du rôle des paramètres des écoulements en effectuant des simulations numériques du type stratigraphique (Dionisos) et des automates cellulaires (CATS). Une surface restaurée, considérée comme référence pour le dépôt des unités-réservoirs a été utilisée comme paléotopographie pour les simulations CATS. Le modèle numérique a été contraint par les données réservoirs. Cette utilisation inédite des simulations 3D avec des automates cellulaires dans une étude de cas réel concernant des dépôts marins anciens a produit des résultats réalistes par rapport aux exemples modernes connus. Elle a également fourni des résultats plus exploitables à l'échelle de réservoir que les modèles numériques de type "stratigraphique". Ce travail met en évidence l'importance des interactions tectonique-sédimentation et de la paléotopographie pour la distribution de réservoirs turbiditiques. / The dynamic of gravity-driven turbidity currents is strongly influenced by the morphology of the seafloor. The resulting turbidites constitute important hydrocarbon reservoirs in sedimentary basins throughout the world. The main objective of the present work is thus to understand the way the paleorelief controls turbidite reservoir architectures, with application in a specific study area with Cretaceous reservoirs in Campos Basin (Brazilian offshore). The tectonics in this Basin was partly controlled by halokinesis. The first approach was describing the local Cretaceous sedimentary sequence architecture, from seismic and well data, and performing structural restorations. Six regional horizons and four reservoir-scale units were identified and mapped in order to build a multi-2D geological model. Structural restorations highlighted the structural evolution and allowed the related horizon palaeotopography to be obtained. The results of this work step suggest that the halokinesis-related listric faults regulated the distribution of the basal reservoirs. Moreover, at the top of the Albian carbonates, a canyon was identified, which, in association with the tectonic structures, forms the palaeotopographic constraints for the upper reservoir geometry. The second approach was analyzing the role of flow controlling parameters by performing stratigraphic (Dionisos) and cellular automata-based (CATS) numerical simulations. The latter provided a more appropriate reservoir scale-simulation process than Dionisos. A restored surface, considered as reference for the deposition of the reservoir units, was used as the palaeotopography for CATS simulations, having as constraints the reservoir data. This pioneer use of cellular automata simulations in a real subsurface case study produced coherent results when compared with the actual reservoir distribution. This work sheds light on the importance of tectonic-sedimentation interactions and of palaeotopography for the distribution of turbidite reservoirs.

After a brief review of machine learning techniques and applications, this Ph.D. thesis examines several approaches for implementing machine learning architectures and algorithms into hardware within our laboratory. From this interdisciplinary background support, we have motivations for novel approaches that we intend to follow as an objective of innovative hardware implementations of dynamically self-reconfigurable logic for enhanced self-adaptive, self-(re)organizing and eventually self-assembling machine learning systems, while developing this new particular area of research. And after reviewing some relevant background of robotic control methods followed by most recent advanced cognitive controllers, this Ph.D. thesis suggests that amongst many well-known ways of designing operational technologies, the design methodologies of those leading-edge high-tech devices such as cognitive chips that may well lead to intelligent machines exhibiting conscious phenomena should crucially be restricted to extremely well defined constraints. Roboticists also need those as specifications to help decide upfront on otherwise infinitely free hardware/software design details. In addition and most importantly, we propose these specifications as methodological guidelines tightly related to ethics and the nowadays well-identified workings of the human body and of its psyche.

The dynamics of many aspects of social behaviour, such as spread of fads and fashion, collective action, group decision-making, homophily and disagreement, have been captured by mathematical models. The power of these models is that they can provide novel insight into the emergent dynamics of groups, e.g. 'epidemics' of memes, tipping points for collective action, wisdom of crowds and leadership by small numbers of individuals, segregation and polarisation. A current weakness in the scientific models is their sheer number. 'New' models are continually 'discovered' by physicists, engineers and mathematicians. The models are analysed mathematically, but very seldom provide predictions that can be tested empirically. In this work, we provide a framework of simple models, based on Lotka's original idea of using chemical reactions to describe social interactions. We show how to formulate models for social epidemics, social recovery, cycles, collective action, group decision-making, segregation and polarisation, which we argue encompass the majority of social dynamics models. We present an open-access tool, written in Python, for specifying social interactions, studying them in terms of mass action, and creating spatial simulations of model dynamics. We argue that the models in this article provide a baseline of empirically testable predictions arising from social dynamics, and that before creating new and more complicated versions of the same idea, researchers should explain how their model differs substantially from our baseline models. / Matematiska modeller kan hjälpa oss att förstå många typer av sociala fenomen, som ryktesspridning, spridning av memes, gruppbeslut, segregation och radikalisering. Det finns idag otaliga modeller för sociala beteenden hos människor och djur, och fler presenteras kontinuerligt. Det stora antalet modeller försvårar navigering inom forskningsfältet, och många av modellerna är dessutom komplicerade och svåra att verifiera genom experiment. I detta arbete föreslås ett ramverk av grundläggande modeller, som var och en modellerar en aspekt av socialt beteende; det gäller sociala epidemier, cykler, gemensamt handlande, gruppbeslut, segregation och polarisering. Vi menar att dessa modeller utgör majoriteten av de verifierbara aspekter av socialt beteende som studeras, och att de bör behandlas som en utgångspunkt när en ny modell ska introduceras. Vilka av mekanismerna från utgångspunkten finns representerade i modellen? Skiljer den sig ens nämnvärt från utgångspunkten? Genom att ha en god förståelse för grundmodellerna, och genom att förklara på vilket sätt en ny modell skiljer sig från dem, kan forskare undvika att presentera modeller som i praktiken är mer komplicerade varianter av sådana som redan finns. I detta arbete visar vi hur dessa grundläggande modeller kan formuleras och studeras. Modellerna bygger på enkla regler om vad som händer när individer i en befolkning möter varandra. Till exempel, om en person som har vetskap om ett rykte träffar någon som inte har det, kan ryktet spridas vidare. Därför har antaganden om vilka personer som kan träffa varandra stor påverkan på de resultat som modellerna ger. I detta arbete studeras varje modell med två olika metoder: i den ena har alla personer i befolkningen samma sannolikhet att träffa varandra, i den andra representeras befolkningen av ett rutnät, där varje plats motsvarar en individ. I den senare har alltså varje person ett begränsat antal grannar att interagera med. Vilken av dessa två metoder man väljer har stor betydelse för vilka beteenden modellerna förutspår. Som ett komplement till detta arbete presenteras ett verktyg i form av ett Python-program som utför analysen av modellerna. Detta kan användas för att undersöka grundmodellerna som presenteras i detta arbete, men också för att formulera och analysera nya modeller på samma sätt. På det viset kan nya modeller enkelt jämföras mot grundmodellerna. Verktyget är användbart både som introduktion för de som är nya inom social dynamik, men också för de forskare som som vill ta fram nya modeller och föra forskningsfältet vidare.

This master's thesis deals with the topic of cellular automata and their utilization in the research of self-replication, especially with the focus on self-replicating loops. It also shows several possible approaches how to optimize the replication process. The first part is focused on theoretical aspects of cellular automata. It acquaints the readers with the questions of self-replication in the cellular automata and present some of the existing self-replicating loops, starting with the widely known Langton's loop. The second part presents the optimization of the replication process considering two selected variants of self-repricating loops - Byl's loop and Chou-Reggia loop. Two approaches are introduced together with their possible combination. The first approach is based on multiple self-replication. The second one is based on the reduction of the number of steps of the cellular automaton needed to create a copy of the loop.