Comparative analysis of the behavior of modern primates, in conjunction with an accurate phylogenetic tree of relatedness, has the power to chart the early history of human cognitive evolution. Adaptive cognitive changes along this path occurred, it is believed, in response to various forms of complexity; to some extent, theories that relate particular challenges to cognitive adaptations can al...

We look at iterated power generators si = s e i−1 mod N for a random seed s0 ∈ ZN that in each iteration output a certain amount of bits. We show that heuristically an output of (1− 1 e ) logN most significant bits per iteration allows for efficient recovery of the whole sequence. This means in particular that the Blum-Blum-Shub generator should be used with an output of less than half of the b...

Let p be a prime and let a and c be integers modulo p. The quadratic congruential generator (QCG) is a sequence (vn) of pseudorandom numbers defined by the relation vn+1 ≡ av 2 n +c mod p. We show that if sufficiently many of the most significant bits of several consecutive values vn of the QCG are given, one can recover in polynomial time the initial value v0 (even in the case where the coeffi...

We generalize and extend results obtained by Boneh and Venkatesan in 1996 and by González Vasco and Shparlinski in 2000 on the hardness of computing bits of the Diffie-Hellman key, given the public values. Specifically, while these results could only exclude (essentially) error-free predictions, we here exclude any non-negligible advantage, though for larger fractions of the bits. We can also d...

While modern energy efficient low voltage designs focus on near-threshold voltage (NTV) operation for general purpose computing and exploiting an application's intrinsic error resilience by deploying probabilistic-CMOS (PCMOS) circuits for application specific computing, our results emphasize the impact of delay on PCMOS bits at NTV and lower voltage operations. This delay is very important to ...

Mitchell et al. argue that divergence-time estimates for our avian phylogeny were too young because of an “inappropriate” maximum age constraint for the most recent common ancestor of modern birds and that, as a result, most modern bird orders diverged before the Cretaceous-Paleogene mass extinction event 66million years ago instead of after. However, their interpretations of the fossil record ...

We consider the evolution of a population of fixed size with no selection. The number of generations G to reach the first common ancestor evolves in time. This evolution can be described by a simple Markov process which allows one to calculate several characteristics of the time dependence of G. We also study how G is correlated to the genetic diversity.

Compromised computers have been a menace to both personal and business computing. In this paper, we tackle the problem of automated detection of break-ins of new unknown threats such as worms, spyware and adware on personal computers. We propose Break-IN DEtectoR (BINDER), a host-based break-in detection system. Our key observation is that many break-ins make extrusions, stealthy malicious outg...

ABSTRACT. This paper presents the architecture of the MFIBVP real-time multiplier which is ideal to be used in real-time system application. The MFIBVP technique is a combination of the MSB–First computation, the Interval-Bounded Arithmetic and the Variable-Precision computation techniques. The MFIBVP computation guarantees the computation carried out will produce high accuracy from the early c...

In a conventional network, most network devices, such as routers, are dedicated devices that do not have much variation in capacity. In recent years, a new concept of network functions virtualisation (NFV) has come into use. The intention is to implement a variety of network functions with software on general-purpose servers and this allows the network operator to select their capacities and lo...