A many-to-many k-disjoint path cover of a graph joining two disjoint vertex sets S and T of equal size k is a set of k vertex-disjoint paths between S and T that altogether cover every vertex of the graph. The many-to-many k-disjoint path cover is classified as paired if each source in S is further required to be paired with a specific sink in T , or unpaired otherwise. In this paper, we first ...

A new method for interpolating between presets is described. The interpolation algorithm called Intersecting N-Spheres Interpolation is simple to compute and its generalization to higher dimensions is straightforward. The current implementation in the SuperCollider environment is presented as a tool that eases the design of many-to-many mappings for musical interfaces. Examples of its uses, inc...

This paper considers the problemofmany-to-many disjoint paths in the hypercubeQn with f faulty vertices and obtains the following result. For any integer k with 1 ≤ k ≤ n − 1 and any two sets S and T of k fault-free vertices in different partite sets of Qn (n ≥ 2), if f ≤ 2n−2k−2 and each fault-free vertex has at least two fault-free neighbors, then there exist k fully disjoint fault-free paths...

Artifacts have been proposed as basic building blocks for complex processes that are driven by life-cycle aware data objects. An artifact choreography describes the interplay of several artifacts from which the process “emerges”. By design, an artifact choreography is tightly coupled to the process’ underlying data model which gives rise to complex interactions between artifacts. This paper pre...

Political theorists likeAlexis deTocqueville have long recognized the importance of citizen associations for the practice of democracy. Through participation in associations, citizens both receive an education in public affairs and create centers of political power independent of the state. Essential to participation in an association is participation in a forum, a communication space that allo...

DEFINITION Publish/subscribe (pub/sub) is a many-to-many communication model that directs the flow of messages from senders to receivers based on receivers’ data interests. In this model, publishers (i.e., senders) generate messages without knowing their receivers; subscribers (who are potential receivers) express their data interests, and are subsequently notified of the messages from a variet...

Addressing knowledge communication with shared databases, this chapter focuses on an asynchronous, many-to-many type of computer-mediated communication (CMC). After an introduction, which characterizes this kind of CMC and provides definitions, various aspects are discussed that influence people’s behavior in knowledge communication with shared databases. This presentation focuses on psychologi...

We consider the many-to-many two-sided matching problem under a stringent domain restriction on preferences called the max-min criterion. We show that, even under this restriction, there is no stable mechanism that is weakly Pareto efficient, strategy-proof, or monotonic (i.e. respects improvements) for agents on one side of the market. These results imply in particular that three of the main r...