Group communication implies a many-to-many communication and it goes beyond both one-to-one communication (i.e., unicast) and one-to-many communication (i.e., multicast). Unlike most user authentication protocols that authenticate a single user each time, we propose a new type of authentication, called group authentication, that authenticates all users in a group at once. The group authenticati...

Sir, the recent publication on “Publication Ethics” is very interesting (1). The article by Fazly Bazzaz and Sadeghi demonstrated many interesting cases                   of misconducts. Indeed, the misconducts can be seen  in many ways. As mentioned in the present publication, both author and editor can perform publication misconducts. Nevertheless, the problem has many more facets. Sometimes,...

Heat transfer by electromagnetic radiation is one of the common methods of energy transfer between objects. Using the fluctuation-dissipation theorem, we have studied the effect of particle arrangement in the transmission of radiative heat in many-body systems. In order to show the effect of the structure morphology on the collective properties, the radiative heat transfer is studied and the re...

In this paper we deal with the problem of designing virtual path layouts in ATM networks with given hop-count and minimum load, for which we prove a lower bound with respect to networks with arbitrary topology. The result is then applied to derive a tight lower bound for the one-to-many communication pattern in networks with arbitrary topology, and for the many-to-many communication pattern in ...

Negotiation is a process in which two or more parties with different criteria, constraints, and preferences, jointly reach an agreement on the terms of a transaction. Many current automated negotiation systems support one-to-one negotiation. One-to-many negotiation has been mostly automated using various kinds of auction mechanisms, which have a number of limitations such as the lack of the abi...

This paper considers group strategy-proofness in many-to-many two-sided matching problems. We first show that the Blocking Lemma holds for a many-to-many matching model under quota-saturability condition and max-min preference criterion that is stranger than substitutability of preferences. This result extends the Blocking Lemma for one-to-one matching and for many-to-one matching to many-to-ma...

In this paper, we propose several deadlock-free protocols for implementing the generalized alternative construct, where a process non-deterministically chooses between sending or receiving among various synchronous channels. We consider general many-to-many channels and examine in detail the special case of fan (many-toone and one-to-many) channels, which are common and can be implemented much ...

The paper presents some models involving a pair of actors that aim at bartering the goods from two privately owned pools of heterogeneous goods. In the models we discuss in the paper the barter can occur only once and can involve either a single good or a basket of goods from each actor/player. In the paper we examine both the basic symmetric model (one-to-one barter) as well as some other vers...