In this work we analyse two problems coming from theoretical biology. In the first part we propose a spatially structured population model which is defined on a continuous lattice. In the model individuals disperse at a constant rate v and competition is local and delimitated by the competition radius R. Due to dispersal, the neighborhooh size fluctuates over time. We analyse how these variables affect the adaptive process. While the fixation probabilities of beneficial mutations are roughly the same as in a panmitic population for small and intermediate fitness effects s, a dependence on v and R appears for large s. These quantities also strongly influence fixation times. The model exhibits a dual behavior displaying a power-law growth for the fixation rate and speed of adaptation with the beneficial mutation rate as observed in spatially structured population models, but simultaneously showing a non-saturating behavior for the speed of adaptation with the population size. In the second part we numerically study the dynamics of model imune networks with random and scale-free topologies. We observe that a memory state is reached when the antigen is attached to the most connected sites of the network, where as a percolation state may occur when the antigen attaches to the less connected sites. For increasing values of the connectivity, its population converges exponentially to the asymptotic value of the memory state. On the other hand, the next-nearest populations evolve slowly as power-laws towards the virgin-like state. / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Neste trabalho, analisamos dois problemas provenientes da biologia teórica. Na primeira parte, propomos um modelo de população espacialmente estruturada, que é definido numa rede contínua. No modelo, indivíduos se dispersam numa taxa constante v e a competição é local e delimitada pelo raio de competição R. Devido à dispersão, o tamanho da vizinhança flutua ao longo do tempo. Analisamos como essas variáveis afetam o processo adaptativo. Embora as probabilidades de fixação de mutações benéficas sejam aproximadamente as mesmas que numa população panmítica para valores de adaptação de pequeno e médio s, uma dependência de v e R aparece para grandes s. Estas quantidades também influenciam fortemente os tempos de fixação. O modelo exibe um comportamento duplo que indica um crescimento em lei de potência para a taxa de fixação e a velocidade de adaptação com a taxa de mutação benéfica como observado em modelos de população espacialmente estruturadas, mas simultaneamente mostra um comportamento não saturante para a velocidade de adaptação com o tamanho da população. Na segunda parte, estudamos numericamente a dinâmica de modelos de redes imunes com topologias aleatória e livre de escala. Observamos que um estado memória é alcançado quando o antígeno é ligado aos sítios mais conectados da rede enquanto que um estado de percolação pode ocorrer quando o antígeno se liga aos sítios menos conectados. Para maiores valores de conectividade, sua população converge exponencialmente para o valor assintótico do estado de memória. Por outro lado, as populações mais próximas evoluem lentamente, como leis de potência para o estado virgem.

The puzzle known as tangram was the inspiration behind this composition. Just as the seven pieces of the tangram create shapes, seven contrasting musical fragments appear as thematic materials from which to draw sonic imagery. Sapphic Fragments for two sopranos This composition was constructed from “broken” materials - an analogy for Sappho's dismembered poem. These broken materials were arranged in a pointillistic manner. I drew inspiration from M.C. Escher's works to vary thematic fragments of this work. M.O.N.T.A.G.E. for flute, clarinet, violin and cello This work was influenced by the video work, Wantee, by artist, Laure Prouvost. The title, M.O.N.T.A.G.E., is an acrostic, using words that show intimate relations with my composition: Multicolour, Oscillation, Numbers, Television, the Artist, Gleam, Etc. Once Emerged from the Grey of Night for flute, clarinet, horn, violin, viola and cello This sextet consists of numerous fragments with various colours and textures, forming a musical collage. A picture-poem by Paul Klee offered the starting point for this work. Scale-Free Spaces for flute, guitar, viola and cello I drew compositional ideas from the video installation, Irreversible, by artist Norimichi Hirakawa. This quartet was composed of brief fragments of dots, lines and movements. Various fragments were structured in forms of both simplicity and complexity. For the latter, ideas were drawn from the study in randomness, ‘Scale-Free Network’. String Quartet no. 3 This composition consists of four movements. In the first and third movements, the sound of rain drops and images of light through stained glass are explored. The second and fourth movements effect a structural metamorphoses of musical elements. I drew inspiration from Kafka's novella The Metamorphosis. A Thousand Plateaux for orchestra In this orchestral work, a variety of images of both plateaux and movements were invoked. The work was inspired by both the book, A Thousand Plateaux by Gilles Deleuze and Félix Guattari, and the Alhambra palace in Granada, Spain.

Submitted by Anna Patricia Pachas Manrique (annapamanrique@gmail.com) on 2017-02-23T20:20:56Z No. of bitstreams: 1 20_02 (1).pdf: 1460371 bytes, checksum: e98c8f4713680550a770e8efcc7ffa14 (MD5) / Approved for entry into archive by Janete de Oliveira Feitosa (janete.feitosa@fgv.br) on 2017-08-03T17:52:37Z (GMT) No. of bitstreams: 1 20_02 (1).pdf: 1460371 bytes, checksum: e98c8f4713680550a770e8efcc7ffa14 (MD5) / Made available in DSpace on 2017-08-18T14:34:31Z (GMT). No. of bitstreams: 1 20_02 (1).pdf: 1460371 bytes, checksum: e98c8f4713680550a770e8efcc7ffa14 (MD5) Previous issue date: 2016-08-29 / The speed and comprehensiveness global level with the pathogen has spread in recent years has drawn attention to the importance of the contact’s social network structure. In fact, the topology of the networks in which members of society interact has influenced the dynamics of epidemics. Studies have shown that pathogens when disiparem in scale-free networks have different effects when compared broadcast in random networks, such as the classic models. In these there were epidemic threshold, may somehow the health ministry have a control on the dissipation of diseases by applying certain measures such as vaccines. Already in models in which are considered the networks, specifically the free network scale, the threshold disappears. Thus, the epidemic threshold depends on the topology is required to include within this structure models Because of the importance of these networks, random networks and scalefree have been implemented along the epidemics of propagation models to check the epidemic threshold and the characteristic time, noting that the epidemic threshold disappears / A velocidade e a abrangência a nível mundial com que os agentes patogênicos tem se disseminado nos últimos anos tem chamado a atenção para a importância da estrutura da rede social de contato . De fato, a topologia das redes na qual os membros da sociedade interagem têm influenciado na dinâmica das epidemias.Estudos têm demostrado que os agentes patogênicos ao se dissiparem em redes livres de escala tem efeitos diferentes se comparado quando difundidos em redes aleatórias, como nos modelos clássicos. Nestes existiam limiar de epidemia ,podendo de alguma forma as entidades de saúde ter um controle sobre a dissipação das enfermidades , aplicando certas medidas como as vacinas por exemplo. Já nos modelos nos quais são consideradas as redes , especificamente a rede livre de escala,este limiar desaparece. Desta forma, o limiar de epidemia ao depender da topologia se faz necessário incluir esta estrutura dentro dos modelos epidemiológicos. Devido a importância destas redes , redes aleatórias e principalmente redes livres de escala foram implementadas junto a modelos de propagação de epidemias para verificar o limiar de epidemia e o tempo característico , verificando que o limiar de epidemia desaparece.

Made available in DSpace on 2015-03-03T15:15:30Z (GMT). No. of bitstreams: 1 GerdivaneFD_DISSERT.pdf: 2461999 bytes, checksum: afd653d46e87e83d8b0144e8086a3d19 (MD5) Previous issue date: 2014-02-21 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior / In this work a study of social networks based on analysis of family names is presented. A basic approach to the mathematical formalism of graphs is developed and then main theoretical models for complex networks are presented aiming to support the analysis of surnames networks models. These, in turn, are worked so as to be drawn leading quantities, such as aggregation coefficient, minimum average path length and connectivity distribution. Based on these quantities, it can be stated that surnames networks are an example of complex network, showing important features such as preferential attachment and small-world character / Neste trabalho ? apresentado um estudo das redes sociais baseado na an?lise dos nomes de fam?lias. Faz-se uma abordagem b?sica do formalismo matem?tico dos grafos e em seguida apresenta-se os principais modelos te?ricos para as Redes Complexas com o objetivo de fundamentar a an?lise das redes dos sobrenomes. Estas, por sua vez, s?o trabalhadas de modo a serem extra?das as principais grandezas, tais como coe ciente de agrega??o, menor caminho m?dio e distribui??o de conectividades. Com base nestas grandezas, pode-se a rmar que as redes de sobrenomes s?o um exemplo de rede complexa, exibindo caracter?sticas importantes como liga??o preferencial e o car?ter de mundo pequeno.

The thesis focusses on central nodes' dynamics in cyberspace, representing its key elements. Such approach derives from the theory of networks developed by Albert-László Barabási and it is conceptualised along with cyberspace in security studies and the role of a state in cyberspace. Main question, which is how to improve cybersecurity strategies, is answered by well-structured package of possible positions of a state towards central nodes. It asses the level of involvement in cyberspace, boundaries of intrusion into central nodes and acceptable tools usable against those which are not directly accessible. Powered by TCPDF (www.tcpdf.org)

The thesis is focused on central nodes' dynamics in cyberspace, representing its key elements. This approach is derived from the theory of networks developed by Albert-László Barabási and applied on different aspects of cyberspace, which brings different views at known events and issues and discovers relationship between central and common nodes. Cyberspace is perceived in its broadest shape as a fluid result of social constructivism influenced by behaviour of its users. Final outcomes are summarised to recommendations for a new approach to a cybersecurity strategy. Powered by TCPDF (www.tcpdf.org)

The focus of this thesis is resource management in large-scale systems. Our primary concerns are energy management and practical principles for self-organization and self-management. The main contributions of our work are: 1. Models. We proposed several models for different aspects of resource management, e.g., energy-aware load balancing and application scaling for the cloud ecosystem, hierarchical architecture model for self-organizing and self-manageable systems and a new cloud delivery model based on auction-driven self-organization approach. 2. Algorithms. We also proposed several different algorithms for the models described above. Algorithms such as coalition formation, combinatorial auctions and clustering algorithm for scale-free organizations of scale-free networks. 3. Evaluation. Eventually we conducted different evaluations for the proposed models and algorithms in order to verify them. All the simulations reported in this thesis had been carried out on different instances and services of Amazon Web Services (AWS). All of these modules will be discussed in detail in the following chapters respectively.

Neste trabalho, foram utilizadas técnicas e conceitos tipicamente encontrados em estudos de Redes Complexas, uma sub-área da Física Estatística, para caracterizar a Internet e sua evolução em uma década, de 1998 a 2007. Foi considerada como unidade básica de análise, a estrutura Sistema Autônomo. Nesta caracterização, foram utilizadas várias ferramentas computacionais desenvolvidas em linguagem C/C++, que permitiram classificar, simular e modelar propriedades dinâmicas. Dentre estas propriedades podemos destacar o coeficiente de conectividade, fundamental para os estudos topológicos, e o parâmetro menor caminho médio, ambos baseados nas propriedades da matriz adjacência. Os dados experimentais foram inicialmente obtidos nos roteadores de borda da RedeRio de Computadores - FAPERJ e posteriormente, os dados relativos ao intervalo de estudo, foram retirados da base de dados disponibilizada pela Universidade de Oregon. Foi proposto um modelo de crescimento de uma rede complexa baseado nas premissas de crescimento contínuo e conexão preferencial não linear com suporte aos mecanismos de rearranjo e novas conexões entre nós já existentes. Este modelo se mostrou bastante adequado no estudo das propriedades consideradas. Foi desenvolvido um método para cálculo do menor caminho médio que apresentou performance superior àqueles normalmente utilizados pela comunidade acadêmica. O comportamento da topologia sob o ponto de vista da distribuição de probabilidades de conexão e do ranque de conectividade, apresentaram comportamento linear constante no período estudado com coeficientes médios iguais a -2,0 e -0,93, respectivamente. O parâmetro menor caminho médio global da Internet permaneceu praticamente inalterado e igual a 4, 2 ao longo da década estudada. / Connection networks are observed in many areas of human knowledge. The characterization and topological studies of these networks may be performed through distribution of connectivity degrees, rank properties, shortest path length between nodes, adjacency matrix etc, typical concepts from Complex networks, a filed of study of Statistical Physics domain. In this thesis we characterize the Internet connections evolution from 1998 to 2007. The Internet may be seen under several levels of reach and complexity considering different basic units. A wide vision is to consider the Internet basic element as an Autonomous System - AS, which is defined as a cluster of LANs or routers submitted to the same policy of usage, connectivity and technically administrated by the same network management group. The complex network considered in this work is composed by Autonomous Systems (vertices) and the established tra connection (edges) between them obtained from the BGP routing table. Many interesting property of this networks is analyzed, e.g. degree distribution (the rank and outdegree exponents) from 1998 to 2007 and the shortest path length (L), obtained by a proposed computational method (Friburgo algorithm) among each pair of ASs represented in the adjacency matrix. Finally, we present the behavior of the power law function and the shortest path length of the Internet for each year. Simulations of the connections network were carried out by a proposed model developed from continuous growth premises, possibilities of new and rearranging connections. This model was based on the concept of potential preferable connection showing a stable exponential factor that reproduces the true shortest path parameter over the decade.

Neste trabalho, foram utilizadas técnicas e conceitos tipicamente encontrados em estudos de Redes Complexas, uma sub-área da Física Estatística, para caracterizar a Internet e sua evolução em uma década, de 1998 a 2007. Foi considerada como unidade básica de análise, a estrutura Sistema Autônomo. Nesta caracterização, foram utilizadas várias ferramentas computacionais desenvolvidas em linguagem C/C++, que permitiram classificar, simular e modelar propriedades dinâmicas. Dentre estas propriedades podemos destacar o coeficiente de conectividade, fundamental para os estudos topológicos, e o parâmetro menor caminho médio, ambos baseados nas propriedades da matriz adjacência. Os dados experimentais foram inicialmente obtidos nos roteadores de borda da RedeRio de Computadores - FAPERJ e posteriormente, os dados relativos ao intervalo de estudo, foram retirados da base de dados disponibilizada pela Universidade de Oregon. Foi proposto um modelo de crescimento de uma rede complexa baseado nas premissas de crescimento contínuo e conexão preferencial não linear com suporte aos mecanismos de rearranjo e novas conexões entre nós já existentes. Este modelo se mostrou bastante adequado no estudo das propriedades consideradas. Foi desenvolvido um método para cálculo do menor caminho médio que apresentou performance superior àqueles normalmente utilizados pela comunidade acadêmica. O comportamento da topologia sob o ponto de vista da distribuição de probabilidades de conexão e do ranque de conectividade, apresentaram comportamento linear constante no período estudado com coeficientes médios iguais a -2,0 e -0,93, respectivamente. O parâmetro menor caminho médio global da Internet permaneceu praticamente inalterado e igual a 4, 2 ao longo da década estudada. / Connection networks are observed in many areas of human knowledge. The characterization and topological studies of these networks may be performed through distribution of connectivity degrees, rank properties, shortest path length between nodes, adjacency matrix etc, typical concepts from Complex networks, a filed of study of Statistical Physics domain. In this thesis we characterize the Internet connections evolution from 1998 to 2007. The Internet may be seen under several levels of reach and complexity considering different basic units. A wide vision is to consider the Internet basic element as an Autonomous System - AS, which is defined as a cluster of LANs or routers submitted to the same policy of usage, connectivity and technically administrated by the same network management group. The complex network considered in this work is composed by Autonomous Systems (vertices) and the established tra connection (edges) between them obtained from the BGP routing table. Many interesting property of this networks is analyzed, e.g. degree distribution (the rank and outdegree exponents) from 1998 to 2007 and the shortest path length (L), obtained by a proposed computational method (Friburgo algorithm) among each pair of ASs represented in the adjacency matrix. Finally, we present the behavior of the power law function and the shortest path length of the Internet for each year. Simulations of the connections network were carried out by a proposed model developed from continuous growth premises, possibilities of new and rearranging connections. This model was based on the concept of potential preferable connection showing a stable exponential factor that reproduces the true shortest path parameter over the decade.