Let Φ̃ be a root system of type F4, and let G be a group generated by non-trivial subgroups Ar, r ∈ Φ̃, satisfying some generalized Steinberg relations, which are also satisfied by root subgroups corresponding to a Moufang octagon. These relations can be considered as a generalization of the element-wise commutator relations in Chevalley groups. The Steinberg presentation specifies the groups sat...

To allow or protect the traffic in any network security system like firewalls and Intrusion Prevention System (IPS), a packet classification scheme is used along with the application of TCAM-based flow identification [1]. But these applications share a common demand, which is the ability to process, maintain, and correlate huge amount of events. In these applications, the rate of the events is ...

The purpose of this paper is to present two agents’ societies responsible for groups formation (sub-communities) in CV-Muzar (Augusto Ruschi Zoobotanical Museum Virtual Community of the University of Passo Fundo). The first is a static society that intends to investigate the groups in the CV-Muzar. The second is a dynamical society that will analyze the existing groups and look for participants...

We present the first fully secure Identity-Based Encryption scheme (IBE) from the standard assumptions where the security loss depends only on the security parameter and is independent of the number of secret key queries. This partially answers an open problem posed by Waters (Eurocrypt 2005). Our construction combines the Waters’ dual system encryption methodology (Crypto 2009) with the Naor-R...

Systematic design of decentralized feedback for coordinated control of multi-agent systems has much to gain from the rigorous examination of the nonlinear dynamics of collective animal behavior. Animals in groups, from bird flocks to fish schools, employ decentralized strategies and have limitations on sensing, computation, and actuation. Yet, at the level of the group, they are known to manage...

In this paper we present an elaborated graph-based algorithmic technique for efficient malware detection. More precisely, we utilize the system-call dependency graphs (or, for short ScD graphs), obtained by capturing taint analysis traces and a set of various similarity metrics in order to detect whether an unknown test sample is a malicious or a benign one. For the sake of generalization, we d...

We present PolyLens, a new collaborative filtering recommender system designed to recommend items for groups of users, rather than for individuals. A group recommender is more appropriate and useful for domains in which several people participate in a single activity, as is often the case with movies and restaurants. We present an analysis of the primary design issues for group recommenders, in...

lsis is a toolkit for building applications consisting of cooperating processes in a distributed system. Group management and group communication are two basic building blocks provided by Isis. This approach has proven successful, and Isis’ large user community is putting substantial demands on these mechanisms. To accommodate these demands a complete redesign of the system, called Horus, is be...