Effectiveness of landmark analysis for establishing locality in p2p networks

Locality to other nodes on a peer-to-peer overlay network can be established by means of a set of landmarks shared among the participating nodes. Each node independently collects a set of latency measures to landmark nodes, which are used as a multi-dimensional feature vector. Each peer node uses the feature vector to generate a unique scalar index which is correlated to its topological locality. A popular dimensionality reduction technique is the space filling Hilbert’s curve, as it possesses good locality preserving properties. However, there exists little comparison between Hilbert’s curve and other techniques for dimensionality reduction. This work carries out a quantitative analysis of their properties. Linear and non-linear techniques for scaling the landmark vectors to a single dimension are investigated. Hilbert’s curve, Sammon’s mapping and Principal Component Analysis have been used to generate a 1d space with locality preserving properties. This work provides empirical evidence to support the use of Hilbert’s curve in the context of locality preservation when generating peer identifiers by means of landmark vector analysis. A comparative analysis is carried out with an artificial 2d network model and with a realistic network topology model with a typical power-law distribution of node connectivity in the Internet. Nearest neighbour analysis confirms Hilbert’s curve to be very effective in both artificial and realistic network topologies. Nevertheless, the results in the realistic network model show that there is scope for improvements and better techniques to preserve locality information are required.

The effects of maternal depression and parental conflict on children's peer play

Background Little is known about the relative effects of exposure to postnatal depression and parental conflict on the social functioning of school-aged children. This is, in part, because of a lack of specificity in the measurement of child and parental behaviour and a reliance on children's reports of their hypothetical responses to conflict in play. Methods In the course of a prospective longitudinal study of children of postnatally depressed and well women, 5-year-old children were videotaped at home with a friend in a naturalistic dressing-up play setting. As well as examining possible associations between the occurrence of postnatal depression and the quality of the children's interactions, we investigated the influence of parental conflict and co-operation, and the continuity of maternal depression. The quality of the current mother-child relationship was considered as a possible mediating factor. Results Exposure to postnatal depression was associated with increased likelihood, among boys, of displaying physical aggression in play with their friend. However, parental conflict mediated the effects of postnatal depression on active aggression during play, and was also associated with displays of autonomy and intense conflict. While there were no gender effects in terms of the degree or intensity of aggressive behaviours, girls were more likely to express aggression verbally using denigration and gloating whereas boys were more likely to display physical aggression via interpersonal and object struggles. Conclusions The study provided evidence for the specificity of effects, with strong links between parental and child peer conflict. These effects appear to arise from direct exposure to parental conflict, rather than indirectly, through mother-child interactions.

Are you thinking what I’m thinking? Peer group similarities in adolescent hostile attribution tendencies

A bias towards attributing hostile intent to others has been linked to aggression. In an adolescent sample, we investigated whether peer group homophily exists in the tendency towards attributing hostile intent. We assessed hostile attribution tendencies and self-reported aggressive behaviours in a normative sample of 910 adolescents, and computed average peer group scores based on nominated friend scores. Results indicated that adolescents showed significant correlations between their own level of hostile attributions and that of their peer group. Further analyses indicated that this effect occurred specifically in reciprocal friendships, and was retained even once own and peer group level of aggression were controlled.

Citation and peer review of data: moving towards formal data publication

This paper discusses many of the issues associated with formally publishing data in academia, focusing primarily on the structures that need to be put in place for peer review and formal citation of datasets. Data publication is becoming increasingly important to the scientific community, as it will provide a mechanism for those who create data to receive academic credit for their work and will allow the conclusions arising from an analysis to be more readily verifiable, thus promoting transparency in the scientific process. Peer review of data will also provide a mechanism for ensuring the quality of datasets, and we provide suggestions on the types of activities one expects to see in the peer review of data. A simple taxonomy of data publication methodologies is presented and evaluated, and the paper concludes with a discussion of dataset granularity, transience and semantics, along with a recommended human-readable citation syntax.

An experimental investigation of peer influences on hostile attributions in adolescents

Aggression in young people has been associated with a bias towards attributing hostile intent to others; however, little is known about the origin of biased social information processing. The current study explored the potential role of peer contagion in the emergence of hostile attribution in adolescents. 134 adolescents were assigned to one of two manipulated ‘chat-room’ conditions, where they believed they were communicating with online peers (e-confederates) who endorsed either hostile or benign intent attributions. Adolescents showed increased hostile attributions following exposure to hostile e-confederates and reduced hostility in the benign condition. Further analyses demonstrated that social anxiety was associated with a reduced tendency to take on hostile peer attitudes. Neither gender nor levels of aggression influenced individual susceptibility to peer influence, but aggressive adolescents reported greater affinity with hostile e-confederates.

Competing edge networks

We introduce a model for a pair of nonlinear evolving networks, defined over a common set of vertices, sub ject to edgewise competition. Each network may grow new edges spontaneously or through triad closure. Both networks inhibit the other’s growth and encourage the other’s demise. These nonlinear stochastic competition equations yield to a mean field analysis resulting in a nonlinear deterministic system. There may be multiple equilibria; and bifurcations of different types are shown to occur within a reduced parameter space. This situation models competitive peer-to-peer communication networks such as BlackBerry Messenger displacing SMS; or instant messaging displacing emails.

Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks

The K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks, such as massively parallel processors and clusters of workstations. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered useless by a single communication failure or high latency in communication paths. The lack of scalable and fault tolerant global communication and synchronisation methods in large-scale systems has hindered the adoption of the K-Means algorithm for applications in large networked systems such as wireless sensor networks, peer-to-peer systems and mobile ad hoc networks. This work proposes a fully distributed K-Means algorithm (EpidemicK-Means) which does not require global communication and is intrinsically fault tolerant. The proposed distributed K-Means algorithm provides a clustering solution which can approximate the solution of an ideal centralised algorithm over the aggregated data as closely as desired. A comparative performance analysis is carried out against the state of the art sampling methods and shows that the proposed method overcomes the limitations of the sampling-based approaches for skewed clusters distributions. The experimental analysis confirms that the proposed algorithm is very accurate and fault tolerant under unreliable network conditions (message loss and node failures) and is suitable for asynchronous networks of very large and extreme scale.

Design patterns for promoting peer interaction in discussion forums in MOOCs

Design patterns are a way of sharing evidence-based solutions to educational design problems. The design patterns presented in this paper were produced through a series of workshops, which aimed to identify Massive Open Online Course (MOOC) design principles from workshop participants’ experiences of designing, teaching and learning on these courses. MOOCs present a challenge for the existing pedagogy of online learning, particularly as it relates to promoting peer interaction and discussion. MOOC cohort sizes, participation patterns and diversity of learners mean that discussions can remain superficial, become difficult to navigate, or never develop beyond isolated posts. In addition, MOOC platforms may not provide sufficient tools to support moderation. This paper draws on four case studies of designing and teaching on a range of MOOCs presenting seven design narratives relating to the experience in these MOOCs. Evidence presented in the narratives is abstracted in the form of three design patterns created through a collaborative process using techniques similar to those used in collective autoethnography. The patterns: “Special Interest Discussions”, “Celebrity Touch” and “Look and Engage”, draw together shared lessons and present possible solutions to the problem of creating, managing and facilitating meaningful discussion in MOOCs through the careful use of staged learning activities and facilitation strategies.

Peer Review

The perils of peer review come home to roost in academe.

Faculty Instructional Quality Assessment Practices Incorporating Teaching Portfolios and Peer Review with Student Course Evaluations

Program directors and department chairs require different means of assessing faculty quality due to the unreliability of student course evaluation data. This report outlines alternative strategies for review committees to assess faculty instructional quality. This report also details incorporation of annual performance reviews for tenure-track faculty into tenure decisions.

A social network approach to trust management in VANETs

In the past few years, vehicular ad hoc networks(VANETs) was studied extensively by researchers. VANETs is a type of P2P network, though it has some distinct characters (fast moving, short lived connection etc.). In this paper, we present several limitations of current trust management schemes in VANETs and propose ways to counter them. We first review several trust management techniques in VANETs and argue that the ephemeral nature of VANETs render them useless in practical situations. We identify that the problem of information cascading and oversampling, which commonly arise in social networks, also adversely affects trust management schemes in VANETs. To the best of our knowledge, we are the first to introduce information cascading and oversampling to VANETs. We show that simple voting for decision making leads to oversampling and gives incorrect results in VANETs. To overcome this problem, we propose a novel voting scheme. In our scheme, each vehicle has different voting weight according to its distance from the event. The vehicle which is more closer to the event possesses higher weight. Simulations show that our proposed algorithm performs better than simple voting, increasing the correctness of voting. © 2012 Springer Science + Business Media, LLC.

Comparing support vector machines and artificial neural networks in the recognition of steering angle for driving of mobile robots through paths in plantations

The use of mobile robots turns out to be interesting in activities where the action of human specialist is difficult or dangerous. Mobile robots are often used for the exploration in areas of difficult access, such as rescue operations and space missions, to avoid human experts exposition to risky situations. Mobile robots are also used in agriculture for planting tasks as well as for keeping the application of pesticides within minimal amounts to mitigate environmental pollution. In this paper we present the development of a system to control the navigation of an autonomous mobile robot through tracks in plantations. Track images are used to control robot direction by pre-processing them to extract image features. Such features are then submitted to a support vector machine and an artificial neural network in order to find out the most appropriate route. A comparison of the two approaches was performed to ascertain the one presenting the best outcome. The overall goal of the project to which this work is connected is to develop a real time robot control system to be embedded into a hardware platform. In this paper we report the software implementation of a support vector machine and of an artificial neural network, which so far presented respectively around 93% and 90% accuracy in predicting the appropriate route. (C) 2013 The Authors. Published by Elsevier B.V. Selection and peer review under responsibility of the organizers of the 2013 International Conference on Computational Science

Survivable Traffic Grooming With Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Survivable Traffic Grooming with Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength division multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated protection and shared protection schemes are considered. Given the network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. We first resort to the integer linear programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA) and tabu search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu search method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Peer assessment in ULPGC on line CLIL course 2010-2013

[EN]Introduction to Content Language and Integrated Learning ( CLIL) is a 60 hour on line course offered by Universidad de Las Palmas de Gran Canaria within its extracurricular courses. During three years we have had 76 students whose final assessment has been to create a CLIL lesson which was evaluated by their peers. The tool for the peer assessment has been the Moodle platform; forums. The assessment was guided by a list of questions they had to apply when evaluating the lessons, but the replies from the CLIL lesson creators did not have any predetermined structure or guidelines to be followed. We have analysed the assessments and replies by grouping them according to content similarities.