Discovering the malicious or vulnerable anchor node is an essential problem in wireless sensor networks (WSNs). In wireless sensor networks, anchor nodes are the nodes that know its current location. Neighbouring nodes or non-anchor nodes calculate its location coordinate (or location reference) with the help of anchor nodes. Ingenuous localization is not possible in the presence of a cheating ...

M uch has been written about the prevalence of academic dishonesty in the past two decades. despite the dialogue, incidents have not only increased in number, but also in complexity as students discover even more creative and technologically savvy ways to circumvent the system. Gone are the days of simple plagiarism , glancing at another's paper during an examination , or using cheat sheats. Vi...

argues that sentences such as those in (1a-b) exemplify a fundamental bifurcation among interrogative clauses (thèquantiicational variability eeect' (QVE)). His claim is that whereas in (1a) an adverb of quantiication can only be interpreted as quantifying over cases/events/situations (henceforth the cases reading), (1b) displays an additional reading, (the qv reading), paraphrasable as (1c): (...

Theory predicts that mutualisms should be vulnerable to invasion by cheaters, yet mutualistic interactions are both ancient and diverse. What prevents one partner from reaping the benefits of the interaction without paying the costs? Using field experiments and observations, we examined factors affecting mutualism stability in six fig tree-fig wasp species pairs. We experimentally compared the ...

Three experiments examined the hypothesis that people show consistency in motivated social cognitive processing across self-serving domains. Consistent with this hypothesis, Experiment 1 revealed that people who rated a task at which they succeeded as more important than a task at which they failed also cheated on a series of math problems, but only when they could rationalize their cheating as...

A large experimental literature has investigated the determinants of trust using variants of the so called trust game. However, a lot of ambiguity remains regarding the definition of what one is trusting: one extreme view is that since there are no explicit promises or guarantees made in the trust game, cheating is not defined and therefore trust is not implied. We address this concern by askin...

Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the dishonest players’ cheating. Finding the optimal security parameters in such protocols is an important open question. In this paper we show that every 1-out-of-2 oblivious transfer protocol allows a dishonest party to cheat...

How do people behave when they face a finite series of opportunities to cheat with little or no risk of detection? In 4 experiments and a small meta-analysis, we analyzed over 25,000 cheating opportunities faced by over 2,500 people. The results suggested that the odds of cheating are almost 3 times higher at the end of a series than earlier. Participants could cheat in 1 of 2 ways: They could ...

How do people behave when they face a finite series of opportunities to cheat with little or no risk of detection? In 4 experiments and a small meta-analysis, we analyzed over 25,000 cheating opportunities faced by over 2,500 people. The results suggested that the odds of cheating are almost three times higher at the end of a series than earlier. Participants could cheat in one of two ways: The...