Related papers: Priority Union and Generalization in Discourse Gra…
We provide new methods to straightforwardly obtain compact and analytic expressions for epsilon-expansions of functions appearing in both field and string theory amplitudes. An algebraic method is presented to explicitly solve for…
We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized…
This article describes a purely analytic approach to urn models of the generalized or extended P\'olya-Eggenberger type, in the case of two types of balls and constant ``balance,'' that is, constant row sum. The treatment starts from a…
To improve word representation learning, we propose a probabilistic prior which can be seamlessly integrated with word embedding models. Different from previous methods, word embedding is taken as a probabilistic generative model, and it…
Embedded software is growing fast in size and complexity, leading to intimate mixture of complex architectures and complex control. Consequently, software specification requires modeling both structures and behaviour of systems.…
We present a systematic approach to regularity theory of the multi-dimensional Euler alignment systems with topological diffusion introduced in \cite{STtopo}. While these systems exhibit flocking behavior emerging from purely local…
The literal and the initial literal shuffle have been introduced to model the behavior of two synchronized processes. However, it is not possible to describe the synchronization of multiple processes. Furthermore, both restricted forms of…
In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on…
We offer an axiomatic definition of a differential algebra of generalized functions over an algebraically closed non-Archimedean field. This algebra is of Colombeau type in the sense that it contains a copy of the space of Schwartz…
In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE. Our motivation being the design of an abstract (WAM-like) machine for the formalism, we consider parsing as a…
In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originating from imperative programming. In this paper, an extension…
We prove a Kleene theorem for higher-dimensional automata. It states that the languages they recognise are precisely the rational subsumption-closed sets of finite interval pomsets. The rational operations on these languages include a…
Generalization techniques have many applications, including template construction, argument generalization, and indexing. Modern interactive provers can exploit advancement in generalization methods over expressive type theories to further…
In conventional speech recognition, phoneme-based models outperform grapheme-based models for non-phonetic languages such as English. The performance gap between the two typically reduces as the amount of training data is increased. In this…
Practitioners commonly align large language models using pairwise preferences, i.e., given labels of the type response A is preferred to response B for a given input. Perhaps less commonly, methods have also been developed for binary…
Powerful formalisms for abstract argumentation have been proposed, among them abstract dialectical frameworks (ADFs) that allow for a succinct and flexible specification of the relationship between arguments, and the GRAPPA framework which…
We describe an exact sampler for a simply-typed, first-order functional programming language. Given an acyclic finite automaton, $\alpha_{\varnothing}$, it samples a random function uniformly without replacement from well-typed functions in…
A seminal result of Agler characterizes the so-called Schur-Agler class of functions on the polydisk in terms of a unitary colligation transfer function representation. We generalize this to the unit ball of the algebra of multipliers for a…
This note presents an extension to the adaptive control strategy presented in [1] able to counter eventual instability due to disturbances at the input of an otherwise $\mathcal{L}_2$ stable closed-loop system. These disturbances are due to…
A new class of univariate stationary interpolatory subdivision schemes of dual type is presented. As opposed to classical primal interpolatory schemes, these new schemes have masks with an even number of elements and are not step-wise…