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...

This paper describes a means for linking Ž eld and object representations of geographical space. The approach is based on a series of mappings, where locations in a continuous Ž eld are mapped to discrete objects. An object in this context is a modeler’s conceptualization, as in a viewshed, highway corridor or biological reserve. An object can be represented as a point, line, polygon, network, ...

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...

Entity resolution is the task of identifying all mentions that represent the same real-world entity within a knowledge base or across multiple knowledge bases. We address the problem of performing entity resolution on RDF graphs containing multiple types of nodes, using the links between instances of different types to improve the accuracy. For example, in a graph of products and manufacturers ...

Theories of inter-organisational co-ordination propose that information processing capabilities (structure, process and technology) must be aligned with information processing needs (environmental, partnership and task uncertainty) and the fit between both is a strong determinant of performance. Electronic marketplaces dominate new developments in electronic commerce. While traditional models p...