This paper is an investigation of LF-copies created by scrambling in the context of FNQ-constructions. It demonstrates that movement leaves a copy at LF only when it targets a position within the next search space; it does not leave an LF copy if movement takes place too close within a single domain of search space. By characterizing this in terms of “Distinctness of Copies,” this paper provide...

We consider a generalized version of a directionally reinforced random walk, which was originally introduced by Mauldin, Monticino, and von Weizsäcker in [20]. Our main result is a stable limit theorem for the position of the random walk in higher dimensions. This extends a result of Horváth and Shao [13] that was previously obtained in dimension one only (however, in a more stringent functiona...

This paper describes XRCE’s participation in Large Scale Visual Concept Detection and Annotation Task [16] and Photo Retrieval Task [17] of ImageCLEF 2009. Those tasks both use a new collection which is different and which is much larger than the ones used in past sessions. Moreover, new kinds of challenge to tackle were designed such as new categories to detect or new types of topic to deal wi...

Several common flexible functional forms are evaluated for Texas agricultural production utilizing three procedures. Nested hypothesis tests indicate that the normalized quadratic is the marginally-preferred functional form followed by the generalized Leontief. Predictive accuracy results are ambiguous between the generalized Leontief and the normalized quadratic. Statistical performance favors...

In this paper, we consider a kind of higher-order neutral equation with distributed delay and variable parameter: (x(t) – p(t)x(t – σ ))(n) + f (x(t))x′(t) + g( ∫ 0 –r x(t + s)dα(s)) = q(t). By using the classical coincidence degree theory of Mawhin, sufficient conditions for the existence of periodic solutions are established. Recent results in the literature are generalized and significantly ...

The well-known third list homomorphism theorem states that if a function h is both an instance of foldr and foldl , it is a list homomorphism. Plenty of previous works devoted to constructing list homomorphisms, however, overlook the fact that proving h is both a foldr and a foldl is often the hardest part which, once done, already provides a useful hint about what the resulting list homomorphi...

We present an active approach for discriminating different materials by impulsively contacting (hitting) them, and sensing and interpreting the resulting sounds. In theory, the angle of internal friction is diagnostic of material, but invariant over object shape. In our experiments, we observe that the angle of internal friction is not invariant over the frequency of the sound spectrum for whic...

This paper presents an approach to elimination of Type-3 code clones based on generative techniques. At a first step it is shown how to replace Type-3 clones by higher-order functions. Then this approach is further generalized by utilizing generative designs.

In this paper we study diierent kinds of reductions of data types. By reduction we mean applying the higher order function fold to a data structure. An appropriate fold function can be deened for any recursive data type. These reductions have been presented as homomorphisms by several authors 2, 6]. Although many useful functions on data structures can be programmed as instances of fold, there ...

Two lower bag domain constructions are introduced: the initial construction which gives free lower monoids, and the final construction which is defined explicitly in terms of second order functions. The latter is analyzed closely. For sober dcpo's, the elements of the final lower bag domains can be described concretely as bags. For continuous domains, initial and final lower bag domains coincid...