Return-Path: william@bourbon.usc.edu Delivery-Date: Tue Apr 20 21:22:04 2010 X-Spam-Checker-Version: SpamAssassin 3.2.3 (2007-08-08) on merlot.usc.edu X-Spam-Level: X-Spam-Status: No, score=-0.8 required=5.0 tests=AWL,BAYES_00, FH_DATE_PAST_20XX autolearn=no version=3.2.3 Received: from bourbon.usc.edu (bourbon.usc.edu [128.125.9.75]) by merlot.usc.edu (8.14.1/8.14.1) with ESMTP id o3L4M4U6022475 for ; Tue, 20 Apr 2010 21:22:04 -0700 Received: from bourbon.usc.edu (localhost.localdomain [127.0.0.1]) by bourbon.usc.edu (8.14.2/8.14.1) with ESMTP id o3L4Kt59002784 for ; Tue, 20 Apr 2010 21:20:55 -0700 Message-Id: <201004210420.o3L4Kt59002784@bourbon.usc.edu> To: cs551@merlot.usc.edu Subject: FWD: Augustin Chaintreau seminar on Thursday Date: Tue, 20 Apr 2010 21:20:55 -0700 From: Bill Cheng Hi everyone, Since we have been talking about peer-to-peer systems and mobile networking this semester, I would like to encourage you to attend a talk given by a CS faculty candidate this Thursday at 3:30pm in SSL 150. Please see the talk announcement below. The speaker is a "rising star" in the field of networking research. So, the talk should be interesting. (I should mentione that this is not a requirement. What's mentioned in this talk will not be part of the final exam.) -- Bill Cheng // bill.cheng@usc.edu -----Original Message----- Date: Tue, 20 Apr 2010 13:33:00 -0700 From: Ramesh Govindan To: John Heidemann , Bill Cheng , Leana Golubchik , Cyrus Shahabi , Bhaskar Krishnamachari , Konstantinos Psounis Subject: Augustin Chaintreau seminar on Thursday Folks, Can I ask if you would encourage the students in your lab and in your respective classes to attend Augustin's talk? Thanks! Ramesh http://cs.usc.edu/~ramesh Thursday, April 22, 2010 CS Colloq: Augustin Chaintreau Time: 3:30 PM - 5 PM Location: SSL 150 Talk Title: Addressing the Mobile Social Data Deluge Speaker: Dr. Augustin Chaintreau Host: Prof. Ramesh Govindan Abstract: Extracting the full economic and scientific value of the "data deluge", which follows from the information produced and consumed online by individuals, is redefining the frontier of computer science. Five years after one of the first experiments on mobile social dynamics, the size and scope of data collected or accessed through mobile devices have increased dramatically. In this talk, it is argued that understanding and releasing the potential of mobile social networks is possible provided that three key challenges are addressed: the lack of a guiding theory, the need to design algorithms exploiting social properties, and the presence of entities with competing goals. Although these broad challenges are likely to exist for some time, this talk presents three examples in which these issues are addressed, using new analytical and algorithmic tools, to improve the efficiency of information dissemination. Bio: A. Chaintreau graduated in 2006 from Ecole Normale Superieure, Paris. He joined Technicolor (previously known as Thomson) to contribute to the creation of a new research lab on advanced communication platforms, where his research deals with mobile and social dynamics in information systems. Prior to that, he worked at Intel Research Cambridge where he was involved in conducting the first measurement campaign of opportunistic mobile dissemination. During his Ph.D, made under the supervision of Francois Baccelli, he worked with Alcatel Bell, and the IBM Watson T.J. Research Center, on characterizing scalable resource sharing systems in the presence of fairness and reliability constraints.