ALCOM/CAGT-seminar:Title: Non-cooperative Competition in Large NetworksSpeaker: Martin Hoefer, Universitaet Konstanz.Thursday, April 12, 2007, 10.15-11.00, Ada-018This talk will present some of my recent and current work onnon-cooperative games in large networks. The first part will treat aclass of games for cost sharing between selfish users.…

The chimpanzee is our closest relative in theanimal kingdom. Until recently, the time where humans and chimpanzees split to eventually become separate species was dated to five-seven million years ago. A recent study,conducted by people from BiRC, is now moving this time toonly about four million years ago. The study reanalyses DNA data using…

The theme of this research is mobile transaction processing systems, focusing on versatile data sharing mechanisms in volatile mobile environments.The rapid growth of wireless network technologies and portable computingdevices has promoted a new mobile working environment. A mobile environment is different from the traditional distributed…

Many universities have experienced an increase in the intake of students and at the same time cuts in the budgets for teaching. Many teachers have experienced, for a number of reasons, they have to adjust their teaching ora course with short notice. These facts pose a challenge to the teachers agility in adapting to changes - and in doing it in a…

In his legendary commencement address ``Cargo Cult Science'' at Caltech, Richard Feynman urged scientific writers to report their work as honestly as they possiblycan: ``The idea is to try to give all the information to help others to judge the value of your contribution; not just the information that leads to judging it in one particular…

Title: The complexity of uniform Nash equilibriaAbstractWe investigate the complexity of finding Nash equilibria in which thestrategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose bimatrix games, deciding the existence of such uniform equilibria is an NP-complete problem.Our proof exploits a…

Title: Verification with Bounded Model CheckingSpeaker: Keijo Heljanko (Academy Research Fellow, Helsinki University of Technology)Abstract:Model checkingis a set of methods for analysing whether a model ofa system (e.g., a Petri net) fulfils its specification given asa temporal logic formula. Bounded model checking (BMC) was introducedby Biere…

Det første møde i det nye institutråd afholdes: - fredag den 20. april kl. 14.00-15.30 i Store Auditorium i IT-huset Mødet fungerer samtidig som informationsmøde for instituttets medarbejdere, og alle er derfor yderst velkomne til at deltage. Dagorden 1. Evaluring af 2006, blandt andet ud fra mini-årsberetningen2. Orientering om den nye…

1. Godkendelse af de seneste referater2. Status og orientering. POP3 omlægning Ansættelse/Stillingsopslag Strategipapir venter3. NFIT arbejdet DS Kalender Mail4. Næste møde: onsdag 30 maj, 13:155. Evt.

Quantum speedup of classical mixing processesPeter Richter, Rutger's University, USAAbstract:Most approximation algorithms for #P-complete problems (e.g., evaluating thepermanent of a matrix or the volume of apolytope) work by reduction to theproblem of approximatesampling from a distribution $\\pi$ over a large set$\\S$. This problem is solved…

Model Checking Techniques for Colored Petri NetsModel checking, or state space analysis, is a formalmethod to prove that finite state system match their specification. Given a formal model of the system and a property, usually expressed in a temporal logic such as the linear time temporal logic, a model checker explores all the possible behaviors…

Local Maximum Avoidance with Correlated Street Blocking for Map-based Geographic Routing in VANETsGeographic routing is known to be a scalable and robust routingstrategy for Vehicular Ad Hoc Networks (VANETs). However,VANETs with constrained mobility and frequently encountered radio obstacles would often result in geographic routing to enter into…

Christian Schaffner defends his PhD dissertation "Cryptography in the Bounded-Quantum-Storage Model".