We discuss the problem of static chaos in spin glasses. In the case of magnetic eld perturbations, we propose a scaling theory for the spin-glass phase. Using the meaneld approach we argue that some pure states are suppressed by the magnetic eld and their free energy cost is determined by the nite-temperature xed point exponents. In this framework, numerical results suggest that meaneld chaos e...

Several systems of xed-point types (also called retract types or recursive types with explicit isomorphisms) extending system F are considered. The seemingly strongest systems have monotonicity witnesses and use them in the deenition of beta reduction for those types. A more na ve approach leads to non-normalizing terms. All the other systems are strongly normalizing because they embed in a red...

This chapter introduces Chess, a retargetable code generation environment for xed-point DSP processors. Chess addresses a range of commercial as well as application-speciic processors, which are increasingly being used for embedded applications in telecommunications, speech and audio processing. Chess is based on a mixed be-havioural/structural processor representation model, which can account ...

Continuing the work started in 11], in this paper we examine the construction of Gauss-Markov processes with xed reciprocal dynamics. We show how to construct Gauss-Markov processes, de-ned on a nite interval, having xed initial and end-point densities and belonging to a given reciprocal class. The problem of changing the end-point density of a Markov process, while remaining in the same recipr...

A novel 32 bit RISC architecture is presented which is the basis of a powerful general purpose microprocessor and in parallel a 16/32 bit xed point DSP processor. This unifying of RISC and DSP was not achieved by simply using a microprocessor and DSP core, but a new concept for the implementation of DSP processors has been developed. With the architecture presented it has been proven that a DSP...

This paper presents a Banach space based approach towards a denotational semantics of a probabilistic constraint programming language. This language is based on the concurrent constraint programming paradigm, where randomness is introduced by means of a probabilis-tic choice construct. As a result, we obtain a declarative framework, in which randomised algorithms can be expressed and formalised...

For applications in spatial statistics, an important property of a random set X in R k is its rst contact distribution. This is the distribution of the distance from a xed point 0 to the nearest point of X, where distance is measured using scalar dilations of a xed test set B. We show that, if B is convex and contains a neighbourhood of 0, the rst contact distribution function F B is absolutely...

Let Y be a convex set in IR k deened by polynomial inequalities and equations of degree at most d 2 with integer coeecients of binary length l. We show that if Y \ ZZ k 6 = ;, then Y contains an integral point of binary length ld O(k 4). For xed k, our bound implies a polynomial-time algorithm for computing an integral point y 2 Y. In particular, we extend Lenstra's theorem on the polynomial-ti...

We study a renormalization operator for families of one dimensional maps close to x 7! p + r(1 x ) 2 , 2 ( 1 2 ; 1). Such functions occur in the study of cascades of homoclinic doubling bifurcations in three dimensional di erential equations. For values of close to 1 2 , we prove the existence of a xed point of the renormalization operator, whose linearization at the xed point has two unstable ...

with a xed point of multiplier = e 2 i at the origin. Take to be real and irrational. For generic choice of (in the sense of Baire category), Cremer showed that there is no local linearizing coordinate near the origin. We will say brie y that the origin is a Cremer point, or that P is a Cremer polynomial . According to Sullivan and Douady, the existence of such a Cremer point implies that the J...