Date: December 3, 2009, 10:30am
Duration: 45 minutes each
Venue: Dipartimento di Informatica, Via Salaria 113, Third Floor, Seminari Lecture Room

Speaker: Julinda Stefa
Title: Outer Space, Selfishness, and Innovative Services in Networks of Mobile Individuals.

ABSTRACT
The recent achievements of technology in yielding affordable small, powerful, multitasking devices, such as last generation lap tops, cellphones, PDAs, etc., not only has made our life easier but also has raised the need for new innovative and user-oriented applications. Now we dream about ``Internet available every time and everywhere'', even when we
can not reach a wireless network provider's signal, maybe through ad-hoc connection to someone else's device that acts as a packet router to the access point in his proximity.

In this context we attack and solve some the problematics like congestion, selfishness, human-movement modeling, and large-scale interest information dissemination.
In the same time, we raise new problems and give insights towards better understanding of human mobility and the network that it defines--the social mobile wireless network--as it seems to be a very promising area
where new innovative services towards the future can be designed.
--

Speaker: Blerina Sinaimeri
Title: Structures of Diversity

ABSTRACT
We consider, within a unified framework, several problems inspired by generalizations of the concept of graph capacity, introduced by Shannon in 1956 in the context of error–free communication over a noisy channel.
Along the lines of the various generalizations of capacity we introduce and study diversity relations between combinatorial structures like strings over a discrete (finite or infinite) alphabet or strings of vertices of graphs (or hypergraphs). We consider a binary relation over a set of combinatorial objects a diversity relation if it is irreflexive (meaning that no object is in this relation with itself) and local, i.e.
for two objects having projections (induced substructures) in this relation, the objects themselves are in this relation. Moreover, we consider and analyze forbiddance relations, which arise when a diversity relation should not hold between the pairs of objects. In case of both types of these relations we study the largest cardinality of sets of strings whose any pair (k–tuple) of elements is in the same relation.