Automata with restart operation (henceforth RA) constitute an interesting class of acceptors and reduction systems at the same time, and simultaneously display a remarkable ’explicative power’ wrt. the analysis of formal and natural languages. This paper focuses on RA as a formal-theoretical tool for modelling the analysis by reduction of natural languages and on the role of analysis by reducti...

Previous experiments using trains of high-frequency filtered clicks have shown that for lateralization based on interaural difference of time or level, there is a decline in the usefulness of interaural information after the signal's onset when the clicks are presented at a high rate. This process has been referred to as "binaural adaptation." Of interest here are the conditions that produce a ...

We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultimately deflate a specific invariant subspace of the matrix which most impedes the convergence of the restarted approximation process. An approximation to the subspace to be deflated is successively refined in the course ...

Following some previous studies on list automata and restarting automata, we introduce a generalized and refined model – the h-lexicalized restarting list automaton (LxRLAW). We argue that this model is useful for expressing transparent variants of lexicalized syntactic analysis, and analysis by reduction in computational linguistics. We present several subclasses of LxRLAW and provide some var...

To satisfy the ever increasing demand for computational resources, high performance computing systems are becoming larger and larger. Unfortunately, the tools supporting system management tasks are only slowly adapting to the increase in components in computational clusters. Virtualization provides concepts which make system management tasks easier to implement by providing more flexibility for...

Abstract. In this paper, we investigate a method for restarting the Lanczos method for approximating the matrix-vector product f(A)b, where A ∈ Rn×n is a symmetric matrix. For analytic f we derive a novel restart function that identifies the error in the Lanczos approximation. The restart procedure is then generated by a restart formula using a sequence of these restart functions. We present an...