Related papers: Weakening and Iterating Laws using String Diagrams

Coded distributed computing introduced by Li et al. in 2015 is an efficient approach to trade computing power to reduce the communication load in general distributed computing frameworks such as MapReduce. In particular, Li et al. show that…

Compounding is a highly productive word-formation process in some languages that is often problematic for natural language processing applications. In this paper, we investigate whether distributional semantics in the form of word…

We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string…

The law of the iterated logarithm for partial sums of weakly dependent processes was intensively studied by Walter Philipp in the late 1960s and 1970s. In this paper, we aim to extend these results to nondegenerate U-statistics of data that…

Modern distributed systems often rely on so called weakly-consistent databases, which achieve scalability by sacrificing the consistency guarantee of distributed transaction processing. Such databases have been formalised in two different…

We examine and implement the concept of non-additive composition laws in the quantum theory of closed bosonic strings moving in (3+1)-dimensional Minkowski space. Such laws supply exact selection rules for the merging and splitting of…

We develop a graphical calculus of manifold diagrams which generalises string and surface diagrams to arbitrary dimensions. Manifold diagrams are pasting diagrams for $(\infty, n)$-categories that admit a semi-strict composition operation…

This paper studies the complexity of distributed construction of purely additive spanners in the CONGEST model. We describe algorithms for building such spanners in several cases. Because of the need to simultaneously make decisions at far…

Dempster-Shafer theory of evidence is widely applied to uncertainty modelling and knowledge reasoning because of its advantages in dealing with uncertain information. But some conditions or requirements, such as exclusiveness hypothesis and…

The biological process of gene assembly has been modeled based on three types of string rewriting rules, called string pointer rules, defined on so-called legal strings. It has been shown that reduction graphs, graphs that are based on the…

We provide a characterization of no-iteration distributive laws in terms of its monads in extensive form only. To do that, it is necessary to take account of both right and left extension systems. We also give, in this right-left…

We study scattering of three equal mass particles in one dimension. Integrable interactions are synonymous with non-diffractive scattering, meaning that the set of incoming momenta for any scattering event coincides with the set of outgoing…

We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…

Distributive laws are important for algebraic reasoning in arithmetic and logic. They are equally important for algebraic reasoning about concurrent programs. In existing theories such as Concurrent Kleene Algebra, only partial correctness…

Containers are used to carve out a class of strictly positive data types in terms of shapes and positions. They can be interpreted via a fully-faithful functor into endofunctors on Set. Monadic containers are those containers whose…

We extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category,…

Two decades ago, a breakthrough in indexing string collections made it possible to represent them within their compressed space while at the same time offering indexed search functionalities. As this new technology permeated through…

The small-scale structure of a string connecting a pair of static sources is explored for the weakly-coupled anisotropic SU(2) Yang-Mills theory in (2+1) dimensions. A crucial ingredient in the formulation of the string Hamiltonian is the…

Proving compositionality of behavioral equivalence on state-based systems with respect to algebraic operations is a classical and widely studied problem. We study a categorical formulation of this problem, where operations on state-based…

We present a new approach to classification that combines data and knowledge. In this approach, data mining is used to derive association rules (possibly with negations) from data. Those rules are leveraged to increase the predictive…