rewriting systems on multisets (ARMS) are a simple construct in the context of Computational living systems, constituting a class of P systems that have been devised for modelling systems dynamics, with the belief that [177]: Environment + Computational living systems = Computation in agreement with the vision of living beings as computing entities whose computation purpose is keeping themselve...

One basic activity in combinatorics is to establish combinatorial identities by so-called ‘bijective proofs,’ which consists in constructing explicit bijections between two types of the combinatorial objects under consideration. We show how such bijective proofs can be established in a systematic way from the ‘lattice properties’ of partition ideals, and how the desired bijections are computed ...

We extend the rule-based, multiset rewriting language CHR with multiset comprehension patterns. Multiset compre-hension provides the programmer with the ability to write multiset rewriting rules that can match a variable number ofentities in the state. This enables implementing algorithms that coordinate large amounts of data or require aggregateoperations in a declarative way, and ...

Ziya Arnavut Computer Science and Engineering, University of Nebraska-Lincoln, NE 68588 [email protected] Linear prediction schemes, such as JPEG or BJPEG, are simple and normally result in a significant reduction in source entropy. Occasionally the entropy of the prediction error becomes greater than that of the original image. Such situations frequently occur when the image data has discre...

In [BE01], Bucciarelli and Ehrhard propose a general tool for building a wide class of models of linear logic where a formula is interpreted as a set (the web) together with a kind of phase valued “coherence relation”. These interpretations are nonuniform in the sense that the semantics of a proof makes no assumption about the behaviour of its possible counter-proofs, unlike e.g. in the usual s...

Gene set testing is an important bioinformatics technique that addresses the challenges of power, interpretation and replication. To better support the analysis of large and highly overlapping gene set collections, researchers have recently developed a number of multiset methods that jointly evaluate all gene sets in a collection to identify a parsimonious group of functionally independent sets...

Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to be processed later. The model is a pushdown system supplied with a multiset of pending tasks. Tasks may be added to the multiset at each transition, whereas a task is taken from the multiset only when the stack is empty. In thi...

Abstract A graph is l -reconstructible if it determined by its multiset of induced subgraphs obtained deleting vertices. We prove that 3-regular graphs are 2-reconstructible.

Considering a commutative unital quantale L as the truth value table and using the tool of L-generalized convergence structures of stratified L-filters, this paper introduces a kind of fuzzy upper topology, called fuzzy S-upper topology, on L-preordered sets. It is shown that every fuzzy join-preserving L-subset is open in this topology. When L is a complete Heyting algebra, for every completel...

Let be a multiset of n points in [a; b], and