Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most central issues in various interconnection networks. A graph G is globally two-equal-disjoint path coverable if for any two distinct pairs of vertices (u, v) and (w, x) of G, there exist two disjoint paths P and Q satisfied that (1) P joins u to v and Q joins w to x, (2) |P ...

This document specifies an extension to the Real-time Transport Control Protocol (RTCP) to use unicast feedback to a multicast sender. The proposed extension is useful for single-source multicast sessions such as Source-Specific Multicast (SSM) communication where the traditional model of many-to-many group communication is either not available or not desired. In addition, it can be applied to ...

In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Nevertheless, many applications can yield better performance if such bounds hold with a given probability. In this paper we show how probabilistic latency bounds can be applied in the context of publish/subscribe. We pr...

We study second-degree price discrimination in markets where the product traded by the monopolist is access to other agents. We derive necessary and suffi cient conditions for the welfareand the profit-maximizing mechanisms to employ a single network or a menu of non-exclusive networks. We characterize the optimal matching schedules under a wide range of preferences, derive implications for pri...

It is generally acknowledged today that, while the intonational features speakers select when they utter a sentence are not determined by the syntax, semantics or discourse context of that sentence, knowledge of these factors can help to constrain the possible intonational features speakers are likely to choose. So, while intonational variation poses a challenge to speech recognition in one sen...

A Disjoint Path Cover (DPC for short) of a graph is a set of pairwise (internally) disjoint paths that altogether cover every vertex of the graph. Given a set S of k sources and a set T of k sinks, a many-to-many k-DPC between S and T is a disjoint path cover each of whose paths joins a pair of source and sink. It is classified as paired if each source of S must be joined to a designated sink o...

This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach allows many-to-many matching methodology and is capable of tolerating errors due to video partitioning and various video editing effects. We formulate clip-based retrieval as a graph matching problem in two stages. In ...

In UML class diagrams, a many-to-many relationship with attributes can be represented by an association class or by a connecting object class. It is unclear which modeling construct is preferred in particular modeling scenarios. Because of lack of theory, this paper investigates the issue empirically. An experiment was conducted that tested the effect of representational form chosen on the perf...

Let n be a positive integer, and let d = (d1, d2, . . . , dn) be an n-tuple of integers such that di ≥ 2 for all i. A hypertorus Q d n is a simple graph defined on the vertex set {(v1, v2, . . . , vn) : 0 ≤ vi ≤ di − 1 for all i}, and has edges between u = (u1, u2, . . . , un) and v = (v1, v2, . . . , vn) if and only if there exists a unique i such that |ui − vi| = 1 or di − 1, and for all j ≠ ...