Montag, 30. Juni 2014

[HIForum] Friendly Reminder: Mittwoch 2. Juli 2014 16.00/17.00

Moin HIForum,    dies ist eine freundliche Erinnerung an die AbsolventInnenverabschiedung und das Sommerfest:     *Mittwoch 2. Juli 2014 16.00 + 17.00*     Am Mittwoch 2.7. ab 16 Uhr findet die Semesterverabschiedung der AbsolventInnen des letzten halben Jahres im Zuse-Hörsaal des Informatikum statt, um 17 Uhr beginnt das traditionelle Sommerfest Ihres Fachbereich Informatik     In diesem Jahr werden wir eine Tombola haben mit vielen wunderbaren Preisen haben und als Highlight eine Cocktailbar, gespendet von der Firma tink-cell      Wir freuen uns auf viele Alumni des Fachbereichs, die das Fest bereichern werden: kommen Sie vorbei und trinken Sie mit uns einen Cocktail. Sie können zu diesem Termin noch einige Exemplare der ersten Auflage der "Alumnibecher" erwerben!       Mit besten Grüßen        Michael Schudy, Angela Schwabl, Dirk Martinssen                              
HIForum - Hamburger Informatik-Forum e.V.
Vorstand: Dipl.-Inform. Michael Schudy (Vorsitzender), 
Dipl.-Inform. Angela Schwabl,
Dipl.-Inform. Dirk Martinssen
Vereinsregister Hamburg VR 16010
c/o Fachbereich Informatik der Universität Hamburg
Vogt-Kölln-Straße 30
22527 Hamburg

Dienstag, 24. Juni 2014

[HIForum] [Kolloquium] INVITATION: UHH Informatik Kolloquium - Mo, 07.07. - Prof. Dr. Jan Peters/TU Darmstadt

This is an invitation to the next "UHH Informatik Kolloquium"

Professor Dr. Jan Peters
TU Darmstadt

This talk will be held in English

MONDAY, 07.07.2014, 17:15 s.t.

Konrad-Zuse-Hörsaal, Informatikum, B-201

TOPIC: Machine Learning of Motor Skills in Robotics:
From Simple Skills to Table Tennis and Manipulation

Autonomous robots that can assist humans in situations of daily life have
been a long standing vision of robotics, artificial intelligence, and
cognitive sciences. A first step towards this goal is to create robots
that can learn tasks triggered by visual stimuli from higher level
instruction. However, learning techniques have yet to live up to this
promise as only few methods manage to scale to high-dimensional
manipulator or humanoid robots. In this talk, we investigate a general
framework suitable for learning motor skills in robotics including both
manipulation of static and dynamic objects that are perceived using
vision. The resulting approach relies on a representation of motor skills
by parameterized motor primitive policies acting as building blocks of
movement generation, and a learned task execution module that transforms
these movements
into motor commands. We discuss task-appropriate learning approaches for
imitation learning, model learning and reinforcement learning for robots
with many degrees of freedom that perceive the manipulated objects using
robot vision. Empirical evaluations on a several robot systems illustrate
the effectiveness and applicability to learning control on an
anthropomorphic robot arm. These robot motor skills range from basic
visuo-motor skills to playing robot table tennis against a human being and
manipulation of various objects.

Jan Peters is a full professor (W3) for Intelligent Autonomous Systems at
the Computer Science Department of the Technische Universitaet Darmstadt
and at the same time a senior research scientist and group leader at the
Max-Planck Institute for Intelligent Systems, where he heads the
interdepartmental Robot Learning Group. Jan Peters has received the Dick
Volz Best 2007 US PhD Thesis Runner Up Award, the Robotics: Science &
Systems - Early Career Spotlight, the INNS Young Investigator Award, and
the IEEE Robotics & Automation Society's Early Career Award.

Jan Peters has studied Computer Science, Electrical, Mechanical and
Control Engineering at TU Munich and FernUni Hagen in Germany, at the
National University of Singapore (NUS) and the University of Southern
California (USC). He has received four Master's degrees in these
disciplines as well as a Computer Science PhD from USC. Jan Peters has
performed research in Germany at DLR, TU Munich and the Max Planck
Institute for Biological Cybernetics (in addition to the institutions
above), in Japan at the Advanced Telecommunication Research Center (ATR),
at USC and at both NUS and Siemens Advanced Engineering in Singapore.

Prof. Dr. Ulrike von Luxburg
Department of Computer Science, University of Hamburg
Phone: +49-(0)40-42883-2409

Kolloquium mailing list
HiForum-Verteiler mailing list

Donnerstag, 12. Juni 2014

[HIForum] [Kolloquium] UHH Informatik Kolloquium - Mo, 23.6. - Prof. Dr. Petra Mutzel/TU Dortmund

This is an invitation to the next "UHH Informatik Kolloquium"

Professor Dr. Petra Mutzel
Lehrstuhl für Algorithm Engineering
Technische Universität Dortmund

This talk will be in German or English, according to preference.

MONDAY, 23.06.2014, 17:15 s.t.

Konrad-Zuse-Hörsaal, Informatikum, B-201

TOPIC: Recent Advances in Crossing Minimization

The crossing number problem asks for the minimum number of edge crossings
that can be achieved by drawing a given graph in the 2-dimensional plane.
It has originally been stated by Turan during the second world war and
published in 1954. Since then, many interesting theoretical and practical
results have been obtained. We will survey some of the more recent
results. Despite the many published papers on this problem and its
variants, the crossing number is only known for very few graph classes.
Although the Harary-Hill conjecture provides a closed formula for the
crossing number of complete graphs, it has only been settled for graphs
with up to 12 vertices. We will review recent results and present further
progress concerning the crossing number of complete graphs. We will
discuss why many experts think that the new approaches will have the
strength to settle this open problem. For general graphs, we will present
approaches based on integer linear programming formulations for computing
the exact crossing number. Our branch-and-cut algorithms are able to
compute the exact crossing numbers for general sparse graphs with up to
100 vertices and crossing number up to 37 within 30 minutes. We will also
survey recent approximation results for the crossing number. For general
graphs, no polynomial time algorithm is known approximating the crossing
number within some non-trivial factor. However, for certain graph classes
like ³almost planar graphs² of bounded degree, the crossing number can be
approximated by a constant factor.

Professor Dr. Petra Mutzel has studied Mathematics at Universität
Augsburg. After her Ph.D. in Computer Science, which she received 1994 at
the Universität zu Köln, she was member of the Max-Planck-Institut für
Informatik in Saarbrücken, where she also got her habilitation in 1999.
After a temporary professorship at the Universität Heidelberg, she got a
full professorship for Algorithms and Data Structures at the Technische
Universität Wien. Since 2004, she is full professor for Algorithm
Engineering at the Technische Universität Dortmund. She is Associate
Editor of the Journal of Graph Algorithms and Applications (JGAA),
Mathematical Programming Computation (MPC), the EURO Journal on
Computational Optimization, the Graph Drawing E-print Archive, and the ACM
Journal on Experimental Algorithmics. In the year 2000, she got the
research prize ³Technische Kommunikation 2000² by the Alcatel SEL Stiftung
für Kommunikationsforschung. Her research focuses on combinatorial
optimization problems as well as on graph data structures and algorithms
with the main application areas graph drawing, network design, and

Prof. Dr. Ulrike von Luxburg
Department of Computer Science, University of Hamburg
Phone: +49-(0)40-42883-2409

Kolloquium mailing list
HiForum-Verteiler mailing list