We characterize the class of strategy-proof social choice functions on the domain of symmetric single-peaked preferences. This class is strictly larger than the set of generalized median voter schemes (the class of strategy-proof and tops-only social choice functions on the domain of single-peaked preferences characterized by Moulin (1980)) since, under the domain of symmetric single-peaked pre...

The article summarizes and systematizes knowledge concerning natural user interfaces. The most important facts related to this problem have been supplemented with examples of possible practical use of such type of human-computer communication. Moreover, the article contains descriptions of three most popular controllers: Microsoft Kinect, Nintendo Wii and Sony Move.

Spooky Dodgeball at a Distance (or SDAAD for short) is a local multi player electronic game of virtual dodgeball without graphics. Two Players use a Neurosky MindWave headset, a lowcost EEG biosensor, and a PlayStation Move controller to defend and attack in a virtual game of dodgeball. The project is an exploration of the gameplay possibilities that these two different devices could offer when...

Acknowledgments are vital since students/researchers can demonstrate their genuine appreciation through them and more importantly shape their (local/global) academic identity. In line with this significance, the present study examined the move patterns of 503 Persian dissertation acknowledgements from two major universities in Iran, from 1981 to 2014 and from sixteen various disciplines includi...

We study a hydrodynamic limit approach to move-to-front rules, namely, a scaling limit as the number of items tends to infinity, of the joint distribution of jump rate and position of items. As an application of the limit formula, we present asymptotic formulas on search cost probability distributions, applicable for general jump rate distributions.

In this paper we fix our attention on the second step algorithms of the Burrows–Wheeler compression algorithm, which in the original version is the Move To Front transform. We discuss many of its replacements presented so far, and compare compression results obtained using them. Then we propose a new algorithm that yields a better compression ratio than the previous ones.