TY - JOUR A1 - Baier, Thomas A1 - Mendling, Jan A1 - Weske, Mathias T1 - Bridging abstraction layers in process mining JF - Information systems N2 - While the maturity of process mining algorithms increases and more process mining tools enter the market, process mining projects still face the problem of different levels of abstraction when comparing events with modeled business activities. Current approaches for event log abstraction try to abstract from the events in an automated way that does not capture the required domain knowledge to fit business activities. This can lead to misinterpretation of discovered process models. We developed an approach that aims to abstract an event log to the same abstraction level that is needed by the business. We use domain knowledge extracted from existing process documentation to semi-automatically match events and activities. Our abstraction approach is able to deal with n:m relations between events and activities and also supports concurrency. We evaluated our approach in two case studies with a German IT outsourcing company. (C) 2014 Elsevier Ltd. All rights reserved. KW - Process mining KW - Abstraction KW - Event mapping Y1 - 2014 U6 - https://doi.org/10.1016/j.is.2014.04.004 SN - 0306-4379 SN - 1873-6076 VL - 46 SP - 123 EP - 139 PB - Elsevier CY - Oxford ER - TY - JOUR A1 - Blaese, Leif T1 - Data mining for unidentified protein squences JF - Process design for natural scientists: an agile model-driven approach N2 - Through the use of next generation sequencing (NGS) technology, a lot of newly sequenced organisms are now available. Annotating those genes is one of the most challenging tasks in sequence biology. Here, we present an automated workflow to find homologue proteins, annotate sequences according to function and create a three-dimensional model. Y1 - 2014 SN - 978-3-662-45005-5 SN - 1865-0929 IS - 500 SP - 73 EP - 87 PB - Springer CY - Berlin ER - TY - THES A1 - Fudickar, Sebastian T1 - Sub Ghz transceiver for indoor localisation of smartphones BT - Optimising localisation accuracy and device runtimes Y1 - 2014 ER - TY - JOUR A1 - Garoufi, Konstantina A1 - Koller, Alexander T1 - Generation of effective referring expressions in situated context JF - Language, cognition and neuroscience N2 - In task-oriented communication, references often need to be effective in their distinctive function, that is, help the hearer identify the referent correctly and as effortlessly as possible. However, it can be challenging for computational or empirical studies to capture referential effectiveness. Empirical findings indicate that human-produced references are not always optimally effective, and that their effectiveness may depend on different aspects of the situational context that can evolve dynamically over the course of an interaction. On this basis, we propose a computational model of effective reference generation which distinguishes speaker behaviour according to its helpfulness to the hearer in a certain situation, and explicitly aims at modelling highly helpful speaker behaviour rather than speaker behaviour invariably. Our model, which extends the planning-based paradigm of sentence generation with a statistical account of effectiveness, can adapt to the situational context by making this distinction newly for each new reference. We find that the generated references resemble those of effective human speakers more closely than references of baseline models, and that they are resolved correctly more often than those of other models participating in a shared-task evaluation with human hearers. Finally, we argue that the model could serve as a methodological framework for computational and empirical research on referential effectiveness. KW - natural language generation KW - reference KW - referential effectiveness Y1 - 2014 U6 - https://doi.org/10.1080/01690965.2013.847190 SN - 2327-3798 SN - 2327-3801 VL - 29 IS - 8 SP - 986 EP - 1001 PB - Routledge, Taylor & Francis Group CY - Abingdon ER - TY - THES A1 - Gericke, Lutz T1 - Tele-Board - Supporting and analyzing creative collaboration in synchronous and asynchronous scenario Y1 - 2014 ER - TY - JOUR A1 - Giese, Holger A1 - Hildebrandt, Stephan A1 - Lambers, Leen T1 - Bridging the gap between formal semantics and implementation of triple graph grammars JF - Software and systems modeling N2 - The correctness of model transformations is a crucial element for model-driven engineering of high-quality software. A prerequisite to verify model transformations at the level of the model transformation specification is that an unambiguous formal semantics exists and that the implementation of the model transformation language adheres to this semantics. However, for existing relational model transformation approaches, it is usually not really clear under which constraints particular implementations really conform to the formal semantics. In this paper, we will bridge this gap for the formal semantics of triple graph grammars (TGG) and an existing efficient implementation. While the formal semantics assumes backtracking and ignores non-determinism, practical implementations do not support backtracking, require rule sets that ensure determinism, and include further optimizations. Therefore, we capture how the considered TGG implementation realizes the transformation by means of operational rules, define required criteria, and show conformance to the formal semantics if these criteria are fulfilled. We further outline how static and runtime checks can be employed to guarantee these criteria. Y1 - 2014 U6 - https://doi.org/10.1007/s10270-012-0247-y SN - 1619-1366 SN - 1619-1374 VL - 13 IS - 1 SP - 273 EP - 299 PB - Springer CY - Heidelberg ER - TY - JOUR A1 - Hibbe, Marcel ED - Lambrecht, Anna-Lena ED - Margaria, Tiziana T1 - Spotlocator - Guess Where the Photo Was Taken! JF - Process Design for Natural Scientists: an agile model-driven approach N2 - Spotlocator is a game wherein people have to guess the spots of where photos were taken. The photos of a defined area for each game are from panoramio.com. They are published at http://spotlocator. drupalgardens.com with an ID. Everyone can guess the photo spots by sending a special tweet via Twitter that contains the hashtag #spotlocator, the guessed coordinates and the ID of the photo. An evaluation is published for all tweets. The players are informed about the distance to the real photo spots and the positions are shown on a map. Y1 - 2014 SN - 978-3-662-45005-5 SN - 1865-0929 IS - 500 SP - 149 EP - 160 PB - Springer Verlag CY - Berlin ER - TY - JOUR A1 - Holler, Robin T1 - GraffDok - a graffiti documentation application JF - Process design for natural scientists: an agile model-driven approach N2 - GraffDok is an application helping to maintain an overview over sprayed images somewhere in a city. At the time of writing it aims at vandalism rather than at beautiful photographic graffiti in an underpass. Looking at hundreds of tags and scribbles on monuments, house walls, etc. it would be interesting to not only record them in writing but even make them accessible electronically, including images. GraffDok’s workflow is simple and only requires an EXIF-GPS-tagged photograph of a graffito. It automatically determines its location by using reverse geocoding with the given GPS-coordinates and the Gisgraphy WebService. While asking the user for some more meta data, GraffDok analyses the image in parallel with this and tries to detect fore- and background – before extracting the drawing lines and make them stand alone. The command line based tool ImageMagick is used here as well as for accessing EXIF data. Any meta data is written to csv-files, which will stay easily accessible and can be integrated in TeX-files as well. The latter ones are converted to PDF at the end of the workflow, containing a table about all graffiti and a summary for each – including the generated characteristic graffiti pattern image. Y1 - 2014 SN - 978-3-662-45005-5 SN - 1865-0929 IS - 500 SP - 239 EP - 251 PB - Springer CY - Berlin ER - TY - JOUR A1 - Hoos, Holger A1 - Lindauer, Marius A1 - Schaub, Torsten H. T1 - claspfolio 2 BT - advances in algorithm selection for answer set programming JF - Theory and practice of logic programming N2 - Building on the award-winning, portfolio-based ASP solver claspfolio, we present claspfolio 2, a modular and open solver architecture that integrates several different portfolio-based algorithm selection approaches and techniques. The claspfolio 2 solver framework supports various feature generators, solver selection approaches, solver portfolios, as well as solver-schedule-based pre-solving techniques. The default configuration of claspfolio 2 relies on a light-weight version of the ASP solver clasp to generate static and dynamic instance features. The flexible open design of claspfolio 2 is a distinguishing factor even beyond ASP. As such, it provides a unique framework for comparing and combining existing portfolio-based algorithm selection approaches and techniques in a single, unified framework. Taking advantage of this, we conducted an extensive experimental study to assess the impact of different feature sets, selection approaches and base solver portfolios. In addition to gaining substantial insights into the utility of the various approaches and techniques, we identified a default configuration of claspfolio 2 that achieves substantial performance gains not only over clasp's default configuration and the earlier version of claspfolio, but also over manually tuned configurations of clasp. Y1 - 2014 U6 - https://doi.org/10.1017/S1471068414000210 SN - 1471-0684 SN - 1475-3081 VL - 14 SP - 569 EP - 585 PB - Cambridge Univ. Press CY - New York ER - TY - CHAP A1 - Kiy, Alexander A1 - Grünwald, Franka A1 - Zoerner, Dietmar A1 - Lucke, Ulrike ED - Trasch, Stephan ED - Plötzner, Rolf ED - Schneider, Gerhard ED - Sassiat, Daniel ED - Gayer, Claudia ED - Wöhrle, Nicole T1 - Ein Hochschul-App-Framework: Hybrid und modular T2 - DeLFI 2014 - Die 12. e-Learning Fachtagung Informatik Lecture Notes in Informatics N2 - Mobile Endgeräte und die dazugehörigen Applikationen sind zu einem unverzichtbaren Bestandteil des täglichen Lebens geworden und ermöglichen den ortsund zeitunabhängigen Zugriff auf wichtige Informationen. Hochschulspezifische An- gebote sind im mobilen Bereich hingegen noch immer nicht flächendeckend anzutreffen und lassen sich i. d. R. nur auf Einzelaktivitäten Studierender und Lehrender zurückführen. Dabei können mobile Applikationen einen essentiellen Beitrag zur Verbesserung der studentischen Selbstorganisation sowie für die Ausgestaltung und Ergänzung von konkreten Lehr-/Lernszenarien leisten. Dieser Artikel stellt ein modulares Hochschul-App-Framework vor, das sowohl zentrale campusbezogene Dienste als auch dezentrale Lernapplikationen unter einer Oberfläche vereint anbietet. Anhand einer Analyse von Stärken und Schwächen werden verschiedene Ansätze in Hinblick auf Anforderungen, Entwicklung, Wartung und Betrieb der Hochschul-App zusammengefasst und bewertet. Es wird auf die zugrundeliegende serviceorientierte Architektur eingegangen, die eine Portierung der Applikation auf andere Hochschulen mit einem vertretbaren Aufwand ermöglicht. Der Beitrag schließt mit einer Darstellung der ersten Ergebnisse und weiterführender Überlegungen und Arbeiten. Y1 - 2014 UR - https://subs.emis.de/LNI/Proceedings/Proceedings233/article18.html SN - 978-3-88579-627-5 IS - P-233 SP - 205 EP - 216 PB - Gesellschaft für Informatik e.V. CY - Bonn ER -