February 2021 - informatik-vortraege

Einladung Informatik-Oberseminar Malte Nuhn
by Sekretariat I6 30 May '22

30 May '22

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Freitag, 12. Juli 2019, 10.00 Uhr Ort: Informatikzentrum, E3, Raum 9222 Referent: Dipl.-Inform. Malte Nuhn Thema: Unsupervised Training with Applications in Natural Language Processing// Abstract: The state-of-the-art algorithms for various natural language processing tasks require large amounts of labeled training data. At the same time, obtaining labeled data of high quality is often the most costly step in setting up natural language processing systems.Opposed to this, unlabeled data is much cheaper to obtain and available in larger amounts.Currently, only few training algorithms make use of unlabeled data. In practice, training with only unlabeled data is not performed at all. In this thesis, we study how unlabeled data can be used to train a variety of models used in natural language processing. In particular, we study models applicable to solving substitution ciphers, spelling correction, and machine translation. This thesis lays the groundwork for unsupervised training by presenting and analyzing the corresponding models and unsupervised training problems in a consistent manner.We show that the unsupervised training problem that occurs when breaking one-to-one substitution ciphers is equivalent to the quadratic assignment problem (QAP) if a bigram language model is incorporated and therefore NP-hard. Based on this analysis, we present an effective algorithm for unsupervised training for deterministic substitutions. In the case of English one-to-one substitution ciphers, we show that our novel algorithm achieves results close to human performance, as presented in [Shannon 49]. Also, with this algorithm, we present, to the best of our knowledge, the first automatic decipherment of the second part of the Beale ciphers.Further, for the task of spelling correction, we work out the details of the EM algorithm [Dempster & Laird + 77] and experimentally show that the error rates achieved using purely unsupervised training reach those of supervised training.For handling large vocabularies, we introduce a novel model initialization as well as multiple training procedures that significantly speed up training without hurting the performance of the resulting models significantly.By incorporating an alignment model, we further extend this model such that it can be applied to the task of machine translation. We show that the true lexical and alignment model parameters can be learned without any labeled data: We experimentally show that the corresponding likelihood function attains its maximum for the true model parameters if a sufficient amount of unlabeled data is available. Further, for the problem of spelling correction with symbol substitutions and local swaps, we also show experimentally that the performance achieved with purely unsupervised EM training reaches that of supervised training. Finally, using the methods developed in this thesis, we present results on an unsupervised training task for machine translation with a ten times larger vocabulary than that of tasks investigated in previous work. Es laden ein: die Dozentinnen und Dozenten der Informatik _______________________________________________ -- -- Stephanie Jansen Faculty of Mathematics, Computer Science and Natural Sciences HLTPR - Human Language Technology and Pattern Recognition RWTH Aachen University Ahornstraße 55 D-52074 Aachen Tel. Frau Jansen: +49 241 80-216 06 Tel. Frau Andersen: +49 241 80-216 01 Fax: +49 241 80-22219 sek(a)i6.informatik.rwth-aachen.de www.hltpr.rwth-aachen.de Tel: +49 241 80-216 01/06 Fax: +49 241 80-22219 sek(a)i6.informatik.rwth-aachen.de www.hltpr.rwth-aachen.de

3 15

Einladung: Informatik-Oberseminar Andrea Schnorr
by Andrea Schnorr 03 Jul '21

03 Jul '21

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Freitag, 19. Februar 2021, 11.00 Uhr Zoom: https://rwth.zoom.us/j/2452218628 Referent: Andrea Schnorr, M.Sc. LuFG i12 Thema: Feature Tracking for Space-Filling Structures Abstract: Feature-based visualization is a proven strategy to deal with the massive amounts of data emerging from time-dependent simulations: the analysis focuses on meaningful structures, i.e., said features. Feature tracking algorithms aim at automatically finding corresponding objects in successive time steps of these time-dependent data sets in order to assemble the individual objects into spatio-temporal features. Classically, feature-based visualization has focused on sparse structures, i.e. structures which cover only a small portion of the data domain. Given a sufficiently high temporal resolution, existing tracking approaches are able to reliably resolve the correspondence between feature objects of successive time steps. Our research is motivated by our collaborators' work on the statistical analysis of structures that are space-filling by definition: dissipation elements. Space-filling structures partition the entire domain. Our collaborators aim at extending their statistical analysis to a time-dependent setting. Hence, we introduce an efficient approach for general feature tracking which handles both sparse and space-filling data. To this end, we develop a framework for automatic evaluation of tracking approaches, an algorithmic framework for feature tracking, and an efficient implementation of this framework. First, we propose a novel evaluation framework based on algorithmic data generators, which provide synthetic data sets and the corresponding ground truth data. This framework facilitates the structured quantitative analysis of an approach's feature tracking performance and the comparison of different approaches based on the resulting measurements. Second, we introduce a novel approach for tracking both sparse and space-filling features. The correspondence between neighboring time-steps is determined by successively solving two graph optimization problems. In the first phase, one-to-one assignments are resolved by computing a maximum-weight, maximum-cardinality matching on a bi-partite graph. In its second phase, the algorithm detects events by finding a maximum weight independent set in a graph of all possible, potentially conflicting event explanations. Third, we show an optimized version of the second stage of the tracking framework which exploits the model-specific graph structure arising for the tracking problem. The method's effectiveness is demonstrated by a set of case studies including the use of the evaluation framework as well as the analysis of miscellaneous real-world simulation data sets. Es laden ein: die Dozentinnen und Dozenten der Informatik

2 1

[infprof-l] Einladung Informatik-Oberseminar Philipp Weidel, December 15, 2020
by Abigail Morrison 02 Mar '21

02 Mar '21

********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Dienstag, 15. Dezember 2020, 10:00 Uhr Zoom: https://rwth.zoom.us/j/99233095930?pwd=dHhTV253V1ZYUzRtSkk1L3A1REZVUT09 Meeting-ID: 992 3309 5930 Kenncode: 626162 Referent: Philipp Weidel, Dipl. Inform. Thema: Learning and decision making in closed loop simulations of plastic spiking neural networks Abstract: To understand how animals and humans learn, form memories and make decisions is a highly relevant goal both for neuroscience and for fields that take some inspiration from neuroscience, such as machine learning and artificial intelligence. Many models of learning and decision making were developed in the fields of machine learning, artificial intelligence, and computational neuroscience. Although these models aim to describe similar mechanisms, they do not all pursue the same goal. These models can be differentiated between models aiming to reach optimal performance on a specific task (or set of tasks) and models trying to explain how animals and humans learn. Some models of the first class use biologically inspired methods (such as deep learning) but are usually not biologically realistic and are therefore not well suited to explain the function of the brain. Models in the second class focus on being biologically plausible to explain how the brain works, but often demonstrate their capability on too simplistic tasks and yield low performance on well-known tasks from machine learning. This work aims to close the gap between these two types of models. In the first part of this talk, tools are described that allow the combination of biologically plausible neural network models together with powerful toolkits known from machine learning and robotics. To this end, MUSIC, the middleware for spiking neural network simulators such as NEST and NEURON is interfaced with ROS, a middleware for robotic hardware and simulators such as Gazebo. This toolchain is extended with interfaces to reinforcement learning toolkits such as the OpenAI Gym. The second part addresses the question of how the brain can represent its environment in the neural substrate of the cortex and how a realistic model of reinforcement learning can make use of these representations. To this end, a spiking neural network model of unsupervised learning is presented which is able to learn its input projections such that it can detect and represent repeating patterns. By using an actor-critic reinforcement learning architecture driven by a realistic dopamine modulated plasticity rule the model can make use of the representations and learn a range tasks. Es laden ein: die Dozentinnen und Dozenten der Informatik -- Prof. Dr. Abigail Morrison IAS-6 / INM-6 / SimLab Neuroscience Jülich Research Center & Computer Science 3 - Software Engineering RWTH Aachen http://www.fz-juelich.de/inm/inm-6 http://www.fz-juelich.de/ias/jsc/slns http://www.se-rwth.de Office: +49 2461 61-9805 Fax # : +49 2461 61-9460 ------------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------------ Forschungszentrum Juelich GmbH 52425 Juelich Sitz der Gesellschaft: Juelich Eingetragen im Handelsregister des Amtsgerichts Dueren Nr. HR B 3498 Vorsitzender des Aufsichtsrats: MinDir Volker Rieke Geschaeftsfuehrung: Prof. Dr.-Ing. Wolfgang Marquardt (Vorsitzender), Karsten Beneke (stellv. Vorsitzender), Prof. Dr.-Ing. Harald Bolt ------------------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------------------

1 1

Einladung: Informatik-Kolloquium Christina Büsing
by Bolke-Hermanns, Helene-Maria 15 Feb '21

15 Feb '21

********************************************************************** * * * Einladung * * * * Informatik-Kolloquium * * * ********************************************************************** Zeit: Mittwoch, 24. Februar 2021, 16:15-17:00 Uhr Ort: https://rwth.zoom.us/j/98137553896?pwd=WmVnYmhKdXhrM0hjS3NvQy84SjcwUT09 Meeting ID: 981 3755 3896 Passcode: 395762 ********************************************************************** Vortragende: Christina Büsing (RWTH) Titel: Operational Planning for Mobile Medical Units Abstract: Mobile medical units allow for an efficient medical coverage of sparsely populated, spacious areas. Unfortunately, flexibility comes at the price of a highly complex operation planning process. We developed a multi-staged optimization approach for the operation of mobile medical units combining facility location, scheduling and routing problems. To determine our vehicle routes, we have to solve a budgeted matching problem on an edge colored graph, which we refer to as budgeted colored matching problem (BCM). We show the strong NP-hardness of the BCM on bipartite graphs with uniform edge weights, costs and budgets using a reduction from (3,B2)-SAT. On special graph classes, the BCM is solvable in pseudo-polynomial time. Finally, we evaluate the usage of mobile medical units in our model region situated in the northern Eifel. To assess the quality of solutions, we developed an agent-based simulation, which models the interaction between patients and general practitioners. Es laden ein: die Dozentinnen und Dozenten der Informatik **********************************************************************

1 0

Einladung: Informatik-Oberseminar Frau Sarah Suleri
by Leany Maaßen 09 Feb '21

09 Feb '21

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Donnerstag, 18. Februar 2021, 11:00-12:00 Uhr Zoom: https://rwth.zoom.us/j/92762889185?pwd=ZVdJV2o1bk13SlJCSDFRanB2TEYwUT09 Meeting-ID: 927 6288 9185 Kenncode: 725212 Referentin: Frau Sarah Suleri, M. Sc. Lehrstuhl Informatik 5 Thema: Impact of Technological Support on the Workload of Software Prototyping Abstract: Prototyping is a broadly utilized iterative technique for brainstorming, communicating, and evaluating user interface (UI) designs. This research aims to analyze this process from three aspects: traditional UI prototyping, rapid prototyping, and prototyping for accessibility. We propose three novel approaches and realize them by introducing three artifacts: 1) Eve, a sketch-based prototyping workbench that supports automation of transforming low fidelity prototypes to higher fidelities, 2) Kiwi, a UI design pattern and guidelines library to support UI design pattern-driven prototyping, 3) Personify, a persona-based UI design guidelines library for accessible UI prototyping. We evaluate the usability of these artifacts, and the results indicate good usability and learnability. Furthermore, we use NASA-TLX to study the impact of using these three novel approaches on the subjective workload experienced by the designers during the software prototyping process. This work aims to extend prior work on UI prototyping and is broadly applicable to understand the impact of using deep learning, UI design patterns, and personas on the workload of UI prototyping. Es laden ein: die Dozentinnen und Dozenten der Informatik _______________________________ Leany Maaßen RWTH Aachen University Lehrstuhl Informatik 5, LuFG Informatik 5 Prof. Dr. Stefan Decker, Prof. Dr. Matthias Jarke, Prof. Gerhard Lakemeyer Ph.D. Ahornstrasse 55 D-52074 Aachen Tel: 0241-80-21509 Fax: 0241-80-22321 E-Mail: maassen(a)dbis.rwth-aachen.de

1 0

Einladung: Informatik-Oberseminar Herr Gustavo Alejandro Aragón Cabrera
by Leany Maaßen 09 Feb '21

09 Feb '21

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Mittwoch, 24. Februar 2021, 15:00-16:00 Uhr Zoom: <https://rwth.zoom.us/j/95286199371?pwd=M3hCUWk3VER6WnE0RlZzQUFBVFMzdz09> https://rwth.zoom.us/j/95286199371?pwd=M3hCUWk3VER6WnE0RlZzQUFBVFMzdz09 Meeting-ID: 952 8619 9371 Kenncode: 424815 Referent: Herr Gustavo Alejandro Aragón Cabrera, M. Sc. Lehrstuhl Informatik 5 Thema: Extended Model Predictive Control Software Framework for Real-Time Local Management of Complex Energy Systems Abstract: Regarding the requirements of the future electrical grid due to high share of renewable distributed generation, smart energy management systems (EMS) are necessary to integrate the rapid development of ICT technologies and new sensor and actuator technologies. This thesis deals with the challenges of Model Predictive Control (MPC)-based EMS and introduces the concept of extended MPC framework that includes ICT aspects of the integration of new sensor and actuator technologies, forecasting methods, data management, flexible optimization model definition and solvers integration in consideration of user needs and deployment requirements in real systems. The extended MPC framework is validated through its deployment in three different use cases: as discrete and stochastic MPC in real test sites and linked to a power flow simulator. Es laden ein: die Dozentinnen und Dozenten der Informatik _______________________________ Leany Maaßen RWTH Aachen University Lehrstuhl Informatik 5, LuFG Informatik 5 Prof. Dr. Stefan Decker, Prof. Dr. Matthias Jarke, Prof. Gerhard Lakemeyer Ph.D. Ahornstrasse 55 D-52074 Aachen Tel: 0241-80-21509 Fax: 0241-80-22321 E-Mail: maassen(a)dbis.rwth-aachen.de

1 0

Einladung: Informatik-Oberseminar Anton Pirogov
by Anton Pirogov 02 Feb '21

02 Feb '21

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Donnerstag, 18. Februar 2021, 10:15 Uhr Ort: Zoom Videokonferenz Link: https://rwth.zoom.us/j/96519556069?pwd=MUVqbXpvZE5XVXBSdDNHZW5LMmJpQT09 Meeting-ID: 965 1955 6069 Kenncode: 482378 Referent: Anton Pirogov, M.Sc. Lehrstuhl Informatik 7 Thema: Determinization and Ambiguity of Classical and Probabilistic Büchi Automata Abstract: Büchi automata can be seen as a straight-forward generalization of ordinary NFA, adapted to handle infinite words. While they were originally introduced for applications in decidability of logics, they became a popular tool for practical applications, e.g. in automata-based approaches to model checking and synthesis problems. Being arguably both the simplest and most well-known variant in the zoo of so-called omega-automata that are considered in this setting, they serve as an intermediate representation of omega-regular specifications of verification or synthesis requirements that are usually expressed in a more declarative fashion, e.g. using linear temporal logic. Unfortunately, nondeterministic automata are not directly suitable for certain applications, whereas deterministic Büchi automata are less expressive. This problem is usually solved by either constructing deterministic automata of a different kind, or by restricting their ambiguity, i.e., the maximal number of accepting runs on some word. In both cases, the transformation is expensive, yielding an exponential blow-up of the state space in the worst case. Therefore, optimized constructions and heuristics for common special cases are useful and in demand for actual practical applications. In this talk we present a new general construction for determinization from nondeterministic Büchi to deterministic parity automata that unifies the dominant branches of previous approaches based on the Safra construction and the Muller-Schupp construction. Additionally, we sketch a number of new heuristics for determinization, some of which exploit properties of our unified construction. Apart from the classical nondeterministic and deterministic variants of automata, it is natural to consider probabilistic automata, i.e., automata that use a probability distribution on the states instead of nondeterminism to decide which state to go to next. It is known that in general, such automata are more expressive than classical automata and many decision problems are undecidable. We present subclasses of probabilistic automata that correspond to certain ambiguity classes and are not more expressive than classical automata. Es laden ein: die Dozentinnen und Dozenten der Informatik

1 0