In Peer-to-Peer networks based on consistent hashing and ring topology each peer is responsible for an interval chosen (pseudo-) randomly on a circle. The topology of the network, the communication load and the amount of data a peer stores depends heavily on the length

Rats experienced a spatial pattern of baited and unbaited arms in an eight-arm radial maze. The spatial pattern remained constant over trials, but the spatial locations that were baited varied unpredictably. Although there was no evidence of control by the spatial pattern during free choice training trials, the rats' ability to locate baited arms in forced choice test trials was superior to tha...

1 Abstract We describe a consistent hashing algorithm which performs multiple lookups per key in a hash table of nodes. It requires no additional storage beyond the hash table, and achieves a peak-to-average load ratio of 1 + ε with just 1 + 1 ε lookups per key.

We consider maximum likelihood estimation of finite mixture of uniform distributions. We prove that the maximum likelihood estimator is strongly consistent, if the scale parameters of the component uniform distributions are restricted from below by exp(−nd), 0 < d < 1, where n is the sample size.