@inbook{26805, abstract = {{In this article we present an approach that enables robots to learn how to act and react robustly in continuous and noisy environments while not loosing track of the overall feasibility, i.e. minimising the execution time in order to keep up continuous learning. We do so by combining reinforcement learning mechanisms with techniques belonging to the field of multivariate statistics on three different levels of abstraction: the motivation layer and the two simultaneously learning strategy and skill layers. The motivation layer allows for modelling occasionally contradicting goals in terms of drives in a very intuitive fashion. A drive represents one single goal, that a robot wants to be satisfied, like charging its battery, when it is nearly exhausted, or transporting an object to a target position. The strategy layer encapsulates the main reinforcement learning algorithm based on an abstracted and dynamically adjusted Markovian state space. By means of state abstraction, we minimise the overall state space size in order to ensure feasibility of the learning process in a dynamically changing environment. The skill layer finally realises a generalised learning method for learning reactive low-level behaviours, that enable a robot to interact with the environment.}}, author = {{Jungmann, Alexander and Kleinjohann, Bernd and Richert, Willi}}, booktitle = {{Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems}}, pages = {{545--558}}, publisher = {{Springer Basel}}, title = {{{A Fast Hierarchical Learning Approach for Autonomous Robots}}}, doi = {{10.1007/978-3-0348-0130-0_36}}, year = {{2011}}, } @inbook{26810, abstract = {{The paradigm of imitation provides a powerful means for increasing the overall learning speed in a group of robots. While separately exploring the environment in order to learn how to behave with respect to a pre-defined goal, a robot gathers experience based on its own actions and interactions with the surroundings, respectively. By accumulating additional experience via observing the behaviour of other robots, the learning process can be significantly improved in terms of speed and quality. Within this article we present an approach, that enables robots in a multi-robot society to imitate any other available robot without imposing unnecessary restrictions regarding the robots’ design. Therefore, it benefits not only from its own actions, but also from actions that an observed robot performs. In order to realise the imitation paradigm, we solve three main challenges, namely enabling a robot to decide whom and when to imitate, to interpret and thereby understand the behaviour of an observed robot, and to integrate the experience gathered by observation into its individual learning process.}}, author = {{Jungmann, Alexander and Kleinjohann, Bernd and Richert, Willi}}, booktitle = {{Organic Computing — A Paradigm Shift for Complex Systems, Autonomic Systems, Band 1 }}, pages = {{295--307}}, publisher = {{Springer Basel}}, title = {{{Increasing Learning Speed by Imitation in Multi-robot Societies}}}, doi = {{10.1007/978-3-0348-0130-0_19}}, year = {{2011}}, } @inproceedings{3811, author = {{Wachsmuth, Henning and Bujna, Kathrin}}, booktitle = {{Proceedings of 5th International Joint Conference on Natural Language Processing}}, editor = {{Berendt, Bettina and de Vries, Arjen and Fan, Wenfei and Macdonald, Craig and Ounis, Iadh and Ruthven, Ian}}, isbn = {{978-1-4503-0717-8}}, pages = {{632--640}}, title = {{{Back to the Roots of Genres: Text Classification by Language Function}}}, year = {{2011}}, } @inproceedings{3875, author = {{Wachsmuth, Henning and Stein, Benno and Engels, Gregor}}, booktitle = {{20th ACM International Conference on Information and Knowledge Management}}, editor = {{Berendt, Bettina and de Vries, Arjen and Fan, Wenfei and Macdonald, Craig and Ounis, Iadh and Ruthven, Ian}}, isbn = {{978-1-4503-0717-8}}, pages = {{2237--2240}}, title = {{{Constructing Efficient Information Extraction Pipelines}}}, year = {{2011}}, } @misc{2902, author = {{Märtens, Marcus}}, title = {{{The Monotone Complexity of Computing k-Clique on Random Graphs}}}, year = {{2011}}, } @inproceedings{2985, author = {{Ackermann, Marcel R and Blömer, Johannes and Scholz, Christoph}}, title = {{{Hardness and Non-Approximability of Bregman Clustering Problems.}}}, year = {{2011}}, } @inbook{2986, author = {{Blömer, Johannes}}, booktitle = {{Algorithms Unplugged}}, isbn = {{9783642153273}}, pages = {{159--168}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{How to Share a Secret}}}, doi = {{10.1007/978-3-642-15328-0_17}}, year = {{2011}}, } @inproceedings{3137, author = {{Hofheinz, Dennis and Jager, Tibor and Kiltz, Eike}}, booktitle = {{Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings}}, pages = {{647----666}}, title = {{{Short Signatures from Weaker Assumptions}}}, doi = {{10.1007/978-3-642-25385-0_35}}, year = {{2011}}, } @inproceedings{3138, author = {{Jager, Tibor and Somorovsky, Juraj}}, booktitle = {{Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, October 17-21, 2011}}, pages = {{413----422}}, title = {{{How to break XML encryption}}}, doi = {{10.1145/2046707.2046756}}, year = {{2011}}, } @article{3183, author = {{Schneider, Steve and Treharne, Helen and Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, pages = {{69----80}}, title = {{{Bounded Retransmission in Event-B{\(\parallel\)}CSP: a Case Study}}}, doi = {{10.1016/j.entcs.2011.11.019}}, year = {{2011}}, } @article{3184, author = {{Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}}, journal = {{{ACM} Trans. Program. Lang. Syst.}}, number = {{1}}, pages = {{4:1----4:43}}, title = {{{Mechanically verified proof obligations for linearizability}}}, doi = {{10.1145/1889997.1890001}}, year = {{2011}}, } @inproceedings{3185, author = {{Ruhroth, Thomas and Wehrheim, Heike and Ziegert, Steffen}}, booktitle = {{37th {EUROMICRO} Conference on Software Engineering and Advanced Applications, {SEAA} 2011, Oulu, Finland, August 30 - September 2, 2011}}, pages = {{83----90}}, title = {{{ReL: {A} Generic Refactoring Language for Specification and Execution}}}, doi = {{10.1109/SEAA.2011.22}}, year = {{2011}}, } @inproceedings{3186, author = {{Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}}, booktitle = {{{FM} 2011: Formal Methods - 17th International Symposium on Formal Methods, Limerick, Ireland, June 20-24, 2011. Proceedings}}, editor = {{J. Butler, Michael and Schulte, Wolfram}}, pages = {{323----337}}, title = {{{Verifying Linearisability with Potential Linearisation Points}}}, doi = {{10.1007/978-3-642-21437-0_25}}, year = {{2011}}, } @inproceedings{3187, author = {{Steenken, Dominik and Wehrheim, Heike and Wonisch, Daniel}}, booktitle = {{Formal Methods, Foundations and Applications - 14th Brazilian Symposium, {SBMF} 2011, S{\~{a}}o Paulo, Brazil, September 26-30, 2011, Revised Selected Papers}}, editor = {{da Silva Sim{\~{a}}o, Adenilso and Morgan, Carroll}}, pages = {{92----107}}, title = {{{Sound and Complete Abstract Graph Transformation}}}, doi = {{10.1007/978-3-642-25032-3_7}}, year = {{2011}}, } @inproceedings{3188, author = {{Schneider, Steve and Treharne, Helen and Wehrheim, Heike}}, booktitle = {{Proceedings 15th International Refinement Workshop, Refine@FM 2011, Limerick, Ireland, 20th June 2011.}}, editor = {{Derrick, John and A. Boiten, Eerke and Reeves, Steve}}, pages = {{139----154}}, title = {{{A {CSP} Account of Event-B Refinement}}}, doi = {{10.4204/EPTCS.55.9}}, year = {{2011}}, } @inproceedings{27622, author = {{Nebe, Karsten and Fischer, Holger Gerhard and Klompmaker, Florian and Jung, Helge}}, pages = {{263--273}}, publisher = {{Oldenbourg Wissenschaftsverlag GmbH, M {\ "u} nchen}}, title = {{{Multi-touch, tangible and pen-based interaction in incident planning}}}, year = {{2011}}, } @inproceedings{27623, abstract = {{Kollaboratives Lernen kann im Großen und Ganzen durch verteilte, unterbrochene kooperative Prozesse charakterisiert werden, da die Interaktion mit anderen Lernern und Lehrenden zu verschiedenen Zeiten an verschiedenen Orten stattfindet. Um die zeitlich und räumlich verteilten Lernaktivitäten zu integrieren, muss ein virtueller Lernraum bereitgestellt werden der einerseits als Arena kooperativer Interaktionen dient und andererseits gleichzeitig ein verteiltes externes Gedächtnis durch persistente Lernobjekte bietet. Das Konzept des ko-aktiven Lernens umfasst eine Vielzahl von technischen Konzepten und Funktionen, die kollaboratives Lernen in unterschiedlichsten Lernarrangements unterstützen. }}, author = {{Keil, Reinhard and Selke, Harald}}, booktitle = {{Proc. of Int. Conf. on Improving University Teaching}}, pages = {{191--202}}, title = {{{Virtual Learning Spaces for Co-Active Learning}}}, year = {{2011}}, } @inproceedings{27624, author = {{Paelke, Volker and Nebe, Karsten and Klompmaker, Florian and Jung, Helge}}, title = {{{Multi-Touch Interaction for Disaster Management.}}}}, year = {{2011}}, } @inproceedings{27625, author = {{Keil, Reinhard}}, editor = {{Breiter, A and Wind, M}}, pages = {{165--184}}, publisher = {{Lit Verlag, M {\" u} nster}}, title = {{{Hypothesis- guided technology design as the basis of contextual computer science}}}, year = {{2011}}, } @inproceedings{27626, author = {{Klompmaker, Florian and Nebe, Karsten and Jung, H}}, title = {{{Smart Fiducials: Advanced Tangible Interaction Techniques through Dynamic Visual Paterns}}}, year = {{2011}}, }