نتایج جستجو برای: gossip

تعداد نتایج: 1614  

2005
Jordan A. Litman Mark V. Pezzo

Four studies were conducted to develop and validate a measure of individual differences in attitudes towards gossip (ATG). In Study 1, exploratory factor analyses of responses to a pool of ATG items identified two factors reflecting attitudes about gossip s Social Value (SV) and Moral Value (MV), which provided the basis for constructing a 12-item ATG scale. In Study 2, the SV and MV factors we...

Journal: :International Journal of Education and Literacy Studies 2022

The reported past tense is one of the basic grammar topics taught to learners in teaching Turkish as a foreign language. It explained textbooks used for language that this mode has functions “hearing from another” and “become aware events later time”. In our daily lives, not welcomed well certain extent society; however, it also “gossip” relation function hearing someone else. Although gossip n...

Journal: : 2022

The aim of the study is to establish communicative and pragmatic features gossips. object phatic communication characters in English fictional discourse. scope article establishing gossip personages’ material for research includes entries from dictionaries dialogic fragments involving spreading special linguistic methods used include definition analysis applied respective nominative units; comp...

2008
Shen Lin François Taïani Gordon S. Blair

Gossip protocols have been successfully applied in the last few years to address a wide range of functionalities. So far, however, very few software frameworks have been proposed to ease the development and deployment of these gossip protocols. To address this issue, this paper presents GossipKit, an event-driven framework that provides a generic and extensible architecture for the development ...

Journal: :Discrete Applied Mathematics 1994
Bogdan S. Chlebus Krzysztof Diks Andrzej Pelc

Each of n nodes of a communication network has a piece of information (gossip) which should be made known to all other nodes. Gossiping is done by sending letters. In a unit of time each node can either send one letter to a neighbor or receive one such letter, containing one gossip currently known to the sender. Letters reach their destinations with constant probability 0 < q < 1, independently...

2011
Silvana Silva Pereira Alba Pagès-Zamora

We study the convergence of consensus algorithms in wireless sensor networks with random topologies where the instantaneous links exist with a given probability and are allowed to be spatially correlated. Aiming at minimizing the convergence time of the algorithm, we adopt an optimization criterion based on the spectral radius of a positive semidefinite matrix for which we derive closed-form ex...

2011
Ruggero Lanotte Massimo Merro

Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout large-scale networks. In this paper, we propose a compositional analysis technique to study formal probabilistic models of gossip protocols in the context of wireless sensor networks. We introduce a simple probabilistic timed process calculus for modelling wireless sensor networks. A si...

Journal: :Voice of the publisher 2022

Gossip has been one of the employees’ most frequent informal activities, especially in last few decades. However, both seasoned and early-career administrators sometimes miss out on benefits that come along with its practice, resulting an over-emphasis dangers. This study examined reasons for concept gossip phenomenon, functions effects, how to get best it enterprise space among public sector e...

2017
Krzysztof R. Apt Dominik Wojtczak D. Wojtczak

Gossip protocols deal with a group of communicating agents, each holding some private information, and aim at arriving at a situation in which all the agents know each other secrets. Distributed epistemic gossip protocols are particularly simple distributed programs that use as guards formulas from an epistemic logic. We showed recently that the implementability of these distributed gossip prot...

2006
Sachin Agarwal

We provide a generic achievability argument for incentives in gossip based p2p streaming by proving that after coupling a randomized optimistic unchoke mechanism to an incentive based gossip streaming algorithm we can (still) distribute a stream from one source to n peers in O(log n) time with high probability. We provide simulation results for a distributed incentive scheme for gossip based p2...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید