Quantum Hall skyrmions are quantized solitons of a ferromagnetic O(3) σ−model. The reference, classical, solutions depend upon the interaction between the electrons and exhibit completely different asymptotic profiles for the physical Coulomb interaction than for the hard core interaction frequently used to generate variational wavefunctions. In this note we show, by means of numerical calculat...

In this paper we consider the bit-security of two types of universal hash functions: linear functions on GFF2 n ] and linear functions on the integers modulo a prime. We show individual security for all bits in the rst case and for the O(log n) least signiicant bits in the second case. Both types of functions are shown to have O(log n) simultaneous secure bits. For the second type of functions,...

Let f : {0, 1} → {0, 1} be a one-way function. A function h : {0, 1} → {0, 1} is called a hard-core function for f if, when given f(x) for a (secret) x drawn uniformly from {0, 1}, it is computationally infeasible to distinguish h(x) from a uniformly random m-bit string. A (randomized) function h : {0, 1} × {0, 1} → {0, 1} is a general hard-core function if it is hard-core for every one-way fun...

We present a computer simulation study of a binary mixture of hard spherocylinders with different diameters (D1,D2) and the same lengths (L15L25L). We first study a mixture of spherocylinders with lengths L 515D2 and D150, which can be regarded as a mixture of rodlike colloids and ideal needles. We find clearly an entropy-driven isotropic-isotropic (I-I) demixing transition in this mixture. In ...

Core reuse is an emerging IC design style which enables rapid development of highly complex ICs. Reusable circuit cores come in two basic varieties, hard and soft. Hard cores are optimized for area and performance and are not modifiable by the user, whereas soft cores are user modifiable. If soft cores do not contain testability (i.e. scan/BIST), it can be inserted into the core by the user. Ha...

Bit and About Universal Hash Functions & Hard Core Bits Eike Kiltz Lehrstuhl Mathematik & Informatik, Fakult at f ur Mathematik, Ruhr-Universit at Bochum, 44780 Bochum, Germany. Fax:+49-234-3214465 [email protected] Abstract. We present a useful primitive, the hidden number problem, which can be exploited to prove that every bit is a hard core of speci c cryptographic functions. A...

We revisit the connection between boosting algorithms and hard-core set constructions discovered by Klivans and Servedio. We present a boosting algorithm with a certain smoothness property that is necessary for hard-core set constructions: the distributions it generates do not put too much weight on any single example. We then use this boosting algorithm to show the existence of hard-core sets ...