Even though tree-based reliable multicast protocols are known to be most scalable for one-to-many sessions, there is still an open question whether these protocols are also scalable for many-to-many sessions. We analyze and compare two promising multicast protocols-the receiver-initiated protocol with NACK suppression and the tree-based protocol-using a new spatial loss model. The proposed mode...

Multiplayer perceptrons or feed-forward networks are generally trained to represent functions or many-to-one (m-o) mappings. This creates a problem if the training data exhibits the property of many-to-many or almost many-many valued-ness because the model, which generated the data, was many-to-many. Therefore in this paper a modified feed-forward network and training algorithm is considered to...

An overlooked problem in Learning From Demonstration is the ambiguity that arises, for instance, when the robot is equipped with more sensors than necessary for a certain task. Simply trying to repeat all aspects of a demonstration is seldom what the human teacher wants, and without additional information, it is hard for the robot to know which features are relevant and which should be ignored....

DEFINITION As stated in the entry “Publish/Subscribe over Streams”, 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, an...

Weblogs have recently emerged as a popular means of sharing information on the Web. While they effectively foster the networking of participants on a one-to-one basis, so far they have been lacking the capacity of allowing the establishment of many-to-many communication relationships. This paper describes recent work on facilitating group-forming processes and the sharing of content among weblo...

We present DIRECTL: an online discriminative sequence prediction model that employs a many-to-many alignment between target and source. Our system incorporates input segmentation, target character prediction, and sequence modeling in a unified dynamic programming framework. Experimental results suggest that DIRECTL is able to independently discover many of the language-specific regularities in ...

Let A and B be two finite sets of points with total cardinality n, the many to many point matching with demands and capacities matches each point ai ∈ A to at least αi and at most α ′ i points in B, and each point bj ∈ B to at least βj and at most β ′ j points in A for all 1 ≤ i ≤ s and 1 ≤ j ≤ t. In this paper, we present an upper bound for this problem using our new polynomial time algorithm.

Postcode 06560 City Sogutozu State Ankara Country Turkey Author Degree Dr.

A k-disjoint path cover of a graph is a set of k internally vertex-disjoint paths which cover the vertex set with k paths and each of which runs between a source and a sink. Given that each source and sink v is associated with an integer-valued demand d(v) ≥ 1, we are concerned with general-demand k-disjoint path cover in which every source and sink v is contained in the d(v) paths. In this pap...

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