Research on the mental representation of numbers has focused on a horizontally aligned mental number line, but more and more findings have begun to implicate a vertical orientation as well. We investigate the relationship between these two orientations when people generate random numbers. In the horizontal condition, people generated larger numbers when they looked right as opposed to left. In ...

This study aimed at investigating the effect of visual (Cuisenaire Rods) and auditory nonsensical monosyllables using Pratt speech processing software as teaching techniques on retention of word stress. To this end, 60 high school participants made the two experimental groups of the study each having 30 students on the basis of their proficiency scores on KET (Key English Test). In one experime...

Differential power analysis (DPA) attacks can be of major concern when applied to cryptosystems that are embedded into small devices such as smart cards. To immunize elliptic curve cryptosystems (ECCs) against DPA attacks, recently several countermeasures have been proposed. A class of countermeasures is based on randomizing the paths taken by the scalar multiplication algorithm throughout its ...

The goal of this paper is to establish a connection between two classical models of random graphs: the random graph G(n, p) and the random regular graph Gd(n). This connection appears to be very useful in deriving properties of one model from the other. In particular, one immediately obtains one-line proofs of several highly non-trivial and recent results on Gd(n).

The core of security proofs quantum key distribution (QKD) is the estimation a parameter that determines amount privacy amplification users need to apply in order distill secret key. To estimate this using observed data, one needs concentration inequalities such as random sampling theory or Azuma's inequality. latter can be straightforwardly employed wider class QKD protocols, including those d...

We consider the random walk attachment graph introduced by Saramäki and Kaski and proposed as a mechanism to explain how behaviour similar to preferential attachment may appear requiring only local knowledge. We show that if the length of the random walk is fixed then the resulting graphs can have properties significantly different from those of preferential attachment graphs, and in particular...