Related papers: Parallel Replacement in Finite State Calculus

Numerically solving ordinary differential equations (ODEs) is a naturally serial process and as a result the vast majority of ODE solver software are serial. In this manuscript we developed a set of parallelized ODE solvers using…

The purpose of this paper is to extend the definition of quasiarithmetic means by taking a strictly monotone generating function instead of a strictly monotone and continuous one. We establish the properties of such means and compare them…

Explicit general constructions of paragrassmann calculus with one and many variables are given. Relations of the paragrassmann calculus to quantum groups are outlined and possible physics applications are briefly discussed. This paper is…

It is well known that modern functional programming languages are naturally amenable to parallel programming. Achieving efficient parallelism using functional languages, however, remains difficult. Perhaps the most important reason for this…

We introduce a first proofs-as-parallel-programs correspondence for classical logic. We define a parallel and more powerful extension of the simply typed lambda calculus corresponding to an analytic natural deduction based on the excluded…

In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…

In the recent paper [Duff I. et al, SIAM J. Sci. Comp., 37(3) (2015), A1248-A1269] the authors proposed an interesting procedure for the parallel solution of large, sparse consistent linear systems of equations. In this respect, according…

In this paper, we characterize complementable operators and provide more precise expressions for the Schur complement of these operators using a single Douglas solution. We demonstrate the existence of subspaces where the given operator is…

This paper proposes an algorithm for computing regularized solutions to linear rational expectations models. The algorithm allows for regularization cross-sectionally as well as across frequencies. A variety of numerical examples illustrate…

Bachmair's and Ganzinger's abstract redundancy concept for the Superposition Calculus justifies almost all operations that are used in superposition provers to delete or simplify clauses, and thus to keep the clause set manageable. Typical…

We supply basic tools for the study of the topological order of a multiplet which is an eigenspace of a finite-dimensional normal operator with continuous parameters. We allow intrinsic degeneracies within the multiplet where a well-known…

We introduce Classification with Alternating Normalization (CAN), a non-parametric post-processing step for classification. CAN improves classification accuracy for challenging examples by re-adjusting their predicted class probability…

Parametric linear programming is central in polyhedral computations and in certain control applications.We propose a task-based scheme for parallelizing it, with quasi-linear speedup over large problems.

We generalize the notion of (geometric) substitution rule to obtain overlapping substitutions. Our motivating example is the substitution presented in Ziherl, Dotera and Bekku \cite{DBZ}, which features a substitution matrix with…

In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…

Coupled map lattices are paradigmatic models of many collective phenomena. However, quite different patterns can emerge depending on the updating scheme. While in early versions, maps were updated synchronously, there has been in recent…

We show that the Replacement Rule in the sequent calculus G3[mic]}^=, for first order languages with function symbols and equality, can be replaced by the simpler rule in which the transformed formula is not repeated in the premiss.

There are several notions of the 'dual' of a word/tile substitution. We show that the most common ones are equivalent for substitutions in dimension one, where we restrict ourselves to the case of two letters/tiles. Furthermore, we obtain…

We initiate the study of parallel quantum programming by defining the operational and denotational semantics of parallel quantum programs. The technical contributions of this paper include: (1) find a series of useful proof rules for…

Large bilingual parallel texts (also known as bitexts) are usually stored in a compressed form, and previous work has shown that they can be more efficiently compressed if the fact that the two texts are mutual translations is exploited.…