993 resultados para Emergent properties
Resumo:
The Harris-Todaro model of the rural-urban migration process is revisited under an agent-based approach. The migration of the workers is interpreted as a process of social learning by imitation, formalized by a computational model. By simulating this model, we observe a transitional dynamics with continuous growth of the urban fraction of overall population toward an equilibrium. Such an equilibrium is characterized by stabilization of rural-urban expected wages differential (generalized Harris-Todaro equilibrium condition), urban concentration and urban unemployment. These classic results obtained originally by Harris and Todaro are emergent properties of our model.
Resumo:
The structure of an ecological community is shaped by several temporally varying mechanisms. Such mechanisms depend in a large extent on species interactions, which are themselves manifestations of the community's own structure. Dynamics and structure are then mutually determined. The assembly models are mathematical or computational models which simulate the dynamics of ecological communities resulting from a historical balance among colonizations and local extinctions, by means of sequential species introductions and their interactions with resident species. They allow analyzing that double relationship between structure and dynamics, recognizing its temporal dependence. It is assumed two spatiotemporal scales: (i) a local scale, where species co-occur and have their dynamics explicitly simulated and (ii) a regional scale without dynamics, representing the external environment which the potential colonizers come from. The mathematical and computational models used to simulate the local dynamics are quite variable, being distinguished according to the complexity mode of population representation, including or not intra or interspecific differences. They determine the community state, in terms of abundances, interactions, and extinctions between two successive colonization attempts. The schedules of species introductions also follow diverse (although arbitrary) rules, which vary qualitatively with respect to species appearance mode, whether by speciation or by immigration, and quantitatively with respect to their rates of introduction into the community. Combining these criteria arises a great range of approaches for assembly models, each with its own limitations and questions, but contributing in a complementary way to elucidate the mechanisms structuring natural communities. To present such approaches, still incipient as research fields in Brazil, to describe some methods of analysis and to discuss the implications of their assumptions for the understanding of ecological patterns are the objectives of the present review.
Resumo:
Pós-graduação em Ciências Biológicas (Zoologia) - IBRC
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Biological processes are complex and possess emergent properties that can not be explained or predict by reductionism methods. To overcome the limitations of reductionism, researchers have been used a group of methods known as systems biology, a new interdisciplinary eld of study aiming to understand the non-linear interactions among components embedded in biological processes. These interactions can be represented by a mathematical object called graph or network, where the elements are represented by nodes and the interactions by edges that link pair of nodes. The networks can be classi- ed according to their topologies: if node degrees follow a Poisson distribution in a given network, i.e. most nodes have approximately the same number of links, this is a random network; if node degrees follow a power-law distribution in a given network, i.e. small number of high-degree nodes and high number of low-degree nodes, this is a scale-free network. Moreover, networks can be classi ed as hierarchical or non-hierarchical. In this study, we analised Escherichia coli and Saccharomyces cerevisiae integrated molecular networks, which have protein-protein interaction, metabolic and transcriptional regulation interactions. By using computational methods, such as MathematicaR , and data collected from public databases, we calculated four topological parameters: the degree distribution P(k), the clustering coe cient C(k), the closeness centrality CC(k) and the betweenness centrality CB(k). P(k) is a function that calculates the total number of nodes with k degree connection and is used to classify the network as random or scale-free. C(k) shows if a network is hierarchical, i.e. if the clusterization coe cient depends on node degree. CC(k) is an indicator of how much a node it is in the lesse way among others some nodes of the network and the CB(k) is a pointer of how a particular node is among several ...(Complete abstract click electronic access below)
Resumo:
The reducionism method has helped in the clari cation of functioning of many biological process. However, such process are extremely complex and have emergent properties that can not be explained or even predicted by reducionism methods. To overcome these limits, researchers have been used a set of methods known as systems biology, a new area of biology aiming to understand the interactions between the multiple components of biological processes. These interactions can be represented by a mathematical object called graph or network, where the interacting elements are represented by a vertex and the interactions by edges that connect a pair of vertexes. Into graphs it is possible to nd subgraphs, occurring in complex networks at numbers that are signi cantly higher than those in randomized networks, they are de ned as motifs. As motifs in biological networks may represent the structural units of biological processess, their detection is important. Therefore, the aim of this present work was detect, count and classify motifs present in biological integrated networks of bacteria Escherichia coli and yeast Saccharomyces cere- visiae. For this purpose, we implemented codes in MathematicaR and Python environments for detecting, counting and classifying motifs in these networks. The composition and types of motifs detected in these integrated networks indicate that such networks are organized in three main bridged modules composed by motifs in which edges are all the same type. The connecting bridges are composed by motifs in which the types of edges are diferent
Resumo:
The Peer-to-Peer network paradigm is drawing the attention of both final users and researchers for its features. P2P networks shift from the classic client-server approach to a high level of decentralization where there is no central control and all the nodes should be able not only to require services, but to provide them to other peers as well. While on one hand such high level of decentralization might lead to interesting properties like scalability and fault tolerance, on the other hand it implies many new problems to deal with. A key feature of many P2P systems is openness, meaning that everybody is potentially able to join a network with no need for subscription or payment systems. The combination of openness and lack of central control makes it feasible for a user to free-ride, that is to increase its own benefit by using services without allocating resources to satisfy other peers’ requests. One of the main goals when designing a P2P system is therefore to achieve cooperation between users. Given the nature of P2P systems based on simple local interactions of many peers having partial knowledge of the whole system, an interesting way to achieve desired properties on a system scale might consist in obtaining them as emergent properties of the many interactions occurring at local node level. Two methods are typically used to face the problem of cooperation in P2P networks: 1) engineering emergent properties when designing the protocol; 2) study the system as a game and apply Game Theory techniques, especially to find Nash Equilibria in the game and to reach them making the system stable against possible deviant behaviors. In this work we present an evolutionary framework to enforce cooperative behaviour in P2P networks that is alternative to both the methods mentioned above. Our approach is based on an evolutionary algorithm inspired by computational sociology and evolutionary game theory, consisting in having each peer periodically trying to copy another peer which is performing better. The proposed algorithms, called SLAC and SLACER, draw inspiration from tag systems originated in computational sociology, the main idea behind the algorithm consists in having low performance nodes copying high performance ones. The algorithm is run locally by every node and leads to an evolution of the network both from the topology and from the nodes’ strategy point of view. Initial tests with a simple Prisoners’ Dilemma application show how SLAC is able to bring the network to a state of high cooperation independently from the initial network conditions. Interesting results are obtained when studying the effect of cheating nodes on SLAC algorithm. In fact in some cases selfish nodes rationally exploiting the system for their own benefit can actually improve system performance from the cooperation formation point of view. The final step is to apply our results to more realistic scenarios. We put our efforts in studying and improving the BitTorrent protocol. BitTorrent was chosen not only for its popularity but because it has many points in common with SLAC and SLACER algorithms, ranging from the game theoretical inspiration (tit-for-tat-like mechanism) to the swarms topology. We discovered fairness, meant as ratio between uploaded and downloaded data, to be a weakness of the original BitTorrent protocol and we drew inspiration from the knowledge of cooperation formation and maintenance mechanism derived from the development and analysis of SLAC and SLACER, to improve fairness and tackle freeriding and cheating in BitTorrent. We produced an extension of BitTorrent called BitFair that has been evaluated through simulation and has shown the abilities of enforcing fairness and tackling free-riding and cheating nodes.
Resumo:
Few real software systems are built completely from scratch nowadays. Instead, systems are built iteratively and incrementally, while integrating and interacting with components from many other systems. Adaptation, reconfiguration and evolution are normal, ongoing processes throughout the lifecycle of a software system. Nevertheless the platforms, tools and environments we use to develop software are still largely based on an outmoded model that presupposes that software systems are closed and will not significantly evolve after deployment. We claim that in order to enable effective and graceful evolution of modern software systems, we must make these systems more amenable to change by (i) providing explicit, first-class models of software artifacts, change, and history at the level of the platform, (ii) continuously analysing static and dynamic evolution to track emergent properties, and (iii) closing the gap between the domain model and the developers' view of the evolving system. We outline our vision of dynamic, evolving software systems and identify the research challenges to realizing this vision.
Resumo:
BACKGROUND Tight spatio-temporal signaling of cytoskeletal and adhesion dynamics is required for localized membrane protrusion that drives directed cell migration. Different ensembles of proteins are therefore likely to get recruited and phosphorylated in membrane protrusions in response to specific cues. RESULTS HERE, WE USE AN ASSAY THAT ALLOWS TO BIOCHEMICALLY PURIFY EXTENDING PROTRUSIONS OF CELLS MIGRATING IN RESPONSE TO THREE PROTOTYPICAL RECEPTORS: integrins, recepor tyrosine kinases and G-coupled protein receptors. Using quantitative proteomics and phospho-proteomics approaches, we provide evidence for the existence of cue-specific, spatially distinct protein networks in the different cell migration modes. CONCLUSIONS The integrated analysis of the large-scale experimental data with protein information from databases allows us to understand some emergent properties of spatial regulation of signaling during cell migration. This provides the cell migration community with a large-scale view of the distribution of proteins and phospho-proteins regulating directed cell migration.
Resumo:
The understanding of the structure and dynamics of the intricate network of connections among people that consumes products through Internet appears as an extremely useful asset in order to study emergent properties related to social behavior. This knowledge could be useful, for example, to improve the performance of personal recommendation algorithms. In this contribution, we analyzed five-year records of movie-rating transactions provided by Netflix, a movie rental platform where users rate movies from an online catalog. This dataset can be studied as a bipartite user-item network whose structure evolves in time. Even though several topological properties from subsets of this bipartite network have been reported with a model that combines random and preferential attachment mechanisms [Beguerisse Díaz et al., 2010], there are still many aspects worth to be explored, as they are connected to relevant phenomena underlying the evolution of the network. In this work, we test the hypothesis that bursty human behavior is essential in order to describe how a bipartite user-item network evolves in time. To that end, we propose a novel model that combines, for user nodes, a network growth prescription based on a preferential attachment mechanism acting not only in the topological domain (i.e. based on node degrees) but also in time domain. In the case of items, the model mixes degree preferential attachment and random selection. With these ingredients, the model is not only able to reproduce the asymptotic degree distribution, but also shows an excellent agreement with the Netflix data in several time-dependent topological properties.
Resumo:
Complex systems techniques provide a powerful tool to study the emergent properties of networks of interacting genes. In this study we extract models of genetic regulatory networks from an artificial genome, represented by a sequence of nucleotides, and analyse how variations in the connectivity and degree of inhibition of the extracted networks affects the resulting classes of behaviours. For low connectivity systems were found to be very stable. Only with higher connectivity was a significant occurrence of chaos found. Most interestingly, the peak in occurrence of chaos occurs perched on the edge of a phase transition in the occurrence of attractors.
Resumo:
Multi-agent systems are complex systems comprised of multiple intelligent agents that act either independently or in cooperation with one another. Agent-based modelling is a method for studying complex systems like economies, societies, ecologies etc. Due to their complexity, very often mathematical analysis is limited in its ability to analyse such systems. In this case, agent-based modelling offers a practical, constructive method of analysis. The objective of this book is to shed light on some emergent properties of multi-agent systems. The authors focus their investigation on the effect of knowledge exchange on the convergence of complex, multi-agent systems.
Resumo:
This work examines atiku-euiash (caribou meat) sharing practices in Sheshatshiu, Newfoundland and Labrador, and aims to elucidate an overarching question: how do sharing practices participate in the co-constitution of the Innu ‘social’? The ‘social’ is understood in this work as a descriptor that refers to the emergent properties of the Innu collective. The thesis is that sharing practices participate in the co-constitution of the Innu social and enact its boundaries. Inside these boundaries, atiku-euiash is more than simply a food resource: by realizing Innu values of generosity, respect and autonomy, sharing implicates the associations of human, animal, and animal masters that constitute the Innu world. Sharing is connected with the enskilment of the younger generations by their el-ders, and thus with the reproduction of Innu values through time. The ways of sharing are relevant because changes in such practices affect the constitution of the Innu social. Giv-en Euro-Canadian colonization, the Innu are in a fraught social space in which sharing is interrupted by colonization practices and values. Understanding sharing is necessary to develop policies that do not interrupt the reproduction of the Innu world This work uses several research methods: participant observation, sharing surveys, and interviews. It also uses network analysis as sharing practices leave traces of giving and receiving actions and these traces can be represented as a network of givers, receivers and circulating caribou meat. There are two main ways in which caribou is hunted and shared: household-based hunts and community-based hunts. The household-based hunts are organized by the hunters themselves, who are able and willing to hunt. Community-based hunts are completely organized and funded by the SIFN or the Innu Nation. In or-der to understand the differences in the distribution of the two hunt types, the categories of centrality and clustering are used to show how the flow of atiku-eiuash and its associ-ated realization of values and enskilment correlate with different degrees of centralization inside the sharing clusters.