TY - JOUR TI - Verdeckte Agilität im Third Space : Projektkoordination zwischen lateraler Führung und struktureller Überforderung AU - Mrohs, Lorenz PY - 2026 SP - 54-60 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/117372 LA - deu AB - Project coordinators in the third space assume governance tasks in projectified higher education without formal authority. This contribution develops ‘hidden agility’ as an analytical concept for coordination practices that function in agile ways yet remain unrecognized as such in scholarly discourse. Based on 20 qualitative interviews, the analysis identifies agile practices (including lateral enablement, adaptive restructuring, and informal feedback loops) alongside structural role ambiguity. The findings suggest that agile coordination emerges in project work but is personally compensated by actors in precarious positions rather than institutionally anchored. Role ambiguity appears as both burden and enabling condition. Sustainable agile higher education management would require recognizing these roles as lasting infrastructure. KW - Hochschulmanagement KW - Hochschulentwicklung KW - Third Space KW - Projektkoordination ER - TY - JOUR TI - Verdeckte Agilität im Third Space : Projektkoordination zwischen lateraler Führung und struktureller Überforderung AU - Mrohs, Lorenz PY - 2026 JO - Hochschulmanagement : HM VL - 21 IS - 2/3 SP - 54-60 PB - Universitätsverlag Webler CY - Bielefeld SN - 1860-3025 UR - https://fis.uni-bamberg.de/handle/uniba/117388 LA - deu AB - Project coordinators in the third space assume governance tasks in projectified higher education without formal authority. This contribution develops ‘hidden agility’ as an analytical concept for coordination practices that function in agile ways yet remain unrecognized as such in scholarly discourse. Based on 20 qualitative interviews, the analysis identifies agile practices (including lateral enablement, adaptive restructuring, and informal feedback loops) alongside structural role ambiguity. The findings suggest that agile coordination emerges in project work but is personally compensated by actors in precarious positions rather than institutionally anchored. Role ambiguity appears as both burden and enabling condition. Sustainable agile higher education management would require recognizing these roles as lasting infrastructure. KW - Hochschulmanagement KW - Hochschulentwicklung KW - Third Space KW - Projektkoordination ER - TY - JOUR TI - Smart City Science : Forschung neu denken (Workshop-Bericht) AU - Ebner, Katharina AU - Nicklas, Daniela AU - Redepenning, Marc AU - Wimmer, Maria A. PY - 2026 SP - 165-172 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/117292 LA - deu AB - Die Forschung zu Smart Cities wurde bisher aus verschiedenen disziplinären Perspektiven wissenschaftlich aufgearbeitet. Getrieben durch die eingeschränkte Erkenntnisbreite sowie Transferfähigkeit dieser disziplinären Sichtweise verfolgen viele jüngere Smart-City-Forschungsansätze inter- oder sogar transdisziplinäre Forschungsansätze. Es zeigt sich dabei jedoch zunehmend, dass eine übergreifende, inter- und transdisziplinäre Strategie zur systematischen Weiterentwicklung des Forschungsfeldes Smart Cities fehlt. Daher bleiben viele Projekterfolge lokal begrenzt auf die teilnehmenden Partnerstädte und Universitäten bzw. beteiligten Disziplinen; die Möglichkeiten eines breiten Erkenntnistransfers werden nicht ausgeschöpft. Finanziert durch die VolkswagenStiftung trafen sich daher vom 4.–6. Februar 2026 28 Personen aus Wissenschaft und Praxis zu einem Scoping Workshop unter dem Titel „Smart City Science: Forschung neu denken“. Ziel des Workshops war es, gemeinsame Forschungsperspektiven und Empfehlungen für die Wissenschaftspolitik zu erarbeiten. Aufbauend auf verschiedenen interaktiven, erfahrungsbasierten und Kreativ-Workshoptechniken setzten sich die Teilnehmenden damit auseinander, ob Forschung im Kontext von Smart Cities ein eigenes Forschungsgebiet oder nur eine weitere Anwendungsdomäne ist und welche Faktoren zu erfolgreichen Smart-City-Projekten führen – sowohl bezüglich der Forschung (reproduzierbarer Erkenntnisgewinn) als auch der Stadtentwicklung (z. B. Steigerung der Lebensqualität im urbanen Kontext). Dazu wurden bekannte Forschungsprobleme interdisziplinär neu gedacht und mit Hilfe der Methode „Appreciative Inquiry“ eine Zukunftsvision für Wissenschaft, Politik und Praxis diskutiert: die Smart City Science (SCiS). KW - Smart City Science KW - Urban Transformation KW - Methodology KW - Policy Advice ER - TY - JOUR TI - Smart City Science : Forschung neu denken (Workshop-Bericht) AU - Ebner, Katharina AU - Nicklas, Daniela AU - Redepenning, Marc AU - Wimmer, Maria A. PY - 2026 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V. VL - 26 IS - 2 SP - 165-172 PB - Springer CY - Berlin ; Heidelberg SN - 1610-1995 DO - 10.1007/s13222-026-00551-x UR - https://fis.uni-bamberg.de/handle/uniba/117291 LA - deu AB - Die Forschung zu Smart Cities wurde bisher aus verschiedenen disziplinären Perspektiven wissenschaftlich aufgearbeitet. Getrieben durch die eingeschränkte Erkenntnisbreite sowie Transferfähigkeit dieser disziplinären Sichtweise verfolgen viele jüngere Smart-City-Forschungsansätze inter- oder sogar transdisziplinäre Forschungsansätze. Es zeigt sich dabei jedoch zunehmend, dass eine übergreifende, inter- und transdisziplinäre Strategie zur systematischen Weiterentwicklung des Forschungsfeldes Smart Cities fehlt. Daher bleiben viele Projekterfolge lokal begrenzt auf die teilnehmenden Partnerstädte und Universitäten bzw. beteiligten Disziplinen; die Möglichkeiten eines breiten Erkenntnistransfers werden nicht ausgeschöpft. Finanziert durch die VolkswagenStiftung trafen sich daher vom 4.–6. Februar 2026 28 Personen aus Wissenschaft und Praxis zu einem Scoping Workshop unter dem Titel „Smart City Science: Forschung neu denken“. Ziel des Workshops war es, gemeinsame Forschungsperspektiven und Empfehlungen für die Wissenschaftspolitik zu erarbeiten. Aufbauend auf verschiedenen interaktiven, erfahrungsbasierten und Kreativ-Workshoptechniken setzten sich die Teilnehmenden damit auseinander, ob Forschung im Kontext von Smart Cities ein eigenes Forschungsgebiet oder nur eine weitere Anwendungsdomäne ist und welche Faktoren zu erfolgreichen Smart-City-Projekten führen – sowohl bezüglich der Forschung (reproduzierbarer Erkenntnisgewinn) als auch der Stadtentwicklung (z. B. Steigerung der Lebensqualität im urbanen Kontext). Dazu wurden bekannte Forschungsprobleme interdisziplinär neu gedacht und mit Hilfe der Methode „Appreciative Inquiry“ eine Zukunftsvision für Wissenschaft, Politik und Praxis diskutiert: die Smart City Science (SCiS). KW - Smart City Science KW - Urban Transformation KW - Methodology KW - Policy Advice ER - TY - JOUR TI - Data Engineering for Horizon-Aware Smart Parking Systems AU - Ostadi, Ali AU - Das, Debasree AU - Elmamooz, Golnaz AU - Nicklas, Daniela PY - 2026 SP - 155-164 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/117289 LA - eng AB - Accurate short-term parking availability forecasting is an important component of intelligent transportation systems. While numerous machine learning and deep learning models have been proposed, most approaches rely on a single predictor and implicitly assume uniform performance across forecast horizons, despite evidence that accuracy varies with lead time. This paper presents a systematic evaluation of multi-step (1–24 h) parking availability forecasting using sensor-based occupancy data from two urban parking facilities. We show that different model classes exhibit complementary strengths at different horizons, with no single model consistently achieving the lowest error across the full forecast range. To address this limitation, we propose a horizon-aware hybrid forecasting approach that combines two complementary base models using validation-driven weighted blending. Two variants are considered: a Global Weighted Blend with a shared weight and a Local Weighted Blend with horizon-specific weights. Experimental results show that both hybrid approaches outperform individual baseline models, with the Local Weighted Blend achieving the best overall performance across all evaluation metrics. These findings demonstrate that horizon-aware blending provides a simple and effective strategy for improving multi-step parking availability forecasts. As an outlook, we propose a context-aware, adaptive model-management architecture for sensor-based smart city systems. KW - Parking availability forecasting KW - Multi-step time series forecasting KW - Horizon-aware forecasting KW - Machine learning KW - Deep learning KW - Decision support systems ER - TY - JOUR TI - Data Engineering for Horizon-Aware Smart Parking Systems AU - Ostadi, Ali AU - Das, Debasree AU - Elmamooz, Golnaz AU - Nicklas, Daniela PY - 2026 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V. VL - 26 IS - 2 SP - 155-164 PB - Springer CY - Berlin ; Heidelberg SN - 1610-1995 DO - 10.1007/s13222-026-00544-w UR - https://fis.uni-bamberg.de/handle/uniba/117287 LA - eng AB - Accurate short-term parking availability forecasting is an important component of intelligent transportation systems. While numerous machine learning and deep learning models have been proposed, most approaches rely on a single predictor and implicitly assume uniform performance across forecast horizons, despite evidence that accuracy varies with lead time. This paper presents a systematic evaluation of multi-step (1–24 h) parking availability forecasting using sensor-based occupancy data from two urban parking facilities. We show that different model classes exhibit complementary strengths at different horizons, with no single model consistently achieving the lowest error across the full forecast range. To address this limitation, we propose a horizon-aware hybrid forecasting approach that combines two complementary base models using validation-driven weighted blending. Two variants are considered: a Global Weighted Blend with a shared weight and a Local Weighted Blend with horizon-specific weights. Experimental results show that both hybrid approaches outperform individual baseline models, with the Local Weighted Blend achieving the best overall performance across all evaluation metrics. These findings demonstrate that horizon-aware blending provides a simple and effective strategy for improving multi-step parking availability forecasts. As an outlook, we propose a context-aware, adaptive model-management architecture for sensor-based smart city systems. KW - Parking availability forecasting KW - Multi-step time series forecasting KW - Horizon-aware forecasting KW - Machine learning KW - Deep learning KW - Decision support systems ER - TY - CPAPER TI - Configuring Agentic AI Coding Tools : An Exploratory Study AU - Galster, Matthias AU - Mohsenimofidi, Seyedmoein AU - Lulla, Jai Lal AU - Abubakar, Muhammad Auwal AU - Treude, Christoph AU - Baltes, Sebastian PY - 2026 SP - 11-20 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/116537 LA - eng AB - Agentic AI coding tools increasingly automate software development tasks. Developers can configure these tools through versioned repository-level artifacts such as Markdown and JSON files. We present a systematic analysis of configuration mechanisms for agentic AI coding tools, covering Claude Code, GitHub Copilot, Cursor, Gemini, and Codex. We identify eight configuration mechanisms spanning from static context to executable and external integrations and, in an empirical study of 2,853 GitHub repositories, examine whether and how they are adopted, with a detailed analysis of Context Files, Skills, and Subagents. First, Context Files dominate the configuration landscape and are often the sole mechanism in a repository, with AGENTS.md emerging as an interoperable standard across tools. Second, few repositories adopt advanced mechanisms such as Skills and Subagents. Skills predominantly rely on static instructions rather than executable scripts. Third, distinct configuration practices are forming around different tools, with Claude Code users employing the broadest range of mechanisms. These findings establish an empirical baseline for understanding how developers configure agentic tools, suggest that AGENTS.md serves as a natural starting point, and motivate longitudinal and experimental research on how configuration strategies evolve and affect agent performance. KW - Software Engineering KW - Generative AI KW - AI Agents KW - Configuration ER - TY - CPAPER TI - Configuring Agentic AI Coding Tools : An Exploratory Study AU - Galster, Matthias AU - Mohsenimofidi, Seyedmoein AU - Lulla, Jai Lal AU - Abubakar, Muhammad Auwal AU - Treude, Christoph AU - Baltes, Sebastian PY - 2026 T2 - Proceedings of the 3rd ACM International Conference on AI-Powered Software SP - 11-20 PB - ACM CY - New York SN - 979-8-4007-2601-9 DO - 10.1145/3805760.3814887 UR - https://fis.uni-bamberg.de/handle/uniba/116536 LA - eng AB - Agentic AI coding tools increasingly automate software development tasks. Developers can configure these tools through versioned repository-level artifacts such as Markdown and JSON files. We present a systematic analysis of configuration mechanisms for agentic AI coding tools, covering Claude Code, GitHub Copilot, Cursor, Gemini, and Codex. We identify eight configuration mechanisms spanning from static context to executable and external integrations and, in an empirical study of 2,853 GitHub repositories, examine whether and how they are adopted, with a detailed analysis of Context Files, Skills, and Subagents. First, Context Files dominate the configuration landscape and are often the sole mechanism in a repository, with AGENTS.md emerging as an interoperable standard across tools. Second, few repositories adopt advanced mechanisms such as Skills and Subagents. Skills predominantly rely on static instructions rather than executable scripts. Third, distinct configuration practices are forming around different tools, with Claude Code users employing the broadest range of mechanisms. These findings establish an empirical baseline for understanding how developers configure agentic tools, suggest that AGENTS.md serves as a natural starting point, and motivate longitudinal and experimental research on how configuration strategies evolve and affect agent performance. KW - Software Engineering KW - Generative AI KW - AI Agents KW - Configuration ER - TY - CPAPER TI - A Dataset of Agentic AI Coding Tool Configurations AU - Galster, Matthias AU - Mohsenimofidi, Seyedmoein AU - Böhme, Levi AU - Lulla, Jai Lal AU - Abubakar, Muhammad Auwal AU - Treude, Christoph AU - Baltes, Sebastian PY - 2026 SP - 314-322 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/116535 LA - eng AB - Agentic AI coding tools such as Claude Code and OpenAI Codex execute multi-step coding tasks with limited human oversight. To steer these tools, developers create repository-level configuration artifacts (e.g., Markdown files) for configuration mechanisms such as Context Files, Skills, Rules, and Hooks. There is no curated dataset yet that captures these configurations at scale. This dataset, collected from open-source GitHub repositories, fills that gap. We selected 40,585 actively maintained repositories through metadata filtering, classified them using GPT-5.2 to identify 36,710 as belonging to engineered software projects, and systematically detected configuration artifacts in these repositories. The dataset covers 4,738 repositories across five tools (Claude Code, GitHub Copilot, OpenAI Codex, Cursor, Gemini) and eight configuration mechanisms. We collected 15,591 configuration artifacts, the full content of 18,167 configuration files associated with these configuration artifacts, and 148,519 AI-co-authored commits. The dataset and the construction pipeline are publicly available on Zenodo under CC BY 4.0. An interactive website allows researchers to browse and explore the data. This data supports research on context engineering, AI tool adoption patterns, and human-AI collaboration. KW - Software Engineering KW - Generative AI KW - AI Agents KW - Configuration ER - TY - CPAPER TI - A Dataset of Agentic AI Coding Tool Configurations AU - Galster, Matthias AU - Mohsenimofidi, Seyedmoein AU - Böhme, Levi AU - Lulla, Jai Lal AU - Abubakar, Muhammad Auwal AU - Treude, Christoph AU - Baltes, Sebastian PY - 2026 T2 - Proceedings of the 3rd ACM International Conference on AI-Powered Software SP - 314-322 PB - ACM CY - New York SN - 979-8-4007-2601-9 DO - 10.1145/3805760.3814922 UR - https://fis.uni-bamberg.de/handle/uniba/116534 LA - eng AB - Agentic AI coding tools such as Claude Code and OpenAI Codex execute multi-step coding tasks with limited human oversight. To steer these tools, developers create repository-level configuration artifacts (e.g., Markdown files) for configuration mechanisms such as Context Files, Skills, Rules, and Hooks. There is no curated dataset yet that captures these configurations at scale. This dataset, collected from open-source GitHub repositories, fills that gap. We selected 40,585 actively maintained repositories through metadata filtering, classified them using GPT-5.2 to identify 36,710 as belonging to engineered software projects, and systematically detected configuration artifacts in these repositories. The dataset covers 4,738 repositories across five tools (Claude Code, GitHub Copilot, OpenAI Codex, Cursor, Gemini) and eight configuration mechanisms. We collected 15,591 configuration artifacts, the full content of 18,167 configuration files associated with these configuration artifacts, and 148,519 AI-co-authored commits. The dataset and the construction pipeline are publicly available on Zenodo under CC BY 4.0. An interactive website allows researchers to browse and explore the data. This data supports research on context engineering, AI tool adoption patterns, and human-AI collaboration. KW - Software Engineering KW - Generative AI KW - AI Agents KW - Configuration ER - TY - CPAPER TI - Going deep and going wide : Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth AU - Adler, Isolde AU - Fluck, Eva AU - Seppelt, Tim AU - Spitzer, Gian Luca PY - 2026 SP - 33:1–33:48 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115964 LA - eng AB - We study the expressive power of first-order logic with counting quantifiers, especially the k-variable and quantifier-rank-q fragment, using homomorphism indistinguishability. Recently, Dawar, Jakl, and Reggio~(2021) proved that two graphs satisfy the same k-variable and quantifier-rank-q sentences if and only if they are homomorphism indistinguishable over the class of graphs admitting a k-pebble forest cover of depth q. After reproving this result using elementary means, we provide a graph-theoretic analysis of this graph class. This allows us to separate it from the intersection of the class of all graphs of treewidth at most k−1 and the class of all graphs of treedepth at most q, provided that q is sufficiently larger than k. We are able to lift this separation to a (semantic) separation of the respective homomorphism indistinguishability relations. We do this by showing that the graph classes of all graphs of treedepth at most q and of graphs admitting a k-pebble forest cover of depth q are homomorphism distinguishing closed, as conjectured by Roberson~(2022). In order to prove Roberson's conjecture for the class of graphs admitting a k-pebble forest cover of depth q we characterise the class in terms of a monotone Cops-and-Robber game.The crux is to prove that if Cop has a winning strategy then Cop also has a winning strategy that is monotone.To that end, we show how to transform Cop's winning strategy into a pre-tree-decomposition, which is inspired by decompositions of matroids, and then applying an intricate breadth-first `cleaning up' procedure along the pre-tree-decomposition (which may temporarily lose the property of representing a strategy), in order to achieve monotonicity while controlling the number of rounds simultaneously across all branches of the decomposition via a vertex exchange argument. KW - Logic in Computer Science KW - Discrete Mathematics KW - Combinatorics ER - TY - CHAP TI - Spannungsfelder in Projekten : Herausforderungen bei der Steuerung und Koordination innovationsbezogener Hochschulprojekte AU - Mrohs, Lorenz PY - 2026 SP - 19-35 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115962 LA - deu AB - Drittmittelprojekte haben sich neben der Forschungsorganisation als neue Form der Hochschulentwicklung etabliert. Trotzdem ist bisher empirisch nicht umfassend geklärt, wie Projekte an Hochschulen organisiert sind, gesteuert werden und welche Rolle Projektkoordinator*innen darin spielen. In diesem Beitrag werden Ergebnisse einer qualitativen Studie vorgestellt, in der 20 Projektkoordinator*innen aus Forschungs- und Entwicklungsprojekten an der Schnittstelle von Digitalisierung und Hochschullehre befragt wurden. Dabei zeigen sich verschiedene Spannungsfelder hinsichtlich der Steuerung und Koordination innovationsbezogener Hochschulprojekte. Sie beziehen sich auf die Rolle der Projektkoordination, die Formen der Zusammenarbeit und die Folgen der Veränderungsimpulse der Projekte in den Hochschulen. Sie geben Aufschluss über die Konstitution, Steuerung und Wirkung von Projekten als temporäre Organisationen im Hochschulkontext. KW - Hochschulprojekte ER - TY - CPAPER TI - Going deep and going wide : Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth AU - Adler, Isolde AU - Fluck, Eva AU - Seppelt, Tim AU - Spitzer, Gian Luca PY - 2026 VL - 22 IS - 2 SP - 33:1–33:48 PB - Erlangen SN - 1860-5974 DO - 10.46298/lmcs-22(2:33)2026 UR - https://fis.uni-bamberg.de/handle/uniba/115889 LA - eng AB - We study the expressive power of first-order logic with counting quantifiers, especially the k-variable and quantifier-rank-q fragment, using homomorphism indistinguishability. Recently, Dawar, Jakl, and Reggio~(2021) proved that two graphs satisfy the same k-variable and quantifier-rank-q sentences if and only if they are homomorphism indistinguishable over the class of graphs admitting a k-pebble forest cover of depth q. After reproving this result using elementary means, we provide a graph-theoretic analysis of this graph class. This allows us to separate it from the intersection of the class of all graphs of treewidth at most k−1 and the class of all graphs of treedepth at most q, provided that q is sufficiently larger than k. We are able to lift this separation to a (semantic) separation of the respective homomorphism indistinguishability relations. We do this by showing that the graph classes of all graphs of treedepth at most q and of graphs admitting a k-pebble forest cover of depth q are homomorphism distinguishing closed, as conjectured by Roberson~(2022). In order to prove Roberson's conjecture for the class of graphs admitting a k-pebble forest cover of depth q we characterise the class in terms of a monotone Cops-and-Robber game.The crux is to prove that if Cop has a winning strategy then Cop also has a winning strategy that is monotone.To that end, we show how to transform Cop's winning strategy into a pre-tree-decomposition, which is inspired by decompositions of matroids, and then applying an intricate breadth-first `cleaning up' procedure along the pre-tree-decomposition (which may temporarily lose the property of representing a strategy), in order to achieve monotonicity while controlling the number of rounds simultaneously across all branches of the decomposition via a vertex exchange argument. KW - Logic in Computer Science KW - Discrete Mathematics KW - Combinatorics ER - TY - CHAP TI - Spannungsfelder in Projekten : Herausforderungen bei der Steuerung und Koordination innovationsbezogener Hochschulprojekte AU - Mrohs, Lorenz PY - 2026 T2 - Lernkulturen in der Digitalität gestalten SP - 19-35 PB - Waxmann CY - Münster SN - 978-3-8188-0153-3 DO - 10.31244/9783818851538 UR - https://fis.uni-bamberg.de/handle/uniba/115854 LA - deu AB - Drittmittelprojekte haben sich neben der Forschungsorganisation als neue Form der Hochschulentwicklung etabliert. Trotzdem ist bisher empirisch nicht umfassend geklärt, wie Projekte an Hochschulen organisiert sind, gesteuert werden und welche Rolle Projektkoordinator*innen darin spielen. In diesem Beitrag werden Ergebnisse einer qualitativen Studie vorgestellt, in der 20 Projektkoordinator*innen aus Forschungs- und Entwicklungsprojekten an der Schnittstelle von Digitalisierung und Hochschullehre befragt wurden. Dabei zeigen sich verschiedene Spannungsfelder hinsichtlich der Steuerung und Koordination innovationsbezogener Hochschulprojekte. Sie beziehen sich auf die Rolle der Projektkoordination, die Formen der Zusammenarbeit und die Folgen der Veränderungsimpulse der Projekte in den Hochschulen. Sie geben Aufschluss über die Konstitution, Steuerung und Wirkung von Projekten als temporäre Organisationen im Hochschulkontext. KW - Hochschulprojekte ER - TY - CPAPER TI - Standing out among the daily spam : How to catch website owners’ attention by means of vulnerability notifications AU - Hennig, Anne AU - Neusser, Fabian AU - Pawelek, Aleksandra Alicja AU - Herrmann, Dominik AU - Mayer, Peter PY - 2026 SP - 1-8 PB - Otto-Friedrich-Universität CY - Bamberg SN - 978-1-4503-9156-6 UR - https://fis.uni-bamberg.de/handle/uniba/115844 LA - eng AB - Running a business without having a website is nearly impossible nowadays. Most business owners use content managements systems to manage their websites. Yet, those can pose security risks and provide vulnerabilities for manipulations. With vulnerability notifcations, website owners are notifed about security risks. To identify common themes with respect to vulnerability notifcations and provide deeper insight into the motivations of website owners to react to those notifcations, we conducted 25 semi-structured interviews. In compliance with previous research, we could confrm that distrust in unexpected notifcations is high and, in contrast to previous research, we suggest that verifcation possibilities are the most important factors to establish trust in notifcations. We also endorse the fndings that raising awareness for the severity and the complexity of the problems is crucial to increase remediation rates. KW - web security KW - CMS vulnerabilities KW - vulnerability notifcation KW - security awareness ER - TY - THES TI - Cloud-native Software Architecture Evaluation : A Quality Model and its Practical Applicability AU - Lichtenthäler, Robin PY - 2026 PB - University of Bamberg Press CY - Bamberg T3 - Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg SN - 978-3-98989-116-6 DO - 10.20378/irb-114696 UR - https://fis.uni-bamberg.de/handle/uniba/114696 LA - eng AB - Cloud-native is used as a term in industry and academia for describing how software should be built in order to run in cloud environments properly. The usage and popularity of the term leads to the desire to build web-based enterprise applications in a cloud-native way to benefit from the advantages of modern cloud environments. However, due to the complexity of modern cloud environments, cloud-native spans a broad range of aspects from the design of an application's structure and communication to the selected deployment technologies and infrastructure. Thus, understanding thoroughly what a cloud-native application design means and deciding how a specific application can benefit from cloud-native patterns and characteristics, is challenging for software architects and developers. This work presents the formulation and validation of a hierarchical quality model for cloud-native software architectures focusing on design time aspects. Cloud-native characteristics are formulated as factors for the quality model and linked to quality aspects through impact relationships. An impact describes how a quality aspect is influenced, if a factor is present in a system. Together with the quality model, a modeling approach for cloud-native software architectures and the Clounaq tool was developed. The Clounaq tool offers software architects a model-based method for designing and evaluating software architectures based on the quality model. For the evaluation approach, architectural measures quantify the factors of the quality model. Software architects and developers can thus better understand consequences of cloud-native characteristics and evaluate for new or existing applications, how the application architecture design can benefit from cloud-native characteristics. The resulting quality model captures the topic of cloud-native software architectures from a quality-focused point of view. It explains how applications can be built in a cloud-native way to achieve certain benefits. Through the characterization in the form of a quality model, software architects can evaluate and prioritize which cloud-native characteristics are relevant and applicable to a certain application at hand. The presented modeling approach demonstrates how core aspects of cloud-native software architectures can be represented in a formal textual and a graphical notation. The Clounaq tool includes implemented calculations for the catalog of architectural measures aligned with the modeling approach and can thus be used by practitioners and researchers for future work on cloud-native software architectures. KW - cloud-native ER - TY - CPAPER TI - Is Personalization Worth It? : Notifying Blogs about a Privacy Issue Resulting from Poorly Implemented Consent Banners AU - Kriecherbauer, Theresa AU - Schwank, Richard AU - Krauss, Adrian AU - Neureither, Konstantin AU - Remme, Lian AU - Volkamer, Melanie AU - Herrmann, Dominik PY - 2026 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115315 LA - eng AB - Several websites integrate trackers without users’ consent. Previous research studied whether notifying responsible website operators about such issues is an effective measure, often with limited success. Insights from marketing research suggest that personalizing notification emails may be an effective means to improve remediation rates, with previous research pointing in both directions. We studied this approach using a sample of 119 German fitness and sports blogs employing Google Analytics (GA) without user consent: In a first step, we compare the fix rate of blog operators that received a personalized notification tailored to their blog with the fix rate of operators that received a generic notification. We find that personalized notifications do neither increase remediation rate nor operators’ response behavior. In a second step, we analyzed the reasons not to fix mentioned in (A) the email responses and (B) a survey sent to the blog operators. We find that they mostly center around (I) denial that a data leak exists, (II) a lack of resources to remedy the issue and (III) claims of specifically requiring GA. We hypothesize that an additional reason not to fix could be the so-called moral credentials phenomenon and sketch how to study that in future work. KW - GDPR KW - Human Factors in Privacy KW - Notification Study KW - Personalization ER - TY - CPAPER TI - Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth AU - Adler, Isolde AU - Fluck, Eva PY - 2026 SP - 1-18 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115222 LA - eng AB - We study a variation of the cops and robber game characterising treewidth, where in each play at most q cops can be placed in order to catch the robber, where q is a parameter of the game. We prove that if k cops have a winning strategy in this game, then k cops have a monotone winning strategy. As a corollary we obtain a new characterisation of bounded depth treewidth, and we give a positive answer to an open question by Fluck, Seppelt and Spitzer (2024), thus showing that graph classes of bounded depth treewidth are homomorphism distinguishing closed. Our proof of monotonicity substantially reorganises a winning strategy by first transforming it into a pre-decomposition, which is inspired by decompositions of matroids, and then applying an intricate breadth-first ‘cleaning up’ procedure along the pre-decomposition (which may temporarily lose the property of representing a strategy), in order to achieve monotonicity while controlling the number of cop placements simultaneously across all branches of the decomposition via a vertex exchange argument. We believe this can be useful in future research. KW - tree decompositions KW - treewidth KW - treedepth KW - cops-and-robber game KW - monotonicity KW - homomorphism distinguishing closure ER - TY - JOUR TI - Project VoLL-KI : Learning from Learners AU - Kohlhase, Michael AU - Berges, Marc AU - Grubert, Jens AU - Landes, Dieter AU - Leidner, Jochen L. AU - Henrich, Andreas AU - Mittag, Florian AU - Nicklas, Daniela AU - Schmid, Ute Maria AU - Sedlmaier, Yvonne AU - Ulbrich-vom Ende, Achim AU - Wolter, Diedrich PY - 2026 VL - 39 SP - 299–309 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115195 LA - eng AB - “Learning from Learners” (“Von Lernenden Lernen”, “VoLL-KI ” for short) is a is collaborative research project with the goal of creating a practical toolbox of instruments at diferent levels of abstraction to improve the learning experience and outcomes for students of artifcial intelligence. Learning and teaching at tertiary education institutions are currently ITbased but not AI-supported. The VoLL-KI project aims to go this crucial next step. Using AI approaches (e.g., ML, symbolic AI, statistical AI), several educational technologies are developed on the diferent granularity of the study programs (e.g., course, semester, program). So, dashboards for study planning, recommender systems improving student advisory services and learning material selection, VR-based learning experiences, educational chatbots, and adaptive learning environments are developed. The systems are mostly deployed as prototypes KW - Computer-aided education KW - Intelligent tutoring systems KW - Teaching support for artifcial intelligence education KW - Computer-aided learning (CAL) KW - Data-driven learning quality management KW - Study course monitoring KW - Learning analytics ER - TY - JOUR TI - Editorial AU - Schüle, Maximilian E. AU - Klettke, Meike AU - Störl, Uta PY - 2026 SP - 183-186 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115103 LA - deu ER - TY - CPAPER TI - Back to the Roots : Decision Trees within Modern Database Systems AU - Wolfschmidt, Lena Renate AU - Schüle, Maximilian Emanuel PY - 2026 SP - 687-695 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115101 LA - eng AB - HUK-COBURG relies on decision trees to classify e-mails into topics. As the data is stored within relational database systems, this paper investigates the performance improvement of in-database evaluation of decision trees. The paper first summarises the theory behind binary decision trees, then describes the implementation as SQL case-when statements. The evaluation shows the benefit of the in-database application of decision trees by eliminating expensive extraction-transform-load time. In the future, we intend to optimise the training as well as inference of decision trees in SQL to fully eliminate the need for data extraction. ER - TY - JOUR TI - Coordination modes in higher education management : a qualitative–reconstructive typology from German higher education development projects AU - Mrohs, Lorenz PY - 2026 SP - 1-10 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/114980 LA - eng AB - This study reconstructs a typology of coordination modes in the university third space, drawing on externally funded HE development projects at German universities. It asks how project coordinators enact steering and which ideal-typical coordination modes can be identified. Previous research on third-space roles and projectification describes the growing relevance of hybrid management positions in HEIs yet lacks an empirically grounded typology specifying steering orientations and forms of embeddedness. Conceptualising project coordination as a governance resource, the study proposes two analytical dimensions structuring a four-mode typology. Drawing on 20 qualitative guideline interviews and reconstructive ideal-type comparison, it derives four modes with distinct role self-understandings, instrument repertoires and decision pathways. The typology refines understanding of managerial roles in the third space and offers guidance for integrating such positions into HE governance, with implications for systems where projectification is salient. KW - Projektkoordination KW - Hochschulentwicklung KW - Wissenschaftsmanagement KW - Third Space KW - Typologie ER - TY - JOUR TI - Coordination modes in higher education management : a qualitative–reconstructive typology from German higher education development projects AU - Mrohs, Lorenz PY - 2026 JO - Perspectives : policy and practice in higher education IS - Online First SP - 1-10 PB - Taylor & Francis CY - Abingdon SN - 1460-7018 DO - 10.1080/13603108.2026.2668073 UR - https://fis.uni-bamberg.de/handle/uniba/114981 LA - eng AB - This study reconstructs a typology of coordination modes in the university third space, drawing on externally funded HE development projects at German universities. It asks how project coordinators enact steering and which ideal-typical coordination modes can be identified. Previous research on third-space roles and projectification describes the growing relevance of hybrid management positions in HEIs yet lacks an empirically grounded typology specifying steering orientations and forms of embeddedness. Conceptualising project coordination as a governance resource, the study proposes two analytical dimensions structuring a four-mode typology. Drawing on 20 qualitative guideline interviews and reconstructive ideal-type comparison, it derives four modes with distinct role self-understandings, instrument repertoires and decision pathways. The typology refines understanding of managerial roles in the third space and offers guidance for integrating such positions into HE governance, with implications for systems where projectification is salient. KW - Projektkoordination KW - Hochschulentwicklung KW - Wissenschaftsmanagement KW - Third Space KW - Typologie ER - TY - CPAPER TI - BTW 2025 Early Career Researcher Workshop : Message from the Chairs AU - Das, Debasree AU - Nicklas, Daniela AU - Adler, Isolde PY - 2026 SP - 391-392 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/114466 LA - eng AB - - KW - - ER - TY - JOUR TI - Flexibilisierung von Konferenzformaten : Perspektiven auf Inverted-Classroom-Tagungen AU - Mrohs, Lorenz AU - Witt, Theresia AU - Pensel, Marisa AU - Schlosser, Anne PY - 2026 SP - 605–619 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/113262 LA - deu AB - Der Beitrag vergleicht Konferenzerfahrungen von Teilnehmenden einer InvertedClassroom-Tagung mit Präsenztagungen. Während die Perspektive der Teilnehmenden bei ‚klassischen‘ Formaten untersucht wurde, fehlt es an Einblicken wie Tagungsteilnehmende ‚moderne‘ Konferenzformate bewerten. Im Fokus steht die Frage, welche Unterschiede zwischen den verschiedenen Formaten wahrgenommen werden. Dafür wurden Teilnehmende (N = 81) einer Inverted-Classroom-Tagung befragt. Die Ergebnisse geben Einblicke in die Perspektive der Teilnehmenden und zeigen am Beispiel von Inverted-Classroom-Tagungen, dass Abweichungen von klassischen Tagungsformaten positiv bewertet werden. KW - Inverted-Classroom-Tagung KW - flipped conference KW - wissenschaftliche Tagung KW - Online-Konferenz KW - hybride Konferenz KW - inverted-classroom conference KW - flipped conference KW - academic conference KW - online conference KW - hybrid conference ER - TY - BOOK TI - Räume der Hochschullehre : Bildungsorte für die Zukunft ED - Mrohs, Lorenz ED - Herrmann, Carmen ED - Brodel, Hannah ED - Franz, Julia ED - Herrmann, Dominik ED - Hess, Miriam ED - Lindner, Konstantin PY - 2026 PB - transcript CY - Bielefeld ET - 1 SN - 978-3-8376-6436-2 UR - https://fis.uni-bamberg.de/handle/uniba/114266 LA - deu ER - TY - JOUR TI - Interdisziplinäre Zusammenarbeit in Innovationsräumen : Herausforderungen am Beispiel hochschulischer Lehrentwicklungsprojekte AU - Mrohs, Lorenz AU - Brodel, Hannah PY - 2026 SP - 236-245 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/113210 LA - deu AB - Interdisziplinäre Zusammenarbeit gilt als zentrale Herausforderung in vielen Forschungsprojekten und ist entsprechend breit diskutiert. Deutlich weniger Beachtung findet bislang die Kooperation in hochschulischen Lehrentwicklungsprojekten, die als Innovationsräume fungieren und auf strukturelle Veränderungen an Hochschulen abzielen. Dieser Beitrag untersucht solche Konstellationen anhand einer qualitativen Interviewstudie mit 20 Projektkoordinator:innen aus drittmittelfinanzierten Entwicklungsprojekten. Die Ergebnisse zeigen, dass sich insbesondere für Hochschulentwicklungsprojekte zwei Besonderheiten ergeben, die auf die Interdisziplinarität der Projektgruppe und die strukturellen Einflüsse der Hochschule zurückzuführen sind. Abschließend sollen Handlungsempfehlungen aus einem diskursiven Workshop-Format für eine erfolgreiche Zusammenarbeit in Projekten gegeben werden. KW - Hochschulentwicklung KW - Interdisziplinarität KW - Konflikte KW - Innovationen KW - Projekte KW - Higher education development KW - interdisciplinarity KW - conflicts KW - innovations KW - projects ER - TY - JOUR TI - Projects as Agile Innovation Spaces? : (Un-) Intended Effects in HE Development AU - Mrohs, Lorenz PY - 2026 SP - 23-41 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/113023 LA - eng AB - In higher education institutions (HEIs), projects are becoming increasingly recognised as agile innovation spaces that facilitate innovation and implement structural change. However, little is known about how innovation-related projects affect structural transformation. This study analyses 20 qualitative interviews with coordinators of digitalization-related HE development projects. The findings indicate that both intended effects and unintended challenges influence the institutionalisation of innovations. Despite these tensions, projects function as agile structures and can serve as pivotal steering instruments in HE development and its academic governance. KW - projects KW - agile innovation KW - academic governance KW - higher education management KW - higher education development KW - Projekte KW - Agilität KW - Innovationen KW - Hochschulforschung KW - Hochschulentwicklung ER - TY - JOUR TI - Interdisziplinäre Zusammenarbeit in Innovationsräumen : Herausforderungen am Beispiel hochschulischer Lehrentwicklungsprojekte AU - Mrohs, Lorenz AU - Brodel, Hannah PY - 2026 JO - Die Hochschullehre VL - 12 IS - 22 SP - 236-245 PB - wbv Media GmbH & Co. KG CY - Bielefeld SN - 2199-8825 DO - 10.3278/hsl2622w UR - https://fis.uni-bamberg.de/handle/uniba/112892 LA - deu AB - Interdisziplinäre Zusammenarbeit gilt als zentrale Herausforderung in vielen Forschungsprojekten und ist entsprechend breit diskutiert. Deutlich weniger Beachtung findet bislang die Kooperation in hochschulischen Lehrentwicklungsprojekten, die als Innovationsräume fungieren und auf strukturelle Veränderungen an Hochschulen abzielen. Dieser Beitrag untersucht solche Konstellationen anhand einer qualitativen Interviewstudie mit 20 Projektkoordinator:innen aus drittmittelfinanzierten Entwicklungsprojekten. Die Ergebnisse zeigen, dass sich insbesondere für Hochschulentwicklungsprojekte zwei Besonderheiten ergeben, die auf die Interdisziplinarität der Projektgruppe und die strukturellen Einflüsse der Hochschule zurückzuführen sind. Abschließend sollen Handlungsempfehlungen aus einem diskursiven Workshop-Format für eine erfolgreiche Zusammenarbeit in Projekten gegeben werden. KW - Hochschulentwicklung KW - Interdisziplinarität KW - Konflikte KW - Innovationen KW - Projekte KW - Higher education development KW - interdisciplinarity KW - conflicts KW - innovations KW - projects ER - TY - GEN TI - Die Hochschullehre : interdisziplinäre Zeitschrift für Studium und Lehre PY - 2026 VL - 12 IS - Räumliche Perspektiven hochschulischer Bildungskulturen PB - wbv Media GmbH & Co. KG CY - Bielefeld SN - 2199-8825 DO - 10.3278/hslt2602w UR - https://fis.uni-bamberg.de/handle/uniba/112645 LA - deu ER - TY - CPAPER TI - Challenges for Federated Crowd Management in Smart Cities AU - Nicklas, Daniela AU - Ackermann, Leonie AU - Das, Debasree AU - Amano, Tatsuya AU - Rizk, Hamada AU - Yamaguchi, Hirozumi PY - 2026 SP - 126–131 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/112571 LA - eng AB - This paper addresses the issue of crowd management in smart cities, where effectively handling large groups is essential for ensuring safety and a positive experience for all. Although smart cities strive to use data for better decision-making, simply measuring crowds is not enough; cities must analyze and utilize this data intelligently. In this paper, we leverage the various experiences of two research groups in this area and present a vision that allows cities to easily establish crowd management platforms by transferring knowledge and insights from similar use cases in other cities. KW - Smart City KW - Crowd Monitoring KW - Federated Learning ER - TY - CPAPER TI - Challenges for Federated Crowd Management in Smart Cities AU - Nicklas, Daniela AU - Ackermann, Leonie AU - Das, Debasree AU - Amano, Tatsuya AU - Rizk, Hamada AU - Yamaguchi, Hirozumi PY - 2026 T2 - ICDCN Companion '26: Companion Proceedings of the 27th International Conference on Distributed Computing and Networking SP - 126–131 PB - Association for Computing Machinery CY - New York SN - 979-8-4007-1969-1 DO - 10.1145/3737611.3776621 UR - https://fis.uni-bamberg.de/handle/uniba/112409 LA - eng AB - This paper addresses the issue of crowd management in smart cities, where effectively handling large groups is essential for ensuring safety and a positive experience for all. Although smart cities strive to use data for better decision-making, simply measuring crowds is not enough; cities must analyze and utilize this data intelligently. In this paper, we leverage the various experiences of two research groups in this area and present a vision that allows cities to easily establish crowd management platforms by transferring knowledge and insights from similar use cases in other cities. KW - Smart City KW - Crowd Monitoring KW - Federated Learning ER - TY - CPAPER TI - The Complexity of Cyber Security in Private and Professional Everyday Life : An Ethnographic-Informatic Collaborative Approach AU - Pöhls, Henrich C. AU - Eckhardt, Dennis AU - Feist, Nelli AU - Pfeiffer, Sabine AU - Herrmann, Dominik AU - Katzenbeisser, Stefan PY - 2025 T2 - HCI for cybersecurity, privacy and trust : 7th international conference, HCI-CPT 2025 : held as part of the 27th HCI International Conference, HCII 2025, Gothenburg, Sweden, June 22-27, 2025 : proceedings, Part I SP - 105-124 PB - Springer CY - Cham SN - 9783031928321 UR - https://fis.uni-bamberg.de/handle/uniba/116731 LA - eng ER - TY - CPAPER TI - DeSiRe-NG : An Architecture for Autonomous and Assisted 5G Network Measurement and Emulation AU - Welzel, Simon AU - Fliedner, Niels Hendrik AU - Friesen, Maxim AU - Tismer, Christian AU - Mildner, Philip AU - Rizvi, Syed Abdullah AU - Noack, Claudius AU - Dalhoff, Lukas AU - Trsek, Henning AU - Klingler, Florian PY - 2025 T2 - 2025 IEEE 21st International Conference on Factory Communication Systems (WFCS), proceedings SP - 1-8 PB - IEEE DO - 10.1109/wfcs63373.2025.11077649 UR - https://fis.uni-bamberg.de/handle/uniba/116239 LA - eng ER - TY - CPAPER TI - Does One Noise Fit All? : Analyzing Utility in Transportation Mode-Based Anonymization AU - Das, Debasree AU - Rafiq, Rahat AU - Nicklas, Daniela PY - 2025 T2 - Proceedings of the 2025 IEEE International Conference on Smart Computing (SMARTCOMP) SP - 216-218 PB - IEEE SN - 979-8-3315-8646-1 DO - 10.1109/smartcomp65954.2025.00042 UR - https://fis.uni-bamberg.de/handle/uniba/112890 LA - eng ER - TY - GEN TI - Data Quality Processing in Data Streaming Environments : A Literature Review AU - Benabbas, Aboubakr AU - Nicklas, Daniela PY - 2025 SP - 1-9 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-112076 UR - https://fis.uni-bamberg.de/handle/uniba/112076 LA - eng AB - The increasing reliance on real-time analytics and sensor-driven systems has elevated the importance of maintaining high data quality in streaming environments. This literature review provides an overview of data quality (DQ) concepts, representations, and processing techniques tailored to continuous data streams. It traces the evolution of data quality from early database systems to modern big data and streaming contexts, emphasizing intrinsic, representational, and contextual quality dimensions such as accuracy, completeness, consistency, and timeliness. The paper reviews major DQ models, metrics, and standards, highlighting methods for assessing and improving quality in sensor-based and high-velocity data systems. Furthermore, it examines state-of-the-art data cleaning, fault detection, and anomaly management approaches, identifying their limitations in flexibility and generalizability. As a literature review, it synthesizes key foundational and recent contributions rather than providing an exhaustive systematic survey. The literature was analyzed through targeted review of seminal and recent works focusing on peer-reviewed contributions to DQ models, metrics, and processing techniques. Finally, the study discusses emerging trends such as adaptive, pattern-based, and AI-driven quality processing toward building accessible, real-time, and domain-independent frameworks for quality-aware data stream management. KW - Data Quality KW - DQ Dimensions KW - DQ Metrics KW - sensor data streams KW - quality-aware stream processing KW - Data Stream Management Systems ER - TY - CPAPER TI - Leveraging Gaussian Noise for Balancing Differential Privacy Guarantees and Utility in Mobility Reports AU - Steger, Lina AU - Ackermann, Leonie AU - Das, Debasree AU - Kapp, Alexandra AU - Nicklas, Daniela PY - 2025 T2 - 2025 IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events (PerCom Workshops) SP - 489-494 PB - IEEE DO - 10.1109/percomworkshops65533.2025.00114 UR - https://fis.uni-bamberg.de/handle/uniba/112298 LA - eng ER - TY - CPAPER TI - On the Generation of Invalid Objects for Inferring More Precise Class Invariants AU - Boockmann, Jan Henrik AU - Jacob, Kerstin AU - Lüttgen, Gerald PY - 2025 T2 - Software Engineering and Formal Methods : 23rd International Conference, SEFM 2025, Toledo, Spain, November 10–14, 2025, Proceedings SP - 148-156 PB - Springer Nature Switzerland CY - Cham T3 - Lecture Notes in Computer Science SN - 9783032104434 DO - 10.1007/978-3-032-10444-1_9 UR - https://fis.uni-bamberg.de/handle/uniba/112155 LA - eng ER - TY - CPAPER TI - Recovering Test-To-Code Trace Links via Program Mutation AU - Jacob, Kerstin AU - Lüttgen, Gerald PY - 2025 T2 - 2025 IEEE International Conference on Software Analysis, Evolution and Reengineering - Companion (SANER-C) SP - 166-173 PB - IEEE Computer Society CY - Los Alamitos, CA, USA DO - 10.1109/saner-c66551.2025.00032 UR - https://fis.uni-bamberg.de/handle/uniba/112156 LA - eng ER - TY - JOUR TI - Projects as Agile Innovation Spaces? : (Un-) Intended Effects in HE Development AU - Mrohs, Lorenz PY - 2025 JO - Zeitschrift für Hochschulentwicklung VL - 20 IS - 4 SP - 23-41 PB - ÖGHD CY - Wien SN - 2219-6994 DO - 10.21240/zfhe/20-4/01 UR - https://fis.uni-bamberg.de/handle/uniba/112081 LA - eng AB - In higher education institutions (HEIs), projects are becoming increasingly recognised as agile innovation spaces that facilitate innovation and implement structural change. However, little is known about how innovation-related projects affect structural transformation. This study analyses 20 qualitative interviews with coordinators of digitalization-related HE development projects. The findings indicate that both intended effects and unintended challenges influence the institutionalisation of innovations. Despite these tensions, projects function as agile structures and can serve as pivotal steering instruments in HE development and its academic governance. KW - projects KW - agile innovation KW - academic governance KW - higher education management KW - higher education development KW - Projekte KW - Agilität KW - Innovationen KW - Hochschulforschung KW - Hochschulentwicklung ER - TY - CHAP TI - Klausur-Booklets zur Stärkung von Methodenkompetenzen und zur Reduktion von Prokrastination AU - Herrmann, Dominik PY - 2025 SP - 169-180 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/111943 LA - deu AB - Semesterbegleitendes Mitlernen scheitert oft an fehlender Methodenkompetenz und der Neigung zur Prokrastination. Klausur-Booklets versprechen Abhilfe: Dabei erlauben Lehrende ihren Studierenden, semesterbegleitend bis zu 15 handschriftliche Notizzettel anzufertigen und als Hilfsmittel in der Prüfung zu nutzen. Klausur-Booklets überwinden die Nachteile von Open-Book-Klausuren und anderen Anreizsystemen wie Midterm Exams und Bonuspunkten. Sie üben einen starken Anreiz auf die Studierenden aus, können die Prüfungskultur verbessern und lassen sich basierend auf den bisherigen organisatorischen und technischen Erfahrungen gut umsetzen. Vor diesem Hintergrund erscheint es sinnvoll, der Vermittlung von Methodenkompetenz in bestehenden Lehrveranstaltungen mehr Raum zu geben. KW - Anreizsystem KW - erlaubtes Hilfsmittel KW - kompetenzorientierte Prüfungen KW - Hochschullehre KW - incentive system KW - allowed aid KW - competency-based examinations KW - higher education ER - TY - CPAPER TI - DuoLingo-AutoDiff : In-Database Automatic Differentiation with MLIR AU - Gutjahr, Kevin AU - Ruck, Clemens AU - Schüle, Maximilian E. PY - 2025 SP - 1-8 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/111827 LA - eng AB - Forward and reverse mode automatic differentiation evaluate the gradient of a model function efficiently by caching the results of partial derivatives. Just-in-time compilation improves the runtime of automatic differentiation by eliminating function calls and storing partial derivatives in virtual registers. This paper discusses the first open-source implementation of automatic differentiation with MLIR and LingoDB. The evaluation compares optimizations applied to forward and reverse modes. It showed that sub-expressions, that appear frequently within the calculation, will be reused after MLIR performs its optimization. Additionally, reverse mode outperforms forward mode due to less generated code. KW - Automatic Diferentiation KW - In-Database Machine Learning KW - Query Compilation KW - MLIR ER - TY - CPAPER TI - DuoLingo-AutoDiff : In-Database Automatic Differentiation with MLIR AU - Gutjahr, Kevin AU - Ruck, Clemens AU - Schüle, Maximilian E. PY - 2025 T2 - DEEM '25: Proceedings of the Workshop on Data Management for End-to-End Machine Learning SP - 1-8 PB - ACM CY - New York SN - 979-8-4007-1924-0 DO - 10.1145/3735654.3735943 UR - https://fis.uni-bamberg.de/handle/uniba/111824 LA - eng AB - Forward and reverse mode automatic differentiation evaluate the gradient of a model function efficiently by caching the results of partial derivatives. Just-in-time compilation improves the runtime of automatic differentiation by eliminating function calls and storing partial derivatives in virtual registers. This paper discusses the first open-source implementation of automatic differentiation with MLIR and LingoDB. The evaluation compares optimizations applied to forward and reverse modes. It showed that sub-expressions, that appear frequently within the calculation, will be reused after MLIR performs its optimization. Additionally, reverse mode outperforms forward mode due to less generated code. KW - Automatic Diferentiation KW - In-Database Machine Learning KW - Query Compilation KW - MLIR ER - TY - JOUR TI - Training and Validating a Machine Learning Model for the Sensor-Based Monitoring of Lying Behavior in Dairy Cows on Pasture and in the Barn AU - Schmeling, Lara AU - Elmamooz, Golnaz AU - Hoang, Phan Thai AU - Kozar, Anastasiia AU - Nicklas, Daniela AU - Sünkel, Michael AU - Thurner, Stefan AU - Rauch, Elke PY - 2025 SP - 1-25 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/109633 LA - eng AB - Monitoring systems assist farmers in monitoring the health of dairy cows by predicting behavioral patterns (e.g., lying) and their changes with machine learning models. However, the available systems were developed either for indoors or for pasture and fail to predict the behavior in other locations. Therefore, the goal of our study was to train and evaluate a model for the prediction of lying on a pasture and in the barn. On three farms, 7–11 dairy cows each were equipped with the prototype of the monitoring system containing an accelerometer, a magnetometer and a gyroscope. Video observations on the pasture and in the barn provided ground truth data. We used 34.5 h of datasets from pasture for training and 480.5 h from both locations for evaluating. In comparison, random forest, an orientation-independent feature set with 5 s windows without overlap, achieved the highest accuracy. Sensitivity, specificity and accuracy were 95.6%, 80.5% and 87.4%, respectively. Accuracy on the pasture (93.2%) exceeded accuracy in the barn (81.4%). Ruminating while standing was the most confused with lying. Out of individual lying bouts, 95.6 and 93.4% were identified on the pasture and in the barn, respectively. Adding a model for standing up events and lying down events could improve the prediction of lying in the barn. KW - behavior recognition KW - classification KW - precision livestock farming KW - accelerometer KW - gyroscope KW - grazing ER - TY - CPAPER TI - Comprehending Object State via Dynamic Class Invariant Learning AU - Boockmann, Jan H. AU - Lüttgen, Gerald PY - 2025 SP - 143-164 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/111406 LA - eng AB - Maintaining software is cumbersome when method argument constraints are undocumented. To reveal them, previous work learned preconditions from exemplary valid and invalid method arguments. In practice, it would be highly beneficial to know class invariants, too, because functionality added during software maintenance must not break them. Even more so than method preconditions, class invariants are rarely documented and often cannot completely be inferred automatically, especially for objects exhibiting complex state such as dynamic data structures. This paper presents a novel dynamic approach to learning class invariants, thereby complementing related work on learning method preconditions. We automatically synthesize assertions from an adjustable assertion grammar to distinguish valid and invalid objects. While random walks generate valid objects, a combination of bounded-exhaustive testing techniques and behavioral oracles yield invalid objects. The utility of our approach for code comprehension and software maintenance is demonstrated by comparing our learned invariants to documented invariant validation methods found in real-world Java classes and to the invariants detected by the Daikon tool. KW - Dynamic Class Invariant Learning ER - TY - CPAPER TI - SWTbahn : An Embedded Software Demonstrator in Symbiosis with Embedded Software Education AU - Luedtke, Bernhard M. AU - Yip, Eugene AU - Lüttgen, Gerald PY - 2025 SP - 77-82 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/111403 LA - eng AB - Demonstrators, such as model railways, are effective in providing real-world examples that help students to grasp abstract concepts in the engineering of embedded software. Although building such a demonstrator yourself can appear overwhelming, we argue how building your own improves your teaching of embedded software. We report on how we have achieved these improvements with a development process that lets our teaching co-evolve with our own demonstrator, share our main lessons learned, and invite educators to discuss remaining challenges. KW - model railway demonstrator KW - evolutionary development KW - embedded software ER - TY - CPAPER TI - Fast Pathfinding in Knowledge Graphs Using Word Embeddings AU - Martin, Leon AU - Boockmann, Jan H. AU - Henrich, Andreas PY - 2025 SP - 305-312 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture Notes in Computer Science UR - https://fis.uni-bamberg.de/handle/uniba/106396 LA - eng AB - Knowledge graphs, which model relationships between entities, provide a rich and structured source of information. Currently, search engines aim to enrich their search results by structured summaries, e.g., obtained from knowledge graphs, that provide further information on the entity of interest. While single entity summaries are available already, summaries on the relations between multiple entities have not been studied in detail so far. Such queries can be understood as a pathfinding problem. However, the large size of public knowledge graphs, such as Wikidata, as well as the large indegree of its major entities, and the problem of concept drift impose major challenges for standard search algorithms in this context. In this paper, we propose a bidirectional pathfinding approach for directed knowledge graphs that uses the semantic distance between entity labels, which is approximated using word vectors, as a search heuristics in a parameterized A*-like evaluation function in order to find meaningful paths between two entities fast. We evaluate our approach using different parameters against a set of selected within- and cross-domain queries. The results indicate that our approach generally needs to explore fewer entities compared to its uninformed counterpart and qualitatively yields more meaningful paths. KW - Knowledge graphs KW - Word embeddings KW - Pathfinding ER - TY - CHAP TI - Diversität braucht Digitalität? : Eine Verhältnisbestimmung in der Organisation Hochschule AU - Mrohs, Lorenz PY - 2025 SP - 27-45 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/110844 LA - deu AB - Sowohl Digitalisierung als auch Diversität zählen derzeit zu den zentralen strategischen Zukunftsaufgaben von Hochschulen. Im Hochschulkontext werden die beiden Themenfelder jedoch häufig getrennt voneinander betrachtet und ihre Verschränkungen nur punktuell thematisiert. Im Sinne einer integrativen Hochschulentwicklung gilt es, die beiden Themenfelder stärker zusammenzudenken und einen genaueren Blick auf die Verschränkung von Digitalitäts und Diversitätsfragen zu werfen. Dieser Beitrag greift ausgewählte Aspekte auf, die für eine produktive Bearbeitung dieses Themenkomplexes relevant sind. Dabei wird mit einer organisationstheoretischen Brille das Verhältnis dieser beiden Zukunftsaufgaben in der Organisation Hochschule betrachtet. KW - Diversität; Digitalität KW - Digitalität KW - Hochschule KW - Universität KW - Organisationen KW - Innovationen KW - Diversity KW - Digitality KW - Higher education KW - University KW - Organisations KW - innovations ER - TY - JOUR TI - The Missing Link in Network Intrusion Detection : taking AI/ML Research Efforts to Users AU - Dietz, Katharina AU - Mühlhauser, Michael AU - Kögel, Jochen AU - Schwinger, Stephan AU - Sichermann, Marleen AU - Seufert, Michael AU - Herrmann, Dominik AU - Hoßfeld, Tobias PY - 2025 SP - 79815-79837 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/110350 LA - deu AB - Intrusion Detection Systems (IDS) tackle the challenging task of detecting network attacks as fast as possible. As this is getting more complex in modern enterprise networks, Artificial Intelligence (AI) and Machine Learning (ML) have gained substantial popularity in research. However, their adoption into real-world IDS solutions remains poor. Academic research often overlooks the interconnection of users and technical aspects. This leads to less explainable AI/ML models that hinder trust among AI/ML non-experts. Additionally, research often neglects secondary concerns such as usability and privacy. If IDS approaches conflict with current regulations or if administrators cannot deal with attacks more effectively, enterprises will not adopt the IDS in practice. To identify those problems systematically, our literature survey takes a user-centric approach; we examine IDS research from the perspective of stakeholders by applying the concept of personas. Further, we investigate multiple factors limiting the adoption of AI/ML in security and suggest technical, non-technical, and user-related considerations to enhance the adoption in practice. Our key contributions are threefold. (i) We derive personas from realistic enterprise scenarios, (ii) we provide a set of relevant hypotheses in the form of a review template, and (iii), based on our reviews, we derive design guidelines for practical implementations. To the best of our knowledge, this is the first paper that analyzes practical adoption barriers of AI/ML-based intrusion detection solutions concerning appropriateness of data, reproducibility, explainability, practicability, usability, and privacy. Our guidelines may help researchers to holistically evaluate their AI/ML-based IDS approaches to increase practical adoption. KW - Anomaly detection KW - artifcial intelligence KW - intrusion detection KW - machine learning KW - network monitoring KW - privacy KW - security KW - usability ER - TY - CHAP TI - Digitale Kulturen der Lehre entwickeln : einleitende Verortungen AU - Mrohs, Lorenz AU - Herrmann, Dominik AU - Franz, Julia AU - Lindner, Konstantin AU - Staake, Thorsten PY - 2025 SP - 1-6 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/110328 LA - deu AB - Der Beitrag führt vor dem Hintergrund der Theorie der Kultur der Digitalität (Felix Stalder) in den vorliegenden Sammelband ein und wendet diesen theoretischen Rahmen auf Hochschulen und die Entwicklung der Hochschullehre an. Es werden die zentralen Strukturbedingungen umrissen und davon ausgehend Erfordernisse für die Entwicklung einer Kultur der Digitalität an der Universität Bamberg skizziert, die im Rahmen des Projekts „Digitale Kulturen der Lehre entwickeln (DiKuLe)“ beforscht und entwickelt werden. Abschließend gibt der Beitrag einen Ausblick auf die Beiträge des Sammelbandes, die neue Konzepte, Gestaltungsmöglichkeiten und Evaluationsergebnisse digitaler Lehr-Lernarrangements vorstellen. KW - Lehre ER - TY - CPAPER TI - Into the Unknown : UAV Navigation with F-Star (F*) AU - Fischer, Tobias AU - Shaik, Zubair AU - Mitschele-Thiel, Andreas AU - Klingler, Florian PY - 2025 T2 - 2025 IEEE 50th Conference on Local Computer Networks (LCN) SP - 1-6 PB - IEEE DO - 10.1109/lcn65610.2025.11146339 UR - https://fis.uni-bamberg.de/handle/uniba/110872 LA - eng ER - TY - CPAPER TI - BTW 2025 Early Career Researcher Workshop : Message from the Chairs AU - Das, Debasree AU - Nicklas, Daniela AU - Adler, Isolde PY - 2025 T2 - Datenbanksysteme für Business, Technologie und Web - Workshopband (BTW 2025) SP - 391-392 CY - Bonn DO - 10.18420/BTW2025-144 UR - https://fis.uni-bamberg.de/handle/uniba/108756 LA - eng AB - - KW - - ER - TY - JOUR TI - Perspectives on Negative Research Results in Pervasive Computing AU - Peltonen, Ella AU - Mohan, Nitinder AU - Zdankin, Peter AU - Shreedhar, Tanya AU - Nguyen, Tri AU - Bayhan, Suzan AU - Crowcroft, Jon AU - Kangasharju, Jussi AU - Nicklas, Daniela PY - 2025 SP - 63-72 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/108500 LA - eng AB - Not all research leads to fruitful results; trying new ways or methods may surpass state of the art, but sometimes the hypothesis is not proven, the improvement is insignificant, or the system fails because of a design error done years ago in previous works. In a systems discipline like pervasive computing, there are many sources of errors, from hardware issues over communication channels to heterogeneous software environments. However, failure to succeed is not a failure to progress. It is essential to create platforms for sharing insights, experiences, and lessons learned when conducting research in pervasive computing so that the same mistakes are not repeated. And sometimes, a problem is a symptom of discovering new research challenges. Based on the collective input of the First International Workshop on Negative Results in Pervasive Computing (PerFail 2022), co-located with the 20th International Conference on Pervasive Computing and Communications (PerCom 2022), this article presents a comprehensive discussion on perspectives on publishing negative results, useful failures, and lessons learned in pervasive computing. KW - Pervasive computing KW - Surveys KW - Sensors KW - Prototypes KW - Ecosystems KW - Behavioral sciences KW - Writing KW - Research initiatives ER - TY - CPAPER TI - ResoMeter : ein Softwarewerkzeug zur Planung mobiler Messungen AU - Högerl, Jakob AU - Lierheimer, Tobias AU - Ackermann, Leonie AU - Nicklas, Daniela AU - Foken, Thomas ED - Ziemann, Astrid ED - Goldberg, Valeri PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-106891 UR - https://fis.uni-bamberg.de/handle/uniba/106891 LA - deu AB - Für die Planung mobiler Messkampagnen ist es wichtig, abhängig vom Messystem die Messfrequenz festzulegen, um eine gewünschte räumliche Auflösung zu erreichen. Die räumliche Auflösung bei mobilen Messungen hängt vom Messgerät (Zeitkonstante), dem mobilen Messsystem (Geschwindigkeit), der Änderung der meteorologischen Variablen und dem akzeptierten Messfehler ab. Das vorgestellte Softwarewerkzeug berechnet aus diesen Eingangsgrößen die mögliche räumliche Auflösung. Ebenso können zu einer angestrebten räumlichen Auflösung mögliche Kombinationen von Messsystemen und Messgeräten ausgegeben werden. Das Softwarewerkzeug wurde mit Flutter entwickelt und kann somit auf unterschiedlichen Plattformen eingesetzt werden. Es kann auf der Konferenz live demonstriert werden. Die verwendeten Algorithmen basieren auf VDI 3785-2 (Mobile Messungen) und unterstützt somit die Anwendung dieser Richtlinie. KW - Mobile Messungen KW - Umweltmeteorologie KW - Softwareanwendung ER - TY - JOUR TI - The Duck’s Brain : Training and Inference of Neural Networks within Database Engines AU - Schüle, Maximilian AU - Neumann, Thomas AU - Kemper, Alfons PY - 2025 SP - 209-221 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/107115 LA - eng AB - Although database systems perform well in data access and manipulation, their relational model hinders data scientists from formulating machine learning algorithms in SQL. Nevertheless, we argue that modern database systems perform well for machine learning algorithms expressed in relational algebra. To overcome the barrier of the relational model, this paper shows how to transform data into a coordinate relational representation for training neural networks in SQL: We first describe building blocks for data transformation, model training and inference in SQL-92 and their counterparts using an extended array data type. Then, we compare the implementation for model training and inference using array data types to the one using a coordinate relational representation in SQL-92 only. The evaluation in terms of runtime and memory consumption proves the suitability of modern database systems for matrix algebra, although specialised array data types perform better than matrices in coordinate relational representation. KW - SQL-92 KW - Neural Networks KW - Automatic Differentiation KW - In-Memory Database Systems KW - Machine Learning ER - TY - CPAPER TI - Softwarewerkzeug zur Planung mobiler Messungen AU - Högerl, Jakob AU - Lierheimer, Tobias AU - Ackermann, Leonie AU - Nicklas, Daniela AU - Foken, Thomas PY - 2025 SP - 60 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106977 LA - deu AB - Für die Planung mobiler Messkampagnen ist es wichtig, abhängig vom Messystem die Messfrequenz festzulegen, um eine gewünschte räumliche Auflösung zu erreichen. Die räumliche Auflösung bei mobilen Messungen hängt vom Messgerät (Zeitkonstante), dem mobilen Messsystem (Geschwindigkeit), der Änderung der meteorologischen Variablen und dem akzeptierten Messfehler ab. Das vorgestellte Softwarewerkzeug berechnet aus diesen Eingangsgrößen die mögliche räumliche Auflösung. Ebenso können zu einer angestrebten räumlichen Auflösung mögliche Kombinationen von Messsystemen und Messgeräten ausgegeben werden. Das Softwarewerkzeug wurde mit Flutter entwickelt und kann somit auf unterschiedlichen Plattformen eingesetzt werden. Es kann auf der Konferenz live demonstriert werden. Die verwendeten Algorithmen basieren auf VDI 3785-2 (Mobile Messungen) und unterstützt somit die Anwendung dieser Richtlinie. KW - Mobile Messungen KW - Umweltmeteorologie KW - Softwareanwendung ER - TY - JOUR TI - Flexibilisierung von Konferenzformaten : Perspektiven auf Inverted-Classroom-Tagungen AU - Mrohs, Lorenz AU - Witt, Theresia AU - Pensel, Marisa AU - Schlosser, Anne PY - 2025 JO - Zeitschrift für Hochschulentwicklung : ZFHE ; Beiträge zu Studium, Wissenschaft und Beruf VL - 20 IS - 1 SP - 605–619 CY - Wien SN - 2219-6994 DO - 10.21240/zfhe/20-1/30 UR - https://fis.uni-bamberg.de/handle/uniba/108460 LA - deu AB - Der Beitrag vergleicht Konferenzerfahrungen von Teilnehmenden einer InvertedClassroom-Tagung mit Präsenztagungen. Während die Perspektive der Teilnehmenden bei ‚klassischen‘ Formaten untersucht wurde, fehlt es an Einblicken wie Tagungsteilnehmende ‚moderne‘ Konferenzformate bewerten. Im Fokus steht die Frage, welche Unterschiede zwischen den verschiedenen Formaten wahrgenommen werden. Dafür wurden Teilnehmende (N = 81) einer Inverted-Classroom-Tagung befragt. Die Ergebnisse geben Einblicke in die Perspektive der Teilnehmenden und zeigen am Beispiel von Inverted-Classroom-Tagungen, dass Abweichungen von klassischen Tagungsformaten positiv bewertet werden. KW - Inverted-Classroom-Tagung KW - flipped conference KW - wissenschaftliche Tagung KW - Online-Konferenz KW - hybride Konferenz KW - inverted-classroom conference KW - flipped conference KW - academic conference KW - online conference KW - hybrid conference ER - TY - JOUR TI - On domain generators for the evaluation of action reversibility in STRIPS AU - Schwartz, Tobias AU - Boockmann, Jan H. AU - Martin, Leon PY - 2025 JO - Annals of Mathematics and Artificial Intelligence VL - 93 IS - 5 SP - 699-726 PB - Springer Science + Business Media B.V CY - Dordrecht [u.a.] SN - 1573-7470 DO - 10.1007/s10472-024-09960-8 UR - https://fis.uni-bamberg.de/handle/uniba/107589 LA - eng AB - Robustness is a crucial requirement for the deployment of AI systems in real-world scenarios. In the context of AI planning, the concept of action reversibility, i.e., the ability to undo the effects of an action using a reverse plan, is a promising direction for achieving robust plans. Plans composed exclusively of reversible actions exhibit resilience against goal changes during the execution of the plan. However, the evaluation of action reversibility systems in STRIPS planning presents a challenge, given that standard planning benchmarks are often not suitable. Early experiments using a naive implementation of an action reversibility algorithm show that the available domain generation approach is susceptible to bias. Building on this existing domain generator, we introduce two slight variations that exhibit entirely different search space characteristics. We assess these domain generators using the naive action reversibility implementation and existing ASP implementations, and demonstrate that different generators indeed favor different implementations. As a follow-up to this line of research, we present a generalized domain generator facilitating the creation of domains with diverse search space characteristics. To finally reduce the utilization of contrived generation patterns, we propose another domain generator based on the Barabási-Albert model yielding less rigid domains. Our experiments demonstrate that these new domain generators can produce a variety of domains with diverse search space characteristics, enabling a less biased evaluation of action reversibility systems. KW - STRIPS planning KW - Action reversibility KW - Benchmark KW - PDDL domain generation ER - TY - BOOK TI - Digitales Lehren und Lernen an der Hochschule : Strategien - Bedinungen - Umsetzung ED - Mrohs, Lorenz ED - Franz, Julia ED - Herrmann, Dominik ED - Lindner, Konstantin ED - Staake, Thorsten PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106338 LA - deu AB - Die Covid-Pandemie hat den Einsatz etablierter digitaler Technologien in der Hochschullehre beschleunigt. Gegenwärtig stellen generative KI-Systeme, allen voran ChatGPT, eine weitere, diesmal technologische Zäsur dar. Die Beiträger*innen diskutieren innovative Ansätze, bewährte Praktiken, aber auch nicht weiter verfolgte Maßnahmen in der Entwicklung und Gestaltung digitalisierter Lehr- und Lernkulturen. Dabei nehmen sie die verschiedenen Ebenen der Hochschule, der Lehre und der Rahmenbedingungen in den Blick und geben fundierte Einsichten in die aktuellen Potentiale und Herausforderungen bei der Implementierung digitalen Lehrens und Lernens an Hochschulen. KW - Hochschullehre KW - Digitalisierung KW - Hochschulentwicklung KW - Digitale Kulturen KW - Digitale Lehre ER - TY - JOUR TI - Project VoLL-KI : Learning from Learners AU - Kohlhase, Michael AU - Berges, Marc AU - Grubert, Jens AU - Landes, Dieter AU - Leidner, Jochen L. AU - Henrich, Andreas AU - Mittag, Florian AU - Nicklas, Daniela AU - Schmid, Ute AU - Sedlmaier, Yvonne AU - Ulbrich-vom Ende, Achim AU - Wolter, Diedrich PY - 2025 JO - Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen ; Organ des Fachbereichs 1 Künstliche Intelligenz der Gesellschaft für Informatik e.V., GI VL - 39 SP - 299–309 PB - Springer CY - Berlin ; Heidelberg SN - 0933-1875 DO - 10.1007/s13218-024-00846-9 UR - https://fis.uni-bamberg.de/handle/uniba/107128 LA - eng AB - “Learning from Learners” (“Von Lernenden Lernen”, “VoLL-KI ” for short) is a is collaborative research project with the goal of creating a practical toolbox of instruments at diferent levels of abstraction to improve the learning experience and outcomes for students of artifcial intelligence. Learning and teaching at tertiary education institutions are currently ITbased but not AI-supported. The VoLL-KI project aims to go this crucial next step. Using AI approaches (e.g., ML, symbolic AI, statistical AI), several educational technologies are developed on the diferent granularity of the study programs (e.g., course, semester, program). So, dashboards for study planning, recommender systems improving student advisory services and learning material selection, VR-based learning experiences, educational chatbots, and adaptive learning environments are developed. The systems are mostly deployed as prototypes KW - Computer-aided education KW - Intelligent tutoring systems KW - Teaching support for artifcial intelligence education KW - Computer-aided learning (CAL) KW - Data-driven learning quality management KW - Study course monitoring KW - Learning analytics ER - TY - BOOK TI - Digitales Lehren und Lernen an der Hochschule : Strategien - Bedinungen - Umsetzung ED - Mrohs, Lorenz ED - Franz, Julia ED - Herrmann, Dominik ED - Lindner, Konstantin ED - Staake, Thorsten PY - 2025 SP - 350 PB - transcript CY - Bielefeld T3 - Hochschulbildung: Lehre und Forschung SN - 978-3-8376-7120-9 DO - 10.14361/9783839471203 UR - https://fis.uni-bamberg.de/handle/uniba/106817 LA - deu AB - Die Covid-Pandemie hat den Einsatz etablierter digitaler Technologien in der Hochschullehre beschleunigt. Gegenwärtig stellen generative KI-Systeme, allen voran ChatGPT, eine weitere, diesmal technologische Zäsur dar. Die Beiträger*innen diskutieren innovative Ansätze, bewährte Praktiken, aber auch nicht weiter verfolgte Maßnahmen in der Entwicklung und Gestaltung digitalisierter Lehr- und Lernkulturen. Dabei nehmen sie die verschiedenen Ebenen der Hochschule, der Lehre und der Rahmenbedingungen in den Blick und geben fundierte Einsichten in die aktuellen Potentiale und Herausforderungen bei der Implementierung digitalen Lehrens und Lernens an Hochschulen. KW - Hochschullehre KW - Digitalisierung KW - Hochschulentwicklung KW - Digitale Kulturen KW - Digitale Lehre ER - TY - CPAPER TI - Back to the Roots : Decision Trees within Modern Database Systems AU - Wolfschmidt, Lena Renate AU - Schüle, Maximilian Emanuel PY - 2025 T2 - Datenbanksysteme für Business, Technologie und Web: Bamberg, 3.-7. März 2025 : Proceedings SP - 687-695 PB - Gesellschaft für Informatik CY - Bonn DO - 10.18420/btw2025-37 UR - https://fis.uni-bamberg.de/handle/uniba/106799 LA - eng AB - HUK-COBURG relies on decision trees to classify e-mails into topics. As the data is stored within relational database systems, this paper investigates the performance improvement of in-database evaluation of decision trees. The paper first summarises the theory behind binary decision trees, then describes the implementation as SQL case-when statements. The evaluation shows the benefit of the in-database application of decision trees by eliminating expensive extraction-transform-load time. In the future, we intend to optimise the training as well as inference of decision trees in SQL to fully eliminate the need for data extraction. ER - TY - CHAP TI - Einleitung AU - Witt, Theresia AU - Herrmann, Carmen AU - Mrohs, Lorenz AU - Brodel, Hannah AU - Lindner, Konstantin AU - Maidanjuk, Ilona PY - 2025 SP - 9-12 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/105998 LA - deu AB - - KW - Diversität KW - Digitalität KW - Hochschullehre ER - TY - RPRT TI - CrowdAnym : Kurzdokumentation des Mobilithek Datensatzes AU - Ackermann, Leonie AU - Baum, Christoph AU - Litvin, Aleksandr AU - Nicklas, Daniela PY - 2025 SP - 1-8 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-97611 UR - https://fis.uni-bamberg.de/handle/uniba/97611 LA - deu AB - In der bei Tourismus und Bevölkerung gleichermaßen beliebten Bamberger Altstadt kommt es immer wieder zu örtlicher Überlastung. Ein daten- und sensorbasiertes System soll daher zukünftig smarte Empfehlungen geben und die Situation für alle Beteiligten verbessern. In einer Vorstudie im Rahmen des Forschungsprojekts CrowdAnym wurde mit einer Testinstallation im Feld untersucht, ob die Datenquali-tät auch bei starker Anonymisierung für solche Vorhaben ausreicht. Das implementierte System verwen-det Wi-Fi-Sensoren als passive, unaufdringliche und kostengünstige Option zur Einschätzung der Besu-cherfrequenz. Für die Testinstallation wurden im Stadtgebiet Bamberg insgesamt neun Sensoren (Wi-Fi Tracker) an touristisch relevanten Orten installiert. Die Sensoren messen Wi-Fi Probe Requests von verschie-denen Endgeräten, wie z.B. Smartphones, Smartwatches oder Laptops. Die Sensordaten enthalten die anonymisierte MAC-Adresse (Salted Hashing, mit täglich wechselndem Salt), einen Zeitstempel, die Sensor-ID und die Signalstärke (Received Signal Strength Indicator). Der Datensatz, der in der Mobilithek zur Verfügung gestellt wird, enthält die Anzahl der erfassten Geräte aggregiert nach Zone (bzw. Sensor), Zeitfenster und Signalstärke. KW - Wi-Fi Tracking KW - Crowd Monitoring KW - Fußverkehr ER - TY - CPAPER TI - “Where Am I?” : Unraveling Challenges in Smart City Data Cleaning to Establish a Ground Truth Framework AU - Asad, Sarah AU - Powell, Breanna AU - Long, Christopher AU - Nicklas, Daniela AU - Lagesse, Brent PY - 2024 T2 - 2024 IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events (PerCom Workshops) SP - 649-654 PB - IEEE CY - New York, USA SN - 979-8-3503-0436-7 DO - 10.1109/percomworkshops59983.2024.10503068 UR - https://fis.uni-bamberg.de/handle/uniba/112337 LA - eng ER - TY - CPAPER TI - A Dual-Model Anomaly Detection Algorithm for non-linear stream data in Smart City Environments AU - Bustamante, Anthony J. AU - Asad, Sarah AU - Nicklas, Daniela AU - Lagesse, Brent PY - 2024 T2 - Proceedings : 2024 20th International Conference on Distributed Computing in Smart Systems and the Internet of Things ; DCOSS-IoT 2024 SP - 540-547 PB - IEEE Computer Society CY - Los Alamitos, California ; Washington ; Tokyo SN - 979-8-3503-6944-1 DO - 10.1109/dcoss-iot61029.2024.00085 UR - https://fis.uni-bamberg.de/handle/uniba/108432 LA - eng ER - TY - CPAPER TI - Is Personalization Worth It? : Notifying Blogs about a Privacy Issue Resulting from Poorly Implemented Consent Banners AU - Kriecherbauer, Theresa AU - Schwank, Richard AU - Krauss, Adrian AU - Neureither, Konstantin AU - Remme, Lian AU - Volkamer, Melanie AU - Herrmann, Dominik PY - 2024 T2 - ARES 24 : 19th International Conference on Availability, Reliability & Security ; Proceedings IS - 38 PB - The Association for Computing Machinery CY - New York, USA SN - 979-8-4007-1718-5 DO - 10.1145/3664476.3664499 UR - https://fis.uni-bamberg.de/handle/uniba/108356 LA - eng AB - Several websites integrate trackers without users’ consent. Previous research studied whether notifying responsible website operators about such issues is an effective measure, often with limited success. Insights from marketing research suggest that personalizing notification emails may be an effective means to improve remediation rates, with previous research pointing in both directions. We studied this approach using a sample of 119 German fitness and sports blogs employing Google Analytics (GA) without user consent: In a first step, we compare the fix rate of blog operators that received a personalized notification tailored to their blog with the fix rate of operators that received a generic notification. We find that personalized notifications do neither increase remediation rate nor operators’ response behavior. In a second step, we analyzed the reasons not to fix mentioned in (A) the email responses and (B) a survey sent to the blog operators. We find that they mostly center around (I) denial that a data leak exists, (II) a lack of resources to remedy the issue and (III) claims of specifically requiring GA. We hypothesize that an additional reason not to fix could be the so-called moral credentials phenomenon and sketch how to study that in future work. KW - GDPR KW - Human Factors in Privacy KW - Notification Study KW - Personalization ER - TY - JOUR TI - Synchronised Shared Memory and Model Checking AU - Aguado, Joaquín AU - Duenas, Alejandra PY - 2024 JO - ACM transactions on embedded computing systems : TECS VL - 23 IS - 5, 70 SP - 1-30 PB - ACM Press CY - New York, NY SN - 1558-3465 DO - 10.1145/3626188 UR - https://fis.uni-bamberg.de/handle/uniba/107767 LA - eng ER - TY - CPAPER TI - Monotonicity of the Cops and Robber Game for Bounded Depth Treewidth AU - Adler, Isolde AU - Fluck, Eva PY - 2024 SP - 1-18 PB - arXiv CY - Ithaca, NY DO - 10.48550/arXiv.2402.09139 UR - https://fis.uni-bamberg.de/handle/uniba/107795 LA - eng AB - We study a variation of the cops and robber game characterising treewidth, where in each play at most q cops can be placed in order to catch the robber, where q is a parameter of the game. We prove that if k cops have a winning strategy in this game, then k cops have a monotone winning strategy. As a corollary we obtain a new characterisation of bounded depth treewidth, and we give a positive answer to an open question by Fluck, Seppelt and Spitzer (2024), thus showing that graph classes of bounded depth treewidth are homomorphism distinguishing closed. Our proof of monotonicity substantially reorganises a winning strategy by first transforming it into a pre-decomposition, which is inspired by decompositions of matroids, and then applying an intricate breadth-first ‘cleaning up’ procedure along the pre-decomposition (which may temporarily lose the property of representing a strategy), in order to achieve monotonicity while controlling the number of cop placements simultaneously across all branches of the decomposition via a vertex exchange argument. We believe this can be useful in future research. KW - tree decompositions KW - treewidth KW - treedepth KW - cops-and-robber game KW - monotonicity KW - homomorphism distinguishing closure ER - TY - CPAPER TI - Softwarewerkzeug zur Planung mobiler Messungen AU - Högerl, Jakob AU - Lierheimer, Tobias AU - Ackermann, Leonie AU - Nicklas, Daniela AU - Foken, Thomas PY - 2024 T2 - METTOOLS XII - Programm und Kurzbeiträge zur Tagung des Fachausschusses Umweltmeteorologie FA UMET der Deutschen Meteorologischen Gesellschaft DMG e. V. vom 26. bis 28. November 2024 in Dresden SP - 60 PB - Zenodo DO - 10.5281/zenodo.14535049 UR - https://fis.uni-bamberg.de/handle/uniba/106974 LA - deu AB - Für die Planung mobiler Messkampagnen ist es wichtig, abhängig vom Messystem die Messfrequenz festzulegen, um eine gewünschte räumliche Auflösung zu erreichen. Die räumliche Auflösung bei mobilen Messungen hängt vom Messgerät (Zeitkonstante), dem mobilen Messsystem (Geschwindigkeit), der Änderung der meteorologischen Variablen und dem akzeptierten Messfehler ab. Das vorgestellte Softwarewerkzeug berechnet aus diesen Eingangsgrößen die mögliche räumliche Auflösung. Ebenso können zu einer angestrebten räumlichen Auflösung mögliche Kombinationen von Messsystemen und Messgeräten ausgegeben werden. Das Softwarewerkzeug wurde mit Flutter entwickelt und kann somit auf unterschiedlichen Plattformen eingesetzt werden. Es kann auf der Konferenz live demonstriert werden. Die verwendeten Algorithmen basieren auf VDI 3785-2 (Mobile Messungen) und unterstützt somit die Anwendung dieser Richtlinie. KW - Mobile Messungen KW - Umweltmeteorologie KW - Softwareanwendung ER - TY - CPAPER TI - Integrating Mutation Techniques to Keep Specification and Source Code in Sync AU - Jacob, Kerstin PY - 2024 T2 - Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis SP - 1912-1914 PB - ACM CY - New York, NY, United States SN - 979-8-4007-0612-7 DO - 10.1145/3650212.3685556 UR - https://fis.uni-bamberg.de/handle/uniba/106849 LA - eng ER - TY - JOUR TI - Editorial AU - Schüle, Maximilian E. AU - Klettke, Meike AU - Störl, Uta PY - 2024 JO - Datenbank-Spektrum VL - 24 IS - 3 SP - 183-186 PB - Springer Science and Business Media LLC SN - 1610-1995 DO - 10.1007/s13222-024-00493-2 UR - https://fis.uni-bamberg.de/handle/uniba/106796 LA - deu ER - TY - JOUR TI - The Duck’s Brain : Training and Inference of Neural Networks within Database Engines AU - Schüle, Maximilian AU - Neumann, Thomas AU - Kemper, Alfons PY - 2024 JO - Datenbank-Spektrum VL - 24 IS - 3 SP - 209-221 PB - Springer CY - Berlin ; Heidelberg SN - 1610-1995 DO - 10.1007/s13222-024-00485-2 UR - https://fis.uni-bamberg.de/handle/uniba/106797 LA - eng AB - Although database systems perform well in data access and manipulation, their relational model hinders data scientists from formulating machine learning algorithms in SQL. Nevertheless, we argue that modern database systems perform well for machine learning algorithms expressed in relational algebra. To overcome the barrier of the relational model, this paper shows how to transform data into a coordinate relational representation for training neural networks in SQL: We first describe building blocks for data transformation, model training and inference in SQL-92 and their counterparts using an extended array data type. Then, we compare the implementation for model training and inference using array data types to the one using a coordinate relational representation in SQL-92 only. The evaluation in terms of runtime and memory consumption proves the suitability of modern database systems for matrix algebra, although specialised array data types perform better than matrices in coordinate relational representation. KW - SQL-92 KW - Neural Networks KW - Automatic Differentiation KW - In-Memory Database Systems KW - Machine Learning ER - TY - CPAPER TI - Give a JIT on GPUs : NVRTC for Code-Generating Database Systems AU - Sachnov, Anton AU - Merzljak, Leonard von AU - Schüle, Maximilian E. PY - 2024 T2 - 2024 IEEE 40th International Conference on Data Engineering Workshops (ICDEW) SP - 384-387 PB - IEEE DO - 10.1109/icdew61823.2024.00061 UR - https://fis.uni-bamberg.de/handle/uniba/106798 LA - eng ER - TY - CPAPER TI - Higher-Order SQL Lambda Functions AU - Schüle, Maximilian E. AU - Hornung, Jakob PY - 2024 T2 - 2024 IEEE 40th International Conference on Data Engineering (ICDE) SP - 5622-5628 PB - IEEE DO - 10.1109/icde60146.2024.00450 UR - https://fis.uni-bamberg.de/handle/uniba/106800 LA - eng ER - TY - CPAPER TI - Enhancing Data Quality and Collaboration in Participatory Climate Data Crowdsensing AU - Ackermann, Leonie AU - Akcabay, Samet AU - Benabbas, Aboubakr AU - Khalil, Reem Eslam AU - Nicklas, Daniela PY - 2024 SP - 1-6 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/97462 LA - eng AB - Based on a citizen-initiated climate data crowdsensing campaign, we showcase mechanisms for ensuring data quality and discuss requirements for collaborative curation of the collected information. Specifically, we delve into the challenges and opportunities citizen-led data collection with the Netatmo Smart Home Weather Station. Our study addresses the engagement of citizens in the scientific process, investigates innovative detection mechanisms for enhancing data quality in crowdsensed climate data, and introduces robust metrics for assessing data quality. Additionally, we propose a design for an application that gives citizens the opportunity to actively participate in data validation and curation, thus increasing the trustworthiness and usefulness of the collected data. These solutions actively contribute to the ongoing design and evolution of climate data crowdsensing, harnessing the potential of the urban knowledge society. In this way, they actively support the participation of the city community in overcoming social challenges associated with climate change adaptation. KW - Crowdsensing KW - Data integrity KW - Urban areas KW - Data collection KW - Data quality KW - Citizen participation KW - Climate data ER - TY - CHAP TI - Einleitung AU - Witt, Theresia AU - Herrmann, Carmen AU - Mrohs, Lorenz AU - Brodel, Hannah AU - Lindner, Konstantin AU - Maidanjuk, Ilona PY - 2024 T2 - Diversität und Digitalität in der Hochschullehre : Innovative Formate in digitalen Bildungskulturen SP - 9-12 PB - transcript Verlag CY - Bielefeld SN - 978-3-8394-6938-5 DO - 10.1515/9783839469385-001 UR - https://fis.uni-bamberg.de/handle/uniba/105522 LA - deu AB - - KW - Diversität KW - Digitalität KW - Hochschullehre ER - TY - CHAP TI - Klausur-Booklets zur Stärkung von Methodenkompetenzen und zur Reduktion von Prokrastination AU - Herrmann, Dominik PY - 2024 T2 - Diversität und Digitalität in der Hochschullehre : innovative Formate in digitalen Bildungskulturen SP - 169-180 PB - Transcript CY - Bielefeld SN - 978-3-8376-6938-1 DO - 10.14361/9783839469385-013 UR - https://fis.uni-bamberg.de/handle/uniba/104523 LA - deu AB - Semesterbegleitendes Mitlernen scheitert oft an fehlender Methodenkompetenz und der Neigung zur Prokrastination. Klausur-Booklets versprechen Abhilfe: Dabei erlauben Lehrende ihren Studierenden, semesterbegleitend bis zu 15 handschriftliche Notizzettel anzufertigen und als Hilfsmittel in der Prüfung zu nutzen. Klausur-Booklets überwinden die Nachteile von Open-Book-Klausuren und anderen Anreizsystemen wie Midterm Exams und Bonuspunkten. Sie üben einen starken Anreiz auf die Studierenden aus, können die Prüfungskultur verbessern und lassen sich basierend auf den bisherigen organisatorischen und technischen Erfahrungen gut umsetzen. Vor diesem Hintergrund erscheint es sinnvoll, der Vermittlung von Methodenkompetenz in bestehenden Lehrveranstaltungen mehr Raum zu geben. KW - Anreizsystem KW - erlaubtes Hilfsmittel KW - kompetenzorientierte Prüfungen KW - Hochschullehre KW - incentive system KW - allowed aid KW - competency-based examinations KW - higher education ER - TY - JOUR TI - Formulating a quality model for cloud-native software architectures : conceptual and methodological considerations AU - Lichtenthäler, Robin AU - Wirtz, Guido PY - 2024 SP - 4077-4093 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/98510 LA - eng AB - Interest in cloud computing is steadily increasing and the range of offerings is evolving due to continuous technological innovation. Hence, cloud-native has been established as a term for building applications in a way that maximally exploits benefits of modern cloud computing concepts. However, cloud-native as a topic is broad and the variety in cloud computing technologies is large. Thus, we identify a need in supporting developers and software architects who want to benefit from cloud-native concepts. We provide this support in the form of a quality model for cloud-native software architectures that explains how architectural characteristics impact different quality aspects. Our focus is on the design time and the aim is that architectural models of applications can be evaluated according to cloud-native characteristics and corresponding quality aspects. In this work we present our approach for formulating and validating the quality model for cloud-native software architectures as well as its current state. This presentation is based on previous work, especially a recently conducted validation survey that focused on the impacts of architectural characteristics on quality aspects. The new contribution of this work is the integrated presentation of our approach in a larger context of conceptual and methodological considerations. Further, revision of the quality model based on a repeated literature search for architectural measures is presented. We provide a more detailed look on the quality model, explaining exemplary product factors and their relevance within the topic of cloud-native. Our results provide a qualitative overview of characteristics associated with cloud native software architectures and lay the foundation for quantitative quality evaluations based on architectural models of applications. KW - Cloud-native KW - Quality model KW - Quality model formulation KW - Architectural evaluation ER - TY - CPAPER TI - Comprehending Object State via Dynamic Class Invariant Learning AU - Boockmann, Jan H. AU - Lüttgen, Gerald PY - 2024 T2 - Fundamental Approaches to Software Engineering : 27th International Conference, FASE 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings SP - 143-164 PB - Springer Nature Switzerland CY - Cham SN - 978-3-031-57258-6 DO - 10.1007/978-3-031-57259-3_7 UR - https://fis.uni-bamberg.de/handle/uniba/98466 LA - eng AB - Maintaining software is cumbersome when method argument constraints are undocumented. To reveal them, previous work learned preconditions from exemplary valid and invalid method arguments. In practice, it would be highly beneficial to know class invariants, too, because functionality added during software maintenance must not break them. Even more so than method preconditions, class invariants are rarely documented and often cannot completely be inferred automatically, especially for objects exhibiting complex state such as dynamic data structures. This paper presents a novel dynamic approach to learning class invariants, thereby complementing related work on learning method preconditions. We automatically synthesize assertions from an adjustable assertion grammar to distinguish valid and invalid objects. While random walks generate valid objects, a combination of bounded-exhaustive testing techniques and behavioral oracles yield invalid objects. The utility of our approach for code comprehension and software maintenance is demonstrated by comparing our learned invariants to documented invariant validation methods found in real-world Java classes and to the invariants detected by the Daikon tool. KW - Dynamic Class Invariant Learning ER - TY - CPAPER TI - SWTbahn : An Embedded Software Demonstrator in Symbiosis with Embedded Software Education AU - Luedtke, Bernhard M. AU - Yip, Eugene AU - Lüttgen, Gerald PY - 2024 T2 - Software Engineering im Unterricht der Hochschulen 2024 : Komplettband SP - 77-82 PB - Gesellschaft für Informatik e.V. CY - Bonn SN - 978-3-88579-255-0 DO - 10.18420/seuh2024_06 UR - https://fis.uni-bamberg.de/handle/uniba/98464 LA - eng AB - Demonstrators, such as model railways, are effective in providing real-world examples that help students to grasp abstract concepts in the engineering of embedded software. Although building such a demonstrator yourself can appear overwhelming, we argue how building your own improves your teaching of embedded software. We report on how we have achieved these improvements with a development process that lets our teaching co-evolve with our own demonstrator, share our main lessons learned, and invite educators to discuss remaining challenges. KW - model railway demonstrator KW - evolutionary development KW - embedded software ER - TY - CPAPER TI - Enhancing Data Quality and Collaboration in Participatory Climate Data Crowdsensing AU - Ackermann, Leonie AU - Akcabay, Samet AU - Benabbas, Aboubakr AU - Khalil, Reem Eslam AU - Nicklas, Daniela PY - 2024 VL - 8 SP - 655-660 PB - IEEE CY - New York SN - 979-8-3503-0436-7 DO - 10.1109/percomworkshops59983.2024.10502897 UR - https://fis.uni-bamberg.de/handle/uniba/98226 LA - eng AB - Based on a citizen-initiated climate data crowdsensing campaign, we showcase mechanisms for ensuring data quality and discuss requirements for collaborative curation of the collected information. Specifically, we delve into the challenges and opportunities citizen-led data collection with the Netatmo Smart Home Weather Station. Our study addresses the engagement of citizens in the scientific process, investigates innovative detection mechanisms for enhancing data quality in crowdsensed climate data, and introduces robust metrics for assessing data quality. Additionally, we propose a design for an application that gives citizens the opportunity to actively participate in data validation and curation, thus increasing the trustworthiness and usefulness of the collected data. These solutions actively contribute to the ongoing design and evolution of climate data crowdsensing, harnessing the potential of the urban knowledge society. In this way, they actively support the participation of the city community in overcoming social challenges associated with climate change adaptation. KW - Crowdsensing KW - Data integrity KW - Urban areas KW - Data collection KW - Data quality KW - Citizen participation KW - Climate data ER - TY - CPAPER TI - On the Hunt for Invalid Objects : Exploring the Object State Space with Program Mutants AU - Boockmann, Jan Henrik AU - Lüttgen, Gerald PY - 2024 VL - 31 SP - 711-716 PB - IEEE CY - New York SN - 979-8-3503-3066-3 DO - 10.1109/saner60148.2024.00078 UR - https://fis.uni-bamberg.de/handle/uniba/98170 LA - eng ER - TY - RPRT TI - Heterogeneous Specification of Spacecraft Software AU - Yip, Eugene AU - Lüttgen, Gerald PY - 2024 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik DO - 10.20378/irb-97634 UR - https://fis.uni-bamberg.de/handle/uniba/97634 LA - eng AB - The operational behaviour of a reactive system is commonly specified or modelled as concurrent state machines, where each machine models the possible states or modes of a software component and its interactions with the environment. However, state machines can quickly become verbose when execution constraints between concurrent states need to be modelled. Alternatively, constraints could be modelled declaratively as special edges between states. Such a heterogeneous modelling approach is employed by Virtual Satellite (VirSat), a model-based systems engineering tool from the German Aerospace Center (DLR). The challenge has been to develop a heterogeneous modelling framework that supports an operational and declarative syntax, defines a unified semantics suitable for formal reasoning, and supports the independent and incremental development of software components. We address this challenge with our Component State Machine (CSM) formalism as a means to operationalise VirSat: the operational syntax of VirSat is preserved in CSM, the declarative VirSat constraints are transformed into CSM atomic propositions and parallel conditions, the CSM parallel operator incrementally composes CSMs and resolves the parallel conditions, and design errors are analysed as inconsistent transitions. CSM permits new constraints to be defined without needing to modify the core VirSat semantics. We also propose an intuitive, practical, and mathematically rigorous notion of refinement that aims to encourage a more systematic development of spacecraft software. Lastly, we offer a modular implementation of CSMs as hierarchically scheduled Executable State Machines (ESMs) that remains open to further composition and refinement. KW - operational behaviour KW - component state machine (CSM) KW - german aerospace center (DLR) KW - VirSat KW - executable state machines (ESMs) ER - TY - RPRT TI - Concurrency, Shared Variables, Compositionality : An Unlikely Triple AU - Yip, Eugene AU - Lüttgen, Gerald PY - 2024 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik DO - 10.20378/irb-97637 UR - https://fis.uni-bamberg.de/handle/uniba/97637 LA - eng AB - This paper reports our experiences with extending Interface Automaton (IA) with shared variables by lifting IA’s intuitive notion of refinement and compositionality to shared variables. Although there are existing works that introduce shared variables to IA, they typically support a very restricted notion of sharing, e.g., the value of a shared variable is only defined for the duration of an atomic operation, with no ability to persist values for subsequent operations. When attempting to formulate the semantics of shared variables that could persist their values across operations, we encountered numerous challenges when defining a notion of refinement that respected compositionality. We conjecture that, even for a basic notion of variable persistence, concurrent shared variable accesses between automata create a tight data dependency that prevents a compositional reasoning. We discuss the generality of this negative result in relation to other concurrency theories. KW - Interface Automaton (IA) KW - compositionality KW - shared variables KW - concurrency ER - TY - BOOK TI - Diversität und Digitalität in der Hochschullehre : Innovative Formate in digitalen Bildungskulturen ED - Witt, Theresia ED - Herrmann, Carmen ED - Mrohs, Lorenz ED - Brodel, Hannah ED - Lindner, Konstantin ED - Maidanjuk, Ilona PY - 2024 PB - Transcript CY - Bielefeld T3 - Hochschulbildung: Lehre und Forschung SN - 978-3-8394-6938-5 DO - 10.1515/9783839469385 UR - https://fis.uni-bamberg.de/handle/uniba/97131 LA - deu ER - TY - CHAP TI - Diversität braucht Digitalität? : Eine Verhältnisbestimmung in der Organisation Hochschule AU - Mrohs, Lorenz PY - 2024 T2 - Diversität und Digitalität in der Hochschullehre : Innovative Formate in digitalen Bildungskulturen SP - 27-45 PB - transcript Verlag CY - Bielefeld SN - 978-3-8376-6938-1 DO - 10.1515/9783839469385-003 UR - https://fis.uni-bamberg.de/handle/uniba/97132 LA - deu AB - Sowohl Digitalisierung als auch Diversität zählen derzeit zu den zentralen strategischen Zukunftsaufgaben von Hochschulen. Im Hochschulkontext werden die beiden Themenfelder jedoch häufig getrennt voneinander betrachtet und ihre Verschränkungen nur punktuell thematisiert. Im Sinne einer integrativen Hochschulentwicklung gilt es, die beiden Themenfelder stärker zusammenzudenken und einen genaueren Blick auf die Verschränkung von Digitalitäts und Diversitätsfragen zu werfen. Dieser Beitrag greift ausgewählte Aspekte auf, die für eine produktive Bearbeitung dieses Themenkomplexes relevant sind. Dabei wird mit einer organisationstheoretischen Brille das Verhältnis dieser beiden Zukunftsaufgaben in der Organisation Hochschule betrachtet. KW - Diversität; Digitalität KW - Digitalität KW - Hochschule KW - Universität KW - Organisationen KW - Innovationen KW - Diversity KW - Digitality KW - Higher education KW - University KW - Organisations KW - innovations ER - TY - JOUR TI - On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing AU - Adler, Isolde AU - Köhler, Noleen AU - Peng, Pan PY - 2024 JO - SIAM journal on computing : a publication of the Society for Industrial and Applied Mathematics VL - 53 IS - 4 SP - 825-883 PB - SIAM CY - Philadelphia, Pa. SN - 1095-7111 DO - 10.1137/23M1556253 UR - https://fis.uni-bamberg.de/handle/uniba/97085 LA - eng ER - TY - BOOK TI - Schulpraktische Studien an der Universität Bamberg : Impulse für die Lehrkräftebildung AU - Grötzbach, Daniel AU - Niehaus, Johanna AU - Beer, Christof AU - Rübben, Ricarda AU - Hirmer, Tobias AU - Sticht, Martin AU - Timm, Susanne AU - Summer, Theresa AU - Schnellbögl, Claudia AU - Kraus, Birgit AU - Schwarzl, Cordula AU - Plötz, Evi AU - Lindner, Konstantin AU - Steinweg, Anna Susanne AU - Treiber, Eva AU - Meidel, Eva AU - Mayer, Florian AU - Franz, Ute AU - Groh, Nicola AU - Kleber, Angelika AU - Anderka, Angela ED - Plötz, Evi ED - Summer, Theresa ED - Grötzbach, Daniel ED - Drechsel, Barbara PY - 2024 PB - University of Bamberg Press CY - Bamberg T3 - Forum Lehrerinnen- und Lehrerbildung SN - 978-3-86309-969-5 DO - 10.20378/irb-95393 UR - https://fis.uni-bamberg.de/handle/uniba/95393 LA - deu AB - Schulbezogene Praktika im Lehramtsstudium sind die ersten und frühzeitigen Einblicke Studierender in ihre zukünftige professionelle Praxis. In den vergangenen Jahren wurde diesen Lerngelegenheiten im wissenschaftlichen Diskurs viel Aufmerksamkeit zugewandt. Unterschiedliche Akteurinnen und Akteure in den Schulen und an der Universität sind damit befasst, Studierenden diese Erfahrungen zu ermöglichen und gemeinsam maximale Lernerfolge sicherzustellen. In diesem Buch werden Fragestellungen rund um die schulpraktischen Studien im Rahmen der Lehrkräftebildung an der Universität Bamberg diskutiert. Aus Anlass des Abschlusses des Projekts SchulPrax (Weiterentwicklung schulpraktischer Studien), das im Bamberger WegE-Projekt der Qualitätsoffensive Lehrerbildung initiiert worden war, ist eine Sammlung von Beiträgen unterschiedlicher an schulpraktischen Studien beteiligten Arbeitsgruppen entstanden. Dabei wird der Blick auf das Lernen Studierender im Praktikum und deren Begleitung durch Praktikumslehrkräfte gelenkt (Teil I) und anhand evidenzbasierter Modelle die wissenschaftlich fundierten Weiterentwicklungen schulpraktischer Studien beschrieben (Teil II), beispielsweise durch die Begleitung von Praktika im Rahmen von E-Portfolios. Zudem werden (Teil III) Einblicke in Praktikumsvarianten verschiedener Unterrichtsfächer und konkrete Konzepte verschiedener allgemein- und fachdidaktischer sowie weiterer auf das Lehramt bezogener Praktika vorgestellt. Somit liefern die Beiträge Impulse zur Weiterentwicklung schulpraktischer Studien für einzelne Fächer und darüber hinaus. KW - Lehramt KW - Teacher training programme KW - Lehramtsstudium KW - Lehrerbildung KW - Praktikum KW - Kohärenz KW - Qualitätsoffensive KW - internships KW - coherence KW - quality initiative ER - TY - JOUR TI - The Missing Link in Network Intrusion Detection : taking AI/ML Research Efforts to Users AU - Dietz, Katharina AU - Mühlhauser, Michael AU - Kögel, Jochen AU - Schwinger, Stephan AU - Sichermann, Marleen AU - Seufert, Michael AU - Herrmann, Dominik AU - Hoßfeld, Tobias PY - 2024 JO - IEEE access : practical research, open solutions VL - 12 SP - 79815-79837 PB - IEEE CY - New York SN - 2169-3536 DO - 10.1109/access.2024.3406939 UR - https://fis.uni-bamberg.de/handle/uniba/95436 LA - deu AB - Intrusion Detection Systems (IDS) tackle the challenging task of detecting network attacks as fast as possible. As this is getting more complex in modern enterprise networks, Artificial Intelligence (AI) and Machine Learning (ML) have gained substantial popularity in research. However, their adoption into real-world IDS solutions remains poor. Academic research often overlooks the interconnection of users and technical aspects. This leads to less explainable AI/ML models that hinder trust among AI/ML non-experts. Additionally, research often neglects secondary concerns such as usability and privacy. If IDS approaches conflict with current regulations or if administrators cannot deal with attacks more effectively, enterprises will not adopt the IDS in practice. To identify those problems systematically, our literature survey takes a user-centric approach; we examine IDS research from the perspective of stakeholders by applying the concept of personas. Further, we investigate multiple factors limiting the adoption of AI/ML in security and suggest technical, non-technical, and user-related considerations to enhance the adoption in practice. Our key contributions are threefold. (i) We derive personas from realistic enterprise scenarios, (ii) we provide a set of relevant hypotheses in the form of a review template, and (iii), based on our reviews, we derive design guidelines for practical implementations. To the best of our knowledge, this is the first paper that analyzes practical adoption barriers of AI/ML-based intrusion detection solutions concerning appropriateness of data, reproducibility, explainability, practicability, usability, and privacy. Our guidelines may help researchers to holistically evaluate their AI/ML-based IDS approaches to increase practical adoption. KW - Anomaly detection KW - artifcial intelligence KW - intrusion detection KW - machine learning KW - network monitoring KW - privacy KW - security KW - usability ER - TY - JOUR TI - Das Projekt DiKuLe und seine Implikationen für Erwachsenen- und Weiterbildner*innen AU - Mrohs, Lorenz AU - Franz, Julia PY - 2024 SP - 1-7 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-94701 UR - https://fis.uni-bamberg.de/handle/uniba/94701 LA - deu AB - Spätestens seit der Corona-Pandemie und den daran anknüpfenden technologischen Herausforderungen durch ChatGPT ist die Frage, wie die universitäre Lehre zukunftsfähig gestaltet werden kann, an den Hochschulen verstärkt in den Vordergrund gerückt. Dabei stellt sich nicht nur die Frage, wie Lehre und Lernen moderner und zeitgemäßer gestaltet werden können, sondern auch wie digitale Strukturen genutzt werden können, um auf die zunehmende Heterogenität der Studierenden sowie deren Bedürfnisse nach räumlicher Flexibilität und lebenslangem Lernen zu reagieren. Der vorliegende Beitrag gibt einen Einblick in das DiKuLe-Projekt und seine Ergebnisse und thematisiert mögliche Implikationen für Erwachsenen- und Weiterbildner:innen. Dafür wird zunächst, wie im Projektnamen verankert, ein Blick auf den theoretischen Rahmen der Kultur der Digitalität geworfen, dessen gesellschaftliche Perspektive der Digitalisierung auch die Hochschulen prägt. Anschließend werden Struktur und Schwerpunkte des DiKuLe-Projekts vorgestellt und Einblicke in Ergebnisse aus den Forschungsbereichen „Videoumgebungen“, „smarte Didaktik“ und „Blended-Learning-Formaten“ gegeben. Darauf aufbauend wird abschließend ein Ausblick auf die Erwachsenen- und Weiterbildung gegeben. KW - Digitale Lehre KW - Hochschulforschung KW - Blended Learning KW - smarte Didaktik KW - Erwachsenenbildung KW - Weiterbildung ER - TY - JOUR TI - Inverted-Classroom-Tagungen : Erfahrungsbericht zu einem neuen Konferenzformat AU - Mrohs, Lorenz AU - Witt, Theresia AU - Herrmann, Dominik PY - 2024 SP - 315-331 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/94990 LA - deu AB - Der Beitrag befasst sich mit einem neuen Konferenzformat in Anlehnung an das Inverted-Classroom-Konzept, bestehend aus einem asynchronen Online-Teil und einer synchronen Präsenzveranstaltung. Im Vordergrund steht die Frage, wie Konferenzen didaktisch sinnvoll gestaltet werden können. Das Inverted-Classroom-Konzept kann darauf Antwort geben, jedoch liefert die Literatur keine Hinweise, wie dies auf wissenschaftliche Tagungen angewendet werden kann. Der vorliegende Erfahrungsbericht gibt Einblicke in die Gestaltung einer Inverted-Classroom-Konferenz. Dadurch soll auf ein neues Konferenzformat aufmerksam gemacht und ein Anstoß für weitere wissenschaftliche Auseinandersetzungen gegeben werden. KW - wissenschaftliche Tagung KW - Online-Konferenz KW - hybride Konferenz KW - Inverted-Classroom-Tagung KW - Inverted Classroom KW - scientific conference KW - online conference KW - hybrid conference KW - inverted-classroom conference KW - inverted classroom ER - TY - JOUR TI - Synchronized Shared Memory and Black-box Procedural Abstraction : Toward a Formal Semantics of Blech AU - Gretz, Friedrich AU - Grosch, Franz-Josef AU - Mendler, Michael AU - Scheele, Stephan PY - 2024 JO - ACM transactions on embedded computing systems : TECS VL - 23 IS - 5 SP - 1-45 PB - ACM Press CY - New York, NY SN - 1539-9087 DO - 10.1145/3571585 UR - https://fis.uni-bamberg.de/handle/uniba/93448 LA - eng ER - TY - CPAPER TI - Towards Anonymizing Intermodal Mobility Data for Smart Cities AU - Ackermann, Leonie AU - Mühlhauser, Michael AU - Burdusel, Alexandru AU - Federlin, Michael AU - Herrmann, Dominik AU - Holly, Steffen AU - Nicklas, Daniela AU - Wolpert, Daniel PY - 2024 SP - 1-6 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92663 LA - eng AB - As cities seek to optimize their resources for a sustainable and livable future, the concept of intermodal mobility has become increasingly important. However, the collection and analysis of intermodal mobility data is complicated by the need for robust anonymization methods, as privacy and security concerns remain paramount. Existing anonymization methods are either mode-specific or so complicated that they deter potential stakeholders. In this paper, we describe a variety of real mobility data sources for our upcoming field study. With that data, we plan to provide insights into infrastructure utilization and transitions between modes of transport. We further identified several anonymization techniques for mobility data to ensure privacy and acceptance among the citizens. To find suitable techniques for intermodal mobility data, we provide insights from our previous experience on anonymization and discuss the practicability of the identified techniques. Our paper highlights the need for explainable anonymization methods tailored to intermodal mobility data that address privacy and security concerns and pave the way for more accessible privacy-compliant solutions. KW - Intermodal Mobility KW - Smart Cities KW - Anonymization KW - Privacy ER - TY - CPAPER TI - Privacy-aware Publication of Wi-Fi Sensor Data for Crowd Monitoring and Tourism Analytics AU - Ackermann, Leonie AU - Baum, Christoph AU - Litvin, Aleksandr AU - Nicklas, Daniela AU - Khalil, Syed Ibrahim PY - 2024 T2 - GeoPrivacy '23: Proceedings of the 1st ACM SIGSPATIAL International Workshop on Geo-Privacy and Data Utility for Smart Societies SP - 1-4 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92664 LA - eng AB - Estimating visitor frequency in urban areas often relies on camera-based solutions or the active participation of individuals using smartphone applications or devices with RFID or Bluetooth technology. This paper presents the results of a preliminary study on anonymous data collection as a basis for data-driven visitor guidance in Bamberg’s Old Town, using passive, non-intrusive and low-cost Wi-Fi sensors. The study includes a field test installation to evaluate data quality under robust anonymization measures. The data collected as part of the project will be made available to the public in the Mobilithek of the Federal Ministry of Digital Affairs and Transport (BMDV). Still, the collection of Wi-Fi probe requests raises legitimate privacy concerns. We address potential attack models for identifying and tracking devices based on these requests and explain the data collection architecture and Technical Data Protection Concept implemented within CrowdAnym to mitigate these risks. We evaluate the impact of our approach on the quality of the CrowdAnym dataset by comparing the data from one sensor location with the number of people counted by a nearby laser scanner. We are able to show that our approach approximates visitor density well, however the deviation of our data from ground truth increases as visitor frequency increases. KW - MAC address detection KW - datasets KW - anonymization ER - TY - CPAPER TI - LetSynchronise : An Open-Source Framework for Analysing and Optimising Logical Execution Time Systems AU - Yip, Eugene AU - Kuo, Matthew M.Y. PY - 2023 T2 - Proceedings of 2023 Cyber-Physical Systems and Internet-of-Things Week (CPS-IoT Week) Workshops : May 9-12, 2023, San Antonio, Texas, USA SP - 349-354 PB - ACM CY - New York SN - 979-8-4007-0049-1 DO - 10.1145/3576914.3587500 UR - https://fis.uni-bamberg.de/handle/uniba/112379 LA - eng ER - TY - CPAPER TI - PULCEO : A Novel Architecture for Universal and Lightweight Cloud-Edge Orchestration AU - Böhm, Sebastian AU - Wirtz, Guido PY - 2023 T2 - 17th IEEE International Conference on Service-Oriented System Engineering : Proceedings SP - 37-47 PB - IEEE Computer Society Conference Publishing Services CY - Los Alamitos, California SN - 979-8-3503-2239-2 DO - 10.1109/sose58276.2023.00011 UR - https://fis.uni-bamberg.de/handle/uniba/112378 LA - eng ER - TY - CPAPER TI - Cookiescanner : An Automated Tool for Detecting and Evaluating GDPR Consent Notices on Websites AU - Gundelach, Ralf AU - Herrmann, Dominik PY - 2023 T2 - ARES 23 : 18th International Conference on Availability, Reliability and Security ; Proceedings IS - 148 PB - Association for Computing Machinery CY - New York, USA SN - 979-8-4007-0772-8 DO - 10.1145/3600160.3605000 UR - https://fis.uni-bamberg.de/handle/uniba/112376 LA - eng ER - TY - JOUR TI - Synchronous Deterministic Parallel Programming for Multi-Cores with ForeC AU - Yip, Eugene AU - Girault, Alain AU - Roop, Partha S. AU - Biglari-Abhari, Morteza PY - 2023 JO - ACM transactions on programming languages and systems : ACM TOPLAS VL - 45 IS - 2 SP - 1-74 PB - Association for Computing Machinery CY - New York, NY SN - 1558-4593 DO - 10.1145/3591594 UR - https://fis.uni-bamberg.de/handle/uniba/108603 LA - eng ER - TY - JOUR TI - A Constructive State-based Semantics and Interpreter for a Synchronous Data-flow Language with State Machines AU - Colaço, Jean-Louis AU - Mendler, Michael AU - Pauget, Baptiste AU - Pouzet, Marc PY - 2023 JO - ACM transactions on embedded computing systems : TECS VL - 22 IS - 5s SP - 1-26 PB - ACM Press CY - New York, NY SN - 1539-9087 DO - 10.1145/3609131 UR - https://fis.uni-bamberg.de/handle/uniba/108553 LA - eng ER - TY - CHAP TI - Digitale Kulturen der Lehre entwickeln : einleitende Verortungen AU - Mrohs, Lorenz AU - Herrmann, Dominik AU - Franz, Julia AU - Lindner, Konstantin AU - Staake, Thorsten Robert PY - 2023 T2 - Digitale Kulturen der Lehre entwickeln : Rahmenbedingungen, Konzepte und Werkzeuge SP - 1-6 PB - Springer CY - Wiesbaden SN - 978-3-658-43378-9 DO - 10.1007/978-3-658-43379-6_1 UR - https://fis.uni-bamberg.de/handle/uniba/95364 LA - deu AB - Der Beitrag führt vor dem Hintergrund der Theorie der Kultur der Digitalität (Felix Stalder) in den vorliegenden Sammelband ein und wendet diesen theoretischen Rahmen auf Hochschulen und die Entwicklung der Hochschullehre an. Es werden die zentralen Strukturbedingungen umrissen und davon ausgehend Erfordernisse für die Entwicklung einer Kultur der Digitalität an der Universität Bamberg skizziert, die im Rahmen des Projekts „Digitale Kulturen der Lehre entwickeln (DiKuLe)“ beforscht und entwickelt werden. Abschließend gibt der Beitrag einen Ausblick auf die Beiträge des Sammelbandes, die neue Konzepte, Gestaltungsmöglichkeiten und Evaluationsergebnisse digitaler Lehr-Lernarrangements vorstellen. KW - Lehre ER - TY - BOOK TI - Digitale Kulturen der Lehre entwickeln : Rahmenbedingungen, Konzepte und Werkzeuge ED - Mrohs, Lorenz ED - Franz, Julia ED - Herrmann, Dominik ED - Lindner, Konstantin ED - Staake, Thorsten PY - 2023 PB - Springer Fachmedien CY - Wiesbaden T3 - Perspektiven der Hochschuldidaktik SN - 9783658433789 DO - 10.1007/978-3-658-43379-6 UR - https://fis.uni-bamberg.de/handle/uniba/95238 LA - deu ER - TY - JOUR TI - Perspectives on Negative Research Results in Pervasive Computing AU - Peltonen, Ella AU - Mohan, Nitinder AU - Zdankin, Peter AU - Shreedhar, Tanya AU - Nguyen, Tri AU - Bayhan, Suzan AU - Crowcroft, Jon AU - Kangasharju, Jussi AU - Nicklas, Daniela PY - 2023 JO - IEEE pervasive computing : mobile and ubiquitous systems VL - 22 IS - 3 SP - 63-72 PB - IEEE CY - New York, NY SN - 1536-1268 DO - 10.1109/mprv.2023.3273718 UR - https://fis.uni-bamberg.de/handle/uniba/95021 LA - eng AB - Not all research leads to fruitful results; trying new ways or methods may surpass state of the art, but sometimes the hypothesis is not proven, the improvement is insignificant, or the system fails because of a design error done years ago in previous works. In a systems discipline like pervasive computing, there are many sources of errors, from hardware issues over communication channels to heterogeneous software environments. However, failure to succeed is not a failure to progress. It is essential to create platforms for sharing insights, experiences, and lessons learned when conducting research in pervasive computing so that the same mistakes are not repeated. And sometimes, a problem is a symptom of discovering new research challenges. Based on the collective input of the First International Workshop on Negative Results in Pervasive Computing (PerFail 2022), co-located with the 20th International Conference on Pervasive Computing and Communications (PerCom 2022), this article presents a comprehensive discussion on perspectives on publishing negative results, useful failures, and lessons learned in pervasive computing. KW - Pervasive computing KW - Surveys KW - Sensors KW - Prototypes KW - Ecosystems KW - Behavioral sciences KW - Writing KW - Research initiatives ER - TY - JOUR TI - FairCaipi : A Combination of Explanatory Interactive and Fair Machine Learning for Human and Machine Bias Reduction AU - Heidrich, Louisa AU - Slany, Emanuel AU - Scheele, Stephan AU - Schmid, Ute PY - 2023 JO - Machine learning and knowledge extraction VL - 5 IS - 4 SP - 1519-1538 PB - MDPI CY - Basel SN - 2504-4990 DO - 10.3390/make5040076 UR - https://fis.uni-bamberg.de/handle/uniba/94998 LA - eng AB - The rise of machine-learning applications in domains with critical end-user impact has led to a growing concern about the fairness of learned models, with the goal of avoiding biases that negatively impact specific demographic groups. Most existing bias-mitigation strategies adapt the importance of data instances during pre-processing. Since fairness is a contextual concept, we advocate for an interactive machine-learning approach that enables users to provide iterative feedback for model adaptation. Specifically, we propose to adapt the explanatory interactive machine-learning approach Caipi for fair machine learning. FairCaipi incorporates human feedback in the loop on predictions and explanations to improve the fairness of the model. Experimental results demonstrate that FairCaipi outperforms a state-of-the-art pre-processing bias mitigation strategy in terms of the fairness and the predictive performance of the resulting machine-learning model. We show that FairCaipi can both uncover and reduce bias in machine-learning models and allows us to detect human bias. KW - fair machine learning KW - explanatory and interactive machine learning ER - TY - CPAPER TI - Teaching Blue Elephants the Maths for Machine Learning AU - Ruck, Clemens AU - Schüle, Maximilian Emanuel PY - 2023 T2 - DEEM '23: Proceedings of the Seventh Workshop on Data Management for End-to-End Machine Learning SP - 1-4 PB - ACM SN - 979-8-4007-0204-4 DO - 10.1145/3595360.3595852 UR - https://fis.uni-bamberg.de/handle/uniba/94682 LA - eng ER - TY - JOUR TI - Inverted-Classroom-Tagungen : Erfahrungsbericht zu einem neuen Konferenzformat AU - Mrohs, Lorenz AU - Witt, Theresia AU - Herrmann, Dominik PY - 2023 JO - Zeitschrift für Hochschulentwicklung : ZFHE VL - 18 IS - 4 SP - 315-331 PB - ÖGHD CY - Wien SN - 2219-6994 DO - 10.21240/zfhe/18-04/17 UR - https://fis.uni-bamberg.de/handle/uniba/92634 LA - deu AB - Der Beitrag befasst sich mit einem neuen Konferenzformat in Anlehnung an das Inverted-Classroom-Konzept, bestehend aus einem asynchronen Online-Teil und einer synchronen Präsenzveranstaltung. Im Vordergrund steht die Frage, wie Konferenzen didaktisch sinnvoll gestaltet werden können. Das Inverted-Classroom-Konzept kann darauf Antwort geben, jedoch liefert die Literatur keine Hinweise, wie dies auf wissenschaftliche Tagungen angewendet werden kann. Der vorliegende Erfahrungsbericht gibt Einblicke in die Gestaltung einer Inverted-Classroom-Konferenz. Dadurch soll auf ein neues Konferenzformat aufmerksam gemacht und ein Anstoß für weitere wissenschaftliche Auseinandersetzungen gegeben werden. KW - wissenschaftliche Tagung KW - Online-Konferenz KW - hybride Konferenz KW - Inverted-Classroom-Tagung KW - Inverted Classroom KW - scientific conference KW - online conference KW - hybrid conference KW - inverted-classroom conference KW - inverted classroom ER - TY - CPAPER TI - Privacy-aware Publication of Wi-Fi Sensor Data for Crowd Monitoring and Tourism Analytics AU - Ackermann, Leonie AU - Baum, Christoph AU - Litvin, Aleksandr AU - Nicklas, Daniela AU - Khalil, Syed Ibrahim PY - 2023 T2 - GeoPrivacy '23: Proceedings of the 1st ACM SIGSPATIAL International Workshop on Geo-Privacy and Data Utility for Smart Societies SP - 20-23 CY - New York DO - 10.1145/3615889.3628513 UR - https://fis.uni-bamberg.de/handle/uniba/92607 LA - eng AB - Estimating visitor frequency in urban areas often relies on camera-based solutions or the active participation of individuals using smartphone applications or devices with RFID or Bluetooth technology. This paper presents the results of a preliminary study on anonymous data collection as a basis for data-driven visitor guidance in Bamberg’s Old Town, using passive, non-intrusive and low-cost Wi-Fi sensors. The study includes a field test installation to evaluate data quality under robust anonymization measures. The data collected as part of the project will be made available to the public in the Mobilithek of the Federal Ministry of Digital Affairs and Transport (BMDV). Still, the collection of Wi-Fi probe requests raises legitimate privacy concerns. We address potential attack models for identifying and tracking devices based on these requests and explain the data collection architecture and Technical Data Protection Concept implemented within CrowdAnym to mitigate these risks. We evaluate the impact of our approach on the quality of the CrowdAnym dataset by comparing the data from one sensor location with the number of people counted by a nearby laser scanner. We are able to show that our approach approximates visitor density well, however the deviation of our data from ground truth increases as visitor frequency increases. KW - MAC address detection KW - datasets KW - anonymization ER - TY - CPAPER TI - Towards Anonymizing Intermodal Mobility Data for Smart Cities AU - Ackermann, Leonie AU - Mühlhauser, Michael AU - Burdusel, Alexandru AU - Federlin, Michael AU - Herrmann, Dominik AU - Holly, Steffen AU - Nicklas, Daniela AU - Wolpert, Daniel PY - 2023 T2 - GeoPrivacy '23: Proceedings of the 1st ACM SIGSPATIAL International Workshop on Geo-Privacy and Data Utility for Smart Societies SP - 24-27 CY - New York DO - 10.1145/3615889.3628514 UR - https://fis.uni-bamberg.de/handle/uniba/92608 LA - eng AB - As cities seek to optimize their resources for a sustainable and livable future, the concept of intermodal mobility has become increasingly important. However, the collection and analysis of intermodal mobility data is complicated by the need for robust anonymization methods, as privacy and security concerns remain paramount. Existing anonymization methods are either mode-specific or so complicated that they deter potential stakeholders. In this paper, we describe a variety of real mobility data sources for our upcoming field study. With that data, we plan to provide insights into infrastructure utilization and transitions between modes of transport. We further identified several anonymization techniques for mobility data to ensure privacy and acceptance among the citizens. To find suitable techniques for intermodal mobility data, we provide insights from our previous experience on anonymization and discuss the practicability of the identified techniques. Our paper highlights the need for explainable anonymization methods tailored to intermodal mobility data that address privacy and security concerns and pave the way for more accessible privacy-compliant solutions. KW - Intermodal Mobility KW - Smart Cities KW - Anonymization KW - Privacy ER - TY - THES TI - The Basin Network : A Model for Data Sharing and Exchange AU - Kasrin, Nasr PY - 2023 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-91269 UR - https://fis.uni-bamberg.de/handle/uniba/91269 LA - eng AB - How can we facilitate the exchange of datasets and other data assets across heterogeneous technical and social environments? This is a classical problem that is more relevant today than ever before, relevant both on a global scale as well as the scale of organizations. We need to distinguish between two notions of data sharing and exchange: one based on the integration of data at the schema level, and the other, which is our focus here, is based on the description, publication, discovery, compilation of data as an asset (similar to how a book is managed in a library). The state-of-the art of the data sharing and exchange problem is polarized. On one end we have emerging 'platforms' which can be susceptible to become walled-gardens that do not interoperate with each other. On the other, we have recommendations such as FAIR guidelines, or architectural abstractions such as data lake and data catalog that help orchestrate vendors in developing interoperable technologies; taking us in the right direction but not too far, due to being too high-level and more normative/prescriptive than constructive. This work fills a gap by making a (1) 'medium-level' proposal, (2) in the form of a constructive recommendation (an architectural pattern), (3) which incorporates several major recommendations. We propose the Basin Network, a distributed architectural pattern which revolves around two novel abstractions: the Offering (message exchange format) and the Basin (node). We adopt an indirection approach: a data asset is managed and exchanged via a surrogate (intermediate representation) which identifies, represents, describes, and effectively 'stands in' for it. The Offering is a model for such surrogates; built on the URI-Resource framework for hypermedia authoring but avoiding some of its pitfalls. The Basin is structure to author, catalog, and manage Offerings and exchange them with other Basins (publish/subscribe), resulting in a Basin Network (akin to a network of data lakes). We demonstrate the applicability of the proposal by applying it to use-cases in three domains: a computer-aided manufacturing project, an IoT project in smart agriculture, and one in crowd data management. KW - Data Exchange KW - Data Catalog KW - Data Architecture KW - Design Pattern KW - FAIR data KW - Standardization KW - Data Mesh KW - Data Lake KW - Data Space ER - TY - CPAPER TI - Context-aware Outlier Detection for Sensor Data Stream Processing AU - Benabbas, Aboubakr AU - Grawunder, Marco AU - Nicklas, Daniela PY - 2023 T2 - 2023 IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events (PerCom Workshops) PB - IEEE SN - 978-1-6654-5381-3 DO - 10.1109/percomworkshops56833.2023.10150217 UR - https://fis.uni-bamberg.de/handle/uniba/91848 LA - eng ER - TY - GEN TI - On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing AU - Adler, Isolde AU - Köhler, Noleen AU - Peng, Pan PY - 2023 SP - 1-69 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/91019 LA - eng AB - We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that is defined by a formula with quantifier prefix ∃∗∀∗ is testable (i.e., testable with constant query complexity), while there exists an FO property that is expressible by a formula with quantifier prefix ∀∗∃∗ that is not testable. In the dense graph model, a similar picture is long known (Alon, Fischer, Krivelevich, Szegedy, Combinatorica 2000), despite the very different nature of the two models. In particular, we obtain our lower bound by an FO formula that defines a class of bounded-degree expanders, based on zig-zag products of graphs. We expect this to be of independent interest. We then use our class of FO definable bounded-degree expanders to answer a long-standing open problem for proximity-oblivious testers (POTs). POTs are a class of particularly simple testing algorithms, where a basic test is performed a number of times that may depend on the proximity parameter, but the basic test itself is independent of the proximity parameter. In their seminal work, Goldreich and Ron [STOC 2009; SICOMP 2011] show that the graph properties that are constant-query proximity-oblivious testable in the bounded-degree model are precisely the properties that can be expressed as a generalised subgraph freeness (GSF) property that satisfies the non-propagation condition. It is left open whether the non-propagation condition is necessary. We give a negative answer by showing that our property is a GSF property which is propagating. Hence in particular, our property does not admit a POT. For this result we establish a new connection between FO properties and GSF-local properties via neighbourhood profiles. KW - Graph property testing KW - first-order logic KW - proximity-oblivious testing KW - locality KW - lower bound ER - TY - JOUR TI - An explicit construction of graphs of bounded degree that are far from being Hamiltonian AU - Adler, Isolde AU - Köhler, Noleen PY - 2023 SP - 1-19 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/91022 LA - eng AB - Hamiltonian cycles in graphs were first studied in the 1850s. Since then, an impressive amount of research has been dedicated to identifying classes of graphs that allow Hamiltonian cycles, and to related questions. The corresponding decision problem, that asks whether a given graph is Hamiltonian (i.\,e.\ admits a Hamiltonian cycle), is one of Karp's famous NP-complete problems. In this paper we study graphs of bounded degree that are \emph{far} from being Hamiltonian, where a graph G on n vertices is \emph{far} from being Hamiltonian, if modifying a constant fraction of n edges is necessary to make G Hamiltonian. We give an explicit deterministic construction of a class of graphs of bounded degree that are locally Hamiltonian, but (globally) far from being Hamiltonian. Here, \emph{locally Hamiltonian} means that every subgraph induced by the neighbourhood of a small vertex set appears in some Hamiltonian graph. More precisely, we obtain graphs which differ in Θ(n) edges from any Hamiltonian graph, but non-Hamiltonicity cannot be detected in the neighbourhood of o(n) vertices. Our class of graphs yields a class of hard instances for one-sided error property testers with linear query complexity. It is known that any property tester (even with two-sided error) requires a linear number of queries to test Hamiltonicity (Yoshida, Ito, 2010). This is proved via a randomised construction of hard instances. In contrast, our construction is deterministic. So far only very few deterministic constructions of hard instances for property testing are known. We believe that our construction may lead to future insights in graph theory and towards a characterisation of the properties that are testable in the bounded-degree model. KW - Computer Science - Discrete Mathematics KW - Computer Science - Computational Complexity KW - Computer Science - Data Structures and Algorithms,G.2.2 ER - TY - CPAPER TI - On Developing an E-Assessment Tool for Agile Practices AU - Jacob, Kerstin AU - Hallmann, Daniel AU - Lüttgen, Gerald AU - Völpel, Vanessa PY - 2023 SP - 13-18 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90945 LA - eng AB - As agile software development processes are widely applied in industry, students need to develop a good understanding of agile principles and practices as part of their education. During our ten years of experience with teaching the Scrum framework in team project modules, we noticed that students frequently struggle with writing good user stories and concise sprint goals. To support students in mastering basic practices and to free limited teaching resources for more in-depth discussions on advanced topics, e-assessment tools should be developed to provide timely feedback on at least common mistakes. This paper argues that, and sketches how, research on quality criteria for artifacts of agile development can serve as the basis for such a tool. However, multiple challenges remain that we invite lecturers and researchers to discuss. KW - agile software development KW - e-assessment tool KW - Scrum ER - TY - GEN TI - On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing AU - Adler, Isolde AU - Köhler, Noleen AU - Peng, Pan PY - 2023 SP - 1-69 PB - arXiv CY - Online DO - 10.48550/arxiv.2304.03810 UR - https://fis.uni-bamberg.de/handle/uniba/90093 LA - eng AB - We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that is defined by a formula with quantifier prefix ∃∗∀∗ is testable (i.e., testable with constant query complexity), while there exists an FO property that is expressible by a formula with quantifier prefix ∀∗∃∗ that is not testable. In the dense graph model, a similar picture is long known (Alon, Fischer, Krivelevich, Szegedy, Combinatorica 2000), despite the very different nature of the two models. In particular, we obtain our lower bound by an FO formula that defines a class of bounded-degree expanders, based on zig-zag products of graphs. We expect this to be of independent interest. We then use our class of FO definable bounded-degree expanders to answer a long-standing open problem for proximity-oblivious testers (POTs). POTs are a class of particularly simple testing algorithms, where a basic test is performed a number of times that may depend on the proximity parameter, but the basic test itself is independent of the proximity parameter. In their seminal work, Goldreich and Ron [STOC 2009; SICOMP 2011] show that the graph properties that are constant-query proximity-oblivious testable in the bounded-degree model are precisely the properties that can be expressed as a generalised subgraph freeness (GSF) property that satisfies the non-propagation condition. It is left open whether the non-propagation condition is necessary. We give a negative answer by showing that our property is a GSF property which is propagating. Hence in particular, our property does not admit a POT. For this result we establish a new connection between FO properties and GSF-local properties via neighbourhood profiles. KW - Graph property testing KW - first-order logic KW - proximity-oblivious testing KW - locality KW - lower bound ER - TY - JOUR TI - Faster Property Testers in a Variation of the Bounded Degree Model AU - Adler, Isolde AU - Fahey, Polly PY - 2023 JO - ACM Transactions on Computational Logic : TOCL VL - 24 IS - 3 SP - 1-24 PB - Association for Computing Machinery (ACM) CY - New York SN - 1529-3785 DO - 10.1145/3584948 UR - https://fis.uni-bamberg.de/handle/uniba/90091 LA - eng ER - TY - CHAP TI - Einleitung AU - Mrohs, Lorenz AU - Hess, Miriam AU - Lindner, Konstantin AU - Schlüter, Julia AU - Overhage, Sven PY - 2023 T2 - Digitalisierung in der Hochschullehre – Perspektiven und Gestaltungsoptionen SP - 9-14 PB - University of Bamberg Press CY - Bamberg SN - 978-3-86309-886-5 DO - 10.20378/irb-89798 UR - https://fis.uni-bamberg.de/handle/uniba/89798 LA - deu AB - - KW - - ER - TY - CPAPER TI - On Developing an E-Assessment Tool for Agile Practices AU - Jacob, Kerstin AU - Hallmann, Daniel AU - Lüttgen, Gerald AU - Völpel, Vanessa PY - 2023 T2 - Proceedings der SEUH 2023 : 23.-24. Februar 2023 in Paderborn, Deutschland SP - 13-18 PB - Gesellschaft für Informatik CY - Bonn SN - 978-3-88579-727-2 DO - 10.18420/seuh2023_01 UR - https://fis.uni-bamberg.de/handle/uniba/90073 LA - eng AB - As agile software development processes are widely applied in industry, students need to develop a good understanding of agile principles and practices as part of their education. During our ten years of experience with teaching the Scrum framework in team project modules, we noticed that students frequently struggle with writing good user stories and concise sprint goals. To support students in mastering basic practices and to free limited teaching resources for more in-depth discussions on advanced topics, e-assessment tools should be developed to provide timely feedback on at least common mistakes. This paper argues that, and sketches how, research on quality criteria for artifacts of agile development can serve as the basis for such a tool. However, multiple challenges remain that we invite lecturers and researchers to discuss. KW - agile software development KW - e-assessment tool KW - Scrum ER - TY - BOOK TI - Digitalisierung in der Hochschullehre – Perspektiven und Gestaltungsoptionen ED - Mrohs, Lorenz ED - Hess, Miriam ED - Lindner, Konstantin ED - Schlüter, Julia ED - Overhage, Sven PY - 2023 PB - University of Bamberg Press CY - Bamberg T3 - Forum Lehrerinnen- und Lehrerbildung SN - 978-3-86309-886-5 DO - 10.20378/irb-59190 UR - https://fis.uni-bamberg.de/handle/uniba/59190 LA - deu AB - Die Digitalisierung übt tiefgreifenden Einfluss auf verschiedenste Bereiche menschlichen Lebens aus, unter anderem auf Bildung und damit einhergehend auch auf die Hochschullehre. Eine Kultur der Digitalität (Felix Stalder) verändert nicht nur die für Hochschulen grundlegenden Formen der Produktion von Wissen, sondern ebenso die Umgangsformen und Lehr-Lern-Strategien, die in Lehrveranstaltungen zum Einsatz kommen. Sie wirkt sich auf die Art und Weise aus, wie Wissensinhalte und Kompetenzen vermittelt, erworben und angewendet werden, aber auch auf die Integration digitaler Lerninhalte, die Schaffung neuer Lehr- und Lernmethoden sowie neuer Prüfungsformate. Eine Kultur der Digitalität eröffnet Chancen, um die Qualität der Lehre zu verbessern – beispielsweise durch die Erhöhung von Flexibilität, durch Anpassungsmöglichkeiten an die individuellen Bedürfnisse der Studierenden oderdurch die Vorbereitung sowie Ermöglichung lebenslangen Lernens. Damit verbunden sind jedoch auch Herausforderungen, die beispielsweise im Verhältnis und der Orchestrierung von Präsenz- und Online-Phasen, in der technischen Ausstattung oder in der nötigen Professionalität der Dozierenden gründen. Letztlich kommt es darauf an, die Möglichkeiten der Digitalisierung für die Hochschullehre gezielt und sinnvoll zu nutzen, um zu einer Erhöhung der Qualität beizutragen. Dieser Sammelband hat das Ziel zu einer zukunftsweisenden interdisziplinären Entwicklung und sinnvollen Gestaltung einer digitalen Kultur der Lehre beizutragen. Die enthaltenen Beiträge diskutieren allgemeine Rahmungen zur Digitalisierung der Hochschullehre und präsentieren sodann Ausführungen zu digitalen und digital gestützten Formaten verschiedener Größenordnung: von einzelnen Tools, über die Ebene von Lehrveranstaltungen bis hin zur Studienorganisation und flankierenden Maßnahmen. KW - Digitalisierung KW - Hochschullehre KW - Digitale Lehre KW - Kultur der Digitalität KW - Lern-Innovation KW - Hybride Lehre KW - Digitales Lernen KW - Digitale Hochschullehre KW - Didaktisches Design KW - Inverted Classroom KW - Blended Learning KW - Online-Lehre KW - Hochschulentwicklung ER - TY - JOUR TI - Augmenting survey data with digital trace data : Is there a threat to panel retention? AU - Trappmann, Mark AU - Schwarz, Stefan AU - Haas, Georg-Christoph AU - Malich, Sonja AU - Keusch, Florian AU - Bähr, Sebastian AU - Kreuter, Frauke PY - 2023 SP - 541–552 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/59900 LA - eng AB - Linking digital trace data to existing panel survey data may increase the overall analysis potential of the data. However, producing linked products often requires additional engagement from survey participants through consent or participation in additional tasks. Panel operators may worry that such additional requests may backfire and lead to lower panel retention, reducing the analysis potential of the data. To examine these concerns, we conducted an experiment in the German PASS panel survey after wave 11. Three quarters of panelists (n = 4,293) were invited to install a research app and to provide sensor data over a period of 6 months, while one quarter (n = 1,428) did not receive an invitation. We find that the request to install a smartphone app and share data significantly decreases panel retention in the wave immediately following the invitation by 3.3 percentage points. However, this effect wears off and is no longer significant in the second and third waves after the invitation. We conclude that researchers who run panel surveys have to take moderate negative effects on retention into account but that the potential gain likely outweighs these moderate losses. KW - Attrition KW - Digital trace data KW - Panel survey KW - Privacy KW - Respondent burden ER - TY - THES TI - Design of a Smart Community Event Planning Platform AU - Ackermann, Leonie Valentina PY - 2023 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-59764 UR - https://fis.uni-bamberg.de/handle/uniba/59764 LA - eng AB - This master thesis builds upon the project idea ”Raum- und Materiallotse” which is part of Bamberg’s Smart City strategy, and makes suggestions for its implementation. It was investigated which stakeholders are interested in using a Smart Community Event Planning Platform like ”Raum- und Materiallotse” and requirements from the perspective of the expected users were identified via interviews. This project was worked on with Chaudry Hamza Tariq, who was particularly involved in developing a prototype (Smart Events Web Application) based on the user stories distilled from the interviews and proposing a solution to enable access to community-shared rooms through smart locks. Each individual’s contributions to the research are highlighted in the respective chapters. This report provides an in-depth analysis of the Smart Events web app and explores its development and implementation’s technical and practical aspects. It also investigates the potential limitations and challenges of developing a secure access system, including user privacy, security, and scalability issues. Additionally, this master thesis examines how a space search and event planning platform can support the development of Smart Community and makes specific recommendations for its implementation in Bamberg. By exploring the requirements and limitations of such a platform, this thesis contributes to the broader field of access control and secure storage, demonstrating how smart locks and other technologies can be applied to community-based spaces and events and highlighting this approach’s potential benefits and challenges. Furthermore, the research conducted in this master thesis contributes to the ongoing exploration of practices to improve the participation of citizens and non-governmental institutions in Smart Cities and to build sustainable Smart Communities, where individuals, organisations and governing agencies work in partnership to realise a common goal. KW - Smart City KW - Smart Community KW - Event Planning KW - Smart Locks ER - TY - CPAPER TI - An Experimental Evaluation of Relations Between Architectural and Runtime Metrics in Microservices Systems AU - Knoll, Niels AU - Lichtenthäler, Robin PY - 2023 SP - 147-154 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/59669 LA - eng AB - The decisions made about the architecture of a microservices system at design time influence the runtime behavior of the resulting system and can be hard to change later. But predicting or evaluating how excatly architecture decisions impact runtime behavior is difficult and in practice mostly based on previous experience. Architectural metrics that are measurable at design time and have a traceable impact on runtime metrics could support architectural decision making to improve quality and prevent costly redevelopments. To investigate traceable relations between architectural metrics and runtime metrics, this paper presents a model-driven generation system for microservice architectures. The system can be used to benchmark different architecture alternatives of a Java-based application without manually changing application code. Using this system, we performed experiments to examine relations between architectural metrics and throughput as a runtime metric. KW - Microservice Architecture KW - Architecture Metrics KW - Model Driven Generation ER - TY - CPAPER TI - Recursive SQL and GPU-Support for In-Database Machine Learning AU - Schüle, Maximilian PY - 2023 SP - 931 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/59173 LA - eng AB - But to retrieve the latest data from a database, time-consuming extraction is necessary as database systems have rarely been used for operations such as matrix algebra and gradient descent.In this work, we demonstrate that SQL with recursive tables makes it possible to express a complete machine learning pipeline out of data preprocessing, model training and its validation.To facilitate the specification of loss functions, we extend the code-generating database system Umbra by an operator for automatic differentiation for use within recursive tables:With the loss function expressed in SQL as a lambda function, Umbra generates machine code for each partial derivative.We further use automatic differentiation for a dedicated gradient descent operator, which generates LLVM code to train a user-specified model on GPUs.We fine-tune GPU kernels at hardware level to allow a higher throughput and propose non-blocking synchronisation of multiple units.In our evaluation, automatic differentiation accelerated the runtime by the number of cached subexpressions compared to compiling each derivative separately.Our GPU kernels with independent models allowed maximal throughput even for small batch sizes, making machine learning pipelines within SQL more competitive. KW - SQL KW - Machine Learning ER - TY - CPAPER TI - NN2SQL : Let SQL Think for Neural Networks AU - Schüle, Maximilian AU - Kemper, Alfons AU - Neumann, Thomas PY - 2023 SP - 183-194 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/59172 LA - eng AB - Although database systems perform well in data access and manipulation, their relational model hinders data scientists from formulating machine learning algorithms in SQL. Nevertheless, we argue that modern database systems perform well for machine learning algorithms expressed in relational algebra. To overcome the barrier of the relational model, this paper shows how to transform data into a relational representation for training neural networks in SQL: We first describe building blocks for data transformation in SQL. Then, we compare an implementation for model training using array data types to the one using a relational representation in SQL-92 only. The evaluation proves the suitability of modern database systems for matrix algebra, although specialised array data types perform better than matrices in relational representation. KW - SQL-92 KW - Neural Networks KW - Automatic Differentiation ER - TY - CPAPER TI - Recursive SQL and GPU-Support for In-Database Machine Learning AU - Schüle, Maximilian PY - 2023 T2 - Lecture Notes in Informatics (LNI) : Proceedings ; P-331 SP - 931 PB - Gesellschaft für Informatik e.V. CY - Bonn SN - 978-3-88579-725-8 DO - 10.18420/BTW2023-62 UR - https://fis.uni-bamberg.de/handle/uniba/58982 LA - eng AB - In machine learning, continuously retraining a model guarantees accurate predictions based on the latest data as training input. But to retrieve the latest data from a database, time-consuming extraction is necessary as database systems have rarely been used for operations such as matrix algebra and gradient descent.In this work, we demonstrate that SQL with recursive tables makes it possible to express a complete machine learning pipeline out of data preprocessing, model training and its validation.To facilitate the specification of loss functions, we extend the code-generating database system Umbra by an operator for automatic differentiation for use within recursive tables:With the loss function expressed in SQL as a lambda function, Umbra generates machine code for each partial derivative.We further use automatic differentiation for a dedicated gradient descent operator, which generates LLVM code to train a user-specified model on GPUs.We fine-tune GPU kernels at hardware level to allow a higher throughput and propose non-blocking synchronisation of multiple units.In our evaluation, automatic differentiation accelerated the runtime by the number of cached subexpressions compared to compiling each derivative separately.Our GPU kernels with independent models allowed maximal throughput even for small batch sizes, making machine learning pipelines within SQL more competitive. KW - SQL KW - Machine Learning ER - TY - CPAPER TI - NN2SQL : Let SQL Think for Neural Networks AU - Schüle, Maximilian AU - Kemper, Alfons AU - Neumann, Thomas PY - 2023 T2 - Lecture Notes in Informatics (LNI) : Proceedings ; P-331 SP - 183-194 PB - Gesellschaft für Informatik e.V. CY - Bonn SN - 978-3-88579-725-8 DO - 10.18420/BTW2023-09 UR - https://fis.uni-bamberg.de/handle/uniba/58981 LA - eng AB - Although database systems perform well in data access and manipulation, their relational model hinders data scientists from formulating machine learning algorithms in SQL. Nevertheless, we argue that modern database systems perform well for machine learning algorithms expressed in relational algebra. To overcome the barrier of the relational model, this paper shows how to transform data into a relational representation for training neural networks in SQL: We first describe building blocks for data transformation in SQL. Then, we compare an implementation for model training using array data types to the one using a relational representation in SQL-92 only. The evaluation proves the suitability of modern database systems for matrix algebra, although specialised array data types perform better than matrices in relational representation. KW - SQL-92 KW - Neural Networks KW - Automatic Differentiation ER - TY - CPAPER TI - Wie motiviert man Menschen zur Preisgabe ihrer Daten? AU - Leder, Johannes AU - Schütz, Astrid AU - Pridöhl, Henning AU - Herrmann, Dominik PY - 2023 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-58292 UR - https://fis.uni-bamberg.de/handle/uniba/58292 LA - deu AB - . KW - Daten KW - Nahverkehr ER - TY - CPAPER TI - Standing out among the daily spam : How to catch website owners’ attention by means of vulnerability notifications AU - Hennig, Anne AU - Neusser, Fabian AU - Pawelek, Aleksandra Alicja AU - Herrmann, Dominik AU - Mayer, Peter PY - 2022 T2 - CHI EA '22: CHI Conference on Human Factors in Computing Systems Extended Abstracts SP - 1-8 PB - ACM CY - New York, NY, United States SN - 978-1-4503-9156-6 DO - 10.1145/3491101.3519847 UR - https://fis.uni-bamberg.de/handle/uniba/115839 LA - eng AB - Running a business without having a website is nearly impossible nowadays. Most business owners use content managements systems to manage their websites. Yet, those can pose security risks and provide vulnerabilities for manipulations. With vulnerability notifcations, website owners are notifed about security risks. To identify common themes with respect to vulnerability notifcations and provide deeper insight into the motivations of website owners to react to those notifcations, we conducted 25 semi-structured interviews. In compliance with previous research, we could confrm that distrust in unexpected notifcations is high and, in contrast to previous research, we suggest that verifcation possibilities are the most important factors to establish trust in notifcations. We also endorse the fndings that raising awareness for the severity and the complexity of the problems is crucial to increase remediation rates. KW - web security KW - CMS vulnerabilities KW - vulnerability notifcation KW - security awareness ER - TY - JOUR TI - High Fidelity Simulation of Hybrid Systems using Higher Order Hybrid Automata AU - Ro, Jin Woo AU - Malik, Avinash AU - Roop, Partha S. PY - 2022 JO - IEEE Transactions on Computers VL - 71 IS - 7 SP - 1668-1680 PB - IEEE Computer Soc. SN - 1557-9956 DO - 10.1109/tc.2021.3100746 UR - https://fis.uni-bamberg.de/handle/uniba/109401 LA - eng ER - TY - JOUR TI - GitOps : The Evolution of DevOps? AU - Beetz, Florian AU - Harrer, Simon PY - 2022 JO - IEEE software VL - 39 IS - 4 SP - 70-75 PB - Soc. CY - Los Alamitos, Calif. SN - 1937-4194 DO - 10.1109/ms.2021.3119106 UR - https://fis.uni-bamberg.de/handle/uniba/109400 LA - eng ER - TY - JOUR TI - Model-driven Engineering for Dynamic Data Structures AU - Boockmann, Jan Henrik AU - Jacob, Kerstin AU - Lüttgen, Gerald PY - 2022 JO - Softwaretechnik-Trends : Mitteilungen der Fachgruppen VL - 42 IS - 4 SP - 2-7 PB - Gesellschaft für Informatik e.V. CY - Bonn SN - 0720-8928 UR - https://fis.uni-bamberg.de/handle/uniba/105316 LA - eng ER - TY - CPAPER TI - Heap Patterns for Memory Graph Visualization AU - Boockmann, Jan AU - Lüttgen, Gerald PY - 2022 T2 - 2022 Working Conference on Software Visualization (VISSOFT) SP - 162-166 PB - IEEE SN - 978-1-6654-8092-5 DO - 10.1109/VISSOFT55257.2022.00025 UR - https://fis.uni-bamberg.de/handle/uniba/105320 LA - eng ER - TY - JOUR TI - Vapnik–Chervonenkis dimension and density on Johnson and Hamming graphs AU - Adler, Isolde AU - Benediktsson, Bjarki Geir AU - Macpherson, Dugald PY - 2022 JO - Discrete applied mathematics : the journal of combinatorial algorithms, informatics and computational sciences VL - 312 SP - 29-44 PB - Elsevier CY - Amsterdam SN - 0166-218X DO - 10.1016/j.dam.2021.09.017 UR - https://fis.uni-bamberg.de/handle/uniba/90094 LA - eng ER - TY - CPAPER TI - Throw Away Student Software At Semester End? : Better Not! AU - Boockmann, Jan AU - Jacob, Kerstin AU - Lüttgen, Gerald PY - 2022 SP - 23-28 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/57354 LA - eng AB - Software engineering is continuously evolving in order to meet the challenges faced by the ever growing complexity and longevity of digital systems. Students should thus acquire additional practical competencies wrt. software evolution and maintenance. This paper describes how student team projects at our Chair have been redesigned to meet this need, and reports on our first experiences. It also aims at initiating a discussion on the challenges we met, namely the contributions we can expect from students, the effort required from staff, and the individualization of grades. KW - long-living software KW - project-based learning KW - software evolution and maintenance ER - TY - CPAPER TI - Throw Away Student Software At Semester End? : Better Not! AU - Boockmann, Jan AU - Jacob, Kerstin AU - Lüttgen, Gerald PY - 2022 T2 - Software Engineering im Unterricht der Hochschulen SEUH 2022 : 24.-25. Februar 2022, Berlin ; Proceedings SP - 23--28 CY - Bonn SN - 978-3-88579-715-9 DO - 10.18420/SEUH2022_03 UR - https://fis.uni-bamberg.de/handle/uniba/57001 LA - eng AB - Software engineering is continuously evolving in order to meet the challenges faced by the ever growing complexity and longevity of digital systems. Students should thus acquire additional practical competencies wrt. software evolution and maintenance. This paper describes how student team projects at our Chair have been redesigned to meet this need, and reports on our first experiences. It also aims at initiating a discussion on the challenges we met, namely the contributions we can expect from students, the effort required from staff, and the individualization of grades. KW - long-living software KW - project-based learning KW - software evolution and maintenance ER - TY - CPAPER TI - Studentische E-Portfolio-Nutzung : Begleitung der Entwicklung und Einführung von Mahara an der Universität Bamberg AU - Eisenmann, Rahel AU - Sticht, Martin AU - Hirmer, Tobias AU - Henrich, Andreas AU - Scheunpflug, Annette PY - 2022 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-56143 UR - https://fis.uni-bamberg.de/handle/uniba/56143 LA - deu AB - Durch die Einführung und Etablierung der Plattform Mahara, welche die Erstellung von E-Portfolios ermöglicht, soll an der Otto-Friedrich-Universität Bamberg individuelles Lernen langfristig digital etabliert und unterstützt werden. Erste E-Portfolios wurden im Sommersemester 2022 in verschiedenen Studiengängen mit unterschiedlichen Herangehensweisen umgesetzt. Das Poster zeigt wichtige Designentscheidungen und Meilensteine der technischen und didaktischen Umsetzung einer universitätsweiten E-Portfolio-Lösung auf. Die unterschiedlichen Anwendungsfälle werden kurz charakterisiert und erste Ergebnisse einer Evaluation dargestellt. KW - E-Portfolio KW - Mahara KW - Erfahrungsbericht ER - TY - JOUR TI - A linear-time branching-time perspective on interface automata AU - Vogler, Walter AU - Lüttgen, Gerald PY - 2022 SP - 513-550 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/55170 LA - eng AB - Over the past two decades, de Alfaro and Henzinger’s interface automata (IA) have become a popular formal framework for the component-based specification of concurrent systems. IA’s parallel composition assumes that a component may wait on inputs but never on outputs, implying that an output must be consumed immediately or a communication error occurs. By now, the literature contains a number of semantics for IA: linear-time semantics based on traces observing communication errors, quiescence and/or divergence, as well as branching-time semantics based on alternating simulation. This article surveys these semantics from Rob van Glabbeek’s linear-time branching-time perspective, which does not consider settings with communication errors. We shed light onto the subtleties implied by IA’s pruning of all behaviour that might lead a component to autonomously enter an error state, and investigate when exactly de Alfaro and Henzinger’s restriction of input-determinism is needed. In addition, we introduce several new semantics for IA, in particular the linear-time ready semantics and the branching-time ready simulation. KW - interface automata KW - semantics KW - simulation KW - de Alfaro and Henzinger’s restriction KW - Glabbeek’s linear-time branching-time perspective ER - TY - CPAPER TI - Reinforcement Learning With Imperfect Safety Constraints AU - Ro, Jin Woo AU - Lüttgen, Gerald AU - Wolter, Diedrich PY - 2022 T2 - Artificial Intelligence Safety 2022 : Proceedings of the Workshop on Artificial Intelligence Safety 2022 (SafeAI 2022) co-located with the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI2022) Virtual, February, 2022. SP - 1-8 PB - RWTH Aachen CY - Aachen, Germany T3 - CEUR workshop proceedings UR - https://fis.uni-bamberg.de/handle/uniba/55364 LA - eng ER - TY - JOUR TI - Augmenting survey data with digital trace data : Is there a threat to panel retention? AU - Trappmann, Mark AU - Schwarz, Stefan AU - Haas, Georg-Christoph AU - Malich, Sonja AU - Keusch, Florian AU - Bähr, Sebastian AU - Kreuter, Frauke PY - 2022 JO - Journal of survey statistics and methodology : JSSAM VL - 11 IS - 3 SP - 541–552 PB - Oxford Univ. Press CY - Oxford SN - 2325-0992 DO - 10.1093/jssam/smac023 UR - https://fis.uni-bamberg.de/handle/uniba/55026 LA - eng AB - Linking digital trace data to existing panel survey data may increase the overall analysis potential of the data. However, producing linked products often requires additional engagement from survey participants through consent or participation in additional tasks. Panel operators may worry that such additional requests may backfire and lead to lower panel retention, reducing the analysis potential of the data. To examine these concerns, we conducted an experiment in the German PASS panel survey after wave 11. Three quarters of panelists (n = 4,293) were invited to install a research app and to provide sensor data over a period of 6 months, while one quarter (n = 1,428) did not receive an invitation. We find that the request to install a smartphone app and share data significantly decreases panel retention in the wave immediately following the invitation by 3.3 percentage points. However, this effect wears off and is no longer significant in the second and third waves after the invitation. We conclude that researchers who run panel surveys have to take moderate negative effects on retention into account but that the potential gain likely outweighs these moderate losses. KW - Attrition KW - Digital trace data KW - Panel survey KW - Privacy KW - Respondent burden ER - TY - JOUR TI - Data-sharing markets for integrating IoT data processing functionalities AU - Kasrin, Nasr AU - Benabbas, Aboubakr AU - Elmamooz, Golnaz AU - Nicklas, Daniela AU - Steuer, Simon AU - Sünkel, Michael PY - 2022 SP - 76-93 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/54951 LA - eng AB - The recent evolution of the Internet of Things into a cyber-physical reality has spawned various challenges from a data management perspective. In addition, IoT platform designers are faced with another set of questions. How can platforms be extended to smoothly integrate new data management functionalities? Currently, data processing related tasks are typically realized by manually developed code and functions which creates difficulties in maintenance and growth. Hence we need to explore other approaches to integration for IoT platforms. In this paper we cover both these aspects: (1) we explore several emerging data management challenges, and (2) we propose an IoT platform integration model that can combine disparate functionalities under one roof. For the first, we focus on the following challenges: sensor data quality, privacy in data streams, machine learning model management, and resource-aware data management. For the second, we propose an information-integration model for IoT platforms. The model revolves around the concept of a Data-Sharing Market where data management functionalities can share and exchange information about their data with other functionalities. In addition, data-sharing markets themselves can be combined into networks of markets where information flows from one market to another, which creates a web of information exchange about data resources. To motivate this work we present a use-case application in smart cities. KW - Internet of Things KW - Resource-Awareness KW - Infrastructure Design KW - Information Integration KW - Data Management Systems KW - Data Quality KW - Privacy KW - Machine Learning Model Management ER - TY - JOUR TI - On the automation-supported derivation of domain-specific UML profiles considering static semantics AU - Kraas, Alexander PY - 2022 VL - 21 IS - 1 SP - 51-79 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/54847 LA - eng AB - In the light of standardization, the model-driven engineering (MDE) is becoming increasingly important for the development of DSLs, in addition to traditional approaches based on grammar formalisms. Metamodels define the abstract syntax and static semantics of a DSL and can be created by using the language concepts of the Meta Object Facility (MOF) or by defining a UML profile. Both metamodels and UML profiles are often provided for standardized DSLs, and the mappings of metamodels to UML profiles are usually specified informally in natural language, which also applies for the static semantics of metamodels and/or UML profiles, which has the disadvantage that ambiguities can occur, and that the static semantics must be manually translated into a machine-processable language. To address these weaknesses, we propose a new automated approach for deriving a UML profile from the metamodel of a DSL. One novelty is that subsetting or redefining metaclass attributes are mapped to stereotype attributes whose values are computed at runtime via automatically created OCL expressions. The automatic transfer of the static semantics of a DSL to a UML profile is a further contribution of our approach. Our DSL Metamodeling and Derivation Toolchain (DSL-MeDeTo) implements all aspects of our proposed approach in Eclipse. This enabled us to successfully apply our approach to the two DSLs Test Description Language (TDL) and Specification and Description Language (SDL). KW - model-driven engineering (MDE) KW - DSL KW - Metamodels KW - UML profiles KW - machine-processable language ER - TY - JOUR TI - Interface Automata for Shared Memory AU - Schinko, Ayleen AU - Vogler, Walter AU - Gareis, Johannes AU - Nguyen, Ngoc Tri AU - Lüttgen, Gerald PY - 2022 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/54718 LA - eng AB - Interface theories based on Interface Automata (IA) are formalisms for the component-based specification of concurrent systems. Extensions of their basic synchronization mechanism permit the modelling of data, but are studied in more complex settings involving modal transition systems or do not abstract from internal computation. In this article, we show how de Alfaro and Henzinger’s original IA theory can be conservatively extended by shared memory data, without sacrificing simplicity or imposing restrictions. Our extension IA for shared Memory (IAM) decorates transitions with pre- and post-conditions over algebraic expressions on shared variables, which are taken into account by IA’s notion of component compatibility. Simplicity is preserved as IAM can be embedded into IA and, thus, accurately lifts IA’s compatibility concept to shared memory. We also provide a ground semantics for IAM that demonstrates that our abstract handling of data within IA’s open systems view is faithful to the standard treatment of data in closed systems. KW - Interface Automata KW - Alfaro and Henzinger’s original IA theory KW - memory data KW - ground semantics ER - TY - CPAPER TI - Artifact: Resource-Aware Classification via Model Management Enabled Data Stream Optimization AU - Sünkel, Michael AU - Elmamooz, Golnaz AU - Grawunder, Marco AU - Nicklas, Daniela PY - 2022 T2 - 2022 IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events (PerCom Workshops) SP - 181-182 PB - IEEE DO - 10.1109/percomworkshops53856.2022.9767412 UR - https://fis.uni-bamberg.de/handle/uniba/54311 LA - eng ER - TY - CPAPER TI - Resource-Aware Classification via Model Management Enabled Data Stream Optimization AU - Sünkel, Michael AU - Elmamooz, Golnaz AU - Grawunder, Marco AU - Hoang, Phan Thai AU - Rauch, Elke AU - Schmeling, Lara AU - Thurner, Stefan AU - Nicklas, Daniela PY - 2022 T2 - 2022 IEEE International Conference on Pervasive Computing and Communications (PerCom) SP - 181-182 PB - IEEE DO - 10.1109/percom53586.2022.9762391 UR - https://fis.uni-bamberg.de/handle/uniba/54285 LA - eng ER - TY - CPAPER TI - A Review of Approaches for Quality Model Validations in the Context of Cloud-native Applications AU - Lichtenthäler, Robin AU - Wirtz, Guido PY - 2022 SP - 30-41 PB - Otto-Friedrich-Universität CY - Bamberg SN - 1613-0073 UR - https://fis.uni-bamberg.de/handle/uniba/53801 LA - eng AB - Quality models considering internal design characteristics of software should represent reality as accurately as possible. This can be ensured through a validation of relations between quality attributes. In this work we review validation approaches used in literature. We conclude that in an early design phase, surveys and expert interviews are suitable to validate quality attributes and their relations while for complete quality models quantitative validations through measures are advised. KW - Quality model KW - Empirical validation KW - Cloud-native ER - TY - JOUR TI - Data Resource Profile : Panel Study Labour Market and Social Security (PASS) AU - Trappmann, Mark AU - Bähr, Sebastian AU - Beste, Jonas AU - Eberl, Andreas AU - Frodermann, Corinna AU - Gundert, Stefanie AU - Schwarz, Stefan AU - Teichler, Nils AU - Unger, Stefanie AU - Wenzig, Claudia PY - 2022 SP - 1411-1411g PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/53792 LA - eng AB - Nicht vorhanden Not available KW - employment KW - social security KW - social welfare KW - unemployment KW - labor market wave KW - physical agent ER - TY - RPRT TI - Projektbericht: Befragung der Zivilgesellschaft zu Geodaten in Bamberg AU - Ackermann, Leonie AU - Demko, Khrystyna PY - 2022 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-53254 UR - https://fis.uni-bamberg.de/handle/uniba/53254 LA - deu AB - Im Rahmen des Smart City Programms der Stadt Bamberg wurde eine Befragung der Zivilgesellschaft durchgeführt, mit dem Ziel, Informationen über die aktuelle Geodaten-Nutzung und potenzielle Nutzungsszenarien für ein städtisches Geodatenportal zu sammeln. Der verwendete Fragebogen und die Ergebnisse werden dargestellt, sowie mögliche Gründe für den Umfrage-Abbruch diskutiert. Es zeigt sich, dass unter den Befragten, die die Umfrage vollständig ausgefüllt haben, ein großer Anteil bereits Geodaten nutzt. Diese Personen und Organisationen sind bereits gut in der Lage ihre Bedarfe und Ideen einzubringen, während andere Teile der Zivilgesellschaft noch keinen Nutzen von Geodaten für sich sehen. Die abschließende Diskussion der gesammelten Use Cases bietet Ansatzpunkte für die weitere Auseinandersetzung mit möglichen Funktionalitäten einer Bamberger Datenplattform. KW - Smart City KW - Geodaten ER - TY - RPRT TI - Data policy models in European smart cities : Experiences, opportunities and challenges in data policies in Europe AU - Pagliarin, Sofia AU - Herrmann, Dominik AU - Nicklas, Daniela AU - Glückert, Hannes AU - Meyer, Jon AU - Vizitiu, Patrick PY - 2022 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-53583 UR - https://fis.uni-bamberg.de/handle/uniba/53583 LA - eng AB - The report illustrates why a smart city should develop a data policy. Guiding questions for the creation of such a data policy in the context of the Smart City Bamberg are discussed. Furthermore, the report shows how the smart cities of Barcelona, Hamburg, Helsinki, Stuttgart, Vienna and Zurich proceed. The presented analysis is based on public documents and interviews. KW - Smart City KW - Data Policy ER - TY - RPRT TI - Data Policies in Europäischen Smart Cities: Erfahrungen, Chance und Herausforderungen AU - Pagliarin, Sofia AU - Herrmann, Dominik AU - Nicklas, Daniela AU - Glückert, Hannes AU - Meyer, Jon AU - Vizitiu, Patrick PY - 2022 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-52940 UR - https://fis.uni-bamberg.de/handle/uniba/52940 LA - deu AB - The report illustrates why a smart city should develop a data policy. Guiding questions for the creation of such a data policy in the context of the Smart City Bamberg are discussed. Furthermore, the report shows how the smart cities of Barcelona, Hamburg, Helsinki, Stuttgart, Vienna and Zurich proceed. The presented analysis is based on public documents and interviews. KW - Smart City KW - Data Policy ER - TY - JOUR TI - Smart City Bamberg : Digitale Möglichkeiten für ein Miteinander AU - Redepenning, Marc AU - Götz, Sascha AU - Nicklas, Daniela AU - Schütz, Astrid PY - 2022 JO - Insel-Rundschau : Mitteilungsblatt des BV-Mitte e.V. IS - 1 SP - 7-9 CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/53357 LA - deu ER - TY - CPAPER TI - Editorial: IEEE International Conference on Pervasive Computing and Communications (PerCom) 2020 AU - Nicklas, Daniela AU - Chipara, Octav AU - Kanhere, Salil S. AU - Reinhardt, Delphine PY - 2021 VL - 77 IS - C SP - 1-2 PB - Elsevier CY - Amsterdam [u.a.] SN - 1574-1192 DO - 10.1016/j.pmcj.2021.101491 UR - https://fis.uni-bamberg.de/handle/uniba/115808 LA - eng ER - TY - CPAPER TI - The Došen Square Under Construction : A Tale of Four Modalities AU - Mendler, Michael AU - Scheele, Stephan AU - Burke, Luke PY - 2021 T2 - Automated Reasoning with Analytic Tableaux and Related Methods : 30th International Conference, TABLEAUX 2021 Birmingham, UK, September 6–9, 2021 Proceedings SP - 446-465 PB - Springer CY - Cham T3 - Lecture Notes in Artificial Intelligence SN - 978-3-030-86058-5 DO - 10.1007/978-3-030-86059-2_26 UR - https://fis.uni-bamberg.de/handle/uniba/111259 LA - eng ER - TY - CPAPER TI - A Context-aware Framework for ML Models on Spatio-temporal Data Streams AU - Elmamooz, Golnaz PY - 2021 T2 - 2021 22nd IEEE International Conference on Mobile Data Management (MDM) SP - 261-263 PB - IEEE SN - 978-1-665-42846-0 DO - 10.1109/mdm52706.2021.00053 UR - https://fis.uni-bamberg.de/handle/uniba/111244 LA - eng ER - TY - CPAPER TI - Online Staypoint Detection in High-Frequency Location Update Streams AU - Elmamooz, Golnaz AU - Grawunder, Marco AU - Benabbas, Aboubakr AU - Nicklas, Daniela PY - 2021 T2 - 2021 22nd IEEE International Conference on Mobile Data Management (MDM) SP - 121-126 PB - IEEE SN - 978-1-6654-2845-3 DO - 10.1109/mdm52706.2021.00027 UR - https://fis.uni-bamberg.de/handle/uniba/111243 LA - eng ER - TY - CPAPER TI - Effective Notification Campaigns on the Web : A Matter of Trust, Framing, and Support AU - Maas, Max AU - Stöver, Alina AU - Pridöhl, Henning AU - Bretthauer, Sebastian AU - Herrmann, Dominik AU - Hollick, Matthias AU - Spiecker, Indra PY - 2021 T2 - Proceedings of the 30th USENIX Security Symposium SP - 2489-2506 PB - USENIX Association SN - 978-1-939133-24-3 UR - https://fis.uni-bamberg.de/handle/uniba/111241 LA - eng ER - TY - CPAPER TI - Synchronised Shared Memory and Model Checking : A Proof of Concept AU - Aguado, Joaquin AU - Duenas, Alejandra PY - 2021 T2 - 2021 Forum on specification & Design Languages (FDL) SP - 01-08 PB - IEEE SN - 978-1-6654-1825-6 DO - 10.1109/fdl53530.2021.9568373 UR - https://fis.uni-bamberg.de/handle/uniba/111238 LA - eng ER - TY - JOUR TI - Toward Object-oriented Modeling in SCCharts AU - Schulz-Rosengarten, Alexander AU - Smyth, Steven AU - Mendler, Michael PY - 2021 JO - ACM transactions on embedded computing systems VL - 20 IS - 4 SP - 1-26 PB - ACM Press CY - New York, NY SN - 1558-3465 DO - 10.1145/3453482 UR - https://fis.uni-bamberg.de/handle/uniba/111171 LA - eng ER - TY - JOUR TI - On the automation-supported derivation of domain-specific UML profiles considering static semantics AU - Kraas, Alexander PY - 2021 JO - Software and Systems Modeling VL - 21 IS - 1 SP - 51-79 PB - Springer CY - Berlin ; Heidelberg ; New York, NY, USA SN - 1619-1374 DO - 10.1007/s10270-021-00890-1 UR - https://fis.uni-bamberg.de/handle/uniba/54846 LA - eng AB - In the light of standardization, the model-driven engineering (MDE) is becoming increasingly important for the development of DSLs, in addition to traditional approaches based on grammar formalisms. Metamodels define the abstract syntax and static semantics of a DSL and can be created by using the language concepts of the Meta Object Facility (MOF) or by defining a UML profile. Both metamodels and UML profiles are often provided for standardized DSLs, and the mappings of metamodels to UML profiles are usually specified informally in natural language, which also applies for the static semantics of metamodels and/or UML profiles, which has the disadvantage that ambiguities can occur, and that the static semantics must be manually translated into a machine-processable language. To address these weaknesses, we propose a new automated approach for deriving a UML profile from the metamodel of a DSL. One novelty is that subsetting or redefining metaclass attributes are mapped to stereotype attributes whose values are computed at runtime via automatically created OCL expressions. The automatic transfer of the static semantics of a DSL to a UML profile is a further contribution of our approach. Our DSL Metamodeling and Derivation Toolchain (DSL-MeDeTo) implements all aspects of our proposed approach in Eclipse. This enabled us to successfully apply our approach to the two DSLs Test Description Language (TDL) and Specification and Description Language (SDL). KW - model-driven engineering (MDE) KW - DSL KW - Metamodels KW - UML profiles KW - machine-processable language ER - TY - JOUR TI - Interface Automata for Shared Memory AU - Schinko, Ayleen AU - Vogler, Walter AU - Gareis, Johannes AU - Nguyen, Ngoc Tri AU - Lüttgen, Gerald PY - 2021 JO - Acta Informatica PB - Springer CY - Berlin ; Heidelberg ; New York, NY, USA SN - 1432-0525 DO - 10.1007/s00236-021-00408-8 UR - https://fis.uni-bamberg.de/handle/uniba/54717 LA - eng AB - Interface theories based on Interface Automata (IA) are formalisms for the component-based specification of concurrent systems. Extensions of their basic synchronization mechanism permit the modelling of data, but are studied in more complex settings involving modal transition systems or do not abstract from internal computation. In this article, we show how de Alfaro and Henzinger’s original IA theory can be conservatively extended by shared memory data, without sacrificing simplicity or imposing restrictions. Our extension IA for shared Memory (IAM) decorates transitions with pre- and post-conditions over algebraic expressions on shared variables, which are taken into account by IA’s notion of component compatibility. Simplicity is preserved as IAM can be embedded into IA and, thus, accurately lifts IA’s compatibility concept to shared memory. We also provide a ground semantics for IAM that demonstrates that our abstract handling of data within IA’s open systems view is faithful to the standard treatment of data in closed systems. KW - Interface Automata KW - Alfaro and Henzinger’s original IA theory KW - memory data KW - ground semantics ER - TY - RPRT TI - Data policy models in European smart cities : Experiences, opportunities and challenges in data policies in Europe AU - Pagliarin, Sofia AU - Herrmann, Dominik AU - Nicklas, Daniela AU - Glückert, Hannes AU - Meyer, Jon AU - Vizitiu, Patrick Vincent PY - 2021 PB - Stadt Bamberg, Stabsstelle Smart City CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/54051 LA - eng AB - The report illustrates why a smart city should develop a data policy. Guiding questions for the creation of such a data policy in the context of the Smart City Bamberg are discussed. Furthermore, the report shows how the smart cities of Barcelona, Hamburg, Helsinki, Stuttgart, Vienna and Zurich proceed. The presented analysis is based on public documents and interviews. KW - Smart City KW - Data Policy ER - TY - CPAPER TI - Best Practices for Notification Studies for Security and Privacy Issues on the Internet AU - Maass, Max AU - Pridöhl, Henning AU - Herrmann, Dominik AU - Hollick, Matthias PY - 2021 T2 - ARES 2021: The 16th International Conference on Availability, Reliability and Security, proceedings PB - ACM CY - New York, NY SN - 978-1-4503-9051-4 DO - 10.1145/3465481.3470081 UR - https://fis.uni-bamberg.de/handle/uniba/53809 LA - eng ER - TY - CPAPER TI - How Private is Android’s Private DNS Setting? : Identifying Apps by Encrypted DNS Traffic AU - Mühlhauser, Michael AU - Pridöhl, Henning AU - Herrmann, Dominik PY - 2021 T2 - ARES 2021: The 16th International Conference on Availability, Reliability and Security, proceedings PB - ACM CY - New York, NY SN - 978-1-4503-9051-4 DO - 10.1145/3465481.3465764 UR - https://fis.uni-bamberg.de/handle/uniba/53782 LA - eng ER - TY - BOOK TI - Handbuch der Künstlichen Intelligenz ED - Görz, Günther ED - Schmid, Ute ED - Braun, Tanya PY - 2021 PB - De Gruyter CY - Berlin ; Boston ET - 6 SN - 978-3-11-065984-9 DO - 10.1515/9783110659948 UR - https://fis.uni-bamberg.de/handle/uniba/52974 LA - deu ER - TY - JOUR TI - Training and Validating a Machine Learning Model for the Sensor-Based Monitoring of Lying Behavior in Dairy Cows on Pasture and in the Barn AU - Schmeling, Lara AU - Elmamooz, Golnaz AU - Hoang, Phan Thai AU - Kozar, Anastasiia AU - Nicklas, Daniela AU - Sünkel, Michael AU - Thurner, Stefan AU - Rauch, Elke PY - 2021 JO - Animals VL - 11 IS - 9, 2660 SP - 1-25 PB - MDPI CY - Basel SN - 2076-2615 DO - 10.3390/ani11092660 UR - https://fis.uni-bamberg.de/handle/uniba/51688 LA - eng AB - Monitoring systems assist farmers in monitoring the health of dairy cows by predicting behavioral patterns (e.g., lying) and their changes with machine learning models. However, the available systems were developed either for indoors or for pasture and fail to predict the behavior in other locations. Therefore, the goal of our study was to train and evaluate a model for the prediction of lying on a pasture and in the barn. On three farms, 7–11 dairy cows each were equipped with the prototype of the monitoring system containing an accelerometer, a magnetometer and a gyroscope. Video observations on the pasture and in the barn provided ground truth data. We used 34.5 h of datasets from pasture for training and 480.5 h from both locations for evaluating. In comparison, random forest, an orientation-independent feature set with 5 s windows without overlap, achieved the highest accuracy. Sensitivity, specificity and accuracy were 95.6%, 80.5% and 87.4%, respectively. Accuracy on the pasture (93.2%) exceeded accuracy in the barn (81.4%). Ruminating while standing was the most confused with lying. Out of individual lying bouts, 95.6 and 93.4% were identified on the pasture and in the barn, respectively. Adding a model for standing up events and lying down events could improve the prediction of lying in the barn. KW - behavior recognition KW - classification KW - precision livestock farming KW - accelerometer KW - gyroscope KW - grazing ER - TY - CPAPER TI - The AppChk Crowd-Sourcing Platform : Which Third Parties are iOS Apps Talking To? AU - Geier, Oleg AU - Herrmann, Dominik PY - 2021 T2 - ICT Systems Security and Privacy Protection : 36th IFIP TC 11 International Conference, SEC 2021, Oslo, Norway, June 22–24, 2021, Proceedings SP - 228-241 PB - Springer CY - Berlin ; Heidelberg T3 - IFIP Advances in Information and Communication Technology SN - 978-3-030-78119-4 DO - 10.1007/978-3-030-78120-0_15 UR - https://fis.uni-bamberg.de/handle/uniba/50052 LA - eng AB - In this paper we present a platform which is usable by novice users without domain knowledge of experts. The platform consisting of an iOS app to monitor network traffic and a website to evaluate the results. Monitoring takes place on-device; no external server is required. Users can record and share network activity, compare evaluation results, and create rankings on apps and app-groups. The results are used to detect new trackers, point out misconduct in privacy practices, or automate comparisons on app-attributes like price, region, and category. To demonstrate potential use cases, we compare 75 apps before and after the iOS 14 release and show that we can detect trends in app-specific behavior change over time, for example, by privacy changes in the OS. Our results indicate a slight decrease in tracking but also an increase in contacted domains. We identify seven new trackers which are not present in current tracking lists such as EasyList. The games category is particularly prone to tracking (53% of the traffic) and contacts on average 36.2 domains with 59.3 requests per minute. ER - TY - JOUR TI - One DB Does Not Fit It All : Teaching the Differences in Advanced Database Systems AU - Wiese, Lena AU - Benabbas, Aboubakr AU - Elmamooz, Golnaz AU - Nicklas, Daniela PY - 2021 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie VL - 21 IS - 2 SP - 83-89 PB - Springer CY - Berlin ; Heidelberg SN - 1618-2162 DO - 10.1007/s13222-021-00371-1 UR - https://fis.uni-bamberg.de/handle/uniba/49626 LA - eng ER - TY - JOUR TI - Data-sharing markets for integrating IoT data processing functionalities AU - Kasrin, Nasr AU - Benabbas, Aboubakr AU - Elmamooz, Golnaz AU - Nicklas, Daniela AU - Steuer, Simon AU - Sünkel, Michael PY - 2021 JO - CCF transactions on pervasive computing and interaction VL - 3 IS - 1 SP - 76-93 PB - Springer Singapore CY - Singapore SN - 2524-521X DO - 10.1007/s42486-020-00054-y UR - https://fis.uni-bamberg.de/handle/uniba/49611 LA - eng AB - The recent evolution of the Internet of Things into a cyber-physical reality has spawned various challenges from a data management perspective. In addition, IoT platform designers are faced with another set of questions. How can platforms be extended to smoothly integrate new data management functionalities? Currently, data processing related tasks are typically realized by manually developed code and functions which creates difficulties in maintenance and growth. Hence we need to explore other approaches to integration for IoT platforms. In this paper we cover both these aspects: (1) we explore several emerging data management challenges, and (2) we propose an IoT platform integration model that can combine disparate functionalities under one roof. For the first, we focus on the following challenges: sensor data quality, privacy in data streams, machine learning model management, and resource-aware data management. For the second, we propose an information-integration model for IoT platforms. The model revolves around the concept of a Data-Sharing Market where data management functionalities can share and exchange information about their data with other functionalities. In addition, data-sharing markets themselves can be combined into networks of markets where information flows from one market to another, which creates a web of information exchange about data resources. To motivate this work we present a use-case application in smart cities. KW - Internet of Things KW - Resource-Awareness KW - Infrastructure Design KW - Information Integration KW - Data Management Systems KW - Data Quality KW - Privacy KW - Machine Learning Model Management ER - TY - CPAPER TI - Synchronized Shared Memory and Procedural Abstraction : Towards a Formal Semantics of Blech AU - Gretz, F. AU - Grosch, F-J. AU - Mendler, M. AU - Scheele, S. PY - 2020 T2 - Proceedings of the 2020 Forum on specification & Design Languages (FDL) PB - IEEE CY - Piscataway, New Jersey SN - 978-1-7281-8928-4 DO - 10.1109/fdl50818.2020.9232942 UR - https://fis.uni-bamberg.de/handle/uniba/112860 LA - eng ER - TY - CPAPER TI - Learning Data Structure Shapes from Memory Graphs AU - Boockmann, Jan AU - Lüttgen, Gerald PY - 2020 VL - 73 SP - 151-168 PB - EasyChair CY - Manchester SN - 2398-7340 DO - 10.29007/dhpw UR - https://fis.uni-bamberg.de/handle/uniba/50153 LA - eng ER - TY - JOUR TI - A linear-time branching-time perspective on interface automata AU - Vogler, Walter AU - Lüttgen, Gerald PY - 2020 JO - Acta Informatica VL - 57 IS - 3 SP - 513-550 PB - Springer SN - 1432-0525 DO - 10.1007/s00236-020-00369-4 UR - https://fis.uni-bamberg.de/handle/uniba/50150 LA - eng AB - Over the past two decades, de Alfaro and Henzinger’s interface automata (IA) have become a popular formal framework for the component-based specification of concurrent systems. IA’s parallel composition assumes that a component may wait on inputs but never on outputs, implying that an output must be consumed immediately or a communication error occurs. By now, the literature contains a number of semantics for IA: linear-time semantics based on traces observing communication errors, quiescence and/or divergence, as well as branching-time semantics based on alternating simulation. This article surveys these semantics from Rob van Glabbeek’s linear-time branching-time perspective, which does not consider settings with communication errors. We shed light onto the subtleties implied by IA’s pruning of all behaviour that might lead a component to autonomously enter an error state, and investigate when exactly de Alfaro and Henzinger’s restriction of input-determinism is needed. In addition, we introduce several new semantics for IA, in particular the linear-time ready semantics and the branching-time ready simulation. KW - interface automata KW - semantics KW - simulation KW - de Alfaro and Henzinger’s restriction KW - Glabbeek’s linear-time branching-time perspective ER - TY - CPAPER TI - Fast Pathfinding in Knowledge Graphs Using Word Embeddings AU - Martin, Leon AU - Boockmann, Jan H. AU - Henrich, Andreas PY - 2020 T2 - KI 2020: Advances in Artificial Intelligence : 43rd German Conference on AI, Bamberg, Germany, September 21–25, 2020, Proceedings SP - 305-312 PB - Springer CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-030-58284-5 DO - 10.1007/978-3-030-58285-2_27 UR - https://fis.uni-bamberg.de/handle/uniba/49140 LA - eng AB - Knowledge graphs, which model relationships between entities, provide a rich and structured source of information. Currently, search engines aim to enrich their search results by structured summaries, e.g., obtained from knowledge graphs, that provide further information on the entity of interest. While single entity summaries are available already, summaries on the relations between multiple entities have not been studied in detail so far. Such queries can be understood as a pathfinding problem. However, the large size of public knowledge graphs, such as Wikidata, as well as the large indegree of its major entities, and the problem of concept drift impose major challenges for standard search algorithms in this context. In this paper, we propose a bidirectional pathfinding approach for directed knowledge graphs that uses the semantic distance between entity labels, which is approximated using word vectors, as a search heuristics in a parameterized A*-like evaluation function in order to find meaningful paths between two entities fast. We evaluate our approach using different parameters against a set of selected within- and cross-domain queries. The results indicate that our approach generally needs to explore fewer entities compared to its uninformed counterpart and qualitatively yields more meaningful paths. KW - Knowledge graphs KW - Word embeddings KW - Pathfinding ER - TY - CPAPER TI - Towards Adaptive Sensor Data Quality Improvement based on Context Models AU - Benabbas, Aboubakr AU - Steuer, Simon AU - Nicklas-Festi, Daniela PY - 2020 T2 - 2020 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) PB - IEEE SN - 978-1-7281-4716-1 DO - 10.1109/PerComWorkshops48775.2020.9156173 UR - https://fis.uni-bamberg.de/handle/uniba/48892 LA - eng ER - TY - CPAPER TI - How do app vendors respond to subject access requests? A longitudinal privacy study on iOS and Android Apps AU - Kröger, Jacob Leon AU - Lindemann, Jens AU - Herrmann, Dominik PY - 2020 T2 - ARES '20: Proceedings of the 15th International Conference on Availability, Reliability and Security SP - 1-10 PB - ACM SN - 9781450388337 DO - 10.1145/3407023.3407057 UR - https://fis.uni-bamberg.de/handle/uniba/48691 LA - eng AB - EU data protection laws grant consumers the right to access the personal data that companies hold about them. In a first-of-its-kind longitudinal study, we examine how service providers have complied with subject access requests over four years. In three iterations between 2015 and 2019, we sent subject access requests to vendors of 225 mobile apps popular in Germany. Throughout the iterations, 19 to 26% of the vendors were unreachable or did not reply at all. Our subject access requests were fulfilled in 15 to 53% of the cases, with an unexpected decline between the GDPR enforcement date and the end of our study. The remaining responses exhibit a long list of shortcomings, including severe violations of information security and data protection principles. Some responses even contained deceptive and misleading statements (7 to 13%). Further, 9% of the apps were discontinued and 27% of the user accounts vanished during our study, mostly without proper notification about the consequences for our personal data. While we observe improvements for selected aspects over time, the results indicate that subject access request handling will be unsatisfactory as long as vendors accept such requests via email and process them manually. ER - TY - RPRT TI - Guidelines for Writing a High-Quality Thesis with the PSIThesis Template AU - Herrmann, Dominik PY - 2020 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-48428 UR - https://fis.uni-bamberg.de/handle/uniba/48428 LA - eng AB - This guide explains how the PSIThesis LaTeX template is used. The guide has been typeset with the PSIThesis template to demonstrate its features (source code available on GitHub). The guide also presents recommendations that will help students to create a coherent and visually appealing thesis. Covered topics are scientific writing, citations, structuring the text, layout, and typography. The design of useful figures and tables is covered particularly thoroughly. While the main users of the template and the guide are students who want to submit a high-quality Bachelor’s or Master’s thesis to the Chair of Privacy and Security in Information Systems at the University of Bamberg, the content may also be useful for students of other institutions. KW - Abschlussarbeiten KW - Vorlage KW - Empfehlungen KW - Richtlinien KW - Tabellen-Design KW - Gestaltung von Abbildungen KW - Wissenschaftliches Schreiben ER - TY - THES TI - Data Structure Identification from Executions of Pointer Programs AU - Rupprecht, Thomas PY - 2020 PB - University of Bamberg Press CY - Bamberg T3 - Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg SN - 978-3-86309-717-2 DO - 10.20378/irb-47325 UR - https://fis.uni-bamberg.de/handle/uniba/47325 LA - eng AB - The reverse engineering of binaries is a tedious and time consuming task, yet mandatory when the need arises to understand the behaviour of a program for which source code is unavailable. Instances of source code loss for old arcade games [1] and the steadily growing amount of malware [2] are prominent use cases requiring reverse engineering. One of the challenges when dealing with binaries is the loss of low level type information, i.e., primitive and compound types, which even state-of-the-art type recovery tools often cannot reconstruct with full accuracy. Further programmers most commonly use high level data structures, such as linked lists, in addition to primitive types. Therefore detection of dynamic data structure shapes is an important aspect of reverse engineering. Though the recognition of dynamic data structure shapes in the presence of tricky programming concepts such as pointer arithmetic and casts – which are both fundamental concepts to enable, e.g., the frequently used Linux kernel list [3] – also bring current shape detection tools to their limits. A recent approach called Data Structure Investigator (DSI) [4] , aims for the detection of dynamic pointer based data structures. While the approach is general in nature, a concrete realization for C programs requiring source code is envisioned as programming constructs such as type casts and pointer arithmetic will stress test the approach. Therefore, the first research question addressed in this dissertation is whether DSI can meet its goal in the presence of the sheer multitude of existing data structure implementations. The second research question is whether DSI can be opened up to reverse engineer C/C++ binaries, even in the presence of type information loss and the variety of C/C++ programming constructs. Both questions are answered positively in this dissertation. The first is answered by realizing the DSI source code approach, which requires detailing fundamental aspects of DSI’s theory to arrive at a working implementation, e.g., handling the consistency of DSI’s memory abstraction and quantifying the interconnections found within a dynamic pointer based data structure, e.g., a parent child nesting scenario, to allow for its detection. DSI’s utility is evaluated on an extensive benchmark including real world examples (libusb [5], bash [6]) and shape analysis examples, [7,8] . The second question is answered through the development of a DSI prototype for binaries (DSIbin). To compensate for the loss of perfect type information found in source code, DSIbin interfaces with the state-of-the-art type recovery tool Howard [9]. Notably, DSIbin improves upon type information recovered by Howard. This is accomplished through a much improved nested struct detection and type merging algorithm, both of which are fundamental aspects for the reverse engineering of binaries. The proposed approach is again evaluated by a diverse benchmark containing real world examples such as, the VNC clipping library, The Computer Language Benchmarks Game and the Olden Benchmark, as well as examples taken from the shape analysis literature. In summary, this dissertation improves upon the state-of-the-art of shape detection and reverse engineering by (i) realizing and evaluating the DSI approach, which includes contributing to DSI’s theory and results in the DSI prototype; (ii) opening up DSI for C/C++ binaries so as to extend DSI to reverse engineering, resulting in the DSIbin prototype; (iii) handling data structures with DSIbin not covered by some related work such as skip lists; (iv) refining the nesting detection and performing type merging for types excavated by Howard. Further, DSIbin’s ultimate future use case of malware analysis is hardened by revealing the presence of dynamic data structures in multiple real world malware samples. In summary, this dissertation advanced the dynamic analysis of data structure shapes with the aforementioned contributions to the DSI approach for source code and further by transferring this new technology to the analysis of binaries. The latter resulted in the additional insight that high level dynamic data structure information can help to infer low level type information. 1. http://kotaku.com/5028197/sega-cant-find-the-source-code-for-your-favorite-old-school-arcade-games 2. https://www.av-test.org/en/statistics/malware/ 3. https://github.com/torvalds/linux/blob/master/include/linux/list.h 4. SWT Research Group, University Bamberg, DFG-Project LU 1748/4-1 5. http://libusb.info/ 6. https://www.gnu.org/software/bash/ 7. Predator: http://www.fit.vutbr.cz/research/groups/verifit/tools/predator/ 8. Forester: http://www.fit.vutbr.cz/research/groups/verifit/tools/forester/ 9. http://www.cs.vu.nl/ herbertb/papers/dde_ndss11-preprint.pdf KW - Data structure identification; Dynamic data structures; Pointer programs; Reverse engineering; Type recovery ER - TY - JOUR TI - Data Resource Profile : Panel Study Labour Market and Social Security (PASS) AU - Trappmann, Mark AU - Bähr, Sebastian AU - Beste, Jonas AU - Eberl, Andreas AU - Frodermann, Corinna AU - Gundert, Stefanie AU - Schwarz, Stefan AU - Teichler, Nils AU - Unger, Stefanie AU - Wenzig, Claudia PY - 2019 JO - International journal of epidemiology VL - 48 IS - 5 SP - 1411-1411g PB - Oxford Univ. Press CY - Oxford SN - 1464-3685 DO - 10.1093/ije/dyz041 UR - https://fis.uni-bamberg.de/handle/uniba/53414 LA - eng AB - Nicht vorhanden Not available KW - employment KW - social security KW - social welfare KW - unemployment KW - labor market wave KW - physical agent ER - TY - CPAPER TI - Shape Inference from Memory Graphs (Extended Abstract) AU - Boockmann, Jan AU - Lüttgen, Gerald PY - 2019 T2 - 20. Kolloquium Programmiersprachen und Grundlagen der Programmierung KPS 2019 : Tagungsband SP - 69-71 PB - Shaker Verlag CY - Düren SN - 978-3-8440-6933-4 UR - https://fis.uni-bamberg.de/handle/uniba/50360 LA - eng ER - TY - CPAPER TI - Know Thy Quality : Assessment of Device Detection by WiFi Signals AU - Rütermann, Tim AU - Benabbas, Aboubakr AU - Nicklas, Daniela PY - 2019 T2 - 2019 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) : Proceedings PB - IEEE DO - 10.1109/PERCOMW.2019.8730828 UR - https://fis.uni-bamberg.de/handle/uniba/50159 LA - eng ER - TY - CPAPER TI - Quality-Aware Sensor Data Stream Management in a Living Lab Environment AU - Benabbas, Aboubakr AU - Nicklas, Daniela PY - 2019 T2 - 2019 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) : Proceedings PB - IEEE DO - 10.1109/PERCOMW.2019.8730858 UR - https://fis.uni-bamberg.de/handle/uniba/50158 LA - eng ER - TY - CPAPER TI - On the Difficulties of Incentivizing Online Privacy through Transparency : A Qualitative Survey of the German Health Insurance Market AU - Maass, Max AU - Walter, Nicolas AU - Herrmann, Dominik AU - Hollick, Matthias ED - Ludwig, Thomas ED - Pipek, Volkmar PY - 2019 T2 - Wirtschaftsinformatik 2019 Proceedings SP - 1307-1321 PB - AIS Electronic Library (AISeL) UR - https://fis.uni-bamberg.de/handle/uniba/50055 LA - eng ER - TY - CPAPER TI - Dangers and Prevalence of Unprotected Web Fonts AU - Mueller, Tobias AU - Klotzsche, Daniel AU - Herrmann, Dominik AU - Federrath, Hannes PY - 2019 PB - IEEE SN - 1847-358X DO - 10.23919/SOFTCOM.2019.8903683 UR - https://fis.uni-bamberg.de/handle/uniba/50054 LA - eng ER - TY - JOUR TI - Measure particulate matter by yourself: data-quality monitoring in a citizen science project AU - Benabbas, Aboubakr AU - Geißelbrecht, Martin AU - Nikol, Gabriel AU - Mahr, Lukas AU - Nähr, Daniel AU - Steuer, Simon AU - Wiesemann, Gabriele AU - Müller, Thomas AU - Nicklas, Daniela AU - Wieland, Thomas PY - 2019 JO - Journal of Sensors and Sensor Systems VL - 8 IS - 2 SP - 317-328 PB - Copernicus Publ. CY - Göttingen SN - 2194-878X DO - 10.5194/jsss-8-317-2019 UR - https://fis.uni-bamberg.de/handle/uniba/49615 LA - eng ER - TY - CPAPER TI - Lightweight Semantics-Preserving Communication for Real-Time Automotive Software AU - Yip, Eugene AU - Lalo, Erjola AU - Lüttgen, Gerald AU - Sailer, Andreas PY - 2019 T2 - 13th IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) SP - 372-379 PB - IEEE SN - 978-1-7281-4882-3 DO - 10.1109/MCSoC.2019.00059 UR - https://fis.uni-bamberg.de/handle/uniba/48659 LA - eng ER - TY - CPAPER TI - A Multi-Rate Precision Timed Programming Language for Multi-Cores AU - Girault, Alain AU - Hili, Nicolas AU - Jenn, Eric AU - Yip, Eugene PY - 2019 T2 - 2019 Forum for Specification and Design Languages (FDL) SP - 8 PB - IEEE SN - 978-1-7281-4113-8 DO - 10.1109/FDL.2019.8876950 UR - https://fis.uni-bamberg.de/handle/uniba/48658 LA - eng ER - TY - CHAP TI - Cyber Espionage and Cyber Defence AU - Herrmann, Dominik PY - 2019 T2 - Information Technology for Peace and Security : IT Applications and Infrastructures in Conflicts, Crises, War, and Peace SP - 83-106 PB - Springer Vieweg CY - Wiesbaden SN - 978-3-658-25651-7 UR - https://fis.uni-bamberg.de/handle/uniba/46003 LA - eng ER - TY - CHAP TI - The Future of IT in Peace and Security AU - Reuter, Christian AU - Altmann, Jürgen AU - Aal, Konstantin AU - Aldehoff, Larissa AU - Buchmann, Johannes AU - Bernhardt, Ute AU - Denker, Kai AU - Herrmann, Dominik AU - Hollick, Matthias AU - Katzenbeisser, Stefan AU - Kaufhold, Marc-André AU - Nordmann, Alfred AU - Reinhold, Thomas AU - Riebe, Thea AU - Ripper, Annette AU - Ruhmann, Ingo AU - Saalbach, Klaus-Peter AU - Schörning, Niklas AU - Sunyaev, Ali AU - Wulf, Volker PY - 2019 T2 - Information Technology for Peace and Security : IT Applications and Infrastructures in Conflicts, Crises, War, and Peace SP - 405-413 PB - Springer Vieweg CY - Wiesbaden SN - 978-3-658-25651-7 UR - https://fis.uni-bamberg.de/handle/uniba/45998 LA - eng ER - TY - THES TI - On the Automated Derivation of Domain-Specific UML Profiles AU - Kraas, Alexander PY - 2019 PB - University of Bamberg Press CY - Bamberg T3 - Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg SN - 978-3-86309-670-0 DO - 10.20378/irbo-54891 UR - https://fis.uni-bamberg.de/handle/uniba/45648 LA - eng AB - Similar to general-purpose languages, domain-specific languages (DSL) can be developed based on grammar formalisms, the model-driven engineering (MDE) is also becoming more and more important for the development of DSLs. On the one hand, metamodels can be used to define the syntax and semantics of DSLs. On the other hand, a DSL can be realized by adapting the Unified Modeling Language (UML) via the profiling mechanism, i.e., by defining a UML profile. For example, metamodels for a DSL can be created with the language concepts provided by the Meta Object Facility (MOF), distinguishing between the Essential MOF (EMOF) and the Complete MOF (CMOF). The latter variant is based on the EMOF but provides additional language concepts. A higher degree of abstraction and reuse of existing metamodels can be achieved by employing the language concepts provided by CMOF, which can be advantageous for the creation of more complex DSLs. Apart from DSLs proposed in the literature, a model-based specification of DSLs becomes increasingly important for standardization. Both metamodels and UML profiles are often provided for standardized DSLs. The mappings of metamodels to UML profiles are usually only specified in some abstract manner by such standards. Therefore, such mappings do not provide all the details required to create executable model transformations. Moreover, the static semantics of metamodels and/or UML profiles are usually specified only in natural language. Thus, on the one hand, ambiguities can occur, and on the other hand, the soundness of the static semantics cannot be verified and validated without a manual translation into a machine-processable language. The main goal of this dissertation is to remedy the identified weaknesses in developing DSLs, for which a CMOF-compliant metamodel and a UML profile shall be created. To achieve this goal, we propose a holistic MDE-based approach for automatically deriving UML profiles and model transformations based on CMOF metamodels. This approach enables an automatic transfer of DSL’s static semantics to UML profiles, so that the well-formedness of UML models with applied UML profile of a DSL can be verified automatically. In addition, the interoperability between UML and DSL models can already be validated in the development phase using the derived model transformations. Apart from new DSLs that are created from scratch, our approach also supports a migration of existing grammar-based DSLs towards CMOF-based metamodels, provided syntax rules exist. To verify and evaluate the presented derivation approach, we have implemented a toolchain that we used to conduct two case studies on the Specification and Description Language (SDL) and the Test Description Language (TDL). KW - Metamodeling KW - UML profiles KW - derivation KW - static semantics KW - OCL ER - TY - CPAPER TI - Generating Inductive Shape Predicates for Runtime Checking and Formal Verification AU - Boockmann, Jan AU - Lüttgen, Gerald AU - Mühlberg, Jan Tobias PY - 2018 T2 - Leveraging Applications of Formal Methods, Verification and Validation. Verification : 8th International Symposium, ISoLA 2018, Limassol, Cyprus, November 5-9, 2018, Proceedings, Part II SP - 64-74 PB - Springer International Publishing CY - Cham SN - 978-3-030-03420-7 DO - 10.1007/978-3-030-03421-4_5 UR - https://fis.uni-bamberg.de/handle/uniba/50362 LA - eng ER - TY - JOUR TI - Semantic Data Management for Experimental Manufacturing Technologies AU - Kasrin, Nasr AU - Qureshi, Maliha AU - Steuer, Simon AU - Nicklas, Daniela PY - 2018 JO - Datenbank-Spektrum VL - 18 IS - 1 SP - 27-37 PB - Springer CY - Berlin ; Heidelberg SN - 1618-2162 DO - 10.1007/s13222-018-0274-0 UR - https://fis.uni-bamberg.de/handle/uniba/49613 LA - eng ER - TY - CPAPER TI - Feinstaub selbst messen: Datenqualität in einem Citizen-Science-Projekt AU - Steuer, Simon AU - Beetz, Florian AU - Geißelbrecht, Martin AU - Kaiser, F. P. AU - Nicklas, Daniela AU - Nikol, G. M. PY - 2018 T2 - Sensoren und Messsysteme : Beiträge der 19. ITG/GMA-Fachtagung 26. - 27. Juni 2018 in Nürnberg SP - 532-535 PB - VDE Verlag GmbH CY - Berlin ; Offenbach SN - 978-3-8007-4683-5 UR - https://fis.uni-bamberg.de/handle/uniba/49612 LA - deu ER - TY - JOUR TI - A generalised theory of Interface Automata, component compatibility and error AU - Fendrich, Sascha AU - Lüttgen, Gerald PY - 2018 JO - Acta Informatica VL - 56 IS - 4 SP - 287-319 PB - Springer CY - Berlin ; Heidelberg [u.a.] SN - 1432-0525 DO - 10.1007/s00236-018-0319-8 UR - https://fis.uni-bamberg.de/handle/uniba/44798 LA - eng AB - Interface theories allow system designers to reason about the composability and compatibility of concurrent system components. Such theories often extend both de Alfaro and Henzinger's Interface Automata and Larsen's Modal Transition Systems, which leads, however, to several issues that are undesirable in practice: an unintuitive treatment of specified unwanted behaviour, a binary compatibility concept that does not scale to multi-component assemblies, and compatibility guarantees that are insufficient for software product lines. In this article we show that communication mismatches are central to all these problems and, thus, the ability to represent such errors semantically is an important feature of an interface theory. Accordingly, we present the error-aware interface theory EMIA, where the above shortcomings are remedied by introducing explicit fatal error states. In addition, we prove via a Galois insertion that EMIA is a conservative generalisation of the established Modal Interface Automata theory. ER - TY - CPAPER TI - A Note on Refinement in Hierarchical Transition Systems AU - Lüttgen, Gerald PY - 2018 T2 - Formal Methods for Industrial Critical Systems : 23rd International Conference, FMICS 2018, Maynooth, Ireland, September 3-4, 2018, Proceedings SP - 211-222 PB - Springer International Publishing CY - Cham T3 - Lecture Notes in Computer Science ET - 1 SN - 978-3-030-00244-2 DO - 10.1007/978-3-030-00244-2 UR - https://fis.uni-bamberg.de/handle/uniba/44799 LA - eng AB - Software engineers frequently employ notations and tools based on transition systems, such as UML state machines and Statecharts, for specifying and reasoning about reactive behaviour. While these notations are typically supported by an operational semantics, they lack a formal underpinning of the incremental refinement practices of engineers who, e.g., place state machines inside states or add outer transitions to states during design. This note sketches how modal transition systems may be applied to formally capture such refinements along state hierarchies, using a hierarchical extension of labelled transition systems that permits engineers to explicitly allow or disallow state refinement and transition extension at each state. A small example testifies to the utility of this framework for hierarchically refining reactive systems. ER - TY - RPRT TI - Optimized Buffering of Time-Triggered Automotive Software AU - Yip, Eugene AU - Lalo, Erjola AU - Lüttgen, Gerald AU - Deubzer, Michael AU - Sailer, Andreas PY - 2018 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik DO - 10.20378/irbo-52917 UR - https://fis.uni-bamberg.de/handle/uniba/44463 LA - eng AB - The development of an automotive system involves the integration of many real-time software functionalities, and it is of utmost importance to guarantee strict timing requirements. However, the recent trend towards multi-core architectures poses significant challenges for the timely transfer of signals between processor cores so as to not violate data consistency. We have studied and adapted an existing buffering mechanism to work specifically for statically scheduled time-triggered systems, called static buffering protocol. We developed further buffering optimisation algorithms and heuristics, to reduce the memory consumption, processor utilisation, and end-to-end response times of time-triggered AUTOSAR designs on multi-core platforms. Our contributions are important because they enable deterministic time-triggered implementations to become competitive alternatives to their inherently non-deterministic event-triggered counterparts. We have prototyped a selection of optimisations in an industrial tool and evaluated them on realistic industrial automotive benchmarks. KW - Real-Time Software, Logical-Execution Time, Buffering Mechanism ER - TY - BOOK TI - A Modal Logic for Handling Behavioural Constraints in Formal Hardware Verification AU - Mendler, Michael PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52663 UR - https://fis.uni-bamberg.de/handle/uniba/44332 LA - eng ER - TY - CPAPER TI - An asynchronous process algebra with multiple clocks AU - Andersen, Henrik Reif AU - Mendler, Michael PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52645 UR - https://fis.uni-bamberg.de/handle/uniba/44320 LA - eng AB - - KW - - ER - TY - CPAPER TI - Constrained Proofs : A Logic for Dealing with Behavioural Constraints in Formal Hardware Verification AU - Mendler, Michael PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52666 UR - https://fis.uni-bamberg.de/handle/uniba/44287 LA - eng AB - - KW - - ER - TY - CPAPER TI - Die formale Validierung einer "Bausteintafel" delay-insensitiver Grundelemente AU - Reinhardt, Tilmann AU - Mendler, Michael AU - Stroup, Terry PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52665 UR - https://fis.uni-bamberg.de/handle/uniba/44288 LA - eng AB - - KW - - ER - TY - JOUR TI - Compositional Characterization of Observable Program Properties AU - Steffen, B. AU - Barry Jay, C. AU - Mendler, Michael PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52664 UR - https://fis.uni-bamberg.de/handle/uniba/44286 LA - deu ER - TY - JOUR TI - Newtonian Arbiters Cannot be Proven Correct AU - Mendler, Michael AU - Stroup, Terry PY - 2018 PB - opus CY - Bamberg DO - 10.20378/irbo-52662 UR - https://fis.uni-bamberg.de/handle/uniba/44285 LA - eng ER - TY - JOUR TI - Multi-Agent Dialogues and Dialogue Sequents for Proof Search and Scheduling in Intuitionistic Logic and the Modal Logic S4 AU - Sticht, Martin PY - 2018 JO - Fundamenta Informaticae VL - 161 IS - 1/2, Special Issue on the 31Th Italian Conference on Computational Logic: CILC 2016 SP - 191-218 PB - IOS Press CY - Amsterdam [u.a.] SN - 0169-2968 DO - 10.3233/FI-2018-1700 UR - https://fis.uni-bamberg.de/handle/uniba/44251 LA - eng KW - dialogues, proof search, intuitionistic logic, modal logic, game theories, parallel reasoning ER - TY - THES TI - Proof Search in Multi-Agent Dialogues for Modal Logic AU - Sticht, Martin PY - 2018 PB - University of Bamberg Press CY - Bamberg T3 - Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg SN - 978-3-86309-599-4 DO - 10.20378/irbo-52527 UR - https://fis.uni-bamberg.de/handle/uniba/44248 LA - eng AB - In computer science, and also in philosophy, modal logics play an important role in various areas. They can be used to model knowledge structures among software-agents, behaviour of computer systems, or ontologies. They also provide mathematical tools to perform reasoning in these models, e.g., to extract common knowledge of agents, check whether security-relevant problems might occur when running a program, or to detect contradictions in a set of terminological definitions. Intuitionistic or constructive propositional logic can be considered as a special kind of modal logic. Constructive modal logics, as a combination of intuitionistic propositional logic and classical modal logics, describe a family of modal systems which are, compared to the classical variant, more restrictive concerning the validity of formulas. To prove validity of a statement formalized in such a logic, various reasoning procedures (also called calculi) have been investigated. There are especially many variants of sequent and tableau systems which can be used easily to find proofs by applying given syntactical rules one after another. Sometimes there are different possibilities to find a proof for the same formula within the same calculus. It also happens that a bad choice of non-invertible rule applications at the wrong time makes it impossible to finish the proof successfully, although the formula is provable. For this reason, a normalization of deductions in a calculus is desired. This restricts the possibilities to apply rules arbitrarily and emphasizes the situations in which significant, non-invertible rule applications are necessary. Such a normalization is enforced in so-called focused sequent systems. Another attempt to find a normalized calculus leads to dialogical logic, a game-theoretic reasoning technique. Usually, two players, one proponent and one opponent, argue about an assertion, expressed as a formula and stated by the proponent at the beginning of the play. The kinds of arguments, namely attacks and defences, are bound to special game rules. These are designed in such a way that the proponent has a winning strategy in the game if and only if his initial statement is a valid formula. The dialogical approach is very flexible as the game rules can be adjusted easily. Sets of rules exist to perform reasoning in many different kinds of logic, however proving soundness and completeness of dialogical calculi is complex and, if at all, often only considered very roughly in the literature. The standard two-player dialogues do not have much potential to enforce normalization like focus sequent systems. However, it turns out that introducing further proponent-players who fight against one opponent in a round-based setting leads to a normalization as described above. The flexibility of two-player games is largely preserved in multi-proponent dialogues. Other ordinary sequent systems can easily be transferred into the dialectic setting to achieve a normalization. Further, the round-based scheduling induces a method to parallelize the reasoning process. Modifying the game rules makes it possible to construct new intermediate or even more restrictive logics. In this work, dialogical systems with multiple proponents are presented for intuitionistic propositional logic and modal logics S4 and CS4. Starting with the former one, it is shown that the normalization can be transferred easily to both the latter systems. Informal game rules are introduced and, to make them concrete and unambiguous, translated into the dialogical sequent-style calculi DiaSeqI, DiaSeqS4, and DiaSeqCS4. An extra system for intuitionistic logic, which guarantees termination in proof searches, even if the target formula is not valid, is also provided. Soundness and completeness of all these presented dialogical sequent calculi is proven formally, by showing that it is always possible to translate derivations in the game-oriented approach into another sound and complete sequent system and vice versa. Thereby, a new (ordinary) multi-conclusion sequent calculus for CS4 is introduced for which adequateness is shown, too. The multi-proponent dialogical systems of this work are compared to different sequent calculi and other dialogical attempts found in literature. A comprehensive survey of such approaches is also part of this thesis. ER - TY - CPAPER TI - PrivacyScore : Improving Privacy and Security via Crowd-Sourced Benchmarks of Websites AU - Maass, Max AU - Wichmann, Pascal AU - Pridöhl, Henning AU - Herrmann, Dominik PY - 2017 T2 - Privacy Technologies and Policy : 5th Annual Privacy Forum, APF 2017, Vienna, Austria, June 7-8, 2017. Revised Selected Papers SP - 178-191 PB - Springer International Publishing CY - Cham SN - 978-3-319-67279-3 DO - 10.1007/978-3-319-67280-9_10 UR - https://fis.uni-bamberg.de/handle/uniba/50992 LA - eng ER - TY - JOUR TI - Living Lab Bamberg : an infrastructure to explore smart city research challenges in the wild AU - Benabbas, Aboubakr AU - Elmamooz, Golnaz AU - Lagesse, Brent AU - Nicklas, Daniela AU - Schmid, Ute PY - 2017 JO - Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen VL - 31 IS - 3 SP - 265–271 PB - Springer CY - Berlin SN - 0933-1875 DO - 10.1007/s13218-017-0497-5 UR - https://fis.uni-bamberg.de/handle/uniba/50160 LA - eng ER - TY - CPAPER TI - Towards Quality Aware Sensor Data Stream Processing in a Smart CityLiving Lab AU - Benabbas, Aboubakr AU - Steuer, Simon AU - Nicklas, Daniela PY - 2017 T2 - Proceedings of the 29th GI-Workshop Grundlagen von Datenbanken : Blankenburg/Harz, Deutschland, 30. Mai-02. Juni 2017 SP - 36-41 CY - Trier UR - https://fis.uni-bamberg.de/handle/uniba/49614 LA - eng ER - TY - CPAPER TI - DSI: Automated detection of dynamic data structures in C programs and binary code AU - Rupprecht, Thomas AU - Boockmann, Jan AU - White, David AU - Lüttgen, Gerald ED - Amme, Wolfram ED - Heinze, Thomas S. PY - 2017 T2 - Programmiersprachen und Grundlagen der Programmierung : 19. Kolloquium, KPS 2017 ; Weimar, 25.–27. September 2017 ; Tagungsband SP - 134-147 PB - Friedrich-Schiller-Universität Jena CY - Weimar T3 - Jenaer Schriften zur Mathematik und Informatik UR - https://fis.uni-bamberg.de/handle/uniba/44806 LA - eng AB - Program comprehension is an important task for software engineers who maintain legacy code, as well as for reverse engineers who analyse binary executables such as malware. Detecting dynamic, i.e., pointer-based data structures is a particular challenge due to the complex usage of pointers found in real world software. This paper presents the key results of the DFG-funded project "Learning Data Structure Behaviour from Executions of Pointer Programs" (DSI), in which dynamic analysis techniques have been developed to identify dynamic data structures in C programs and x86 binary code. DSI's analysis utilizes a novel memory abstraction that allows for a compact description of pointer-based data structures such as linked lists and binary trees, and their interconnections such as parent-child nesting. On top of this abstraction, an evidence-collecting approach calculates a natural language description of the observed data structure with the help of a systematic taxonomy. The inferred data structure information is not only helpful for program comprehension but also for other use cases including software verification and software visualization. ER - TY - CPAPER TI - Comparing trace recordings of automotive real-time software AU - Sailer, Andreas AU - Deubzer, Michael AU - Lüttgen, Gerald AU - Mottok, Jürgen PY - 2017 T2 - Proceedings of the 25th International Conference on Real-Time Networks and Systems, 2017, Grenoble, France SP - 118-127 PB - ACM CY - New York, NY SN - 978-1-4503-5286-4 DO - 10.1145/3139258.3139265 UR - https://fis.uni-bamberg.de/handle/uniba/43006 LA - eng ER - TY - CPAPER TI - DSIbin: identifying dynamic data structures in C/C++ binaries AU - Rupprecht, Thomas AU - Chen, Xi AU - White, David H. AU - Boockmann, Jan H. AU - Lüttgen, Gerald AU - Bos, Herbert PY - 2017 T2 - Proceedings of the 32nd International Conference on Automated Software Engineering SP - 331-341 PB - IEEE CY - Urbana, IL SN - 978-1-5386-2684-9 DO - 10.1109/ASE.2017.8115646 UR - https://fis.uni-bamberg.de/handle/uniba/42967 LA - eng ER - TY - CHAP TI - Lyrik : das Weiche in der Härte AU - Schwarz, Stefan PY - 2017 T2 - Bibliothek deutschsprachiger Gedichte SP - 67 PB - Realis Verlag GmbH CY - Gräfelfing SN - 978-3-930048-76-2 UR - https://fis.uni-bamberg.de/handle/uniba/42895 LA - deu KW - Lyrik ER - TY - CPAPER TI - Automated Tooling for the Evolving SDL Standard: From Metamodels to UML Profiles AU - Kraas, Alexander ED - Csöndes, Tibor ED - Kovács, Gábor ED - Réthy, György PY - 2017 T2 - SDL 2017 : Model-Driven Engineering for Future Internet ; 18th International SDL Forum, Budapest, Hungary, October 9–11, 2017, Proceedings SP - 136-156 PB - Springer International Publishing CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-319-68015-6 DO - 10.1007/978-3-319-68015-6 UR - https://fis.uni-bamberg.de/handle/uniba/42606 LA - eng ER - TY - THES TI - Modal Interface Theories for Specifying Component-based Systems AU - Fendrich, Sascha PY - 2017 PB - opus CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/42329 LA - eng AB - Large software systems frequently manifest as complex, concurrent, reactive systems and their correctness is often crucial for the safety of the application. Hence, modern techniques of software engineering employ incremental, component-based approaches to systems design. These are supported by interface theories which may serve as specification languages and as semantic foundations for software product lines, web-services, the internet of things, software contracts and conformance testing. Interface theories enable a systems designer to express communication requirements of components on their environments and to reason about the mutual compatibility of these requirements in order to guarantee the communication safety of the system. Further, interface theories enrich traditional operational specification theories by declarative aspects such as conjunction and disjunction, which allow one to specify systems heterogeneously. However, substantial practical aspects of software verification are not supported by current interface theories, e.g., reusing components, adapting components to changed operational environments, reasoning about the compatibility of more than two components, modelling software product lines or tracking erroneous behaviour in safety-critical systems. The goal of this thesis is to investigate the theoretical foundations for making interface theories more practical by solving the above issues. Although partial solutions to some of these issues have been presented in the literature, none of them succeeds without sacrificing other desired features. The particular challenge of this thesis is to solve these problems simultaneously within a single interface theory. To this end, the arguably most general interface theory Modal Interface Automata (MIA) is extended, yielding the interface theory Error-preserving Modal Interface Automata (EMIA). The above problems are addressed as follows. Quotient operators are adjoint to composition and, therefore, support component reuse. Such a quotient operator is introduced to both MIA and EMIA. It is the first one that considers nondeterministic dividends and compatibility. Alphabet extension operators for MIA and EMIA allow for the change of operational environment by permitting one to adapt system components to new interactions without breaking previously satisfied requirements. Erroneous behavior is identified as a common source of problems with respect to the compatibility of more than two components, the modelling of software product lines and erroneous behaviour in safety-critical systems. EMIA improves on previous interface theories by providing a more precise semantics with respect to erroneous behaviour based on error-preservation. The relation between error-preservation and the usual error-abstraction employed in previous interface theories is investigated, establishing a Galois insertion from MIA into EMIA that is relevant at the levels of specifications, composition operations and proofs. The practical utility of interface theories is demonstrated by providing a software implementation of MIA and EMIA that is applied to two case studies. Further, an outlook is given on the relation between type checking and refinement checking. As a proof of concept, the simple interface theory Interface Automata is extended to a behavioural type theory where type checking is a syntactic approximation of refinement checking. ER - TY - CPAPER TI - On the Automated Derivation of Domain-Specific UML Profiles AU - Kraas, Alexander ED - Anjorin, Anthony ED - Espinoza, Huáscar PY - 2017 T2 - Modelling Foundations and Applications : 13th European Conference, ECMFA 2017, Held as Part of STAF 2017, Marburg, Germany, July 19-20, 2017, Proceedings SP - 3-19 PB - Springer International Publishing CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-319-61482-3 DO - 10.1007/978-3-319-61482-3_1 UR - https://fis.uni-bamberg.de/handle/uniba/42325 LA - eng ER - TY - JOUR TI - Resource-aware Policies AU - Bottoni, Paolo AU - Fish, Andrew AU - Heußner, Alexander AU - Presicce, F. Parisi PY - 2017 JO - Journal of Visual Languages and Computation VL - 38 SP - 84-96 PB - Elsevier, Academic Press CY - Amsterdam [u.a.] SN - 1045-926X DO - 10.1016/j.jvlc.2016.10.004 UR - https://fis.uni-bamberg.de/handle/uniba/41394 LA - eng ER - TY - JOUR TI - Improving Energy Efficiency in QoS-Constrained Wireless Sensor Networks AU - Abdelaal, Mohamed AU - Theel, Oliver AU - Kuka, Christian AU - Zhang, Peilin AU - Gao, Yang AU - Bashlovkina, Vasilisa AU - Nicklas, Daniela AU - Fränzle, Martin PY - 2016 JO - International journal of distributed sensor networks VL - 12 IS - 5, 1576038 PB - SAGE CY - London SN - 1550-1477 UR - https://fis.uni-bamberg.de/handle/uniba/109493 LA - eng AB - Energy saving is often achieved via “squeezing” other application-sensitive Quality of Service (QoS) parameters such as delay and throughput. Accordingly, energy-saving methods must consider those QoS parameters. In this paper, we survey the most recent work on energy efficiency in WSNs and we discuss the impacts of these methods on the QoS provided. Moreover, we propose a novel divide-and-conquer procedure to deal with the trade-off between energy consumption and other QoS parameters. The idea is to tackle a certain source of energy consumption to minimize the drawn energy. Subsequently, this energy-saving method is refined to consider other service qualities. To support the correctness of our claim, three energy-saving methods, taking the QoS issues into consideration, are given as examples. The first method exploits a so-called Fuzzy transform for shrinking the wireless traffic with highly precise lossy data compression. In the second method, the sensing module is targeted by employing reliable virtual sensors. Such sensors compensate the unavailability of main energy-hungry sensors during sleep periods. The third method exploits a self-adaptive mechanism to improve the QoS parameters via deliberately reducing the lifetime below the maximum time and exploiting design-time knowledge. KW - energy efficiency KW - quality of service KW - wireless sensor network ER - TY - JOUR TI - Improving Energy Efficiency in QoS-Constrained Wireless Sensor Networks AU - Abdelaal, Mohamed AU - Theel, Oliver AU - Kuka, Christian AU - Zhang, Peilin AU - Gao, Yang AU - Bashlovkina, Vasilisa AU - Nicklas, Daniela AU - Fränzle, Martin PY - 2016 JO - International journal of distributed sensor networks VL - 12 IS - 5, 1576038 SP - 1-28 PB - SAGE CY - London SN - 1550-1477 DO - 10.1155/2016/1576038 UR - https://fis.uni-bamberg.de/handle/uniba/109483 LA - eng AB - Energy saving is often achieved via “squeezing” other application-sensitive Quality of Service (QoS) parameters such as delay and throughput. Accordingly, energy-saving methods must consider those QoS parameters. In this paper, we survey the most recent work on energy efficiency in WSNs and we discuss the impacts of these methods on the QoS provided. Moreover, we propose a novel divide-and-conquer procedure to deal with the trade-off between energy consumption and other QoS parameters. The idea is to tackle a certain source of energy consumption to minimize the drawn energy. Subsequently, this energy-saving method is refined to consider other service qualities. To support the correctness of our claim, three energy-saving methods, taking the QoS issues into consideration, are given as examples. The first method exploits a so-called Fuzzy transform for shrinking the wireless traffic with highly precise lossy data compression. In the second method, the sensing module is targeted by employing reliable virtual sensors. Such sensors compensate the unavailability of main energy-hungry sensors during sleep periods. The third method exploits a self-adaptive mechanism to improve the QoS parameters via deliberately reducing the lifetime below the maximum time and exploiting design-time knowledge. KW - energy efficiency KW - quality of service KW - wireless sensor network ER - TY - CPAPER TI - CoreTAna : A Trace Analyzer for Reverse Engineering Real-Time Software AU - Sailer, Andreas AU - Deubzer, Michael AU - Lüttgen, Gerald AU - Mottok, Jürgen PY - 2016 T2 - IEEE 23rd Intl. Conf. on Software Analysis, Evolution, and Reengineering (SANER 2016) SP - 657-660 PB - IEEE Computer Society CY - Osaka, Japan SN - 978-1-5090-1855-0 DO - 10.1109/SANER.2016.36 UR - https://fis.uni-bamberg.de/handle/uniba/41947 LA - eng ER - TY - CPAPER TI - The ForeC Synchronous Deterministic Parallel Programming Language for Multicores AU - Yip, Eugene AU - Girault, Alain AU - Roop, Partha S. AU - Biglari-Abhari, Morteza PY - 2016 T2 - IEEE 10th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC), 2016 SP - 297-304 PB - IEEE CY - Deutschland SN - 978-1-5090-3531-1 DO - 10.1109/MCSoC.2016.13 UR - https://fis.uni-bamberg.de/handle/uniba/41458 LA - eng ER - TY - CPAPER TI - Preface AU - Heußner, Alexander AU - Kissinger, Aleks AU - Wijs, Anton PY - 2016 T2 - EPTCS 231: Proceedings Second : Graphs as Models Workshop ; Eindhoven, The Netherlands, April 2-3, 2016 PB - NICTA CY - Sydney SN - 2075-2180 DO - 10.4204/EPTCS.231 UR - https://fis.uni-bamberg.de/handle/uniba/41391 LA - eng ER - TY - CPAPER TI - POSTER: Identifying Dynamic Data Structures in Malware AU - Rupprecht, Thomas AU - Chen, Xi AU - White, David H. AU - Mühlberg, Jan Tobias AU - Bos, Herbert AU - Lüttgen, Gerald PY - 2016 T2 - CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security SP - 1772-1774 PB - ACM CY - New York, NY, USA SN - 978-1-4503-4139-4 DO - 10.1145/2976749.2989041 UR - https://fis.uni-bamberg.de/handle/uniba/41377 LA - eng AB - As the complexity of malware grows, so does the necessity of employing program structuring mechanisms during development. While control flow structuring is often obfuscated, the dynamic data structures employed by the program are typically untouched. We report on work in progress that exploits this weakness to identify dynamic data structures present in malware samples for the purposes of aiding reverse engineering and constructing malware signatures, which may be employed for malware classification. Using a prototype implementation, which combines the type recovery tool Howard and the identification tool Data Structure Investigator (DSI), we analyze data structures in Carberp and AgoBot malware. Identifying their data structures illustrates a challenging problem. To tackle this, we propose a new type recovery for binaries based on machine learning, which uses Howard's types to guide the search and DSI's memory abstraction for hypothesis evaluation. ER - TY - CPAPER TI - A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs AU - Corrodi, Claudio AU - Heußner, Alexander AU - Poskitt, Christopher M. ED - Stevens, Perdita ED - Wąsowski , Andrzej PY - 2016 T2 - Fundamental Approaches to Software Engineering : 19th International Conference, FASE 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2–8, 2016, Proceedings SP - 31-48 PB - Springer CY - Berlin ; Heidelberg T3 - Lecture Notes in Computer Science SN - 978-3-662-49664-0 DO - 10.1007/978-3-662-49665-7_3 UR - https://fis.uni-bamberg.de/handle/uniba/41373 LA - eng ER - TY - JOUR TI - Nondeterministic Modal Interfaces AU - Bujtor, Ferenc AU - Fendrich, Sascha AU - Lüttgen, Gerald AU - Vogler, Walter PY - 2016 JO - Theoretical computer science : the journal of the EATCS IS - 642 SP - 24-53 PB - Elsevier CY - Amsterdam [u.a.] SN - 0304-3975 DO - 10.1016/j.tcs.2016.06.011 UR - https://fis.uni-bamberg.de/handle/uniba/41366 LA - eng AB - Interface theories are employed in the component-based design of concurrent systems. They often emerge as combinations of Interface Automata (IA) and Modal Transition Systems (MTS), e.g., Nyman et al.'s IOMTS, Bauer et al.'s MIO, Raclet et al.'s MI or our MIA. In this paper, we generalise MI to interfaces, for which we properly resolve the longstanding conflict between unspecified inputs being allowed in IA but forbidden in MTS. With this solution we achieve, in contrast to related work, an associative parallel composition, a compositional preorder, a conjunction on interfaces with dissimilar alphabets supporting perspective-based specifications, and a quotienting operator for decomposing nondeterministic specifications in a single theory. In addition, we define a hiding and a restriction operator, complement conjunction with a disjunction operator and illustrate our interface theory by means of a simple example. ER - TY - CPAPER TI - DSI : an evidence-based approach to identify dynamic data structures in C programs AU - White, David H. AU - Rupprecht, Thomas AU - Lüttgen, Gerald PY - 2016 T2 - ISSTA 2016: Proceedings of the 25th International Symposium on Software Testing and Analysis SP - 259-269 PB - ACM CY - New York, NY SN - 978-1-4503-4390-9 DO - 10.1145/2931037.2931071 UR - https://fis.uni-bamberg.de/handle/uniba/41314 LA - eng ER - TY - CPAPER TI - A Generalised Theory of Interface Automata, Component Compatibility and Error AU - Fendrich, Sascha AU - Lüttgen, Gerald ED - Ábrahám, Erika ED - Huisman, Marieke PY - 2016 T2 - Integrated formal methods : 12th International Conference, IFM 2016, Reykjavik, Iceland, June 1-5, 2016: proceedings SP - 160-175 PB - Springer CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-319-33692-3 DO - 10.1007/978-3-319-33693-0_11 UR - https://fis.uni-bamberg.de/handle/uniba/41243 LA - eng ER - TY - JOUR TI - Experiences with Sensor-Based Research for Critical, Socio-technical Systems AU - Surm, Henrik AU - Rüssmeier, Nick AU - Grawunder, Marco AU - Nicklas, Daniela AU - Zielinski, Oliver PY - 2016 JO - Proceedings of the 17th IEEE International Conference on Mobile Data Management PB - IEEE CY - New York, NY, USA SN - 2375-0324 DO - 10.1109/MDM.2016.41 UR - https://fis.uni-bamberg.de/handle/uniba/40930 LA - eng ER - TY - JOUR TI - Challenges and Design Goals for an Architecture of a Privacy-preserving Smart City Lab AU - Steuer, Simon AU - Benabbas, Aboubakr AU - Kasrin, Nasr AU - Nicklas, Daniela PY - 2016 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval VL - 16 IS - 2 SP - 147-156 PB - Springer CY - Berlin ; Heidelberg SN - 1610-1995 DO - 10.1007/s13222-016-0223-8 UR - https://fis.uni-bamberg.de/handle/uniba/40914 LA - eng ER - TY - CPAPER TI - Ad-hoc Situational Awareness by Optical Sensors in a Research Port Maritime Environment : Approved Networking and Sensor Fusion Technologies AU - Rüssmeier, Nick AU - Hahn, Axel AU - Nicklas, Daniela AU - Zielinski, Oliver PY - 2016 T2 - Tagungsband 18. GMA/ITG-Fachtagung Sensoren und Messsysteme 2016 / Organisation AMA Service GmbH SP - 715-722 PB - AMA Service GmbH CY - Wunstorf, Germany SN - 978-3-9816876-0-6 DO - 10.5162/sensoren2016/P7.1 UR - https://fis.uni-bamberg.de/handle/uniba/40901 LA - eng ER - TY - JOUR TI - Application Migration Effort in the Cloud AU - Kolb, Stefan AU - Lenhard, Jörg AU - Wirtz, Guido PY - 2016 PB - opus CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/40530 LA - eng AB - Over the last years, the utilization of cloud resources has been steadily rising and an increasing number of enterprises are moving applications to the cloud. A leading trend is the adoption of Platform as a Service to support rapid application deployment. By providing a managed environment, cloud platforms take away a lot of complex configuration effort required to build scalable applications. However, application migrations to and between clouds cost development effort and open up new risks of vendor lock-in. This is problematic because frequent migrations may be necessary in the dynamic and fast changing cloud market. So far, the effort of application migration in PaaS environments and typical issues experienced in this task are hardly understood. To improve this situation, we present a cloud-to-cloud migration of a real-world application to seven representative cloud platforms. In this case study, we analyze the feasibility of the migrations in terms of portability and the effort of the migrations. We present a Docker-based deployment system that provides the ability of isolated and reproducible measurements of deployments to platform vendors, thus enabling the comparison of platforms for a particular application. Using this system, the study identifies key problems during migrations and quantifies these differences by distinctive metrics. KW - Cloud Computing KW - Platform as a Service KW - Migration KW - Portability KW - Metrics ER - TY - GEN TI - A Generalised Theory of Interface Automata, Component Compatibility and Error AU - Fendrich, Sascha AU - Lüttgen, Gerald PY - 2016 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/40287 LA - eng AB - Interface theories allow systems designers to reason about the composability and compatibility of concurrent system components. Such theories often extend both de Alfaro and Henzinger’s Interface Automata and Larsen’s Modal Transition Systems, which leads, however, to several issues that are undesirable in practice: an unintuitive treatment of specified unwanted behaviour, a binary compatibility concept that does not scale to multi-component assemblies, and compatibility guarantees that are insufficient for software product lines. In this paper we show that communication mismatches are central to all these problems and, thus, the ability to represent such errors semantically is an important feature of an interface theory. Accordingly, we present the error-aware interface theory EMIA, where the above shortcomings are remedied by introducing explicit fatal error states. In addition, we prove via a Galois insertion that EMIA is a conservative generalisation of the established MIA (Modal Interface Automata) theory. KW - Interface Automata KW - Modal Transition Systems KW - Component-based Design KW - Concurrency KW - Error States ER - TY - GEN TI - Denotational Fixed Point Semantics for Constructive Scheduling of Synchronous Concurrency AU - Mendler, Michael AU - von Hanxleden, Reinhard AU - Fuhrmann, Insa AU - Aguado, Joaquín PY - 2016 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/21713 LA - eng AB - The synchronous model of concurrent computation (SMoCC) is well established for programming languages in the domain of safety-critical reactive and embedded systems. Translated into mainstream C/Java programming, the SMoCC corresponds to a cyclic execution model in which concurrent threads are synchronised on a logical clock that cuts system computation into a sequence of macro-steps. A causality analysis verifies the existence of a schedule on memory accesses to ensure each macro-step is deadlock-free and determinate. We introduce an abstract semantic domain I(D,P) and an associated denotational fixed point semantics for reasoning about concurrent and sequential variable accesses within a synchronous cycle-based model of computation. We use this domain for a new and extended behavioural definition of Berry’s causality analysis in terms of approximation intervals. The domain I(D,P) extends the domain I(D) from our previous work and fixes a mistake in the treatment of initialisations. Based on this fixed point semantics the notion of Input Berry-constructiveness (IBC) for synchronous programs is proposed. This new IBC class lies properly between strong (SBC) and normal Berry-constructiveness (BC) defined in previous work. SBC and BC are two ways to interpret the standard constructive semantics of synchronous programming, as exemplified by imperative SMoCC languages such as Esterel or Quartz. SBC is often too restrictive as it requires all variables to be initialised by the program. BC can be too permissive because it initialises all variables to a fixed value, by default. Where the initialisation happens through the memory, e.g., when carrying values from one synchronous tick to the next, then IBC is more appropriate. IBC links two levels of execution, the macro-step level and the micro-step level. We prove that the denotational fixed point analysis for IBC, and hence Berry’s causality analysis, is sound with respect to operational micro-level scheduling. The denotational model can thus be viewed as a compositional presentation of a synchronous scheduling strategy that ensures reactiveness and determinacy for imperative concurrent programming. KW - Denotational semantics KW - concurrency KW - determinism KW - constructiveness KW - Mealy reactive systems, synchronous programming, Esterel ER - TY - CPAPER TI - Concept Drift Detection with Clustering via Statistical Change Detection Methods AU - Nicklas, Daniela AU - Fukui, Ken-Ichi AU - Gama, João AU - Moriyama, Koichi AU - Numao, Masayuki AU - Sakamoto, Yusuke PY - 2015 T2 - Proceedings: 2015 Seventh International Conference on Knowledge and Systems Engineering (KSE) SP - 37-42 PB - IEEE CY - New York, NY, USA DO - 10.1109/KSE.2015.19 UR - https://fis.uni-bamberg.de/handle/uniba/44519 LA - eng AB - We propose a concept drift detection method utilizing statistical change detection in which a drift detection method and the Page-Hinkley test are employed. Our method enables users to annotate clustering results without constructing a model of drift detection for every input. In our experiments using synthetic data, we evaluated our proposed method on the basis of detection delay and false detection, also revealed relations between the degree of drift and parameters of the method. ER - TY - CPAPER TI - Learning assertions to verify linked-list programs AU - Mühlberg, Jan Tobias AU - White, David H. AU - Dodds, Mike AU - Lüttgen, Gerald AU - Piessens, Frank ED - Calinescu, Radu ED - Rumpe , Bernhard PY - 2015 T2 - Software Engineering and Formal Methods : 13th International Conference, SEFM 2015, York, UK, September 7-11, 2015 ; Proceedings SP - 37-52 PB - Springer CY - Berlin ; Heidelberg [u.a.] T3 - Lecture Notes in Computer Science SN - 978-3-319-22968-3 DO - 10.1007/978-3-319-22969-0_3 UR - https://fis.uni-bamberg.de/handle/uniba/41306 LA - eng ER - TY - CPAPER TI - Reliable Virtual Sensing for Wireless Sensor Networks AU - Abdelaal, Mohamed AU - Kuka, Christian AU - Theel, Oliver AU - Nicklas, Daniela PY - 2015 T2 - Tenth International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP), 2015 IEEE PB - IEEE CY - New York, NY, USA DO - 10.1109/ISSNIP.2015.7106926 UR - https://fis.uni-bamberg.de/handle/uniba/40967 LA - eng ER - TY - CPAPER TI - Data streams and event processing (DSEP) AU - Grawunder, Marco AU - Nicklas, Daniela PY - 2015 T2 - Workshopband : Tagung vom 02. - 03. März 2015 in Hamburg ; Datenbanksysteme für Business, Technologie und Web (BTW 2015) SP - 49-50 PB - Gesellschaft für Informatik e.V. CY - Bonn T3 - GI-Edition : Proceedings SN - 978-3-88579-636-7 UR - https://fis.uni-bamberg.de/handle/uniba/40936 LA - eng ER - TY - CPAPER TI - Bestimmung von Datenunsicherheit in einem probabilistischen Datenstrommanagementsystem AU - Kuka, Christian AU - Nicklas, Daniela ED - Ritter, Norbert PY - 2015 T2 - Workshopband : Tagung vom 02. - 03. März 2015 in Hamburg ; Datenbanksysteme für Business, Technologie und Web (BTW 2015) SP - 81-90 PB - Gesellschaft für Informatik e.V. CY - Bonn T3 - GI-Edition : Proceedings SN - 978-3-88579-636-7 UR - https://fis.uni-bamberg.de/handle/uniba/40924 LA - deu ER - TY - CPAPER TI - Towards a framework for sensor-based research and development platform for critical, socio-technical systems AU - Surm, Henrik AU - Nicklas, Daniela PY - 2015 T2 - Datenbanksysteme für Business, Technologie und Web (BTW 2015) - Workshopband, 2.-3. März 2015, Hamburg, Germany SP - 97-100 CY - Bonn SN - 978-3-88579-636-7 UR - https://fis.uni-bamberg.de/handle/uniba/40934 LA - eng ER - TY - CPAPER TI - Brain Activity Measured with fNIRS for the Prediction of Cognitive Workload AU - Unni, Anirudh AU - Surm, Henrik AU - Ihme, Klas AU - Weber, Lars AU - Lüdtke, Andreas AU - Nicklas, Daniela AU - Jipp, Meike AU - Rieger, Jochem PY - 2015 T2 - Proceedings : 6th IEEE International Conference on Cognitive Infocommunications (CogInfoCom), 2015 PB - IEEE CY - Washington D.C. (USA) DO - 10.1109/CogInfoCom.2015.7390617 UR - https://fis.uni-bamberg.de/handle/uniba/40920 LA - eng ER - TY - JOUR TI - Editorial : Schwerpunktthema ; Data Management for Mobility AU - Mitschang, Bernhard AU - Nicklas, Daniela AU - Härder, Theo PY - 2015 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V. VL - 15 IS - 2 SP - 1-4 PB - Springer CY - Heidelberg SN - 1610-1995 DO - 10.1007/s13222-015-0193-2 UR - https://fis.uni-bamberg.de/handle/uniba/40919 LA - deu ER - TY - CPAPER TI - Semantic Data Exchange in e-Navigation AU - Salous, Mazen AU - Nicklas, Daniela AU - Bolles, André AU - Mextorf, Henning PY - 2015 T2 - Datenbanksysteme für Business, Technologie und Web (BTW 2015) : 4.-6. März 2015 in Hamburg ; Proceedings SP - 601-611 CY - Bonn SN - 978-3-88579-635-0 UR - https://fis.uni-bamberg.de/handle/uniba/40921 LA - eng ER - TY - JOUR TI - Richer interface automata with optimistic and pessimistic compatibility AU - Lüttgen, Gerald AU - Vogler, Walter AU - Fendrich, Sascha PY - 2015 JO - Acta Informatica VL - 52 IS - 4/5 SP - 305-336 PB - Springer CY - Heidelberg [u.a.] SN - 1432-0525 DO - 10.1007/s00236-014-0211-0 UR - https://fis.uni-bamberg.de/handle/uniba/21974 LA - eng AB - Modal transition systems are a popular semantic underpinning of interface theories, such as Nyman et al.’s IOMTS and Bauer et al.’s MIO, which facilitate component-based reasoning for concurrent systems. Our interface theory MIA repaired a compositional flaw of IOMTS-refinement and introduced a conjunction operator. In this paper, we first modify MIA to properly deal with internal computations including internal must-transitions, which were largely ignored already in IOMTS. We then study a MIA variant that adopts MIO’s pessimistic—rather than IOMTS’ optimistic—view on component compatibility and define, for the first-time in a pessimistic, non-deterministic setting, conjunction and disjunction on interfaces. For both the optimistic and pessimistic MIA variant, we also discuss mechanisms for extending alphabets when refining interfaces, which is a desired feature for perspective-based specification. We illustrate our advancements via a small example. ER - TY - CPAPER TI - Nondeterministic Modal Interfaces AU - Bujtor, Ferenc AU - Fendrich, Sascha AU - Lüttgen, Gerald AU - Vogler, Walter PY - 2015 T2 - SOFSEM 2015: theory and practice of computer science 41th International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sněžkou, Czech Republic, January 24 - 29, 2015 ; proceedings SP - 152-163 PB - Springer CY - Heidelberg [u.a.] T3 - Lecture Notes in Computer Science SN - 978-3-662-46078-8 DO - 10.1007/978-3-662-46078-8_13 UR - https://fis.uni-bamberg.de/handle/uniba/21930 LA - eng AB - Interface theories are employed in the component-based design of concurrent systems. They often emerge as combinations of Interface Automata (IA) and Modal Transition Systems (MTS), e.g., Nyman et al.’s IOMTS, Bauer et al.’s MIO, Raclet et al.’s MI or our MIA. In this paper, we generalise MI to nondeterministic interfaces, for which we resolve the longstanding conflict between unspecified inputs being allowed in IA but forbidden in MTS. With this solution we achieve, in contrast to related work, an associative parallel composition, a compositional preorder, a conjunction on interfaces with dissimilar alphabets supporting perspective-based specifications, and a quotienting operator for decomposing nondeterministic specifications in a single theory. ER - TY - THES TI - Model and Proof Theory of Constructive ALC : constructive Description Logics AU - Scheele, Stephan PY - 2015 PB - University of Bamberg Press CY - Bamberg T3 - Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg SN - 978-3-86309-320-4 DO - 10.20378/irb-21626 UR - https://fis.uni-bamberg.de/handle/uniba/21626 LA - eng AB - Description logics (DLs) represent a widely studied logical formalism with a significant impact in the field of knowledge representation and the Semantic Web. However, they are equipped with a classical descriptive semantics that is characterised by a platonic notion of truth, being insufficiently expressive to deal with evolving and incomplete information, as from data streams or ongoing processes. Such partially determined and incomplete knowledge can be expressed by relying on a constructive semantics. This thesis investigates the model and proof theory of a constructive variant of the basic description logic ALC, called cALC. The semantic dimension of constructive DLs is investigated by replacing the classical binary truth interpretation of ALC with a constructive notion of truth. This semantic characterisation is crucial to represent applications with partial information adequately, and to achieve both consistency under abstraction as well as robustness under refinement, and on the other hand is compatible with the Curry-Howard isomorphism in order to form the cornerstone for a DL-based type theory. The proof theory of cALC is investigated by giving a sound and complete Hilbert-style axiomatisation, a Gentzen-style sequent calculus and a labelled tableau calculus showing finite model property and decidability. Moreover, cALC can be strengthened towards normal intuitionistic modal logics and classical ALC in terms of sound and complete extensions and hereby forms a starting point for the systematic investigation of a constructive correspondence theory. KW - Constructive Logic, Description Logic, Curry-Howard, Gentzen Tableau, Modal Logic ER - TY - CHAP TI - Challenges for Personal Data Stream Management in Smart Buildings AU - Geesen, Dennis AU - Appelrath, H.-Jürgen AU - Grawunder, Marco AU - Nicklas, Daniela PY - 2014 T2 - Creating Personal, Social, and Urban Awareness through Pervasive Computing SP - 201-219 PB - IGI Global CY - Pennsylvania (USA) SN - 978-1-4666-4695-7 DO - 10.4018/978-1-4666-4695-7.ch009 UR - https://fis.uni-bamberg.de/handle/uniba/40970 LA - eng ER - TY - JOUR TI - Special issue on information management in mobile applications AU - Delot, Thierry AU - Geisler, Sandra AU - Nicklas, Daniela AU - Quix, Christoph AU - Xu, Bo PY - 2014 JO - Pervasive and Mobile Computing VL - 15 IS - Special Issue on Information Management in Mobile Applications / Edited by Thierry Delot, Sandra Geisler, Daniela Nicklas, Christoph Quix and Bo Xu ; Special Issue on Data Mining in Pervasive Environments / Edited by Nirmalya Roy, Parisa Rashidi, Larry Holder and Liming Chen SP - 1-2 PB - Elsevier CY - New York, NY [u.a.] DO - 10.1016/j.pmcj.2014.08.004 UR - https://fis.uni-bamberg.de/handle/uniba/40977 LA - eng ER - TY - CPAPER TI - 9 Million Bicycles? Extending Induction Loops with Bluetooth Sensing AU - Jansen, Slinger AU - Hoting, Dennis AU - Runge, Julian AU - Brinkhoff, Thomas AU - Nicklas, Daniela AU - Sauter, Jens PY - 2014 T2 - IEEE MDM 2014 : 15th IEEE International Conference on Mobile Data Management 15-18 July, 2014, Brisbane, Australia SP - 113-116 PB - IEEE CY - Washington D.C. (USA) SN - 978-1-4799-5705-7 DO - 10.1109/MDM.2014.20 UR - https://fis.uni-bamberg.de/handle/uniba/40939 LA - eng ER - TY - CPAPER TI - Quality Matters : Supporting Quality-aware Pervasive Applications by Probabilistic Data Stream Management AU - Kuka, Christian AU - Nicklas, Daniela PY - 2014 T2 - Proceedings of the 8th ACM International Conference on Distributed Event-Based Systems SP - 1-12 PB - ACM CY - New York, USA SN - 978-1-4503-2737-4 DO - 10.1145/2611286.2611292 UR - https://fis.uni-bamberg.de/handle/uniba/40925 LA - eng ER - TY - CPAPER TI - Supporting Quality-aware Pervasive Applications by Probabilistic Data Stream Management (Demo) AU - Kuka, Christian AU - Nicklas, Daniela PY - 2014 T2 - DEBS '14: Proceedings of the 8th ACM International Conference on Distributed Event-Based Systems SP - 330-333 PB - ACM CY - New York, USA SN - 978-1-4503-2737-4 DO - 10.1145/2611286.2611319 UR - https://fis.uni-bamberg.de/handle/uniba/40922 LA - eng ER - TY - JOUR TI - Symbolic object code analysis AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2014 JO - International Journal on Software Tools for Technology Transfer VL - 16 IS - 1 SP - 81-102 PB - Springer CY - Berlin Heidelberg SN - 1433-2787 DO - 10.1007/s10009-012-0256-8 UR - https://fis.uni-bamberg.de/handle/uniba/21904 LA - eng ER - TY - CPAPER TI - Automated Verification of Critical Systems AU - Lüttgen, Gerald AU - Merz, Stephan PY - 2014 IS - 96 (2014), 3, Special issue on Automated Verification of Critical Systems (AVoCS'12) SP - 277-278 PB - Elsevier Science CY - Amsterdam [u.a.] DO - 10.1016/j.scico.2014.03.008 UR - https://fis.uni-bamberg.de/handle/uniba/21865 LA - eng ER - TY - CPAPER TI - SCCharts : Sequentially constructive statecharts for safety-critical applications ; HW/SW-Synthesis for a Conservative Extension of Synchronous Statecharts AU - von Hanxleden, Reinhard AU - Duderstadt, Björn AU - Motika, Christian AU - Smyth, Steven AU - Mendler, Michael AU - Aguado, Joaquin AU - Mercer, Stephen AU - O'Brien, Owen PY - 2014 T2 - PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation SP - 372-383 PB - ACM CY - New York, NY, USA SN - 978-1-4503-2784-8 DO - 10.1145/2594291.2594310 UR - https://fis.uni-bamberg.de/handle/uniba/21163 LA - eng ER - TY - JOUR TI - On the Computational Interpretation of CKn for Contextual Information Processing AU - Mendler, Michael AU - Scheele, Stephan PY - 2014 JO - Fundamenta Informaticae VL - 130 IS - 1 SP - 125-162 PB - IOS Press CY - Amsterdam SN - 0169-2968 UR - https://fis.uni-bamberg.de/handle/uniba/21154 LA - eng ER - TY - CPAPER TI - Grounding Synchronous Deterministic Concurrency in Sequential Programming AU - Aguado, Joaquin AU - Mendler, Michael AU - von Hanxleden, Reinhard AU - Fuhrmann, Insa ED - Shao, Zhong PY - 2014 T2 - Programming languages and systems : 23rd European Symposium on Programming, ESOP 2014, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5 - 13, 2014 ; proceedings SP - 229-248 PB - Springer CY - Berlin [u.a.] T3 - Lecture Notes in Computer Science SN - 978-3-642-54832-1 DO - 10.1007/978-3-642-54833-8_13 UR - https://fis.uni-bamberg.de/handle/uniba/21129 LA - eng ER - TY - BOOK TI - Grounding Synchronous Deterministic Concurrency in Sequential Programming AU - Aguado, Joaquín AU - Mendler, Michael AU - Von Hanxleden, Reinhard AU - Fuhrmann, Insa PY - 2014 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/20793 LA - eng AB - In this report, we introduce an abstract interval domain I(D; P) and associated fixed point semantics for reasoning about concurrent and sequential variable accesses within a synchronous cycle-based model of computation. The interval domain captures must (lower bound) and cannot (upper bound) information to approximate the synchronisation status of variables consisting of a value status D and an init status P. We use this domain for a new behavioural definition of Berry’s causality analysis for Esterel. This gives a compact and uniform understanding of Esterel-style constructiveness for shared-memory multi-threaded programs. Using this new domain-theoretic characterisation we show that Berry’s constructive semantics is a conservative approximation of the recently proposed sequentially constructive (SC) model of computation. We prove that every Berry-constructive program is sequentially constructive, i.e., deterministic and deadlock-free under sequentially admissible scheduling. This gives, for the first time, a natural interpretation of Berry-constructiveness for main-stream imperative programming in terms of scheduling, where previous results were cast in terms of synchronous circuits. It also opens the door to a direct mapping of Esterel’s signal mechanism into boolean variables that can be set and reset arbitrarily within a tick. We illustrate the practical usefulness of this mapping by discussing how signal reincarnation is handled efficiently by this transformation, which is of complexity that is linear in program KW - Concurrency KW - determinism KW - constructiveness KW - Mealy reactive systems KW - synchronous programming ER - TY - GEN TI - On the Computational Interpretation of CKn for Contextual Information Processing : Ancillary Material AU - Scheele, Stephan AU - Mendler, Michael PY - 2014 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/6157 LA - eng AB - In the journal article we introduce a modal λ-calculus λCKn whose type system corresponds to the constructive multi-modal logic CKn. This logic is a constructive refinement of the classical multi-modal logic CKn which forms the heart of the class of description logics used in semantic information processing. λCKn constitutes the core of a functional language for information processing in this application domain. Being strongly typed, it offers static type checking to support safe contextual reasoning in relational structures like those treated by description logics. Here we provide detailed mathematical proofs for the results presented in [8]. Accordingly, this report is not meant as a self-contained technical exposition of the whys and hows of λCKn. It is merely a collection of ancillary material to complement the main article [8] to which the reader is referred for more information. An early version of this work appeared at the 3rd International Workshop on Logics, Agents and Mobility (LAM 2010). We are grateful for the support by the German Research Council (DFG) who funded this research as part of the project SPACMODL under grant No. ME 1427/4-1. ER - TY - CPAPER TI - Sequentially constructive concurrency : A conservative extension of the synchronous model of computation AU - Hanxleden, Reinhard von AU - Mendler, Michael AU - Aguado, Joaquin AU - Duderstadt, Björn AU - Fuhrmann, Insa AU - Motika, Christian AU - Mercer, Stephen AU - O'Brien, Owen PY - 2013 T2 - European Design Automation Association: 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE 2013) : Grenoble, France, 18 - 22 March 2013 ; Proceedings SP - 581-586 PB - IEEE CY - Piscataway, NJ SN - 978-1-4673-5071-6 DO - 10.7873/DATE.2013.128 UR - https://fis.uni-bamberg.de/handle/uniba/21189 LA - eng ER - TY - CHAP TI - How similar is what I get to what I want : Matchmaking for Mobility Support AU - Schmid, Ute AU - Berle, Lukas AU - Munz, Michael AU - Stein, Klaus AU - Sticht, Martin PY - 2013 T2 - Computational Approaches to Analogical Reasoning : Current Trends SP - 263-287 PB - Springer CY - Berlin T3 - Studies in Computational Intelligence SN - 978-3642545153 UR - https://fis.uni-bamberg.de/handle/uniba/2734 LA - eng ER - TY - CPAPER TI - Identifying Dynamic Data Structures by Learning Evolving Patterns in Memory AU - White, David AU - Lüttgen, Gerald ED - Piterman, Nir PY - 2013 T2 - Tools and algorithms for the construction and analysis of systems : 19th international conference, TACAS 2013, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16 - 24, 2013 ; proceedings SP - 354-369 PB - Springer CY - Berlin T3 - Lecture notes in computer science SN - 978-3-642-36741-0 DO - 10.1007/978-3-642-36742-7_25 UR - https://fis.uni-bamberg.de/handle/uniba/2581 LA - eng ER - TY - JOUR TI - Modal Interface Automata AU - Lüttgen, Gerald AU - Vogler, Walter PY - 2013 JO - Logical Methods in Computer Science : LMCS VL - 9 IS - 3 SP - 1-28 CY - Braunschweig SN - 1860-5974 DO - 10.2168/LMCS-9(3:4)2013 UR - https://fis.uni-bamberg.de/handle/uniba/2535 LA - eng ER - TY - CPAPER TI - ω-Petri Nets AU - Geeraerts, Gilles AU - Heußner, Alexander AU - Praveen, M. AU - Raskin, Jean-François ED - Colom, José-Manuel ED - Desel, Jörg PY - 2013 T2 - Application and Theory of Petri Nets and Concurrency : 34th International Conference, PETRI NETS 2013, Milan, Italy, June 2013 ; Proceedings SP - 49-69 PB - Springer CY - Heidelberg T3 - Lecture Notes in Computer Science SN - 978-3-642-38696-1 DO - 10.1007/978-3-642-38697-8_4 UR - https://fis.uni-bamberg.de/handle/uniba/2539 LA - eng ER - TY - CPAPER TI - Queue-Dispatch Asynchronous Systems AU - Geeraerts, Gilles AU - Heußner, Alexander AU - Raskin, Jean-François PY - 2013 T2 - ACSD '13: Proceedings of the 2013 13th International Conference on Application of Concurrency to System Design SP - 150-159 PB - IEEE Computer Society CY - Washington, DC, USA SN - 978-0-7695-5035-0 DO - 10.1109/ACSD.2013.18 UR - https://fis.uni-bamberg.de/handle/uniba/2547 LA - eng ER - TY - CPAPER TI - Reachability in Higher-Order-Counters AU - Heußner, Alexander AU - Kartzow, Alexander ED - Krishnendu, Chatterjee ED - Sgall, Jiri PY - 2013 T2 - Mathematical Foundations of Computer Science 2013 : 38th International Symposium, MFCS 2013; Klosterneuburg, Austria, August 26-30, 2013 ; Proceedings SP - 528-539 PB - Springer CY - Berlin, Heidelberg T3 - Lecture Notes in Computer Science SN - 978-3-642-40312-5 DO - 10.1007/978-3-642-40313-2_47 UR - https://fis.uni-bamberg.de/handle/uniba/2528 LA - eng ER - TY - JOUR TI - Constructive Boolean circuits and the exactness of timed ternary simulation AU - Mendler, Michael AU - Shiple, Thomas R. AU - Berry, Gérard PY - 2012 JO - Formal methods in system design : an international journal VL - 40 IS - 3 SP - 283-329 PB - Springer CY - Dordrecht [u.a.] SN - 0925-9856 DO - 10.1007/s10703-012-0144-6 UR - https://fis.uni-bamberg.de/handle/uniba/1113 LA - eng ER - TY - CPAPER TI - Matchmaking: How similar is what I want to what I get? AU - Munz, Michael AU - Stein, Klaus AU - Sticht, Martin AU - Schmid, Ute PY - 2012 T2 - Working Papers of the 1st International Workshop on Similarity and Analogy-based Methods in AI, SAMAI 2012, August 27, 2012 - Montpellier (France) SP - 13-18 PB - IRIT CY - Toulouse UR - https://fis.uni-bamberg.de/handle/uniba/1018 LA - eng ER - TY - CPAPER TI - Safety Verification of Communicating One-Counter Machines AU - Heußner, Alexander AU - Le Gall, Tristan AU - Sutre, Grégoire PY - 2012 T2 - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) SP - 224-235 CY - Wadern T3 - LIPIcs - Leibniz International Proceedings in Informatics SN - 978-3-939897-47-7 UR - https://fis.uni-bamberg.de/handle/uniba/986 LA - eng ER - TY - CPAPER TI - On Parallel Software Verification Using Boolean Equation Systems AU - Ditter, Alexander AU - Češka, Milan AU - Lüttgen, Gerald ED - Donaldson, Alastair PY - 2012 T2 - Model checking software : 19th international workshop, SPIN 2012, Oxford, UK, July 23 - 24, 2012 ; proceedings SP - 80-97 PB - Springer CY - Berlin [u.a.] T3 - Lecture Notes in Computer Science SN - 978-3-642-31758-3 DO - 10.1007/978-3-642-31759-0_8 UR - https://fis.uni-bamberg.de/handle/uniba/858 LA - eng ER - TY - CPAPER TI - Introducing Fairness into Compositional Verification via Unidirectional Counters AU - Siirtola, Antti AU - Puhakka, Antti AU - Lüttgen, Gerald PY - 2012 T2 - Proceedings, 2012 12th International Conference on Application of Concurrency to System Design : ACSD 2012 : 27-29 June 2012, Hamburg, Germany. SP - 32-41 CY - Hamburg SN - 978-0-7695-4709-1 UR - https://fis.uni-bamberg.de/handle/uniba/839 LA - eng ER - TY - CPAPER TI - Modal Interface Automata AU - Lüttgen, Gerald AU - Vogler, Walter ED - Baeten, Josephus C. M. PY - 2012 T2 - Theoretical computer science : 7th IFIP TC1/WG2.2 international conference, TCS 2012 : Amsterdam, The Netherlands, September 2012 : proceedings SP - 265-279 PB - Springer CY - Berlin [u.a.] T3 - Lecture Notes in Computer Science SN - 978-3-642-33474-0 DO - 10.1007/978-3-642-33475-7_19 UR - https://fis.uni-bamberg.de/handle/uniba/840 LA - eng ER - TY - JOUR TI - Symbolic object code analysis AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2012 JO - International journal on software tools for technology transfer : STTT PB - Springer CY - Berlin ; Heidelberg SN - 1433-2779 UR - https://fis.uni-bamberg.de/handle/uniba/835 LA - eng ER - TY - JOUR TI - Verifying compiled file system code AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2012 JO - Formal Aspects of Computing : the international journal of formal methods VL - 24 IS - 3 SP - 375-391 PB - Springer CY - London ; Berlin SN - 0934-5043 DO - 10.1007/s00165-011-0198-z UR - https://fis.uni-bamberg.de/handle/uniba/829 LA - eng ER - TY - CPAPER TI - Computing with streams AU - Aguado, Joaquín AU - Mendler, Michael PY - 2011 T2 - DAMP '11 Proceedings of the sixth workshop on Declarative aspects of multicore programming ; Austin, Texas, 23 Jan 2011 SP - 35-44 CY - New York, NY UR - https://fis.uni-bamberg.de/handle/uniba/5492 LA - eng ER - TY - JOUR TI - Constructive semantics for instantaneous reactions AU - Aguado, Joaquín AU - Mendler, Michael PY - 2011 JO - Theoretical computer science : the journal of the EATCS VL - 412 IS - 11 SP - 931 - 961 SN - 0304-3975 UR - https://fis.uni-bamberg.de/handle/uniba/5450 LA - eng ER - TY - JOUR TI - Cut-free Gentzen Calculus for Multimodal CK AU - Mendler, Michael AU - Scheele, Stephan PY - 2011 JO - Information and computation VL - 209 IS - 12, December 2011: Intuitionistic Modal Logic and Applications (IMLA 2008) SP - 1435 - 1538 SN - 0890-5401 UR - https://fis.uni-bamberg.de/handle/uniba/5451 LA - eng ER - TY - CPAPER TI - Unifying Synchronous Data and Control Flow in the Lazy Lambda Calculus AU - Aguado, Joaquín AU - Mendler, Michael AU - Pouzet, Marc PY - 2011 T2 - Proceedings of the 23rd Nordic Workshop on Programming Theory, October 26 - 28, 2011, Västerås, Sweden (NWPT 2011) SP - 108 - 111 CY - Västerås, Sweden T3 - Technical report UR - https://fis.uni-bamberg.de/handle/uniba/5441 LA - eng ER - TY - CPAPER TI - An Algebra of Synchronous Scheduling Interfaces AU - Mendler, Michael PY - 2011 T2 - Foundations of Interface Technologies : (FIT 2010), Paris, 30th August 2010 SP - 28 - 48 CY - Paris UR - https://fis.uni-bamberg.de/handle/uniba/4266 LA - eng ER - TY - JOUR TI - To Parallelize or to Optimize? AU - Ezekiel, Jonathan AU - Lüttgen, Gerald AU - Siminiceanu, Radu PY - 2011 JO - Journal of Logic and Computation VL - 21 IS - 1 SP - 85 - 120 SN - 0955-792X UR - https://fis.uni-bamberg.de/handle/uniba/3252 LA - eng ER - TY - CPAPER TI - Towards Strategies for Dataflow Programming AU - Mendler, Michael AU - Aguado, Joaquín PY - 2010 T2 - Preproceedings of the 22nd Symposium on Implementation and Application of Functional Languages (IFL 2010) SP - 372 - 423 UR - https://fis.uni-bamberg.de/handle/uniba/4312 LA - eng ER - TY - JOUR TI - Ready simulation for concurrency: It's logical!star, open AU - Lüttgen, Gerald AU - Vogler, Walter PY - 2010 JO - Information and computation VL - 208 IS - 7 SP - 845-867 SN - 0890-5401 UR - https://fis.uni-bamberg.de/handle/uniba/3920 LA - eng ER - TY - CPAPER TI - On the expressiveness of refinement settings AU - Fecher, Harald AU - Frutos-Escrig, David de AU - Lüttgen, Gerald AU - Schmidt, Heiko PY - 2010 T2 - Fundamentals of software engineering : third IPM international conference, FSEN 2009, Kish Island, Iran, April 15 - 17, 2009 ; revised selected papers SP - 276 - 291 CY - Berlin u.a. SN - 978-3-642-11622-3 UR - https://fis.uni-bamberg.de/handle/uniba/3884 LA - eng ER - TY - CPAPER TI - Symbolic Object Code Analysis AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2010 T2 - Model checking software : 17th International SPIN workshop, Enschede, The Netherlands, September 27-29, 2010 ; proceedings SP - 4 - 21 CY - Berlin u.a. T3 - Lecture Notes in Computer Science UR - https://fis.uni-bamberg.de/handle/uniba/3886 LA - eng ER - TY - CHAP TI - What is in a Step: New Perspectives on a Classical Question AU - Roever, Willem-Paul de AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2010 T2 - Time for verification : essays in memory of Amir Pnueli SP - 370 - 399 CY - Berlin u.a. SN - 9783642137532 UR - https://fis.uni-bamberg.de/handle/uniba/3847 LA - eng ER - TY - CPAPER TI - Is observational congruence on µ-expressions axiomatisable in equational horn logic? AU - Mendler, Michael AU - Lüttgen, Gerald PY - 2010 VL - 208 IS - 6 = Special Issue: 18th International Conference on Concurrency Theory (CONCUR 2007) SP - 634 - 651 UR - https://fis.uni-bamberg.de/handle/uniba/3806 LA - eng ER - TY - JOUR TI - Generative Models for Chemical Structures AU - White, David AU - Wilson, Richard C. PY - 2010 JO - Journal of chemical information and modeling VL - 50 IS - 7 SP - 1257-1274 PB - American Chemical Society CY - Washington, DC, SN - 1549-960X DO - 10.1021/ci9004089 UR - https://fis.uni-bamberg.de/handle/uniba/2607 LA - eng ER - TY - THES TI - Die Seele im Gespräch mit sich selbst : Bewusstsein und die Fähigkeit zur Selbsterkenntnis und -veränderung AU - Zeißner, Georg PY - 2010 PB - University of Bamberg Press CY - Bamberg T3 - Schriften aus der Fakultät Humanwissenschaften der Otto-Friedrich-Universität Bamberg SN - 978-3-86309-005-0 DO - 10.20378/irb-270 UR - https://fis.uni-bamberg.de/handle/uniba/270 LA - deu AB - Die besondere Fähigkeit des Menschen, sich flexibel an neuartige und sich dynamisch verändernde Problemstellungen anzupassen, wird von zeitgenössischen psychologischen und neurowissenschaftlichen Menschenbildern nur unzureichend berücksichtigt. Nicht ohne Grund fällt diese konzeptionelle Lücke mit einer Neigung zusammen, das menschliche Bewusstsein bei der Erforschung des menschlichen Geistes auszuklammern oder als rein epiphänomenal zu behandeln. Dabei schließt dieses – im Sinne seiner grundsätzlichen Befähigung, über sich selbst zu reflektieren und sein Denken und Handeln im Einklang mit den so gewonnenen Erkenntnissen zu verändern, verstanden – genau die erwähnte Lücke. In der Tat existieren sowohl Theorien (Dörner, 1999) wie auch empirische Ergebnisse (Reither, 1979 sowie Tisdale, 1998), die einen engen Zusammenhang zwischen Bewusstsein und Problemlösegüte nahelegen. Zielsetzung der vorliegenden Arbeit war es, die Tätigkeit dieser bewussten Handlungskontrolle im Detail zu beobachten, um deren Bedingungen und Erscheinungsformen genauer herausarbeiten zu können. Sechzehn Versuchspersonen wurden mit einem Versuchsparcours aus drei Versuchsteilen konfrontiert: Dem Führen einer fiktiven Farm in einem einfachen computersimulierten ökologischen System, der Bearbeitung von Entscheidungsszenarien sowie dem Deuten und Bewerten von Sprichwörtern. Dabei hielt der Versuchsleiter die Probanden dazu an, ihre Gedanken laut auszusprechen, damit er die Entwicklung des Problemlöseprozesses online verfolgen konnte. Acht Probanden wurden als Eckfälle ausgewählt und ihre Versuchsdaten einer Einzelfallanalyse unterzogen. Für die Eckfälle konnten Theorien entwickelt werden, die den individuellen Verlauf der Computersimulation erklären. Die verschiedenen Episoden im Simulationsverlauf, an denen die Probanden sich und ihre Problemlösebemühungen immer wieder in den Blick nahmen, leisteten hierbei einen besonders großen Erklärungsbeitrag. Sie wurden in einem weiteren Schritt probandenübergreifend betrachtet, geordnet und in Beziehung gesetzt. Die resultierende Theorie ist in der Lage, die Stellen des Vorkommens, sowie den Inhalt und die Auswirkungen dieser bewussten Episoden in Abhängigkeit von der jeweiligen Situation und der Persönlichkeit des Probanden zu erklären. In einer abschließenden Prüfung durch Triangulation und Modellierung am Rechner hat sich diese Theorie bewährt. KW - Bewusstsein , PSI-Theorie , komplexe Probleme , Selbstreflexion , Besonnenheit KW - consciousness , PSI-theory , complex problem-solving , self-reflection , deliberateness KW - Bewusstsein KW - PSI-Theorie KW - komplexe Probleme KW - Selbstreflexion KW - Besonnenheit KW - consciousness KW - PSI-theory KW - complex problem-solving KW - self-reflection KW - deliberateness ER - TY - GEN TI - Symbolic Object Code Analysis AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2010 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/194 LA - eng AB - Current software model checkers quickly reach their limit when being applied to verifying pointer safety properties in source code that includes function pointers and inlined assembly. This paper introduces an alternative technique for checking pointer safety violations, called Symbolic Object Code Analysis (SOCA), which is based on bounded symbolic execution, incorporates path-sensitive slicing, and employs the SMT solver Yices as its execution and verification engine. Extensive experimental results of a prototypic SOCA Verifier, using the Verisec suite and almost 10,000 Linux device driver functions as benchmarks, show that SOCA performs competitively to current source-code model checkers and that it also scales well when applied to real operating systems code and pointer safety issues. SOCA effectively explores semantic niches of software that current software verifiers do not reach. KW - bounded model checking , symbolic execution , program slicing , object code analysis , linux device drivers KW - bounded model checking KW - symbolic execution KW - program slicing KW - object code analysis KW - linux device drivers ER - TY - CPAPER TI - Verifying compiled file system code AU - Mühlberg, Jan Tobias AU - Lüttgen, Gerald PY - 2009 T2 - Formal methods: foundations and applications : 12th Brazilian Symposium on Formal Methods, SBMF 2009 Gramado, Brazil, August 19- 21, 2009 ; revised selected papers SP - 306 - 320 CY - Berlin u.a. SN - 978-3-642-10452-7 UR - https://fis.uni-bamberg.de/handle/uniba/20148 LA - eng ER - TY - GEN TI - QoS-Enabled B2B Integration AU - Benker, Thomas AU - Fritzemeier, Stefan AU - Geiger, Matthias AU - Harrer, Simon AU - Kessner, Tristan AU - Schwalb, Johannes AU - Schönberger, Andreas AU - Wirtz, Guido PY - 2009 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/214 LA - eng AB - Business-To-Business Integration (B2Bi) is a key mechanism for enterprises to gain competitive advantage. However, developing B2Bi applications is far from trivial. Inter alia, agreement among integration partners about the business documents and the control flow of business document exchanges as well as applying suitable communication technologies for overcoming heterogeneous IT landscapes are major challenges. At the same time, choreography languages such as ebXML BPSS (ebBP), orchestration languages such as WS-BPEL and Web Services are promising to provide the foundations for seamless interactions among business partners. Automatically translating choreography agreements of integration partners into partner-specific orchestrations is an obvious idea for ensuring conformance of orchestration models to choreography models. Moreover, the application of such model-driven development methods facilitates productivity and cost-effectiveness whereas applying a service oriented architecture (SOA) based on WS-BPEL and Web Services leverages standardization and decoupling. By now, the realization of QoS attributes has not yet received the necessary attention that makes such approaches suitable for B2Bi. In this report, we describe a proof-of-concept implementation of the translation of ebBP choreographies into WS-BPEL orchestrations that respects B2Bi-relevant QoS attributes. KW - B2Bi, QoS, Choreography to Orchestration Generation, Web Services, ebXML, ebBP, BPEL, SOA, WS-* standards KW - B2Bi, QoS, Choreography to Orchestration Generation, Web Services, ebXML, ebBP, BPEL, SOA, WS-* standards KW - B2Bi KW - QoS KW - Choreography to Orchestration Generation KW - Web Services KW - ebXML KW - ebBP KW - BPEL KW - SOA KW - WS-* standards KW - B2Bi KW - QoS KW - Choreography to Orchestration Generation KW - Web Services KW - ebXML KW - ebBP KW - BPEL KW - SOA KW - WS-* standards ER - TY - RPRT TI - A Requirements Analysis of Business-To-Business Integration AU - Schönberger, Andreas AU - Wilms, Christian AU - Wirtz, Guido PY - 2009 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/201 LA - eng AB - Ever fiercer competition has forced enterprises not only to optimize their own operations but also to cooperate with their suppliers and customers along their supply chains. Thus, competition today usually takes place between supply chains and not between individual enterprises. Business-To-Business integration (B2Bi) is a major task of supply chain management (SCM), and although it already has been researched for years, B2Bi is still an area of active research with a plethora of research questions and according approaches. Hence, management of B2Bi projects necessitates the identification of relevant requirements which is a far from trivial task. This paper identifies a core set of B2Bi challenges and deduces a comprehensive set of B2Bi requirements that are particularly useful for tackling the challenges identified. The derivation of B2Bi requirements follows an inductive approach that is based on the analysis of integration standards, reference architectures and related literature. In order to operationalize the B2Bi requirements for further analysis and concrete B2Bi projects, the requirements are classified according to the abstraction layers of a B2Bi schema. Thus, this report not only offers a requirements check list for B2Bi projects but also helps in deciding when to address which requirements during the course of a B2Bi project. KW - Anforderungsanalyse KW - requirement analysis, business-to-business integration, business process integration, business collaboration KW - Anforderungsanalyse KW - requirement analysis KW - business-to-business integration KW - business process integration KW - business collaboration ER - TY - RPRT TI - Performance Modeling of a Streaming Media Server AU - Sandmann, Werner AU - Krieger, Udo R. AU - Van Do, Tien PY - 2008 UR - https://fis.uni-bamberg.de/handle/uniba/18202 LA - eng ER - TY - GEN TI - Electronic Notes in Theoretical Computer Science ED - Aguado, Joaquin ED - Mendler, Michael PY - 2008 VL - 203 IS - 4, Proceedings of the International Workshop on Model-driven High-level Programming of Embedded Systems (SLA++P 2007), Braga, Portugal, 31 March 2007 SP - 1 - 140 SN - 1571-0661 UR - https://fis.uni-bamberg.de/handle/uniba/18126 LA - eng ER - TY - CPAPER TI - Constructive Description Logic cALC as a Type System for Semantic Streams in the Domain of Auditing AU - Mendler, Michael AU - Scheele, Stephan PY - 2008 T2 - Proceedings of the 1st International Workshop on Logics for Agents and Mobility 2008 PB - Bibliothek des Dep. Informatik, Univ. CY - Hamburg UR - https://fis.uni-bamberg.de/handle/uniba/18088 LA - eng ER - TY - CPAPER TI - Towards Constructive DL for Abstraction and Refinement AU - Mendler, Michael AU - Scheele, Stephan PY - 2008 T2 - Proceedings of the 21th ... ; (DL 2008), Dresden, May 13 - 16, 2008 SP - 1 - 11 UR - https://fis.uni-bamberg.de/handle/uniba/18094 LA - eng ER - TY - JOUR TI - WCRT Algebra and Scheduling Interfaces for Esterel- style Synchronous Multithreading AU - Hanxleden, R. von AU - Mendler, Michael AU - Traulsen, C. PY - 2008 JO - Technical Report IS - Nr. 0807, vom 11 Juli 2008 SP - 3 - 37 UR - https://fis.uni-bamberg.de/handle/uniba/18093 LA - eng ER - TY - GEN TI - Towards Constructive Description Logics for Abstraction and Refinement AU - Scheele, Stephan AU - Mendler, Michael PY - 2008 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/6173 LA - eng AB - This work explores some aspects of a new and natural semantical dimension that can be accommodated within the syntax of description logics which opens up when passing from the classical truth-value interpretation to a constructive interpretation. We argue that such a strengthened interpretation is essential to represent applications with partial information adequately and to achieve consistency under abstraction as well as robustness under refinement. We introduce a constructive version of ALC, called cALC, for which we give a sound and complete Hilbert axiomatisation and a Gentzen tableau calculus showing finite model property and decidability. ER - TY - BOOK TI - Improving the Tor Hidden Service Protocol Aiming at Better Performances AU - Wilms, Christian PY - 2008 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/205 LA - eng AB - Offering services anonymously on the Internet using so-called location-hidden services requires complex protocols with many different nodes involved. These properties result in performance problems, e.g. a simple website request taking tens of seconds. This work describes a setup to measure the performance of hidden services using the worldwide Tor network. It analyzes the results and proposes changes to the protocol to improve the performance without losing anonymity. KW - Tor, Anonymisierung, Netzwerk, Messungen, Versteckte Server KW - Tor, anonymity networks, performance, measurements, location-hidden services KW - Tor KW - Anonymisierung KW - Netzwerk KW - Messungen KW - Versteckte Server KW - Tor KW - anonymity networks KW - performance KW - measurements KW - location-hidden services ER - TY - GEN TI - A Service Description Framework for Service Ecosystems AU - Scheithauer, Gregor AU - Winkler, Matthias PY - 2008 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/191 LA - eng AB - Recently, service orientation has strongly influenced the way enterprise applications are built. Service ecosystems, which provide means to trade services between companies like goods, are an evaluation of service orientation. To allow service ordering, discovering, selection, and consumption, a common way to describe services is a necessity. This paper discusses existing approaches to describe certain service aspects. Finally, a Service Description Framework for service ecosystems is proposed and exemplified. KW - Dienst-orientierte Architektur, Dienstbeschreibungen KW - SOA, Service Ecosystems, Service Description KW - Dienst-orientierte Architektur KW - Dienstbeschreibungen KW - SOA KW - Service Ecosystems KW - Service Description ER - TY - GEN TI - Applying Business Process Management Systems : a Case Study AU - Scheithauer, Gregor AU - Wirtz, Guido PY - 2008 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/176 LA - eng AB - Business Process Management Systems (BPMS) aim to support the Business Process Management paradigm and to ease legacy application integration. Often, they rely on Service-oriented Architecture (SoA). However, do such systems really meet real-world requirements? This paper introduces and discusses a set of criteria which are important for BPMS and applies these criteria in comparing tools from three important vendors, namely IDS Scheer, Oracle and Intalio based on a case study. KW - BPMS, SOA, Webservice KW - BPMS, SOA, Webservice, usability criteria KW - BPMS KW - SOA KW - Webservice KW - BPMS KW - SOA KW - Webservice KW - usability criteria ER - TY - CPAPER TI - Extended Abstracts of the Second Privacy Enhancing Technologies Convention (PET-CON 2008.1) AU - Westermann, Benedikt AU - Wendolsky, Rolf AU - Renner, Johannes AU - Pape, Sebastian AU - Loesing, Karsten AU - Herrmann, Dominik ED - Loesing, Karsten PY - 2008 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/165 LA - eng AB - PET-CON, the Privacy Enhancing Technologies Convention, is a forum for researchers, students, developers, and other interested people to discuss novel research, current developments and techniques in the area of Privacy Enhancing Technologies. PET-CON was first conceived in June 2007 at the 7th International PET Symposium in Ottawa, Canada. The idea was to set up a bi-annual convention in or nearby Germany to be able to meet more often than only once a year at some major conference. KW - Anonymisierung , Datenschutz KW - Anonymisierung KW - Datenschutz ER - TY - CPAPER TI - Is observational congruence axiomatisable in equational horn logic? AU - Mendler, Michael AU - Lüttgen, Gerald PY - 2007 T2 - CONCUR 2007 - concurrency theory : 18th international conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007 ; proceedings SP - 197 - 211 CY - Berlin u.a. T3 - Lecture notes in computer science DO - 10.1007/978-3-540-74407-8 UR - https://fis.uni-bamberg.de/handle/uniba/18098 LA - eng ER - TY - BOOK TI - Is observational congruence on µ-expressions axiomatisable in equational horn logic? AU - Mendler, Michael AU - Lüttgen, Gerald PY - 2007 CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/15376 LA - eng ER - TY - CPAPER TI - Model-driven high-level programming of embedded systems : SLA++P 2007 ; proceedings ; satellite workshop to the tenth European Joint Conferences on Theory and Practice of Software (ETAPS 2007), Braga, Portugal, March 31, 2007 ED - Aguado, Joaquin ED - Mendler, Michael PY - 2007 CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/15261 LA - eng ER - TY - GEN TI - Open Chord version 1.0.4 User's Manual AU - Loesing, Karsten AU - Kaffille, Sven PY - 2007 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/109 LA - eng AB - In recent years peer-to-peer networks have developed from unstructured to structured overlay networks. Structured peer-to-peer overlay networks facilitate a bounded number of messages in the number of peers for querying and publishing content opposed to unstructured networks, which usually flood the network with messages. To prevent the messages from overflooding the network they have a bounded life time, which may cause that some published content will be lost. Structured peer-to-peer networks guarantee that all published content can be found. One well known structured overlay network is the chord distributed hash table. An implementation of chord is only available in C, but not in Java, which is used widely and often in computer science education. This manual describes an open source implementation of chord in Java - called Open Chord - and how it can be used in Java-based applications. It provides a console-based experimentation environment to explore the functionality of chord, as well. KW - Chord, Verteilte Hashtabelle, Java, Peer-to-Peer KW - Chord, Distributed Hash Table, Java, Peer-to-Peer KW - Chord KW - Verteilte Hashtabelle KW - Java KW - Peer-to-Peer KW - Chord KW - Distributed Hash Table KW - Java KW - Peer-to-Peer ER - TY - RPRT TI - The Synchrony Hypothesis or the Importance of Being Constructive AU - Mendler, Michael PY - 2006 CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/18092 LA - eng ER - TY - BOOK TI - Constructive circuits and the exactness of ternary simulation AU - Mendler, Michael AU - Shiple, Thomas R. AU - Berry, Gérard PY - 2006 CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/14022 LA - eng ER - TY - GEN TI - Concealing Presence Information in Instant Messaging Systems AU - Wilms, Christian AU - Sehr, Matthias AU - Röglinger, Maximilian AU - Hildebrandt, Knut AU - Grote, Martin AU - Dorsch, Markus AU - Loesing, Karsten AU - Wirtz, Guido PY - 2006 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/85 LA - eng AB - Information about online presence allows participants of instant messaging (IM) systems to determine whether their prospective communication partners will be able to answer their requests in a timely manner, or not. That is why presence information, combined with the ability to send instant messages, makes IM more personal and closer than other forms of communication such as e-mail. On the other hand, revelation of presence constitutes a potential of misuse by untrustworthy entities. A possible risk is the generation of online logs disclosing user habits. This makes presence information a resource worth protecting. We argue, however, that current IM systems do not take reasonable precautions to protect presence information. We implemented an IM system designed to be robust against attacks to disclose a user’s presence. In contrast to existing systems, it stores presence information in a registry in a way that is only detectable and applicable for intended users and not comprehensible even for the registry itself. We use a distributed hash table (DHT) as registry and apply an anonymous communication network to protect the physical addresses of both senders and receivers of messages. KW - Instant Messaging KW - Instant Messaging KW - Anonymität KW - Peer-to-Peer-Netz KW - Instant Messaging KW - Presence Information KW - Anonymity KW - Peer-to-Peer ER - TY - GEN TI - Decentralized Reputation Management for Cooperating Software Agents in Open Multi-Agent Systems AU - Scheithauer, Gregor AU - Lenskaya, Kira AU - König, Stefan AU - Hudert, Sebastian AU - Grünert, Andreas AU - Fischer, Marco AU - Kaffille, Sven AU - Wirtz, Guido PY - 2006 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/86 LA - eng AB - Multi-Agent Systems (MAS) promise a new advance in distributed computing. In MAS autonomous software agents flexibly cooperate, coordinate, and compete to provide the desired function(s) of such a system. If some components of a MAS fail or do not provide the desired functionality, the system is expected to autonomously deal with these situations. It is desirable to reduce occurrences of such situations by selecting trustworthy cooperation partners before cooperating with them. This becomes even more desirable and important in an open MAS where arbitrary heterogeneous software agents, deployed by different parties, participate in the MAS, as it becomes more likely that these agents fail or try to exploit the MAS for their own purposes without reciprocation. In order to monitor agent behavior and enable selection of trustworthy cooperation partners, trust or reputation management services can be applied. As there is no central control in an open MAS and it is completely distributed these services themselves have to be distributed. This paper proposes a fully distributed reputation management service for open MAS based on peer-to-peer technology (especially distributed hash tables). A Java-based implementation of that service, which is intended as a plug-in for multi-agent platforms, is also described. KW - Multi-Agent-Systeme KW - Reputation management, trust, software agents, cooperative problem solving, multi-agent systems KW - Multi-Agent-Systeme KW - Reputation management KW - trust KW - software agents KW - cooperative problem solving KW - multi-agent systems ER - TY - GEN TI - Modelling and Validating Business Collaborations : A Case Study on RosettaNet AU - Schönberger, Andreas PY - 2006 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/81 LA - eng AB - The way business processes are organised heavily influences the flexibility and the expenses of enterprises. The capability to address changing market needs in a timely manner and to provide appropriate pricing is indispensable in a world of internationalisation and growing competition. Optimising processes that cross enterprise boundaries potentially is a key success factor in achieving this goal but it requires the information systems of the participating enterprises to be consistently integrated. This gives rise to some challenging tasks. The personnel involved in building up business collaborations comes from different enterprises with different business vocabulary and background which requires extensive communication support. The lack of central technical infrastructure, typically prohibited by business politics, often calls for a distributed and computer-aided collaboration structure, so that the resulting complexity must be handled somehow. Nevertheless robustness is an important factor in building business collaborations as these may exchange goods of considerable value. This technical report proposes the use of a two step modelling approach that separates business logic, modelled in the so-called centralised perspective (CP), from its distributed implementation, modelled in the so-called distributed perspective (DP). The separation of these perspectives enables business people to concentrate on business issues and to solve communication problems in the CP whereas technical staff can concentrate on distribution issues. The use of stringent modelling rules is advised in order to provide the basis for formal analysis techniques as one means to achieve robustness. Considering the choreography of RosettaNet Partner Interface Processes (PIPs) as the subject of my analysis, UML activity diagrams for modelling the CP and WSBPEL for modelling the DP are described as enabling techniques for implementing the proposed two step modelling approach. Further, model checking is applied to validate the CP and DP models in order to detect errors in early design phases. As the adequacy of model checking tools highly depends on the detailed modelling techniques as well as the properties to be checked, a major part of our discussion covers relevant properties and requirements for a model checker. KW - UML , Validierung , Programmverifikation , Verteiltes System , Prozessmanagement , Modellierung , Web Services KW - RosettaNet, WSBPEL, validation, verification, UML, business process modelling, distributed system, business to business integration, distributed conse KW - UML KW - Validierung KW - Programmverifikation KW - Verteiltes System KW - Prozessmanagement KW - Modellierung KW - Web Services KW - RosettaNet KW - WSBPEL KW - validation KW - verification KW - UML KW - business process modelling KW - distributed system KW - business to business integration KW - distributed conse ER - TY - CPAPER TI - Proceedings of the Second Workshop on Semantic Foundations of Engineering Design Languages (SFEDL 2004) AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2005 VL - 115 SP - 1 - 97 SN - 0304-3975 UR - https://fis.uni-bamberg.de/handle/uniba/12909 LA - eng ER - TY - BOOK TI - Constructive semantics for instantaneous reactions AU - Aguado, Joaquin AU - Mendler, Michael PY - 2005 CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/12313 LA - eng ER - TY - CPAPER TI - Semantic foundations of engineering design languages : SFEDL 2004 ; satellite workshop to the seventh European Joint Conferences on Theory and Practice of Software (ETAPS 2004), Barcelona, Spain, April 3, 2004 ; proceedings AU - Lüttgen, Gerald AU - Martínez Madrid, Natividad AU - Mendler, Michael PY - 2004 CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/15256 LA - eng ER - TY - JOUR TI - Editorial: Semantic Foundations of Engineering Design Languages AU - Broy, Manfred AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2004 JO - Formal aspects of computing : the internat. journal of formal methods VL - 16 IS - 3 = Special issue SP - 165 SN - 0934-5043 UR - https://fis.uni-bamberg.de/handle/uniba/13594 LA - eng ER - TY - JOUR TI - Modalities in constructive modal logics and type theories AU - De Paiva, V, AU - Gore, R. AU - Mendler, Michael PY - 2004 JO - Journal of logic and computation VL - 14 IS - 4 SP - 439 - 446 SN - 0955-792X UR - https://fis.uni-bamberg.de/handle/uniba/12846 LA - eng ER - TY - GEN TI - Formal aspects of computing : the international journal of formal methods AU - Mendler, Michael PY - 2004 PB - Springer CY - London u.a. UR - https://fis.uni-bamberg.de/handle/uniba/10079 LA - eng ER - TY - CPAPER TI - Editorial: Where theory and practice meet AU - Broy, Manfred AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2003 VL - 15 IS - 4 = Special Issue: Where theory and practice meet SP - 297 - 298 UR - https://fis.uni-bamberg.de/handle/uniba/13602 LA - eng ER - TY - CPAPER TI - A compositional semantic theory for synchronous component-based design AU - Norton, B. AU - Mendler, Michael AU - Lüttgen, Gerald PY - 2003 T2 - CONCUR 2003 - concurrency theory : 14th International Conference, Marseille, France, September 3 - 5, 2003 ; proceedings SP - 461 - 476 CY - Berlin T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/9771 LA - eng ER - TY - JOUR TI - Intensional completeness in an extension of Goedel- Dummett logic AU - Fairtlough, M. AU - Mendler, Michael PY - 2003 JO - Studia logica : an international journal for symbolic logic VL - 73 IS - 1 SP - 51 - 80 SN - 0039-3215 UR - https://fis.uni-bamberg.de/handle/uniba/9779 LA - eng ER - TY - CPAPER TI - Statecharts: from visual syntax to model-theoretic semantics AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2003 T2 - Wirtschaft und Wissenschaft in der network economy - Visionen und Wirklichkeit : Tagungsband der GI/OCG Jahrestagung 2001, 25. - 28. September 2001, Universität Wien SP - 615 - 621 CY - Wien T3 - Books@ocg.at UR - https://fis.uni-bamberg.de/handle/uniba/9775 LA - eng ER - TY - CPAPER TI - Towards a model-theory for Esterel AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2002 VL - 65 IS - 5 = SLAP'2002 Synchronous Languages, Applications, and Programming, Grenoble, France, April 13, 2002 SN - 0304-3975 UR - https://fis.uni-bamberg.de/handle/uniba/10081 LA - eng ER - TY - CPAPER TI - Axiomatizing an algebra of step reactions for synchronous languages AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2002 T2 - CONCUR 2002 - Concurrency theory : 13th international conference, Brno, Czech Republic, August 20 - 23, 2002 ; proceedings SP - 386 - 401 CY - Berlin u.a. T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/9824 LA - eng ER - TY - CPAPER TI - On the logical content of computational type theory: A solution to Curry's problem AU - Fairtlough, M. AU - Mendler, Michael PY - 2002 T2 - Types for proofs and programs : international workshop, TYPES 2000, Durham, UK, December 8 - 12, 2000 ; selected papers SP - 63 - 78 CY - Berlin u.a. T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/9776 LA - eng ER - TY - JOUR TI - The intuitionism behind statecharts steps AU - Lüttgen, Gerald AU - Mendler, Michael PY - 2002 JO - ACM transactions on computational logic : TOCL VL - 3 IS - 1 SP - 1 - 41 SN - 1529-3785 DO - 10.1145/504077.504078 UR - https://fis.uni-bamberg.de/handle/uniba/9778 LA - eng ER - TY - CPAPER TI - Intuitionistic modal logic and applications : (IMLA ' 02) ; workshop proceedings ; LICS Satellite Workshop to the 3rd Federated Logic Conference (FLoC'02), Copenhagen, DK, 26 July 2002 AU - Mendler, Michael ED - Goré, Rajeev ED - Mendler, Michael PY - 2002 PB - Otto-Friedrich-Univ. CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/7837 LA - eng ER - TY - CPAPER TI - Proofs as constraints for abstraction and refinement AU - Cheng, Xiaochun AU - Fairtlough, Matt AU - Mendler, Michael PY - 2001 T2 - Workshop on Proof Transformations, Proof Presentations and Complexities of Proof (PTP-01 Siena, Universitá degli Studi di Siena, Dipartimento di Ingegneria dell'Informatione June 19, 2001, in connection with IJCAR 2001) SP - 1 - 11 CY - Siena UR - https://fis.uni-bamberg.de/handle/uniba/10127 LA - eng ER - TY - JOUR TI - Special Issue: Modalities in Type Theory AU - Mendler, Michael AU - Fairtlough, Matt AU - Moggi, Eugenio PY - 2001 JO - Mathematical structures in computer science : MSCS ; a journal in the applications of categorical, algebraic and geometric methods in computer science VL - 11 IS - 4 SP - 507-596 PB - Cambridge Univ. Press CY - Cambridge DO - 10.1017/S0960129501003310 UR - https://fis.uni-bamberg.de/handle/uniba/10075 LA - deu ER - TY - CPAPER TI - Abstraction and refinement in higher order logic AU - Fairtlough, M. AU - Mendler, Michael AU - Cheng, X. PY - 2001 T2 - Theorem proving in higher order logics : 14th international conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3 - 6, 2001 ; proceedings SP - 201 - 216 CY - Berlin u.a. T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/9820 LA - eng ER - TY - CPAPER TI - Categorical and Kripke semantics for constructive S4 modal logic AU - Alechina, N. AU - Mendler, Michael AU - De Paiva, V, AU - Ritter, E. PY - 2001 T2 - Computer science logic : 15th international workshop, CSL 2001, 10th annual conference of the EACSL Paris, France, September 10 - 13, 2001 ;proceedings SP - 292 - 307 CY - Berlin u.a. T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/9774 LA - eng ER - TY - JOUR TI - Modalities in type theory AU - Mendler, Michael PY - 2001 JO - Mathematical structures in computer science : MSCS ; a journal in the applications of categorical, algebraic and geometric methods in computer science VL - 11 IS - 4 SP - 507 - 509 SN - 0960-1295 UR - https://fis.uni-bamberg.de/handle/uniba/9780 LA - deu ER - TY - CPAPER TI - An asynchronous process algebra with multiple clocks AU - Andersen, Henrik Reif AU - Mendler, Michael PY - 1994 T2 - Programming languages and systems : proceedings ; ESOP '94, 5th European Symposium on Programming, Edinburgh, UK, April 11 - 13, 1994 SP - 58-73 PB - Springer CY - Berlin ; Heidelberg T3 - Lecture notes in computer science SN - 978-3-540-57880-2 UR - https://fis.uni-bamberg.de/handle/uniba/104022 LA - eng AB - - KW - - ER - TY - JOUR TI - Newtonian Arbiters Cannot be Proven Correct AU - Mendler, Michael AU - Stroup, Terry PY - 1993 JO - Formal Methods in System Design VL - 3 IS - 3 SP - 233-257 PB - Kluwer CY - Dordrecht [u.a.] SN - 1572-8102 UR - https://fis.uni-bamberg.de/handle/uniba/56619 LA - eng ER - TY - CPAPER TI - Die formale Validierung einer "Bausteintafel" delay-insensitiver Grundelemente AU - Reinhardt, Tilmann AU - Mendler, Michael AU - Stroup, Terry PY - 1992 T2 - Rechnergestützter Entwurf und Architektur mikroelektronischer Systeme : Vorträge der ITG-Fachtagung am 23. und 24. November 1992 in Darmstadt SP - 273-274 PB - vde-Verl. CY - Berlin ; Offenbach T3 - Informationstechnische Gesellschaft: ITG-Fachbericht SN - 978-3-8007-1905-1 UR - https://fis.uni-bamberg.de/handle/uniba/104020 LA - deu AB - - KW - - ER - TY - JOUR TI - Compositional Characterization of Observable Program Properties AU - Steffen, B. AU - Barry Jay, C. AU - Mendler, Michael PY - 1992 JO - Theoretical informatics and applications VL - 26 IS - 5 SP - 403-424 PB - EDP Sciences CY - Cambridge, Massachusetts, USA SN - 0988-3754 DO - 10.1051/ita/1992260504031 UR - https://fis.uni-bamberg.de/handle/uniba/56620 LA - deu ER - TY - CPAPER TI - Constrained Proofs : A Logic for Dealing with Behavioural Constraints in Formal Hardware Verification AU - Mendler, Michael PY - 1991 T2 - Designing Correct Circuits : Workshop jointly organised by the Universities of Oxford and Glasgow, 26–28 September 1990, Oxford SP - 1-28 PB - Springer CY - London u.a. SN - 978-1-4471-3544-9 UR - https://fis.uni-bamberg.de/handle/uniba/104019 LA - eng AB - - KW - - ER -