In distributional semantics studies, there is a growing attention in compositionally determining the distributional meaning of word sequences. Yet, compositional distributional models depend on a large set of parameters that have not been explored. In this paper we propose a novel approach to estimate parameters for a class of compositional distributional models: the additive models. Our approa...

With the development of ASIC designs, simulation cannot cover all the corner cases in a complicated design. Model checking is a fully automatic approach to verify a finite state machine against its temporal specifications. However, its application is limited by the size of the system to be verified. Compositional verification and model reduction are two possible methods to tackle this problem. ...

Abstract We present a compositional model checking algorithm for Markov decision processes, in which they are composed the categorical graphical language of string diagrams . The computes optimal expected rewards. Our theoretical development is supported by category theory, while what we call decomposition equalities rewards act as key enabler. Experimental evaluation demonstrates its performan...

Numerous innovative controllers and collaborative tactile interfaces have been developed for social interaction with sound. This evolutionary field of interaction design has led to a wide range of compositional models that increasingly mirror the open source methodologies developed by the creators of such systems. The authors consider the software integration of such systems as a potential mode...

The requirement synthesis tool RESY automatically computes environment assumptions for compositional model checking. Given a process M in a multi-process PROMELA program, an abstraction refinement loop computes a coarse equivalence relation on the states of the environment, collapsing two states if the environment of M can either force the occurrence of an error from both states or from neither...

Product form Markov chains are a class of compositional Markovian models that can be proved to benefit from a decomposed solution of the steady-state distribution (i.e. the steady-state distribution is given by the product of the components’ steady-state distributions). In this paper we focus on the Boucherie product processes, a specific class of product form Continuous Time Markov Chains. We ...

The automatic compilation of bilingual dictionaries from comparable corpora has been successful for single-word terms (SWTs), but remains disappointed for multi-word terms (MWTs). The increase of coverage of bilingual dictionary thanks to compositional translation improved the results, but still shows some limits for MWTs of different syntactic structures. In this paper, we propose to bridge th...

We propose a mathematical framework for a unification of the distributional theory of meaning in terms of vector space models, and a compositional theory for grammatical types, namely Lambek’s pregroup semantics. A key observation is that the monoidal category of (finite dimensional) vector spaces, linear maps and the tensor product, as well as any pregroup, are examples of compact closed categ...

A neural architecture for compositional sentence structures is presented. The architecture solves the ‘four challenges for cognitive neuroscience’ described by Jackendoff (2002). Sentence structures are encoded in this neural architecture by temporarily binding word representations with structure representations in a manner that preserves sentence structure. The architecture can store different...

Compositional model checking is used to verify a processor microarchitecture containing most of the features of a modern microprocessor, including branch prediction, speculative execution, out-of-order execution and a load-store buffer supporting re-ordering and load forwarding. We observe that the proof methodology scales well, in that the incremental proof cost of each feature is low. The pro...