Untergeordnete Navigation

Veranstaltungskalender

diese Seite mit Tabellen

Der Kalender liegt auch im csv-Format (z.B. für Microsoft Outlook) und im ics/iCal-Format vor.


Informatik-Kolloquium

Zeit: 18.05.2012, 10:00 Uhr

Ort: Informatik-Zentrum, Raum 5056, Ahornstr. 55

Referent: Herr Prof. Dr. Chris J. Myers, University of Utah, USA

Titel: Formal Verification of Genetic Circuits

Abstract:

Researchers are beginning to be able to engineer synthetic genetic circuits for a range of applications in the environmental, medical, and energy domains. Crucial to the success of these efforts is the development of methods and tools to verify the correctness of these designs.

This verification though is complicated by the fact that genetic circuit components are inherently noisy making their behavior asynchronous, analog, and stochastic in nature. Therefore, rather than definite results, researchers are often interested in the probability of the system reaching a given state within a certain amount of time. Usually, this involves simulating the system to produce some time series data and analyzing this data to discern the state probabilities. However, as the complexity of models of genetic circuits grow, it becomes more difficult for researchers to reason about the different states by looking only at time series simulation results of the models. To address this problem, techniques from the formal verification community, such as stochastic model checking, can be leveraged.

This talk will introduce the basic biology concepts needed to understand genetic circuits, as well as, the modeling and analysis techniques currently being employed. Finally, it will give insight into how formal verification techniques can be applied to genetic circuits.

13.04.2012, sts

Turings Test Revisited

Zeit: 23.05.2012, 15:00 Uhr

Ort: Informatik-Zentrum, AH 4, Ahornstr. 55

Referent: Wolfgang Coy, Humboldt-Universität Berlin

Inhalt:

Die Pioniere der modernen Rechenautomaten waren von numerischen und aussagenlogischen Fähigkeiten ihrer Maschinen so fasziniert, dass sie immer wieder über eine Erweiterung des Begriffs der menschlichen Intelligenz nachdachten. Alan M. Turing schlug in einem populärwissenschaftlichen Aufsatz vor, die Simulation eines intelligenten schriftlichen Dialogs zum Ausgangspunkt eines Intelligenztests zu machen, nicht um Intelligenz im Sinne der IQ-Tests zu messen, sondern der Maschine die gelungene Imitation intelligenten Verhaltens zuzubilligen. Turings Prognose lautet: „I believe that in about fifty years’ time it will be possible, to program computers, with a storage capacity of about 109, to make them play the imitation game so well that an average interrogator will not have more than 70 per cent chance of making the right identification after five minutes of questioning.“ Diesem „Turing-Test“ war in den nächsten Jahrzehnten eine immer wiederkehrende mediale Aufmerksamkeit sicher, freilich erst einmal in Gestalt von Joseph Weizenbaums reizender Tochter Eliza, deren Intelligenz mehr an E. T. A. Hofmanns Olympe orientiert war. Seit 1991 ist es das Spektakel des regelmäßig vergebenen, mit maximal 100.000 US-$ ausgestatteten Loebner-Preises, der Turings Test in Erinnerung hält. Als einen weiteren Beleg intelligenten Räsonierens mag man im Abschneiden von IBMs Watson-Rechner im Rahmen der TV-Show „Jeopardy!“ sehen. Apple SIRI verführt zu allerlei Jux zwischen Mensch und Smartphone. Verstehen Computer nun endlich menschliche Sprachen? Hat sich sechzig Jahre nach Turings Aufsatz „Computing Machinery and Intelligence“ der allgemeine Sprachgebrauch soweit verändert, dass wir Maschinen Intelligenz zubilligen sollten?

09.03.2012, sts

Informatik-Kolloquium

Zeit: 31.05.2012, 16:00 Uhr

Ort: Informatik-Zentrum, Raum 2002, Ahornstr. 55

Referent: Dr. Ralf Huuck, NICTA / UNSW / Red Lizard Software

Thema: Software Bug Detection in Millions of Lines of C/C++ Code

Abstract:

Model checking has a long stigmatized history of being slow and not scalable to large real life systems. In this talk we report on our experiences of using model checking at the core of our C/C++ source code analysis tool Goanna. We present our underlying abstractions, refinement models and auxiliary techniques to obtain a solution that is fast, scalable, and sufficiently precise. Moreover, we report on our experience andt challenges in moving our Goanna software from an academic project to a commercial product.

Dr Ralf Huuck is a senior researcher with NICTA, Australia's national center of excellence for computer science research, a senior lecturer with the Univeristy of New South Wales, Sydney, and the CEO and co-Founder of Red Lizard Software, an enterprise delivering software source code analysis solutions. Ralf obtained his PhD in formal methods from the University of Kiel, Germany, and was holding visiting appointments in France, Hong Kong, Australia and Japan.

10.05.2012, mbr

Kolloquium zum 60. Geburtstag von Prof. Dr. Matthias Jarke, Informatik 5 (Informationssysteme)

Zeit: 01.06.2012, 15:00 Uhr

Ort: Aula II, Informatik-Zentrum, Ahornstr. 55

Programm zum Festkolloquium

27.04.2012, mbr

Informatik-Oberseminar

Zeit: 08.06.2012, 10:00 Uhr

Ort: Informatik-Zentrum, Raum 5053.2, Ahornstr. 55

Referent: Vaishak Belle, M. Sc.

Titel: On the Projection Problem in Active Knowledge Bases with Incomplete Information

Abstract:

The problem of projection has been identified as a fundamental reasoning concern in dynamical domains, where we are to determine whether or not some conditions will hold after a sequence of actions has been performed. Solving the problem requires, at the very least, effectively reasoning about how actions transform the world, and inferring the logical consequences of the initial knowledge base (KB). For various reasons, tractability one of them, applications often make the closed-world assumption, thereby limiting the scope of these systems for the real world. In this thesis, using the language of the situation calculus, we investigate the computational properties of a number of unsolved reasoning tasks in the context of projection with incomplete information. We first look at inherently incomplete KBs, where the information provided to the agent may not determine every fact about the world. Projection, then, may involve reasoning about what is believed and also, about what is not believed. We then look at physical agents with unreliable hardware, as a result of which actions lead to certain kinds of incomplete knowledge. Intuitively, beliefs should be (periodically) synchronized with this noise. Finally, we consider the presence of other agents in the environment, whose beliefs may differ arbitrarily, and the formalism should incorporate what others sense and learn during actions.

To enable a precise mathematical treatment of incomplete KBs, we appeal to a seminal proposal by Levesque, called only knowing, and investigate projection wrt extensions to the situation calculus for only knowing, noisy hardware and multiple agents. Our central contribution will be to show that, in spite of the additional expressivity, reasoning about knowledge and action reduces to non-epistemic non-dynamic (i.e, purely first-order) reasoning about the initial KB.

10.05.2012, mbr

Sommerfest der Fachgruppe Informatik

Zeit: 22.06.2012, 15:00 Uhr

Ort: Informatik-Zentrum, Ahornstr. 55

27.04.2012, mbr

Aufbau und Abbau von Mustern in der Biologie

Zeit: 27.06.2012, 15:00 Uhr

Ort: Informatik-Zentrum, AH 4, Ahornstr. 55

Referent: Hans Meinhardt, Max-Planck-Institut für Entwicklungsbiologie, Tübingen

Inhalt:

Was hat der Mathematiker und Computerpionier Alan Turing mit tropischen Meeresschnecken und Blattadern zu tun? Dieser Vortrag zeigt, wie die Natur etwas fertig bringt, was fast unmöglich zu sein scheint: zuverlässig und reproduzierbar Strukturen aufzubauen, wo vorher keine Strukturen vorhanden waren. Das hat auch Turing interessiert. Denn zunächst einmal entsteht ein komplexer Organismus aus einer einzigen Zelle und alle Zellen besitzen das gleiche genetische Material. Alan Turing hat in seiner Arbeit gezeigt, dass es Systeme geben kann, in denen jede noch so kleine Schwankung zur Bildung von stabilen Mustern führen kann. Es wird gezeigt, wie sich Muster bilden können, von Muschelschalen bis hin zu Sanddünen. Auch die Regeneration von Strukturen kann so erklärt werden.

09.03.2012, sts