Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support

In a peer-to-peer network, the nodes interact with each other by sharing resources, services and information. Many applications have been developed using such networks, being a class of such applications are peer-to-peer databases. The peer-to-peer databases systems allow the sharing of unstructured data, being able to integrate data from several sources, without the need of large investments, because they are used existing repositories. However, the high flexibility and dynamicity of networks the network, as well as the absence of a centralized management of information, becomes complex the process of locating information among various participants in the network. In this context, this paper presents original contributions by a proposed architecture for a routing system that uses the Ant Colony algorithm to optimize the search for desired information supported by ontologies to add semantics to shared data, enabling integration among heterogeneous databases and the while seeking to reduce the message traffic on the network without causing losses in the amount of responses, confirmed by the improve of 22.5% in this amount. © 2011 IEEE.

Optimization of query results in peer-to-peer database supported by semantics

The development of new technologies that use peer-to-peer networks grows every day, with the object to supply the need of sharing information, resources and services of databases around the world. Among them are the peer-to-peer databases that take advantage of peer-to-peer networks to manage distributed knowledge bases, allowing the sharing of information semantically related but syntactically heterogeneous. However, it is a challenge to ensure the efficient search for information without compromising the autonomy of each node and network flexibility, given the structural characteristics of these networks. On the other hand, some studies propose the use of ontology semantics by assigning standardized categorization of information. The main original contribution of this work is the approach of this problem with a proposal for optimization of queries supported by the Ant Colony algorithm and classification though ontologies. The results show that this strategy enables the semantic support to the searches in peer-to-peer databases, aiming to expand the results without compromising network performance. © 2011 IEEE.

Roteamento de consultas em banco de dados peer-to-peer utilizando colônias de formigas e ontologias

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

SW-V: modelo de streaming de software baseado em técnicas de virtualização e transporte peer-to-peer

Pós-graduação em Ciência da Computação - IBILCE

Modelo estrutural para compartilhamento de arquivos peer-to-peer

Pós-graduação em Ciência da Computação - IBILCE

A experiência multiprofissional e interdisciplinar da interação universidade-serviços-comunidade: o olhar e o trabalho do professor tutor

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

O tutor nos cursos de Pedagogia da Universidade Aberta do Brasil: características da tutoria e aspectos da profissionalização

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

O tutor no ensino a distância: considerações sobre o elemento humano da mediação educativa com tecnologia

Pós-graduação em Educação Escolar - FCLAR

O tutor virtual na formação continuada em educação especial

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Student Understanding and Achievement When Focusing on Peer-led Reviews

Math in the Middle Institute Partnership, Action Research Project Report, In partial fulfillment of the MAT Degree. Department of Mathematics. University of Nebraska-Lincoln. July 2009.

Making Learning Visible: Peer Review and the Scholarship of Teaching

This is the promotional brochure from the March 2004 national conference, Making Learning Visible: Peer Review and the Scholarship of Teaching. This conference was hosted by the UNL Peer Review of Teaching project and the University of Nebraska-Lincoln.

Central catheter dressing in a simulator: the effects of tutor's assistance or self-learning tutorial

Aims: to compare the performance of undergraduate students concerning semi-implanted central venous catheter dressing in a simulator, with the assistance of a tutor or of a self-learning tutorial. Method: Randomized controlled trial. The sample consisted of 35 undergraduate nursing students, who were divided into two groups after attending an open dialogue presentation class and watching a video. One group undertook the procedure practice with a tutor and the other with the assistance of a self-learning tutorial. Results: in relation to cognitive knowledge, the two groups had lower performance in the pre-test than in the post-test. The group that received assistance from a tutor performed better in the practical assessment. Conclusion: the simulation undertaken with the assistance of a tutor showed to be the most effective learning strategy when compared to the simulation using a self-learning tutorial. Advances in nursing simulation technology are of upmost importance and the role of the tutor in the learning process should be highlighted, taking into consideration the role this professional plays in knowledge acquisition and in the development of critical-reflexive thoughts and attitudes. (ClinicalTrials.gov Identifier: NCT 01614314).

Evolutionary methods for self-organizing cooperation in peer-to-peer networks

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.