Stimulus displacements coinciding with a saccadic eye movement are poorly detected by human observers. In recent years, converging evidence has shown that this phenomenon does not result from poor transsaccadic retention of presaccadic stimulus position information, but from the visual system's efforts to spatially align presaccadic and postsaccadic perception on the basis of visual landmarks. ...

Changing the internal structure of a program without changing its behavior is called restructuring. This paper presents a transformation called tuck for restructuring programs by decomposing large functions into small functions. Tuck consists of three steps: Wedge, Split, and Fold. A wedge—a subset of statements in a slice—contains computations that are related and that may create a meaningful ...

The impact-parameter representation of the spin-flip amplitude of hadron elastic scattering is examined in different unitarisation schemes, taking the Born term of the spin-flip amplitude from the Dubna Dynamical Model (DDM). It is shown that the basic properties of the unitarisation schemes are independent of the functional form used for unitarisation but heavily depend on the asymptotic value...

We apply algebraic transformation techniques to synthesise Horner’s rule for polynomial evaluation. Horner’s rule is then transformed into a pipeline by the application of further axioms. The syntheses demonstrate the power of the algebraic style, in which inductive proof is replaced by constructive unfolding and folding of standard higher-order functions defined on lists.

In the context of finite elements, construction of higher order shape functions for elements forming the exact sequence has been a long standing activity in both engineering and numerical analysis communities. A comprehensive review of the subject can be found for example in Demkowicz (2006), Demkowicz et al. (2007) and references therein. This document presents a self-contained systematic theo...

This paper generalizes the notion of identi cation by functional form to semiparametric contexts. It considers identi cation and estimation of the function F and vector B where M(X) = F[X'B, G(X)], assuming the functions M and G are identied. Identi cation in these models is typically obtained by parametric restrictions or by instrument exclusion restrictions, e.g., assuming that an element of ...

Algorithmic skeletons are polymorphic higher-order functions that represent common parallelization patterns. They can be used as the building blocks of parallel applications by integrating them into a sequential language. In this paper, we consider the design and implementation of skeletons for the management of distributed dynamic data. Such skeletons are used by grid-managers of numerical sol...

Algorithmic skeletons are polymorphic higher-order functions that represent common parallelization patterns. They can be used as the building blocks of parallel applications by integrating them into a sequential language. In this paper we present a skeleton-based approach to manage overlapping of distributed grids, which occur in parallel adaptive multigrid algorithms. Overlapping is necessary ...

This paper describes a tableau-based higher-order theorem prover Hot and an application to natural language semantics. In this application, Hot is used to prove equivalences using world knowledge during higher-order unii-cation (HOU). This extended form of HOU is used to compute the licensing conditions for corrections.