Best practice in peer-led curriculum content : informing an interactive program to improve passenger safety among high school seniors

Despite ongoing improvements in behaviour change strategies, licensing models and road law enforcement measures young drivers remain significantly over-represented in fatal and non-fatal road related crashes. This paper focuses on the safety of those approaching driving age and identifies both high priority road safety messages and relevant peer-led strategies to guide the development school programs. It summarises the review in a program logic model built around the messages and identified curriculum elements, as they may be best operationalised within the licensing and school contexts in Victoria. This paper summarises a review of common deliberate risk-taking and non-deliberate unsafe driving behaviours among novice drivers, highlighting risks associated with speeding, driving while fatigued, driving while impaired and carrying passengers. Common beliefs of young people that predict risky driving were reviewed, particularly with consideration of those beliefs that can be operationalised in a behaviour change school program. Key components of adolescent risk behaviour change programs were also reviewed, which identified a number of strategies for incorporation in a school based behaviour change program, including: a well-structured theoretical design and delivery, thoughtfully considered peer-selected processes, adequate training and supervision of peer facilitators, a process for monitoring and sustainability, and interactive delivery and participant discussions. The research base is then summarised in a program logic model with further discussion about the quality of the current state of knowledge of evaluation of behaviour change programs and the need for considerable development in program evaluation.

Enhanced student learning in accounting utilising web-based technology, peer-review feedback and reflective practices: A learning community approach to assessment

Higher education is becoming a major driver of economic competitiveness in an increasingly knowledge-driven global economy. Maintaining the competitive edge has seen an increase in public accountability of higher education institutions through the mechanism of ranking universities based on the quality of their teaching and learning outcomes. As a result, assessment processes are under scrutiny, creating tensions between standardisation and measurability and the development of creative and reflective learners. These tensions are further highlighted in the context of large undergraduate subjects, learner diversity and time-poor academics and students. Research suggests that high level and complex learning is best developed when assessment, combined with effective feedback practices, involves students as partners in these processes. This article reports on a four-phase, cross-institution and cross-discipline project designed to embed peer-review processes as part of the assessment in two large, undergraduate accounting classes. Using a social constructivist view of learning, which emphasises the role of both teacher and learner in the development of complex cognitive understandings, we undertook an iterative process of peer review. Successive phases built upon students’ feedback and achievements and input from language/learning and curriculum experts to improve the teaching and learning outcomes.

A student-centred approach to support, reward and recognition of student peer ‘learnership’

The benefits for university graduates in growing skills and capabilities through volunteering experiences are gaining increased attention. Building leadership self-efficacy supports students develop their capacity for understanding, articulating and evidencing their learning. Reward and recognition is fundamental in the student’s journey to build self-efficacy. Through this research, concepts of reward and recognition have been explored and articulated through the experiences and perceptions of actively engaged student peer leaders. The research methodology has enabled a collaborative, student-centred approach in shaping an innovative Rewards Framework, which supports, recognises and rewards the learning journey from beginning peer leader to competent and confident graduate.

Practices to enhance peer program implementation integrity to safeguard peer leaders and learners

The powerful influence of peers on fellow students’ learning engagement and their ability to foster self-efficacy is well recognised. A positive learner mindset can be fostered through establishment of guided meaningful relationships formed between peers. Recognising the value of peer connections in shaping the student learning experience, peer programs have been widely adopted by universities as a mechanism to facilitate these connections. While potentially beneficial, a lack of knowledge and inexperience by program implementers can lead to program outcomes being compromised. To mitigate this risk, QUT has established university wide systems and benchmarks for enacting peer programs. These measures aim to promote program implementation integrity by supporting and developing the knowledge and capabilities of peer leaders and program coordinators. This paper describes a range of measures that have been instigated to optimise the quality of programs and ensure outcomes are mutually constructive and beneficial for all stakeholders.

Using simplified peer review processes to fund research: A prospective study

Objective: To prospectively test two simplified peer review processes, estimate the agreement between the simplified and official processes, and compare the costs of peer review. Design, participants and setting: A prospective parallel study of Project Grant proposals submitted in 2013 to the National Health and Medical Research Council (NHMRC) of Australia. The official funding outcomes were compared with two simplified processes using proposals in Public Health and Basic Science. The two simplified processes were: panels of 7 reviewers who met face-to-face and reviewed only the nine-page research proposal and track record (simplified panel); and 2 reviewers who independently reviewed only the nine-page research proposal (journal panel). The official process used panels of 12 reviewers who met face-to-face and reviewed longer proposals of around 100 pages. We compared the funding outcomes of 72 proposals that were peer reviewed by the simplified and official processes. Main outcome measures: Agreement in funding outcomes; costs of peer review based on reviewers’ time and travel costs. Results: The agreement between the simplified and official panels (72%, 95% CI 61% to 82%), and the journal and official panels (74%, 62% to 83%), was just below the acceptable threshold of 75%. Using the simplified processes would save $A2.1–$A4.9 million per year in peer review costs. Conclusions: Using shorter applications and simpler peer review processes gave reasonable agreement with the more complex official process. Simplified processes save time and money that could be reallocated to actual research. Funding agencies should consider streamlining their application processes.

Rip, mix, burn: The politics of peer to peer and copyright law

Whereas Lessig's recent work engages with questions of culture and creativity in society, this paper looks at the role of culture and creativity in the law. The paper evaluates the Napster, DeCSS, Felten and Sklyarov litigation in terms of the new social, legal, economic and cultural relations being produced. This involves a deep discussion of law's economic relations, and the implications of this for litigation strategy. The paper concludes with a critique of recent attempts to define copyright law in terms of first amendment rights and communicative freedom.

Author responsibilities in improving the quality of peer reviews: A rejoinder to Iivari (2016)

In this rejoinder to Iivari (2016), I discuss authors’ responsibilities in the process of ensuring quality reviews. I argue that one overlooked element in quality peer reviewing is authors’ unconstrained right to submit manuscripts in whatever form or quality they desire. As such, I suggest adding some constraints and offering more freedom to reviewers to maintain viability of the scholarly publication system. I offer three responses to Iivari’s suggestions and add two further suggestions for change.

Developing Peer-To-Peer Web Applications

As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform’s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data.

Developing Peer-To-Peer Web Applications

As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data.

Design and analysis of a peer-to-peer based distributed clock synchronisation protocol for wireless sensor networks

Clock synchronisation is an important requirement for various applications in wireless sensor networks (WSNs). Most of the existing clock synchronisation protocols for WSNs use some hierarchical structure that introduces an extra overhead due to the dynamic nature of WSNs. Besides, it is difficult to integrate these clock synchronisation protocols with sleep scheduling scheme, which is a major technique to conserve energy. In this paper, we propose a fully distributed peer-to-peer based clock synchronisation protocol, named Distributed Clock Synchronisation Protocol (DCSP), using a novel technique of pullback for complete sensor networks. The pullback technique ensures that synchronisation phases of any pair of clocks always overlap. We have derived an exact expression for a bound on maximum synchronisation error in the DCSP protocol, and simulation study verifies that it is indeed less than the computed upper bound. Experimental study using a few TelosB motes also verifies that the pullback occurs as predicted.

O "atual" direito autoral, as trocas peer-to-peer de músicas e vídeos pela internet e os projetos de lei que tratam dos crimes cibernéticos

Analisa o uso do aplicativo de compartilhamento de arquivos, os chamados peer-to-peer, em relação à privacidade e ao direito autoral dos usuários de internet.

基于双层ID空间的Peer-to-Peer文件系统设计与实现

提出并实现了一种建立在Peer-to-Peer 搜索策略上的自组织、自适应、高效和可靠的文件系统DISPFS(Double ID Space basedPeer-to-peer File System)。它在双层ID 空间中构造虚拟存储节点,不仅有效地取得了文件系统内的负载均衡、提高系统利用率,而且保证了动态环境中文件的可靠、快速获取。试验数据表明,DISPFS 在系统接近满负荷运行和文件插入/删除操作频繁的双重压力下依然保持优良的性能。

Scalable Peer-to-Peer Indexing with Constant State

We present a distributed indexing scheme for peer to peer networks. Past work on distributed indexing traded off fast search times with non-constant degree topologies or network-unfriendly behavior such as flooding. In contrast, the scheme we present optimizes all three of these performance measures. That is, we provide logarithmic round searches while maintaining connections to a fixed number of peers and avoiding network flooding. In comparison to the well known scheme Chord, we provide competitive constant factors. Finally, we observe that arbitrary linear speedups are possible and discuss both a general brute force approach and specific economical optimizations.

Seed Scheduling for Peer-to-Peer Networks

The initial phase in a content distribution (file sharing) scenario is a delicate phase due to the lack of global knowledge and the dynamics of the overlay. An unwise distribution of the pieces in this phase can cause delays in reaching steady state, thus increasing file download times. We devise a scheduling algorithm at the seed (source peer with full content), based on a proportional fair approach, and we implement it on a real file sharing client [1]. In dynamic overlays, our solution improves up to 25% the average downloading time of a standard protocol ala BitTorrent.