In this paper, a new, patent pending, architecture for a jitterbased random bit source which is cost-effective and suitable for applications in cryptography, is presented. The source is designed to be robust against parameter variations and attacks aimed to force its output. It also features an auto-test which allows to detect faults and to estimate the source entropy. The proposed design is an...

PORTER M. E. (2003) The economic performance of regions, Reg. Studies 37, 549–578. This paper examines the basic facts about the regional economic performance, the composition of regional economies and the role of clusters in the US economy over period of 1990 to 2000. The performance of regional economies varies markedly in terms of wage, wage growth, employment growth and patenting rate. Base...

The l o c a l c h o i c e o f i n d i v i d u a l a c t i o n s i n t h e c o l l e c t i v e w i t h a n t a g o n i s t i c i n t e r a c t i o n may i n p r i n c i p l e l e a d t o u n s t a b l e , b u r s t l i k e reg imes i n t h i s c o l l e c t i v e . I n t h e m a t h e m a t i c a l model o f such a c o l l e c t i v e c o n s i d e r e d be low ( w h i c h i s c o n v e n i e n ...

In this paper we determine the local and global resilience of random graphs Gn,p (p n−1) with respect to the property of containing a cycle of length at least (1 − α)n. Roughly speaking, given α > 0, we determine the smallest rg(G,α) with the property that almost surely every subgraph of G = Gn,p having more than rg(G,α)|E(G)| edges contains a cycle of length at least (1−α)n (global resilience)...

A construction of Alon yields a sequence of highly pseudorandom triangle-free graphs with edge density significantly higher than one might expect from comparison with random graphs. We give an alternative construction for such graphs.

A model for cleaning a graph with brushes was recently introduced. In this paper, we consider the minimum number of brushes needed to clean a random graph G(n, p = d/n) in this model, the so-called brush number. We show that the brush number of a random graph on n vertices is asymptotically almost surely (a.a.s.) dn 4 (1 + o(1)) if the average degree is tending to infinity with n. For a constan...