KES
2006
Springer
13 years 4 months ago
2006
Springer
Groups of collaborative agents within organizations need to achieve goals creating group awareness. This is necessary for groups to act as single entities. The notion of collective...
JCS
2006
13 years 4 months ago
2006
We present GKMPAN, an efficient and scalable group rekeying protocol for secure multicast in ad hoc networks. Our protocol exploits the property of ad hoc networks that each membe...
JCT
2008
13 years 4 months ago
2008
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
JCT
2008
13 years 4 months ago
2008
A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all t...
JCIT
2008
13 years 4 months ago
2008
A group oriented encryption scheme is presented in this paper. In this scheme, a sender is allowed to encrypt a message using the group public key and send the ciphertext to the gr...
CE
2007
13 years 4 months ago
2007
This study investigated the effects of visualization of participation during computer-supported collaborative learning (CSCL). It is hypothesized that visualization of participat...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
In this paper we propose the group of unitriangular matrices over a finite field as a non-abelian group and composition of inner, diagonal and central automorphisms as a group of a...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
In this paper we study a key exchange protocol similar to the DiffieHellman key exchange protocol, using abelian subgroups of the automorphism group of a non-abelian nilpotent gro...
COMBINATORICS
2006
13 years 4 months ago
2006
The group PGL(2, q), q = pn, p an odd prime, is 3-transitive on the projective line and therefore it can be used to construct 3-designs. In this paper, we determine the sizes of o...
CN
2006
13 years 4 months ago
2006
We consider a system where each user is in one or more elementary groups. In this system, arbitrary groups of users can be specified using the operations of union, intersection, a...