Actualité du LIP6

TrackSign, premier outil de webtracking destiné aux TPE/PME qui se lancent sur internet

Bernadette.Bouchon-Meunier@lip6.fr (Bernadette Bouchon-Meunier)

TrackSign est le service de webtracking d’ILObjects disponible dès maintenant à la vente par abonnement ou à l’unité.
TrackSign, c’est l’analyse du comportement des internautes qui vous aidera à réussir votre stratégie webmarketing. Pour accroître la visibilité de vos produits et de vos services, maximiser vos ventes, Tracksign vous permettra de mieux cibler vos clients potentiels.

Efficacité et fiabilité

TrackSign étudie les parcours de tous les internautes en respectant leur anonymat.
TrackSign classe les utilisateurs selon leur comportement de navigation et les présente sous forme de groupes homogènes.
TrackSign permet d’analyser ce qui retient l’intérêt des visiteurs de chaque page.
TrackSign fournit des rapports précis et personnalisés permettant d’optimiser l’usage de votre site et le retour sur investissements.
Grâce à l’analyse du comportement de chaque internaute, TrackSign vous permet de personnaliser votre contenu et de rendre votre offre plus attractive, afin de valoriser vos relations avec vos clients.

Informations pratiques

TrackSign propose aux entreprises un service clef en main, qui se décline sous deux formes :

une étude ciblée à la demande
un abonnement annuel.

Contact contactus@ilobjects.com ou www.ilobjects.com/contact
ILObjects est membre professionnel de la Web Analytics Association

Transverse Subjectivity Classification, jeudi 24 mai à 10h30.

Sahar.Changuel@lip6.fr (Sahar Changuel) — Fri, 30 Mar 2012 15:03:18 GMT

In this talk, we will present our research on learning models for subjectivity classification across domain. After a small introduction about related works and challenges of sentiment analysis, we will start by presenting new features for subjectivity analysis.
Then, we will present two different paradigms of multi-view learning strategies to learn transfer models: multi-view learning with agreement and guided multi-view learning. Then, we will present an exhaustive evaluation based on both paradigms including two states-of-the-art algorithms and show that accuracy over 91% can be obtained using three views. In our concluding remarks, we will talk about future extensions of the presented methodology.

Dynamic Temporal Workload in Hybrid Data Centers, Energy-Aware Aggregation, and Networking, mercredi 6 juin à 10h00.

stefano.secci@lip6.fr (stefano secci) — Wed, 16 May 2012 16:57:57 GMT

Abstract:
Workloads in data centers are highly dynamic. Secondly, data centers are often hybrid in terms of hardware/compute capability. We consider the problem of balancing energy consumption and system cost in hybrid data centers with dynamic temporal workloads. For comparison, we consider three data-center scenarios: all homogeneous, all heterogeneous, mixed clusters. To be able to compute optimal configurations for large scale data centers, we also explore static and dynamic aggregation schemes, which come at the additional cost on energy consumption. Thus, we will discuss the trade-off between energy-aware aggression and the computational cost, and where and how the dynamic scheme helps compared to the static scheme. In addition, we will discuss how this impact placement and routing in a data center environment.

Bio:
Deep Medhi is Curators' Professor in the Department of Computer Science and Electrical Engineering at the University of Missouri- Kansas City, USA. He received B.Sc. in Mathematics from Cotton College, Gauhati University, India, M.Sc. in Mathematics from the University of Delhi, India, and his Ph.D. in Computer Sciences from the University of Wisconsin-Madison, USA. Prior to joining UMKC in 1989, he was a member of the technical staff at AT&T Bell Laboratories. He was an invited visiting professor at the Technical University of Denmark, a visiting research fellow at Lund Institute of Technology, Sweden, and a Fulbright Senior Specialist. He is the Editor-in-Chief of Springer’s Journal of Network and Systems Management, and is on the editorial board of IEEE/ACM Transactions on Networking, IEEE Transactions on Network and Service Management, and IEEE Communications Surveys & Tutorials. He has published over a hundred papers, and is co-author of the books, Routing, Flow, and Capacity Design in Communication and Computer Networks (2004) and Network Routing: Algorithms, Protocols, and Architectures (2007), both published by Morgan Kaufmann Publishers.

Ecole de printemps "Théorie des jeux algorithmique", lundi 18 juin.

Fanny.Pascual@lip6.fr (Fanny Pascual) — Tue, 15 May 2012 16:27:42 GMT

Ecole thématique du CNRS
dédiée à la théorie des jeux algorithmique, avec le soutien du GdR RO.

Ouverte aux chercheurs, enseignants-chercheurs et doctorants, cette
école de printemps vise à fournir aux participants un panorama de la
théorie des jeux algorithmique, discipline à l'intersection de
l'optimisation combinatoire et de la théorie des jeux. La théorie des
jeux algorithmique a des applications dans de multiples domaines, en
particulier les réseaux et l'intelligence artificielle. L'objectif de
cette école est d'une part d'offrir l'occasion à toute personne
intéressée de se familiariser avec les principaux concepts de la
discipline, d'autre part de favoriser la rencontre et les discussions
entre chercheurs intéressés par ce sujet. L'école est structurée autour
de six cours accessibles à toute personne disposant d'une formation de
base en algorithmique (aucun prérequis en théorie des jeux n'est
nécessaire). Les doctorants sont particulièrement encouragés à
participer à cette école.

Programme

Introduction à la théorie des jeux, Olivier Serre (LIAFA, CNRS-Université
Denis Diderot)

Cooperation in resource management of distributed systems, Krzysztof
Rzadca (Université de Varsovie) et Denis Trystram (LIG, Grenoble)

Computational Aspects of Cooperative Game Theory, Michael Wooldridge
(University of Oxford)

Efficacité des équilibres, Laurent Gourvès (LAMSADE, CNRS-Université
Paris-Dauphine)

Jeux de congestion, Jose Rafaël Correa (Universidad de Chile)

Mécanismes d'incitation, Christoph Dürr (LIP6, Université Pierre et
Marie Curie)

Comité scientifique

Evripidis Bampis, Christoph Dürr, Bruno Escoffier,
Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen, Fanny
Pascual, Olivier Spanjaard, Denis Trystram.

A General Framework for People Retrieval in Social Media with Multiple Roles, jeudi 21 juin à 10h00.

Adrien.Revault-d'Allonnes@lip6.fr (Adrien Revault-d'Allonnes) — Tue, 15 May 2012 13:40:17 GMT

Internet users are more and more playing multiple roles when connected on the Web, such as "posting", "commenting", "tagging" and "sharing" different kinds of information on various social media. Despite the research interest in the field of social networks, few has been done up to now w.r.t. information access in multi-relational social networks where queries can be multifaceted queries (e.g. a mix of textual key-words and key-persons in some social context).

We propose a unified and efficient framework to address such complex queries on multi-modal "social'' collections, working in 3 distinct phases, namely:

(I) aggregation of documents into modal profiles,

(II) expansion of mono-modal subqueries to mono-modal and multi-modal subqueries,

(III) relevance score computation through late fusion of the different similarities deduced from profiles and subqueries obtained during the first two phases.

Experiments on the ENRON email collection for a recipient proposal task show that competitive results can be obtained using the proposed framework.

Model Checking Contest at PETRI NETS 2012, lundi 25 juin.

mcc-contest-committee@systeme.lip6.fr (mcc-contest-committee) — Wed, 21 Sep 2011 15:58:40 GMT

We just launched the first phase of the Model Checking Contest @ PETRI NET 2012. This phase allows the community to provide us with benchmark models.

This phase will end by October 30, 2011. Then, models will be evaluated and some will be selected to be part of the benchmark for 2012 (together with the ones of 2011).