Abstract:

Starting with the consideration that massive multiplayer online gaming (MMOG) is a latency-critical representative of the class of highly interactive multi-user multimedia applications, we have acquired trace data from an MMOG operator and investigated the features of this traffic. Approaching latency from several angles, we found two quite different improvements that can improve a variety of interactive applications.

The first is based on the understanding that reliable transport protocols such as TCP and SCTP are basically suited for a class of interactive traffic that generates thin streams, but that some modifications are required. These thin-stream modifications work nicely with regular applications and unmodified receivers, but produce easily noticable improvements for thin-stream applications such as games, remote login, voice-over-IP, and the like.

The second is based on an observation that games and many other distributed virtual environments are divided in areas-of-interest, and that avatars‘ locations in such areas define frequently changing all-to-all overlay multicast groups. Considering that IP multicast is not generally available, we have investigated how such multicast groups within a larger distributed application should be maintained and updated. Depending on application parameters, the appropriate decisions differ quite widely, and we have explored a large part of the parameter space.

Biographie:

Carsten Griwodz leads the Media Performance Group at the Norwegian research company Simula Research Laboratory AS, Norway, and is Professor at the University of Oslo. He received his Diploma in Computer Science from the University of Paderborn, Germany, in 1993. From 1993 to 1997, he worked at the IBM European Networking Center in Heidelberg, Germany. In 1997 he joined the Multimedia Communications Lab at Darmstadt University of Technology, Germany, where he obtained his doctoral degree in 2000. His interests lie in the improvement of system support for interactive distributed multimedia, with heterogeneous parallel processing, operating systems and protocol support for streaming applications and multiplayer games in particular. He leads the StorIKT project Verdione that investigates system support for the World Opera, and is member of the Center for Research-based Innovation „Information Access Disruptions“ that develops next generation search technology.

Abstract:

Adaptation of multimedia content is a topic that has been addressed from many points of view, namely from an elementary media perspective. Rich Media content is a particular type of multimedia content, i.e., a collection of elementary media, but with a strong emphasis on compositing aspects and on dynamic and interactive behaviors. Adaptation of Rich Media content is hence quite a different problem from elementary media adaptation. This problem has been tackled in the past, but global, accepted approaches have not yet been widely adopted. This talk will first survey the state-of-the-art approaches in Rich Media adaptation, including the scalable approach developed in our lab. The talk will also present the research challenges remaining ahead.

Cyril Concolato is Associate Professor in the Multimedia Group at Telecom ParisTech, Paris, France, where he received his master and doctoral degree in Computer Science in 2000 and 2007, respectively. His interests lie in multimedia scene descriptions and in interactive multimedia applications. He is the author or co-author of 8 journal papers and 29 conference papers. He is an active participant to the standardization bodies of MPEG and W3C. Finally, he is one of the project leaders of the Open Source project GPAC.

Homepage of Cyril Concolato: http://concolato.wp.institut-telecom.fr/

András Lörincz short bio: professor, senior researcher has been teaching at the Faculty of Informatics at Eötvös University, Budapest since 1998. His research focuses on distributed intelligent systems and their applications in neurobiological and cognitive modeling, as well as medicine. He has founded the Neural Information Processing Group of Eötvös University and he directs a multidisciplinary team of mathematicians, programmers, computer scientists and physicists. He has acted as the PI of several successful international projects in collaboration with Panasonic, Honda Future Technology Research and the Information Directorate of the US Air Force in the fields of hardware-software co-synthesis, image processing and human-computer collaboration. He authored about 200 peer reviewed scientific publications. He has received the Széchenyi Professor Award, Master Professor Award and the Széchenyi István Award in 2000, 2001, and 2004, respectively. In 20

04, he was awarded the Kalmár Prize of the John von Neumann Computer Society of Hungary. He has become an elected Fellow of the European Coordinating Committee for Artificial Intelligence for his pioneering work in the field of artificial intelligence in 2006.

Abstract: In recent years, a number of novel applications have emerged through „L1 Magic“, the intriguing property that cost functions using l0 norm (i.e., the minimization of the number of the elements of a basis set representing a given input) and cost functions using l1 norm are equivalent under certain conditions. This feature turns relevant NP-hard-looking problems to polynomial ones. Based on this and related recent advances in signal processing, we study a novel model in which signal is decomposed into a dense signal of low intrinsic dimension and into a sparse signal. In contrast to other approaches, this preprocessing in conjunction with efficient sparse coding can achieve structural sparseness thus allowing for the formation of highly overcomplete and highly sparse, but combinatorial dictionaries. We shall present some results for natural images and will discuss the advantages of the separation of the two types of representations for other data, including movies and texts.

A key requirement in packet switching networks is an efficient way to access information stored within the routers. The most obvious example is the routing table and its associated forwarding information, accessed at least once for each packet traversing the router, but advanced protocols may require to store and access flow state information too, adding scalability problems as well. In this seminar, an innovative, highly efficient way to exploit the cooperation between end nodes and intermediate systems will be presented. It is based on Distributed Linked Data Structures (DLDS), an extension of the classical linked data structures where pointers are stored in data packets, travel along the route from sender to receiver and address memory locations within the routers belonging to the path. When integrated in network protocols (for example as a new IP option field), DLDS provide the router the memory addresses needed to access the required information without the need of searching. This leads to constant cost procedures, increasing performance and overcoming scalability problems. DLDS may support several different applications; two of them will be discussed in detail: resource reservation for deterministic Quality of Service support (based on an algorithm called REBOOK) and routing tables lookup.

Pier Luca Montessoro was born in Torino, Italy, on November 25, 1961. He received the Dr. Eng. degree cum laude in Electronic Engineering from the Politecnico di Torino, Italy, in 1986. He has been with the Consiglio Nazionale delle Ricerche (C.N.R.), the Italian National Council for Scientific Research, from 1988 to 1992. During this period he has also been scientific consultant for the Digital Equipment Corporation (later Compaq) in Hudson, Mass. (USA) in the field of simulation for VLSI design. His teaching and research activities began at Politecnico di Torino where he taught computer programming, computer architectures, computer networks and databases in a Management Engineering course from 1990 to 1994. In November 1992 he moved to University of Udine as associate professor in computer science and since Novembre 2002 he is full professor. His teaching activity at the engineering faculty is on computer science fundamentals and computer networks. He recorded two video-courses for the Nettuno on-line university, he is author of several didactic publications, more than sixty scientific papers, some patents and together with Silvano Gai and Pietro Nicoletti wrote a popular book („Reti locali: dal cablaggio all’internetworking“, SSGRR, in italian) on structured cabling systems, LAN and internetworking, also included in their multimedia CD-ROM. His research interests, after several years spent on CAD for digital circuits design and, later, on multimedia systems for teleteaching and e-learning, are currently focused on computer networks and network security and on pervasive computing. From 2003 to 2009 Pier Luca Montessoro has been head of the Electrical, Management and Mechanical Engineering Department and from 1995 to 2002 director of the Computer Center of the University of Udine. He has been member of the NCGT of the CRUI („Conferenza dei Rettori delle Università Italiane“) for the GARR computer network, the italian research network, president of master course in Multimedia Sciences and Technologies of the University of Udine, rector’s delegate for the computer networks and telematic systems of the University of Udine, member of the Tecnical Board („Comitato Tecnico“) of the CINECA consortium; He is currently representative of University of Udine in several national committees. Related to the interest in multimedia systems, Pier Luca Montessoro developed some studies about musical piracy and has been consultant of magistrates in several proceedings. He is also member of SIAE („Società Italiana degli Autori ed Editori“), the italian authors and editors society, as composer and song writer.

In der Vortragsreihe des Projektes Informatik verstehen hat am 8. Juni Herr Prof. Böszörmenyi vom Institut für Informationstechnologie über das Thema „Die unsichtbaren Diener – Der Compiler und seine Artgenossen“ referiert. Neben Mitarbeitern der Universität nahmen erfreulicherweise auch Lehrer und zahlreiche Schüler am Vortrag teil.

Link zu den Vortragsfolien: http://www.itec.uni-klu.ac.at/~laszlo/courses/cb/Compiler.pdf

Abstract:
Popular programming languages offer thousands of add-on libraries or modules. Popular applications offer thousands of add-on plug-in modules. We consider the problem of recommending a small set of related modules when someone visits a page describing a module. There are three promising sources of information for these recommendations. The first is textual similarity among the descriptions of modules. The second is co-mention of the modules in forum conversations. The third is co-installation of modules in public sites that report on which modules are used. I will report on a deployment on drupal.org, comparing the effectiveness (in terms of user click-throughs) of recommenders that use the three sources. I will also describe a further experiment, about to be released on drupal.org, that dynamically updates the recommendations based on users‘ click behaviors, using a Multi-Armed Bandit learning algorithm. I will describe how we are using the three sources of information to set „priors“ for the bandit algorithm, and how we will assess the amount of improvement in recommendations from using the

priors as compared to a prior-free version of the bandit algorithm.
Background paper: http://portal.acm.org/citation.cfm?id=1639714.1639737

Paul Resnick is a Professor at the University of Michigan School of Information. He previously worked as a researcher at AT&T Labs and AT&T Bell Labs, and as an Assistant Professor at the MIT Sloan School of Management. He received the master’s and Ph.D. degrees in Electrical Engineering and Computer Science from MIT, and a bachelor’s degree in mathematics from the University of Michigan.
Professor Resnick’s research focuses on SocioTechnical Capital, productive social relations that are enabled by the ongoing use of information and communication technology. His current projects include analyzing and designing reputation systems, ride share coordination services, and applying principles from economics and social psychology to the design of on-line communities.
Resnick was a pioneer in the field of recommender systems (sometimes called collaborative filtering or social filtering). Recommender systems guide people to interesting materials based on recommendations from other people. His articles have appeared in Scientific American, Wired, Communications of the ACM, The American Economic Review, Management Science, and many other publications.

Mit der Entwicklung der Informationstheorie gelang C. E. Shannon bereits im Jahre 1948 der Beweis, das mittels geeigneter Codierverfahren auch über gestörte Übertragungskanäle prinzipiell eine fehlerfreie digitale Übertragung möglich ist, solange nicht versucht wird, mehr Daten zu übertragen als die Kapazität des Kanals zulässt. Dieses Kanalcodierungstheorem leitete eine breite Forschungstätigkeit auf dem Gebiet der Kanalcodierung ein. Dennoch wurden über viele Jahre trotz des Einsatzes anspruchsvollster mathematischer Methoden nur eher bescheidene Fortschritte erreicht und das Ziel, die informationstheoretische Kapazität von Übertragungskanälen in der Praxis nutzbar zu machen, erschien grundsätzlich  unerreichbar. Erst durch die Zufallserfindung der sog. „Turbo-Codes