Log in

Relevant bibliographies by topics / Peer to peer / Journal articles

To see the other types of publications on this topic, follow the link: Peer to peer.

Journal articles on the topic 'Peer to peer'

Author: Grafiati

Published: 4 June 2021

Last updated: 8 June 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Peer to peer.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Coggans, Niall, and Susan McKellar. "Drug Use Amongst Peers: peer pressure or peer preference?" Drugs: Education, Prevention and Policy 1, no. 1 (January 1994): 15–26. http://dx.doi.org/10.3109/09687639409028532.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jin, Xin, Yu-Kwong Kwok, and Jian Deng. "Variegated competing peer-to-peer systems with selfish peers." Computer Networks 75 (December 2014): 313–30. http://dx.doi.org/10.1016/j.comnet.2014.10.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gee, Henry. "Peers slam peer review." Nature 355, no. 6360 (February 1992): 488. http://dx.doi.org/10.1038/355488a0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Vassilakis, Dimitrios K., and Vasilis Vassalos. "An analysis of peer-to-peer networks with altruistic peers." Peer-to-Peer Networking and Applications 2, no. 2 (January 16, 2009): 109–27. http://dx.doi.org/10.1007/s12083-008-0024-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

WATANABE, KENICHI, and MAKOTO TAKIZAWA. "SERVICE ORIENTED COOPERATION AMONG TRUSTWORTHY PEERS." Journal of Interconnection Networks 07, no. 04 (December 2006): 507–33. http://dx.doi.org/10.1142/s0219265906001831.

Full text

Abstract:

Various types of applications make access to objects distributed in peer-to-peer (P2P) overlay networks. Even if the locations of target objects are discovered by some look-up algorithm such as flooding and distributed hash table (DHT), applications cannot manipulate the target objects without access rights. It is critical to perceive which peer can manipulate an object in which method, i.e. only a peer authorized with an access right is allowed to manipulate an object. Hence, an application has to find peers which can manipulate a target object rather than detect the location of the target object. Due to the scalability, variety, and autonomy of peers, it is difficult, may be impossible to maintain a centralized directory showing in which peer each object is distributed. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate. We discuss types of acquaintance relations of peers with respect to what objects each peer holds, is allowed to manipulate, and can grant access rights on. Acquaintance peers of a peer may notify the peer of different information on target peers due to communication and propagation delay. Here, it is critical to discuss how much a peer trusts each acquaintance peer. We first define the satisfiability of an acquaintance peer, i.e. how much a peer is satisfied by issuing an access request to the acquaintance peer. For example, if a peer p locally manipulates a target object o and obtains a response, p is mostly satisfied. On the other hand, if the peer p has to ask another peer to manipulate the object o, the peer p is less satisfied. We define the trustworthiness and ranking factor of an acquaintance peer obtained by accumulating the satisfiability of each interaction with the acquaintance peer. Differently from traditional reputation concepts, trustworthiness information only from trustworthy acquaintance peers can be used to obtain the ranking factor. The trustworthiness of an acquaintance peer shows how much a peer can trusts the acquaintance peer while the ranking factor of an acquaintance peer shows how much the acquaintance peer is trusted by other trustworthy acquaintance peers. Then, we evaluate the trustworthiness and ranking factor in presence of faulty peers.

APA, Harvard, Vancouver, ISO, and other styles

6

Brack, Amy Badura, Michele Millard, and Kinjal Shah. "Are Peer Educators Really Peers?" Journal of American College Health 56, no. 5 (March 1, 2008): 566–68. http://dx.doi.org/10.3200/jach.56.5.566-568.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mitchell, Ojmarrh. "Peers and police peer misconduct." Nature Human Behaviour 3, no. 8 (May 27, 2019): 774–75. http://dx.doi.org/10.1038/s41562-019-0613-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Abinaya, I., and S. Faizal Mukthar Hussian. "Efficient Equalization Work in Peer-to-Peer System." Asian Journal of Computer Science and Technology 1, no. 1 (May 5, 2012): 65–68. http://dx.doi.org/10.51983/ajcst-2012.1.1.1667.

Full text

Abstract:

Peer-to-peer (P2P) architectures present benefits like scalability, load balancing and fault tolerance when compared to Client/Server architectures. Structured P2P systems furthermore feature efficient lookup mechanisms: an exact search is usually performed with logarithmic complexity relative to the number of peers in the system. The notion of virtual servers, peers participating in a heterogeneous, structured peer-to-peer (P2P) network may host different numbers of virtual servers, and by migrating virtual servers, peers can balance their loads proportional to their capacities close by in the address space. Load balancing is a critical issue for the efficient operation of peer-to-peer networks.This project include a simple protocol that balances load by moving nodes to arbitrary locations “where they are needed.”

APA, Harvard, Vancouver, ISO, and other styles

9

Ed-daoui, Ilyas, Abdelkhalak El Hami, Mhamed Itmi, Nabil Hmina, and Tomader Mazri. "Unstructured Peer-to-Peer Systems: Towards Swift Routing." International Journal of Engineering & Technology 7, no. 2.3 (March 8, 2018): 33. http://dx.doi.org/10.14419/ijet.v7i2.3.9963.

Full text

Abstract:

In this paper, we contribute to the enhancement of routing in unstructured Peer-to-Peer (P2P) systems. Our contribution aims to propose an alternative to the repetitive interactions between peers in discovery which waste considerable time. We propose a methodology that seeks effectiveness and swiftness. Contrary to classic and heuristic-based routing strategies, the main goal of our proposition is that every peer prepares a database at the integration phase. The database includes information about peers, locations, routes to every destination, etc. Every peer possesses its own database and is able to update it whenever a change occurs in the system. Changes refer to the integration of new peers and the dissociation of existing ones. Theoretically, the communication between peers will become significantly quicker since every peer knows enough information about the other peers forming the system. The application of our strategy demonstrates its fitness to the proposed system model in addition to its celerity and relevance.

APA, Harvard, Vancouver, ISO, and other styles

10

GARCÉS-ERICE, L., E. W. BIERSACK, K. W. ROSS, P. A. FELBER, and G. URVOY-KELLER. "HIERARCHICAL PEER-TO-PEER SYSTEMS." Parallel Processing Letters 13, no. 04 (December 2003): 643–57. http://dx.doi.org/10.1142/s0129626403001574.

Full text

Abstract:

Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.

APA, Harvard, Vancouver, ISO, and other styles

11

Mahajan, Sourabh S., and S. K. Pathan. "A Self-Orgnizing Model for Peer-to-Peer Systems using Trust Relations." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 14, no. 1 (December 4, 2014): 5394–97. http://dx.doi.org/10.24297/ijct.v14i1.2128.

Full text

Abstract:

Peer-to-Peer systems enables the interactions of peers to accomplish tasks. Attacks of peers with malicious can be reduced by establishing trust relationship among peers. In this paper we presents algorithms which helps a peer to reason about trustworthiness of other peers based on interactions in the past and recommendations. Local information is used to create trust network of peers and does not need to deal with global information. Trustworthiness of peers in providing services can be describedby Service metric and recommendation metric. Parameters considered for evaluating interactions and recommendations are Recentness, Importance and Peer Satisfaction. Trust relationships helps a good peer to isolate malicious peers.

APA, Harvard, Vancouver, ISO, and other styles

12

Chung, Won-Ho. "A Hierarchical Construction of Peer-to-Peer Systems Based on Super-Peer Networks." Journal of the Institute of Internet Broadcasting and Communication 16, no. 6 (December 31, 2016): 65–73. http://dx.doi.org/10.7236/jiibc.2016.16.6.65.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Mohite, Mr Samir Ashok. "Peer To Peer File Transfer with Torrent." International Journal of Trend in Scientific Research and Development Volume-2, Issue-4 (June 30, 2018): 2821–23. http://dx.doi.org/10.31142/ijtsrd15746.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Huang, Fei Xue, and Zhi Jie Li. "A Self-Adaptive Model of Two-Level for Dynamic Peer-to-Peer Networks." Key Engineering Materials 460-461 (January 2011): 479–84. http://dx.doi.org/10.4028/www.scientific.net/kem.460-461.479.

Full text

Abstract:

The present thesis puts forward a hierarchical P2P model: self-adaptive P2P model of two-level. Super peers compose a self-adaptive DHT network on the top layer, and lower ordinary peers take super peer in the same group as their center server to form a cluster. Data are stored in ordinary peers and super peers hold indices of data and answer for request from ordinary peers. When super peer join or leave, it does not maintain consistency of entire network’s logic topology but only update routing table of its predecessor and successor, besides, super peers update their routing table cache when they transmit messages. The ordinary peers keep backup of super peer for system restore when super peer fails. System can optimize network structure by select peers with high capacity to be super peer and restrict amount of peers in each group.

APA, Harvard, Vancouver, ISO, and other styles

15

Adjiman, P., P. Chatalic, F. Goasdoue, M. C. Rousset, and L. Simon. "Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web." Journal of Artificial Intelligence Research 25 (February 28, 2006): 269–314. http://dx.doi.org/10.1613/jair.1785.

Full text

Abstract:

In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we consider peer-to-peer inference systems in which the local theory of each peer is a set of propositional clauses defined upon a local vocabulary. An important characteristic of peer-to-peer inference systems is that the global theory (the union of all peer theories) is not known (as opposed to partition-based reasoning systems). The main contribution of this paper is to provide the first consequence finding algorithm in a peer-to-peer setting: DeCA. It is anytime and computes consequences gradually from the solicited peer to peers that are more and more distant. We exhibit a sufficient condition on the acquaintance graph of the peer-to-peer inference system for guaranteeing the completeness of this algorithm. Another important contribution is to apply this general distributed reasoning setting to the setting of the Semantic Web through the Somewhere semantic peer-to-peer data management system. The last contribution of this paper is to provide an experimental analysis of the scalability of the peer-to-peer infrastructure that we propose, on large networks of 1000 peers.

APA, Harvard, Vancouver, ISO, and other styles

16

AIKEBAIER, AILIXIER, VALBONA BAROLLI, TOMOYA ENOKIDO, and MAKOTO TAKIZAWA. "A PROTOCOL FOR MAKING AN AGREEMENT IN A PEER-TO-PEER (P2P) SOCIETY." Journal of Interconnection Networks 09, no. 04 (December 2008): 317–35. http://dx.doi.org/10.1142/s0219265908002308.

Full text

Abstract:

There are many discussions on agreement protocols of multiple peer processes (peers) where every peer just aims at agreeing on one value out of values shown by the peers. In meetings of human societies, agreement procedures are so flexible that persons can change their opinions and can use not only all-condition where every person agrees on one value but also various types of agreement conditions like majority-condition. In this paper, we discuss a flexible agreement protocol of multiple peers by taking into account human behaviors in social agreement procedures. Each peer first takes a value v1 and notifies the other peers of the value v1. A peer pi in turn receives values from other peers. Unless a set of the values from all the peers satisfy the agreement condition, the peer pi can take another value v2. In order to model the social human behavior, in our previous work we discussed E - and P -precedent relations [Formula: see text] and [Formula: see text] on values of a peer pi. The relations [Formula: see text] and [Formula: see text] show that a peer pi can take a value v2 after taking a value v1 and prefers v1 to v2, respectively. If a peer autonomously takes values based on its precedent relations, the peers might not make an agreement even if there exists a satisfiable set of previous values. We discuss what previous values the peer can take again. In this paper, we try to find a satisfiable set of previous values in a history of values which the peers have so far taken, in addition for each peer to taking a new value at each round.

APA, Harvard, Vancouver, ISO, and other styles

17

He, Hong. "A reliable peer-to-peer storage framework based on virtual peers model." International Journal of Networking and Virtual Organisations 22, no. 2 (2020): 129. http://dx.doi.org/10.1504/ijnvo.2020.10027110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

He, Hong. "A reliable peer-to-peer storage framework based on virtual peers model." International Journal of Networking and Virtual Organisations 22, no. 2 (2020): 129. http://dx.doi.org/10.1504/ijnvo.2020.105513.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

WATANABE, KENICHI, NAOHIRO HAYASHIBARA, and MAKOTO TAKIZAWA. "CBF: LOOK-UP PROTOCOL FOR DISTRIBUTED MULTIMEDIA OBJECTS IN PEER-TO-PEER OVERLAY NETWORKS." Journal of Interconnection Networks 06, no. 03 (September 2005): 323–44. http://dx.doi.org/10.1142/s0219265905001459.

Full text

Abstract:

Various types of applications take usage of multimedia objects like music and movies. Multimedia objects are distributed in peer-to-peer (P2P) overlay networks since the objects are downloaded and personalized in computers, mainly personal computers interconnected with the Internet. An application would like to take some service of a target object. A target peer is a peer which can manipulate a target object. First, the application has to find target peers which can support enough quality of service (QoS) of target multimedia objects. Due to the scalability and variety of peers in P2P overlay networks, it is difficult, possibly impossible to maintain a centralized directory showing in which peer each object is distributed. In this paper, we newly take an acquaintance approach where each peer maintains its acquaintance peers. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate in P2P overlay networks. We discuss types of acquaintance relations of peers with respect to what objects each peer holds, is allowed to manipulate, and can grant access rights on. In addition, we discuss a new type of flooding algorithm named charge-based flooding (CBF) algorithm to find target peers based on charge and acquaintance concepts so that areas in P2P overlay networks where target peers are expected to exist are more deeply searched. We evaluate the charge-based flooding (CBF) algorithm compared with a traditional TTL-based flooding algorithm in terms of the number of messages transmitted in networks.

APA, Harvard, Vancouver, ISO, and other styles

20

Appelstein, Charles D. "Peer Helping Peer." Residential Treatment For Children & Youth 10, no. 4 (July 8, 1993): 33–53. http://dx.doi.org/10.1300/j007v10n04_04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Nascimento, Mario A. "Peer-to-peer." ACM SIGMOD Record 32, no. 2 (June 2003): 57–58. http://dx.doi.org/10.1145/776985.776996.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Doyle, James F. "Peer-to-Peer." Ubiquity 2001, May (May 2001): 2. http://dx.doi.org/10.1145/375348.377427.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Doyle, James F. "Peer-to-Peer." Ubiquity 2001, May (May 2001): 2. http://dx.doi.org/10.1145/377424.377427.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Smith, C., and K. Jonsson. "Peer-to-peer." Communications Engineer 2, no. 2 (April 1, 2004): 24–27. http://dx.doi.org/10.1049/ce:20040204.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Schoder, Detlef, and Kai Fischbach. "Peer-to-Peer." Wirtschaftsinformatik 44, no. 6 (December 2002): 587–89. http://dx.doi.org/10.1007/bf03250877.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Garn, Stine Dandanell, Charlotte Glümer, Sarah Fredsted Villadsen, Majken Lillholm Pico, and Ulla Christensen. "Mechanisms Activated in the Interaction between Peer Supporters and Peers: How do the Peer Supporters Perceive and Perform Their Role in an Intervention Targeted Socially Vulnerable People with Type 2 Diabetes: A Realist-Informed Evaluation." Health & Social Care in the Community 2023 (July 1, 2023): 1–13. http://dx.doi.org/10.1155/2023/5367426.

Full text

Abstract:

Research on peer support programmes for people with type 2 diabetes has shown a positive effect on health-related behaviours, yet little is known about what causes this effect. This study researched the mechanisms generating immediate outcomes (changes in awareness) and intermediate outcomes (behavioural changes) among socially vulnerable people with type 2 diabetes in a Danish peer support intervention. Using a realist-informed evaluation approach, we investigated how nonprofessional volunteers perceived and performed as peer supporters, and how these activated mechanisms in the interaction between peers and peer supporters. Furthermore, we explored how contextual factors related to peers and peer supporters influenced how mechanisms worked. The study was based on a qualitative multimethod case-study design (n = 11). Data consisted of semistructured interviews with four key informants (peer, peer supporter, project manager, and a diabetes nurse) (n = 27), participation observation of two peer supporter training courses, one network meeting, two supervisions for peer supporters, and logbooks from peer supporters. Data were analysed using systematic text condensation. The findings revealed that the peer supporters used their lived experience to perceive and perform in the peer support meetings. Furthermore, being with a like-minded person with type 2 diabetes activated mechanisms, such as trust, respect, empathy, care, and honesty between peers and peer supporters, which led to increased self-care awareness among the peers (immediate outcome). Finally, the findings revealed that contextual factors, such as peer supporters’ lived experiences and peers’ and peer supporters’ sociodemographic characteristics and health conditions, affected how the mechanisms were at stake. Thus, our study contributes on how to support socially vulnerable people with type 2 diabetes and where peer support programmes can supplement the established healthcare system by providing social and emotional support to this vulnerable group. This trial is registered with ClinicalTrials.gov, Retrospective Registration (20 Jan 2021), registration number NCT04722289.

APA, Harvard, Vancouver, ISO, and other styles

27

LI, KEQIN. "PROBING HIGH-CAPACITY PEERS TO REDUCE DOWNLOAD TIMES IN P2P FILE SHARING SYSTEMS WITH STOCHASTIC SERVICE CAPACITIES." International Journal of Foundations of Computer Science 23, no. 06 (September 2012): 1341–69. http://dx.doi.org/10.1142/s0129054112500189.

Full text

Abstract:

The main problem for an individual user peer in a peer-to-peer network with heterogeneous source peers is the peer selection problem, namely, switching among source peers and finally settling on one, while keeping the total time of probing and downloading to a minimum. There has been little investigation on selecting source peers with stochastic service capacities. The main contribution of this paper is to address the problem of reducing download times in peer-to-peer file sharing systems with stochastic service capacities. A precise analysis of the expected download time is given when the service capacity of a source peer is a random variable. A chunk-based switching and peer selection algorithm using the method of probing high-capacity peers is proposed and the expected download time of the algorithm is analyzed. Two subproblems of the optimal choice of the threshold of high-capacity source peers and the optimal order of probing are also solved. The performance of the algorithm is compared with the random chunk-based switching method. It is shown that noticeable performance improvement can be obtained.

APA, Harvard, Vancouver, ISO, and other styles

28

Ali, M., I. Ullah, W. Noor, A. Sajid, A. Basit, and J. Baber. "Predicting the Session of an P2P IPTV User through Support Vector Regression (SVR)." Engineering, Technology & Applied Science Research 10, no. 4 (August 16, 2020): 6021–26. http://dx.doi.org/10.48084/etasr.3635.

Full text

Abstract:

Scalability and ease of implementation make Peer-to-Peer (P2P) infrastructure an attractive option for live video streaming. Peer end-users or peers in these networks have extremely complex features and exhibit unpredictable behavior, i.e. any peer may join or exit the network without prior notice. Peers' dynamics is considered one of the key problems impacting the Quality of Service (QoS) of the P2P based IPTV services. Since, peer dynamics results in video disruption to consumer peers, for smooth video distribution, stable peer identification and selection is essential. Many research works have been conducted on stable peer identification using classical statistical methods. In this paper, a model based on machine learning is proposed in order to predict the length of a user session on entering the network. This prediction can be utilized in topology management such as offloading the departing peer before its exit. Consequently, this will help peers to select stable provider peers, which are the ones with longer session duration. Furthermore, it will also enable service providers to identify stable peers in a live video streaming network. Results indicate that the SVR based model performance is superior to an existing Bayesian network model.

APA, Harvard, Vancouver, ISO, and other styles

29

STELEA, George-Alex, Radu CURPEN, Ștefania ȘURARIU, and Alexandru PAPOI. "PEER-TO-PEER REAL-TIME CLOUD COMMUNICATION SOLUTIONS." Review of the Air Force Academy 14, no. 2 (December 8, 2016): 99–108. http://dx.doi.org/10.19062/1842-9238.2016.14.2.12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

S., Vimal, and Srivatsa S K. "A Reliable Peer-to-Peer Platform for Adding New Node Using Trust Based Model." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 6 (December 1, 2017): 3515. http://dx.doi.org/10.11591/ijece.v7i6.pp3515-3520.

Full text

Abstract:

In order to evaluate the trustworthiness of participating peers in unstructured peer-to-peer networks, Reputation aggregation methods are used in this method. Each and every peer of the network will collect the local scores of each transaction and will compute global scores by aggregating all the local scores with the help of global scores, each individual peer can interact with its suitable peers. But the existing method will not consider the score of the new peer. In this condition, requests are handled by existing peers who leads to failure in downloading process. To rectify this, NP-TRUST model is used to distribute the request to all peers including the newly joined peers. The proposed method is compared with gossip and DFR-TRUST model in Transaction Success rate and variation in file request.

APA, Harvard, Vancouver, ISO, and other styles

31

Yue, J. Z., K. Böhm, and S. von Stackelberg. "Incentivizing High-Quality Reviews in Peer-to-Peer Settings." International Journal of Virtual Communities and Social Networking 6, no. 1 (January 2014): 1–21. http://dx.doi.org/10.4018/ijvcsn.2014010101.

Full text

Abstract:

Peer reviewing has been touted as a popular instrument to identify good contributions in communities. A problem of peer reviewing is that reviewers have little incentive to make significant effort. To address this problem, the authors introduce a new variant of peer reviewing. It differs from conventional peer reviewing in two ways: First, peers who have made a contribution must also review the contributions made by others. Second, each contributor issues ratings regarding the reviews he has received. To incentivize reviewing, they design an assessment scheme which does not only assess the quality of the contribution made by a peer, but also the quality of the reviews he has submitted. The scheme ranks peers by overall performance, and the ranks determine their payoff. Such a setting gives way to competition among peers. A core challenge however is to elicit objective reviews and ratings. The authors consider two issues which are in the way of this objectiveness: First, they expect preference bias in ratings, i.e., peers tend to prefer reviews with high scores, but dislike reviews with low scores. Second, strategic peers might defame others in their reviews or ratings. This is because they perceive others as competitors. In this paper, they propose a heuristic to address these issues. Further, they carry out a user study in a lecture scenario to evaluate their scheme. It shows that students are incentivized to submit high-quality reviews and that their scheme is effective to evaluate the performance of students.

APA, Harvard, Vancouver, ISO, and other styles

32

Eckles, Dean, René F. Kizilcec, and Eytan Bakshy. "Estimating peer effects in networks with peer encouragement designs." Proceedings of the National Academy of Sciences 113, no. 27 (July 5, 2016): 7316–22. http://dx.doi.org/10.1073/pnas.1511201113.

Full text

Abstract:

Peer effects, in which the behavior of an individual is affected by the behavior of their peers, are central to social science. Because peer effects are often confounded with homophily and common external causes, recent work has used randomized experiments to estimate effects of specific peer behaviors. These experiments have often relied on the experimenter being able to randomly modulate mechanisms by which peer behavior is transmitted to a focal individual. We describe experimental designs that instead randomly assign individuals’ peers to encouragements to behaviors that directly affect those individuals. We illustrate this method with a large peer encouragement design on Facebook for estimating the effects of receiving feedback from peers on posts shared by focal individuals. We find evidence for substantial effects of receiving marginal feedback on multiple behaviors, including giving feedback to others and continued posting. These findings provide experimental evidence for the role of behaviors directed at specific individuals in the adoption and continued use of communication technologies. In comparison, observational estimates differ substantially, both underestimating and overestimating effects, suggesting that researchers and policy makers should be cautious in relying on them.

APA, Harvard, Vancouver, ISO, and other styles

33

Al-Ghazali, Fawzi. "Peer feedback for peer learning and sharing." Learning and Teaching in Higher Education: Gulf Perspectives 12, no. 1 (June 1, 2015): 46–61. http://dx.doi.org/10.18538/lthe.v12.n1.179.

Full text

Abstract:

Peer feedback is applauded in many writing courses for fostering students’ independence and collaboration and for creating a wider learning environment in which students can benefit from the feedback and diversity of input they get from other peers (Stubbe, 2013). It improves students’ writing skills by developing their use of effective composing processes since they can share ideas while planning, drafting, and revising writing forms (Richards and Schmidt, 2010). It also reduces the anxiety of students who can get constructive feedback on their writing from other peers instead of their teachers (Phillipson, 2007). However, application of peer feedback in writing courses is a complex process since it requires provision of rubrics and guidelines for students to follow; this is in addition to explaining the areas they need to focus on. It also requires having cultural awareness of the level of corrections Arab students can accept. This paper reflects on a practical experiment conducted with a group of undergraduate students for showing how peer feedback is approached and practised by students in English language courses. Students’ views and perceptions about peer feedback are also surveyed showing their appreciation of the level of collaboration peer feedback encourages among them. Nevertheless, the results also show a number of concerns students have about peer feedback.

APA, Harvard, Vancouver, ISO, and other styles

34

Chen, Yu-Lun, Laura L. Senande, Michael Thorsen, and Kristie Patten. "Peer preferences and characteristics of same-group and cross-group social interactions among autistic and non-autistic adolescents." Autism 25, no. 7 (June 25, 2021): 1885–900. http://dx.doi.org/10.1177/13623613211005918.

Full text

Abstract:

Social interaction is inherently bidirectional, but research on autistic peer interactions often frames communication as unidirectional and in isolation from the peer context. This study investigated natural peer interactions among six autistic and six non-autistic adolescents in an inclusive school club over 5 months (14 45-min sessions in total) to examine the students’ peer preferences in real-world social interactions and how the preferences changed over time. We further examined whether social behavior characteristics differ between student and peer neurotype combinations. Findings showed that autistic students were more likely to interact with autistic peers then non-autistic peers. In both autistic and non-autistic students, the likelihood of interacting with a same-neurotype peer increased over time. Autistic and non-autistic students’ within-neurotype social interactions were more likely to reflect relational than functional purposes, be characterized as sharing thoughts and experiences rather than requesting help or objects, and be highly reciprocal, as compared with cross-neurotype interactions. These peer preferences and patterns of social interactions were not found among student-peer dyads with the same genders. These findings suggest that peer interaction is determined by more than just a student’s autism diagnosis, but by a combination of student and peer neurotypes. Lay abstract Autistic students often experience challenges in peer interactions, especially for young adolescents who are navigating the increased social expectations in secondary education. Previous research on the peer interactions of autistic adolescents mainly compared the social behaviors of autistic and non-autistic students and overlooked the peers in the social context. However, recent research has shown that the social challenges faced by autistic may not be solely contributed by their social differences, but a mismatch in the social communication styles between autistic and non-autistic people. As such, this study aimed to investigate the student-and-peer match in real-world peer interactions between six autistic and six non-autistic adolescents in an inclusive school club. We examined the odds of autistic and non-autistic students interacting with either an autistic peer, a non-autistic peer, or multiple peers, and the results showed that autistic students were more likely to interact with autistic peers then non-autistic peers. This preference for same-group peer interactions strengthened over the 5-month school club in both autistic and non-autistic students. We further found that same-group peer interactions, in both autistic and non-autistic students, were more likely to convey a social interest rather than a functional purpose or need, be sharing thoughts, experiences, or items rather than requesting help or objects, and be highly reciprocal than cross-group social behaviors. Collectively, our findings support that peer interaction outcomes may be determined by the match between the group memberships of the student and their peers, either autistic or non-autistic, rather than the student’s autism diagnosis.

APA, Harvard, Vancouver, ISO, and other styles

35

FUJITA, SATOSHI. "Three-Tier Delaunay Network as a Topology for Peer-to-Peer Overlay." Journal of Interconnection Networks 19, no. 04 (December 2019): 1950010. http://dx.doi.org/10.1142/s0219265919500105.

Full text

Abstract:

This paper considers the problem of improving the routing performance of hierarchical Delaunay networks. Delaunay network is a network topology for peer-to-peer systems based on the Delaunay triangulation of a set of points associated with a set of peers. It is known that Delaunay networks have a favorable property as a topology for peer-to-peer systems such that a greedy routing scheme always delivers a given message to its destination without encountering a dead-end. The key idea used in the proposed method is to apply a hash function to the address of participant peers. More concretely, by applying a hash function to the coordinate point of the peers and by associating several points to each peer, we could realize an overlay so that the number of hops to the destination in the original network could be significantly reduced.

APA, Harvard, Vancouver, ISO, and other styles

36

RYU, Y. S. "An Effective Peer-to-Peer Web Caching System under Dynamic Participation of Peers." IEICE Transactions on Communications E88-B, no. 4 (April 1, 2005): 1476–83. http://dx.doi.org/10.1093/ietcom/e88-b.4.1476.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Alhussain, Alanoud, Heba Kurdi, and Lina Altoaimy. "Managing Trust and Detecting Malicious Groups in Peer-to-Peer IoT Networks." Sensors 21, no. 13 (June 30, 2021): 4484. http://dx.doi.org/10.3390/s21134484.

Full text

Abstract:

Peer-to-peer (P2P) networking is becoming prevalent in Internet of Thing (IoT) platforms due to its low-cost low-latency advantages over cloud-based solutions. However, P2P networking suffers from several critical security flaws that expose devices to remote attacks, eavesdropping and credential theft due to malicious peers who actively work to compromise networks. Therefore, trust and reputation management systems are emerging to address this problem. However, most systems struggle to identify new smart models of malicious peers, especially those who cooperate together to harm other peers. This paper proposes an intelligent trust management system, namely, Trutect, to tackle this issue. Trutect exploits the power of neural networks to provide recommendations on the trustworthiness of each peer. The system identifies the specific model of an individual peer, whether good or malicious. The system also detects malicious collectives and their suspicious group members. The experimental results show that compared to rival trust management systems, Trutect raises the success rates of good peers at a significantly lower running time. It is also capable of accurately identifying the peer model.

APA, Harvard, Vancouver, ISO, and other styles

38

Kaselitz, Elizabeth, Megha Shah, Hwajung Choi, and Michele Heisler. "Peer characteristics associated with improved glycemic control in a randomized controlled trial of a reciprocal peer support program for diabetes." Chronic Illness 15, no. 2 (January 17, 2018): 149–56. http://dx.doi.org/10.1177/1742395317753884.

Full text

Abstract:

Objective In a secondary analysis of a randomized controlled trial of diabetes reciprocal peer support, we examined characteristics of peers associated with improvements in their partner’s glycemic control. Methods A total of 102 adults with diabetes were randomized to the reciprocal peer support arm (vs. a nurse care management arm). The primary outcome was change in A1c over six months. Intermediate outcomes were insulin initiation and peer engagement. A number of baseline characteristics of peers were hypothesized to influence outcomes for their peer, and concordant characteristics of peer dyads were hypothesized that would influence outcomes for both peer partners. Results Improvement in A1c was associated with having a peer older than oneself ( P < .05) or with higher diabetes-related distress ( P < .01). Participants with peers who reported poorer health at baseline had worse glycemic control at follow-up ( P < .01). Hypothesized concordant characteristics were not associated with A1c improvements. Participants whose peers had a more controlled self-regulation style were more likely to initiate insulin ( P < .05). Discussion The improved outcomes of peers whose partners were older and reported more diabetes distress at baseline supports the need for further research into the peer characteristics that lead to improved outcomes. This could allow for better matching and more effective partnerships.

APA, Harvard, Vancouver, ISO, and other styles

39

Matthews, Amy, Maureen Ziegler, Margie Mayberry, Jamie Owen-DeSchryver, and Erik W. Carter. "Scaling Up a Peer-Mediated Program Statewide: Lessons Learned Through Peer to Peer." Intellectual and Developmental Disabilities 60, no. 4 (July 22, 2022): 334–44. http://dx.doi.org/10.1352/1934-9556-60.4.334.

Full text

Abstract:

Abstract Peer-mediated interventions are a powerful and practical way of promoting the social relationships, learning, and inclusion of students with disabilities. In this article, we describe one state's efforts to scale up a research-based, peer-mediated program called Peer to Peer throughout Michigan. Among the more than 700 schools that now offer this program, as many as 18,000 peers are involved in supporting nearly 5,000 schoolmates with autism and other developmental disabilities in their learning and relationships. We share our perspectives on eight key factors that have contributed to the growth and widespread adoption of Peer to Peer over the last 20 years. We discuss enduring challenges in this long-haul work and conclude with recommendations for future research focused on schoolwide peer-mediated programs.

APA, Harvard, Vancouver, ISO, and other styles

40

Pepler, Debra J., and Wendy M. Craig. "Assessing Children's Peer Relationships." Child Psychology and Psychiatry Review 3, no. 4 (November 1998): 176–82. http://dx.doi.org/10.1017/s1360641798001737.

Full text

Abstract:

Peers have both positive and negative influences on children; therefore, considerable attention has focused on assessing peer relationships and friendships through childhood and adolescence. The present article provides an overview of the main methods of assessing peer relationships. The adaptive nature of children's peer relations has been assessed through four main methodologies: (1) asking the children themselves about elements of peer relations and friendships; (2) asking children about their perceptions of others within the peer group; (3) asking adults (i.e. parents and teachers) about the peer relations skills of children in their care; and (4) directly observing children during interactions with peers. Each of these approaches is described, with attention to relative strengths and weaknesses and their suitability for assessing peer relations in early childhood, middle childhood, and adolescence.

APA, Harvard, Vancouver, ISO, and other styles

41

Zhdanova, Olga Aleksandrovna, Tatiana Grigorievna Bondarenko, and Tatiana Pavlovna Maksimova. "Peer-to-Peer Lending in the Modern Financial System." Journal of Advanced Research in Dynamical and Control Systems 11, no. 11-SPECIAL ISSUE (November 29, 2019): 116–24. http://dx.doi.org/10.5373/jardcs/v11sp11/20192937.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Kim, Yongseok, Jinhee Song, and Sokho Lee. "Effects of Peer Selection and Peer Influence on Adolescent Alcohol Use and Cigarette Smoking." Korean Academy of Addiction Psychiatry 26, no. 2 (September 30, 2022): 52–57. http://dx.doi.org/10.37122/kaap.2022.26.2.52.

Full text

Abstract:

Objectives: This study was the first to investigate the role of peer selection and peer influence in adolescent alcohol use and cigarette smoking over three time periods. Methods: Panel data were collected from students in two middle schools in Gyeonggi province for three consecutive years. Starting from their 1st grade, the survey was conducted yearly through the 3rd grade. Social network data were collected by asking students to nominate their five best friends. Peer selection was operationally defined as the proportion of peers with drinking . smoking experiences of the peers a particular student selected as friends, and peer influence was operationally defined as the proportion of peers with drinking (smoking) experiences of the peers who selected a particular student as a friend. Lifetime alcohol use and cigarette smoking were measured. Results: Peer selection significantly impacted adolescent lifetime alcohol use and cigarette smoking. Selecting users as friends predicted drinking as well as smoking. Conclusion: The findings suggest that future adolescent substance abuse prevention programs need to include a stronger focus on peer group formation.

APA, Harvard, Vancouver, ISO, and other styles

43

LeClair-Smith, Colleen, Brandi Branum, Lindsay Bryant, Betty Cornell, Heather Martinez, Erin Nash, and Lacy Phillips. "Peer-to-Peer Feedback." JONA: The Journal of Nursing Administration 46, no. 6 (June 2016): 321–28. http://dx.doi.org/10.1097/nna.0000000000000352.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Pitschel-Walz, Gabriele, Yvonne Kussinger, and Kerstin Schäffer. "Peer-to-peer-Psychoedukation." NeuroTransmitter 32, no. 12 (December 2021): 34–37. http://dx.doi.org/10.1007/s15016-021-9308-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Ritzer-Angerer, Petra. "Peer-to-Peer-Ökonomie." WiSt - Wirtschaftswissenschaftliches Studium 49, no. 7-8 (2020): 44–46. http://dx.doi.org/10.15358/0340-1650-2020-7-8-44.

Full text

Abstract:

Die Peer-to-Peer-Ökonomie ist die Vision einer Wirtschafts- und Gesellschaftsordnung, die den Kapitalismus zukünftig ablösen könnte. Peer-to-Peer-Netzwerke waren ursprünglich eine Innovation der Informatik. Innerhalb der letzten 20 Jahre hat sich aus ersten Programmierungen die Sharing Economy entwickelt. Diese stellt eine Zwischenstufe in der Entwicklung hin zu einer echten Peer-to-Peer-Ökonomie dar.

APA, Harvard, Vancouver, ISO, and other styles

46

Hampshire, Robert C., and Craig Gaites. "Peer-to-Peer Carsharing." Transportation Research Record: Journal of the Transportation Research Board 2217, no. 1 (January 2011): 119–26. http://dx.doi.org/10.3141/2217-15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Sonnenfeldt, Michael W., and Richard L. Lavin. "Peer-to-Peer Groups." Journal of Wealth Management 5, no. 1 (April 30, 2002): 71–78. http://dx.doi.org/10.3905/jwm.2002.320438.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Ballús-Armet, Ingrid, Susan A. Shaheen, Kelly Clonts, and David Weinzimmer. "Peer-to-Peer Carsharing." Transportation Research Record: Journal of the Transportation Research Board 2416, no. 1 (January 2014): 27–36. http://dx.doi.org/10.3141/2416-04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Rein, L. "Peer-to-peer XML." IEEE Internet Computing 6, no. 2 (March 2002): 100. http://dx.doi.org/10.1109/mic.2002.991451.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Kuhnke, Janet L., and Sue Rosenthal. "Peer-to-Peer Education." Journal of Wound, Ostomy and Continence Nursing 42, no. 4 (2015): 321–23. http://dx.doi.org/10.1097/won.0000000000000155.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!