BioéthiqueOnline: Moving to Peer-Review / BioéthiqueOnline : Passage à l’évaluation par les pairs

Éditoral / Editorial

PEER TO PEER CACHE RESOLUTION MECHANISM FOR MOBILE AD HOC NETWORKS

In this paper we investigate the problem of cache resolution in a mobile peer to peer ad hoc network. In our vision cache resolution should satisfy the following requirements: (i) it should result in low message overhead and (ii) the information should be retrieved with minimum delay. In this paper, we show that these goals can be achieved by splitting the one hop neighbours in to two sets based on the transmission range. The proposed approach reduces the number of messages flooded in to the network to find the requested data. This scheme is fully distributed and comes at very low cost in terms of cache overhead. The experimental results gives a promising result based on the metrics of studies.

Scientific Journals, Peer Review and How to Write a Great Research Paper

Recording of the Elsevier Author Seminar by Dr Anthony Newman and Michaela Kurschildgen.

Las tecnologías "PEER-TO-PEER" los derechos de autor y el "COPYRIGHT"

William Murray fue un jurista singular. Con el nombre literario de Lord Mansfield, creó para su época y para la posteridad una expresión inolvidable: ―Una persona puede usar una copia tocándola, pero no tiene ningún derecho a robarle al autor los beneficios multiplicando las copias y disponiendo de ellas para su propio uso‖1 . En esa opinión se apoyó para decidir el memorable caso de Millar v. Taylor2, donde por primera vez se sostuvo que los derechos de autor son perpetuos y nunca entran a hacer parte del dominio público. La disputa involucraba a Andrew Millar, un vendedor de libros que, en 1729, adquirió los derechos de edición sobre ‗The Seasons’, un poema de James Thomson. Cuando la protección de esos derechos expiró, Robert Taylor comenzó a publicar sus propias copias y a competir con Millar.

Supporting ad hoc collaborations in peer-to-peer networks

Traditionally, applications and tools supporting collaborative computing have been designed only with personal computers in mind and support a limited range of computing and network platforms. These applications are therefore not well equipped to deal with network heterogeneity and, in particular, do not cope well with dynamic network topologies. Progress in this area must be made if we are to fulfil the needs of users and support the diversity, mobility, and portability that are likely to characterise group work in future. This paper describes a groupware platform called Coco that is designed to support collaboration in a heterogeneous network environment. The work demonstrates that progress in the p development of a generic supporting groupware is achievable, even in the context of heterogeneous and dynamic networks. The work demonstrates the progress made in the development of an underlying communications infrastructure, building on peer-to-peer concept and topologies to improve scalability and robustness.

A peer-to-peer approach to content dissemination and search in collaborative networks

There are three key driving forces behind the development of Internet Content Management Systems (CMS) - a desire to manage the explosion of content, a desire to provide structure and meaning to content in order to make it accessible, and a desire to work collaboratively to manipulate content in some meaningful way. Yet the traditional CMS has been unable to meet the latter of these requirements, often failing to provide sufficient tools for collaboration in a distributed context. Peer-to-Peer (P2P) systems are networks in which every node is an equal participant (whether transmitting data, exchanging content, or invoking services) and there is an absence of any centralised administrative or coordinating authorities. P2P systems are inherently more scalable than equivalent client-server implementations as they tend to use resources at the edge of the network much more effectively. This paper details the rationale and design of a P2P middleware for collaborative content management.

Equipped to deal with uncertainty in climate and impacts predictions: lessons from internal peer review

The quantification of uncertainty is an increasingly popular topic, with clear importance for climate change policy. However, uncertainty assessments are open to a range of interpretations, each of which may lead to a different policy recommendation. In the EQUIP project researchers from the UK climate modelling, statistical modelling, and impacts communities worked together on ‘end-to-end’ uncertainty assessments of climate change and its impacts. Here, we use an experiment in peer review amongst project members to assess variation in the assessment of uncertainties between EQUIP researchers. We find overall agreement on key sources of uncertainty but a large variation in the assessment of the methods used for uncertainty assessment. Results show that communication aimed at specialists makes the methods used harder to assess. There is also evidence of individual bias, which is partially attributable to disciplinary backgrounds. However, varying views on the methods used to quantify uncertainty did not preclude consensus on the consequential results produced using those methods. Based on our analysis, we make recommendations for developing and presenting statements on climate and its impacts. These include the use of a common uncertainty reporting format in order to make assumptions clear; presentation of results in terms of processes and trade-offs rather than only numerical ranges; and reporting multiple assessments of uncertainty in order to elucidate a more complete picture of impacts and their uncertainties. This in turn implies research should be done by teams of people with a range of backgrounds and time for interaction and discussion, with fewer but more comprehensive outputs in which the range of opinions is recorded.

Interactional dynamics in on-line and face-to-face peer-tutoring sessions for second language writers

This paper reports the results of a study comparing the interactional dynamics of face-to-face and on-line peer-tutoring in writing by university students in Hong Kong. Transcripts of face-to-face tutoring sessions, as well as logs of on-line sessions conducted by the same peer-tutors, were coded for speech functions using a system based on Halliday's functional-semantic view of dialogue. Results show considerable differences between the interactional dynamics in on-line and face-to-face tutoring sessions. In particular, face-to-face interactions involved more hierarchal encounters in which tutors took control of the discourse, whereas on-line interactions were more egalitarian, with clients controlling the discourse more. Differences were also found in the topics participants chose to focus on in the two modes, with issues of grammar, vocabulary, and style taking precedence in face-to-face sessions and more “global” writing concerns like content and process being discussed more in on-line sessions.

PERFORMANCE EVOLUTION OF PEER TO PEER NETWORKS

This thesis work concerns about the Performance evolution of peer to peer networks, where we used different distribution technique’s of peer distribution like Weibull, Lognormal and Pareto distribution process. Then we used a network simulator to evaluate the performance of these three distribution techniques.During the last decade the Internet has expanded into a world-wide network connecting millions of hosts and users and providing services for everyone. Many emerging applications are bandwidth-intensive in their nature; the size of downloaded files including music and videos can be huge, from ten megabits to many gigabits. The efficient use of network resources is thus crucial for the survivability of the Internet. Traffic engineering (TE) covers a range of mechanisms for optimizing operational networks from the traffic perspective. The time scale in traffic engineering varies from the short-term network control to network planning over a longer time period.Here in this thesis work we considered the peer distribution technique in-order to minimise the peer arrival and service process with three different techniques, where we calculated the congestion parameters like blocking time for each peer before entering into the service process, waiting time for a peers while the other peer has been served in the service block and the delay time for each peer. Then calculated the average of each process and graphs have been plotted using Matlab to analyse the results