TY - CPAPER TI - What Makes Research Data Visible? : Factors and Implications for Humanities Research Data Infrastructures AU - Lachner, Sonja AU - Henrich, Andreas PY - 2026 SP - 1-13 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/117763 LA - eng AB - Research data infrastructures are designed, among other objectives, to improve the discoverability and accessibility of research data. However, this is often accompanied by an implicit assumption that data become perceptible to scholars simply by existing and being made accessible. Building on the premise that visibility is not a stable property of data itself, we argue that the visibility of research data is instead shaped by several conditions that determine whether and how data become perceptible to scholars. Using the humanities as an illustrative domain, we focus on the modes of access to humanities research data, understood as the ways through which researchers become aware of research data and argue that each access mode is associated with a distinct Dimension of Visibility, shaped by diferent factors that infuence how and whether research data become visible within these Modes of Access. To capture these dynamics, we introduce the Humanities Research Data Visibility Model (HRDVM), a literature-driven model that identifes four central Modes of Access: Social Interaction, Information Systems, Physical Access and Scholarly Literature. For each Mode of Access, the model introduces a corresponding Dimension of Visibility: Social Visibility, Digital Visibility, Physical Visibility, and Literature Visibility. Building on this model, we derive implications for the design of humanities research data infrastructures. These include, among others, supporting multiple modes of access to research data, improving metadata to better represent reuse-relevant information, and accounting for the social and institutional practices through which researchers discover and access data. Although we focus on the humanities, the proposed framework and the implications can be adapted to other research domains and non-academic contexts, as well as to other information resources. KW - Humanities Research Data KW - Research Data Visibility KW - Research Data Infrastructures KW - Information Behavior ER - TY - CPAPER TI - What Makes Research Data Visible? : Factors and Implications for Humanities Research Data Infrastructures AU - Lachner, Sonja AU - Henrich, Andreas PY - 2026 T2 - JCDL '26: Proceedings of the 26th ACM/IEEE Joint Conference on Digital Libraries SP - 1-13 PB - ACM CY - New York, NY; United States SN - 979-8-4007-2597-5 DO - 10.1145/3805696.3846022 UR - https://fis.uni-bamberg.de/handle/uniba/117760 LA - eng AB - Research data infrastructures are designed, among other objectives, to improve the discoverability and accessibility of research data. However, this is often accompanied by an implicit assumption that data become perceptible to scholars simply by existing and being made accessible. Building on the premise that visibility is not a stable property of data itself, we argue that the visibility of research data is instead shaped by several conditions that determine whether and how data become perceptible to scholars. Using the humanities as an illustrative domain, we focus on the modes of access to humanities research data, understood as the ways through which researchers become aware of research data and argue that each access mode is associated with a distinct Dimension of Visibility, shaped by diferent factors that infuence how and whether research data become visible within these Modes of Access. To capture these dynamics, we introduce the Humanities Research Data Visibility Model (HRDVM), a literature-driven model that identifes four central Modes of Access: Social Interaction, Information Systems, Physical Access and Scholarly Literature. For each Mode of Access, the model introduces a corresponding Dimension of Visibility: Social Visibility, Digital Visibility, Physical Visibility, and Literature Visibility. Building on this model, we derive implications for the design of humanities research data infrastructures. These include, among others, supporting multiple modes of access to research data, improving metadata to better represent reuse-relevant information, and accounting for the social and institutional practices through which researchers discover and access data. Although we focus on the humanities, the proposed framework and the implications can be adapted to other research domains and non-academic contexts, as well as to other information resources. KW - Humanities Research Data KW - Research Data Visibility KW - Research Data Infrastructures KW - Information Behavior ER - TY - CPAPER TI - Support for Reuse in Data Journals : Current State and Future Perspectives for the Humanities AU - Lachner, Sonja AU - Fruth, Leon AU - Henrich, Andreas PY - 2026 SP - 1-5 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/117762 LA - eng AB - Research data reuse is an objective of Open Science, and data journals have emerged as an important publication format for supporting reuse of research data. However, it remains unclear how this objective is operationalized in humanities-oriented data journals and whether reuse-related information is made accessible through their search interfaces. This paper investigates the support for research data reuse in humanities-oriented data journals. We synthesize prior work on research data reuse and identify diferent reuse purposes and forms. In addition, we analyze how ten humanities-oriented data journals implement support for reuse in their documentation structures and search interfaces. Our analyses show that reuse is frequently recognized as an objective in humanities-oriented data journals, but reuse-related information is not directly represented in the search interfaces. Building on these fndings, we derive implications that address the representation of reuse-related information and the design of search systems. KW - Research Data Reuse KW - Humanities Research Data KW - Data Journals ER - TY - CPAPER TI - Support for Reuse in Data Journals : Current State and Future Perspectives for the Humanities AU - Lachner, Sonja AU - Fruth, Leon AU - Henrich, Andreas PY - 2026 T2 - JCDL '26: Proceedings of the 26th ACM/IEEE Joint Conference on Digital Libraries SP - 1-5 PB - ACM CY - New York, NY; United States SN - 979-8-4007-2597-5 DO - 10.1145/3805696.3846475 UR - https://fis.uni-bamberg.de/handle/uniba/117761 LA - eng AB - Research data reuse is an objective of Open Science, and data journals have emerged as an important publication format for supporting reuse of research data. However, it remains unclear how this objective is operationalized in humanities-oriented data journals and whether reuse-related information is made accessible through their search interfaces. This paper investigates the support for research data reuse in humanities-oriented data journals. We synthesize prior work on research data reuse and identify diferent reuse purposes and forms. In addition, we analyze how ten humanities-oriented data journals implement support for reuse in their documentation structures and search interfaces. Our analyses show that reuse is frequently recognized as an objective in humanities-oriented data journals, but reuse-related information is not directly represented in the search interfaces. Building on these fndings, we derive implications that address the representation of reuse-related information and the design of search systems. KW - Research Data Reuse KW - Humanities Research Data KW - Data Journals ER - TY - CPAPER TI - ADISS : Authority Data Integration Search System AU - Fruth, Leon AU - Gradl, Tobias AU - Henrich, Andreas PY - 2026 SP - 189-200 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115320 LA - eng AB - This paper introduces ADISS, a generic search system designed to integrate heterogeneous authority file providers. Authority data is used to unambiguously identify entities such as persons, places, and organizations. As single data providers do not offer both quantity and quality of data, a combined access to multiple datasets is often required to support real-world use cases. In the context of Digital Humanities this combination improves the resolution of ambiguities in data curation processes. Our work is mainly motivated by two projects that require semi-automatic retrieval, as well as user-centered search scenarios for different authority file providers. Instead of using multiple existing endpoints to access the various datasets, we gather the heterogeneous data and make it accessible via integrated query and result models. In this paper, we present our highly configurable search API, which offers a diverse range of search and filtering options. We show that by its generic and highly configurable nature, our system is adaptable and reusable for a diverse set of use cases and conclude the paper with ideas for further steps and improvements. KW - FAIR KW - Digital Humanities KW - Authority Data KW - Data Curation 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 - CPAPER TI - Automatisierte Typklassifikation von Normdaten mit BERT : Poster AU - Hebeis, Maximilian AU - Fruth, Leon AU - Gradl, Tobias AU - Henrich, Andreas PY - 2026 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/114779 LA - deu AB - Normdaten sind zentral für die Interoperabilität geisteswissenschaftlicher Daten. Die an der Otto-Friedrich-Universität Bamberg entwickelte integrierte Suchplattform ADISS integriert verschiedene Normdatenquellen wie GND, Wikidata oder Geonames, jedoch bislang ohne einheitliche Typisierung. Dies erschwert eine gezielte Facettierung bei der Suche. Ziel des Projekts ist daher ein System zur automatisierten Typenzuordnung mittels maschinellen Lernens. Auf Basis von BERT soll ein Klassifikator trainiert werden, der Normdatensätze in ein reduziertes Zielschema überführt. Trainingsdaten entstehen durch Mapping zwischen GND- und Wikidata-Datensätzen. Neben Quelltypen werden Name und Beschreibung des jeweiligen Normdatensatzes als semantische Features genutzt. Erste Experimente mit einem auf einem multilingualen BERT-Modell als Encoder basierenden hierarchischen Klassifikator zeigen vielversprechende Ergebnisse. Künftig sollen die Datenbasis und Modellparameter optimiert werden, um eine robuste, domänenübergreifende Typisierung zur Verbesserung der Suchfunktionalität in ADISS zu ermöglichen. KW - Normdaten KW - Textklassifikation KW - Maschinelles Lernen KW - Forschungsdateninfrastrukturen KW - Metadaten KW - Entity Typing KW - BERT KW - Datenintegration ER - TY - CPAPER TI - Automatisierte Typklassifikation von Normdaten mit BERT AU - Hebeis, Maximilian AU - Fruth, Leon AU - Gradl, Tobias AU - Henrich, Andreas PY - 2026 SP - 447-450 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/114771 LA - deu AB - Normdaten sind zentral für die Interoperabilität geisteswissenschaftlicher Daten. Die an der Otto-Friedrich-Universität Bamberg entwickelte integrierte Suchplattform ADISS integriert verschiedene Normdatenquellen wie GND, Wikidata oder Geonames, jedoch bislang ohne einheitliche Typisierung. Dies erschwert eine gezielte Facettierung bei der Suche. Ziel des Projekts ist daher ein System zur automatisierten Typenzuordnung mittels maschinellen Lernens. Auf Basis von BERT soll ein Klassifikator trainiert werden, der Normdatensätze in ein reduziertes Zielschema überführt. Trainingsdaten entstehen durch Mapping zwischen GND- und Wikidata-Datensätzen. Neben Quelltypen werden Name und Beschreibung des jeweiligen Normdatensatzes als semantische Features genutzt. Erste Experimente mit einem auf einem multilingualen BERT-Modell als Encoder basierenden hierarchischen Klassifikator zeigen vielversprechende Ergebnisse. Künftig sollen die Datenbasis und Modellparameter optimiert werden, um eine robuste, domänenübergreifende Typisierung zur Verbesserung der Suchfunktionalität in ADISS zu ermöglichen. KW - Normdaten KW - Textklassifikation KW - Maschinelles Lernen KW - Forschungsdateninfrastrukturen KW - Metadaten KW - Entity Typing KW - BERT KW - Datenintegration ER - TY - CPAPER TI - Automatisierte Typklassifikation von Normdaten mit BERT AU - Hebeis, Maximilian AU - Fruth, Leon AU - Gradl, Tobias AU - Henrich, Andreas PY - 2026 T2 - Book of Abstracts : DHd 2026 SP - 447-450 PB - Zenodo DO - 10.5281/zenodo.18703020 UR - https://fis.uni-bamberg.de/handle/uniba/114773 LA - deu AB - Normdaten sind zentral für die Interoperabilität geisteswissenschaftlicher Daten. Die an der Otto-Friedrich-Universität Bamberg entwickelte integrierte Suchplattform ADISS integriert verschiedene Normdatenquellen wie GND, Wikidata oder Geonames, jedoch bislang ohne einheitliche Typisierung. Dies erschwert eine gezielte Facettierung bei der Suche. Ziel des Projekts ist daher ein System zur automatisierten Typenzuordnung mittels maschinellen Lernens. Auf Basis von BERT soll ein Klassifikator trainiert werden, der Normdatensätze in ein reduziertes Zielschema überführt. Trainingsdaten entstehen durch Mapping zwischen GND- und Wikidata-Datensätzen. Neben Quelltypen werden Name und Beschreibung des jeweiligen Normdatensatzes als semantische Features genutzt. Erste Experimente mit einem auf einem multilingualen BERT-Modell als Encoder basierenden hierarchischen Klassifikator zeigen vielversprechende Ergebnisse. Künftig sollen die Datenbasis und Modellparameter optimiert werden, um eine robuste, domänenübergreifende Typisierung zur Verbesserung der Suchfunktionalität in ADISS zu ermöglichen. KW - Normdaten KW - Textklassifikation KW - Maschinelles Lernen KW - Forschungsdateninfrastrukturen KW - Metadaten KW - Entity Typing KW - BERT KW - Datenintegration ER - TY - CPAPER TI - Automatisierte Typklassifikation von Normdaten mit BERT : Poster AU - Hebeis, Maximilian AU - Fruth, Leon AU - Gradl, Tobias AU - Henrich, Andreas PY - 2026 PB - Zenodo DO - 10.5281/zenodo.18999712 UR - https://fis.uni-bamberg.de/handle/uniba/114772 LA - deu AB - Normdaten sind zentral für die Interoperabilität geisteswissenschaftlicher Daten. Die an der Otto-Friedrich-Universität Bamberg entwickelte integrierte Suchplattform ADISS integriert verschiedene Normdatenquellen wie GND, Wikidata oder Geonames, jedoch bislang ohne einheitliche Typisierung. Dies erschwert eine gezielte Facettierung bei der Suche. Ziel des Projekts ist daher ein System zur automatisierten Typenzuordnung mittels maschinellen Lernens. Auf Basis von BERT soll ein Klassifikator trainiert werden, der Normdatensätze in ein reduziertes Zielschema überführt. Trainingsdaten entstehen durch Mapping zwischen GND- und Wikidata-Datensätzen. Neben Quelltypen werden Name und Beschreibung des jeweiligen Normdatensatzes als semantische Features genutzt. Erste Experimente mit einem auf einem multilingualen BERT-Modell als Encoder basierenden hierarchischen Klassifikator zeigen vielversprechende Ergebnisse. Künftig sollen die Datenbasis und Modellparameter optimiert werden, um eine robuste, domänenübergreifende Typisierung zur Verbesserung der Suchfunktionalität in ADISS zu ermöglichen. KW - Normdaten KW - Textklassifikation KW - Maschinelles Lernen KW - Forschungsdateninfrastrukturen KW - Metadaten KW - Entity Typing KW - BERT KW - Datenintegration ER - TY - CPAPER TI - Contrasting Traditional Models and LLMs : An Evaluation Based on Text Segmentation AU - Jegan, Robin AU - Henrich, Andreas PY - 2026 SP - 274–281 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/114487 LA - eng AB - This paper presents a discussion of the relevancy of older natural language processing approaches compared to modern large language models (LLMs), with experimental results for a specific application: the segmentation of video transcripts. An analysis was conducted, if powerful modern LLMs are necessary for tasks such as text segmentation or if traditional and more efficient models – here TextTiling – suffice. In the end, LLMs provide comparable performance to the other models, but the results produced by TextTiling are promising and suggest a discussion about a trade-off regarding efficiency, performance, energy-consumption and other factors. KW - - ER - TY - CPAPER TI - Automatic Creation of Marginalia AU - Lang, Aaron AU - Jegan, Robin AU - Henrich, Andreas PY - 2026 SP - 228–240 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/114474 LA - eng AB - In contrast to similar tasks such as keyphrase prediction or text summarization, the automatic creation of marginalia has not been explored yet. This paper takes the first steps to advance research in this area. For our experiments, we used marginalia data extracted from German computer science textbooks and analyzed the marginalia’s properties. We utilized methods from the similar task of keyphrase prediction to test how suitable they are for the creation of marginalia and adapted the methods accord-ing to the observed marginalia properties and for the use with the German language. The results are evaluated quantitatively and quali-tatively. We also highlight limitations of frequently used measures such as F1 and describe why it is desirable to advance research on suit-able evaluation measures. We find that GPT-4o and mT5 perform best while for the non-LLM-based methods, SIFRank+ and TF-IDF show promising results. KW - - ER - TY - JOUR TI - A Flexible Search System for Integrated Authority Data : ADISS AU - Fruth, Leon AU - Gradl, Tobias AU - Hebeis, Maximilian AU - Henrich, Andreas PY - 2026 SP - 167-178 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/112845 LA - eng AB - This paper presents ADISS, a generic and flexible search system designed to integrate heterogeneous authority file providers. Authority data is used to unambiguously identify entities such as persons, places, and institutions. As individual data providers typically do not offer both broad, universal coverage and domain-specific, in-depth data, many real-world application scenarios require combined access to multiple datasets. In the context of Digital Humanities, combining multiple authority data providers helps to improve the coverage and to resolve ambiguities more effectively during data curation. Instead of relying on separate endpoints to access multiple data sources, we address this need by aggregating the datasets and exposing them through integrated query and result models, thus simplifying access at the level of technical interfaces and schema integration. We present a highly configurable search API, which offers a diverse range of search and filtering options, to leverage the integrated data sources. We demonstrate its practical value through two active projects, that require semi-automatic retrieval, as well as user-centered search scenarios for different authority file providers. An evaluation based on manually curated data shows high retrieval accuracy, highlighting the system’s effectiveness. We further illustrate how ADISS’s generic and highly configurable design makes it adaptable and reusable for a wide range of use cases, and we outline directions for future improvements. KW - FAIR KW - Digital Humanities KW - Authority Data KW - Data Curation ER - TY - CPAPER TI - Methoden der automatischen Sprachverarbeitung und Zugänge zu Big Data für den Fachunterricht AU - Lang, Aaron ED - Henrich, Andreas PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-112238 UR - https://fis.uni-bamberg.de/handle/uniba/112238 LA - deu AB - Das Poster gibt einen Überblick über die Ziele und Inhalte der im Rahmen des DiSo-SGW-Projekts entwickelten Fortbildung zum Thema Distant Reading im Unterricht. KW - Distant Reading KW - DiSo ER - TY - CPAPER TI - Teilprojekt Text+ – Nutzbarmachung von Sammlungen, Editionen und Co AU - Gradl, Tobias AU - Hirmer, Tobias AU - Fruth, Leon AU - Henrich, Andreas PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-112303 UR - https://fis.uni-bamberg.de/handle/uniba/112303 LA - deu AB - Text+ ist ein Konsortium der Nationalen Forschungsdateninfrastruktur (NFDI) und bietet Zugang zu Knowhow, Standards und Services im Bereich der text- und sprachbasierten Wissenschaften. In Text+ ist das Team des Lehrstuhls Medieninformatik insbesondere mit Themen rund um die Erschließung und Nutzbarmachung von Datenbeständen befasst. Dabei werden die Anbieter von Forschungsdaten, die sogenannten Datenzentren, bei der Umsetzung der FAIR Prinzipien unterstützt. Über die anbieterorientierte Perspektive hinaus stehen Anforderungen durch die Fachwissenschaften in der Forschung im Vordergrund. Anforderungen aus DiSo an die über Text+ zugänglichen Ressourcen können für die Gestaltung von Diensten und Standards mit Blick auf die Nachnutzbarkeit in Unterricht und Lehrkräftebildung eingebracht und berücksichtigt werden. KW - DiSo KW - lernen:digital ER - TY - CPAPER TI - A closed approach to vague collections in partly inaccessible distributed databases AU - Haase, Oliver AU - Henrich, Andreas PY - 2025 SP - 261-274 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture Notes in Computer Science UR - https://fis.uni-bamberg.de/handle/uniba/106904 LA - eng AB - Inaccessibility of part of the database is a research topic hardly addressed in the literature about distributed databases. However, there are various application areas, where the database has to remain operable even if part of the database is inaccessible. In particular, queries to the database should be processed in an appropriate way. This means that the final and all intermediate results of a query in a distributed database system must be regarded as potentially vague. In this paper we propose hybrid representations for vague sets, vague multisets, and vague lists, which address the accessible elements in an enumerating part and the inaccessible elements in a descriptive part. These representations allow to redefine the usual query language operations for vague sets, vague multisets, and vague lists. The main advantage of our approach is that the descriptive part of the representation can be used to improve the enumerating part during query processing. KW - distributed databases ER - TY - JOUR TI - Learner models : design, components, structure, and modelling ; A systematic literature review AU - Böck, Felix AU - Ochs, Michaela AU - Henrich, Andreas AU - Landes, Dieter AU - Leidner, Jochen L. AU - Sedelmaier, Yvonne PY - 2025 SP - 1-81 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/111422 LA - eng AB - Learning is at the heart of every progress the human species makes. It is most effective when it considers who we are as individuals, what learning approach we prefer and what we already know to begin with. In the digital age, we strive to capture such information in the form of a digital representation—the so-called learner model—, to tailor learning-related systems to this information and build upon it to create more personalised learning experiences. Over recent years, the proliferation of diverse models across various educational applications and disciplines has made it challenging to access targeted research. In this survey, we aim to address this gap, reviewing the latest advances in learner modelling and conducting a comprehensive analysis of the existing approaches, focusing on developments from 2014 to 2023. With the help of a systematic literature review (SLR), we want to provide designers and developers of learner models with a structured overview and simplified entrance into the topic and the field of learner models. We investigate the question: What do learner models look like and how are they filled, kept up to date and used? To this end, we analyse and classify existing approaches. Our findings provide a comprehensive and structured overview of the field of learner modelling, allowing researchers to navigate and understand the diverse approaches more easily and providing developers of learner models or adaptive systems with a practical tool to access relevant information according to their needs. KW - Learner model KW - Digital twin KW - Student modelling KW - Systematic literature review KW - Systematic survey KW - Systematic review KW - Higher education KW - Computer science KW - Computer-assisted learning ER - TY - JOUR TI - Learner models : design, components, structure, and modelling ; A systematic literature review AU - Böck, Felix AU - Ochs, Michaela AU - Henrich, Andreas AU - Landes, Dieter AU - Leidner, Jochen L. AU - Sedelmaier, Yvonne PY - 2025 JO - User modeling and user adapted interaction : an international journal ; umuai VL - 35 IS - 4, 15 SP - 1-81 PB - Springer CY - Berlin SN - 1573-1391 DO - 10.1007/s11257-025-09434-4 UR - https://fis.uni-bamberg.de/handle/uniba/112077 LA - eng AB - Learning is at the heart of every progress the human species makes. It is most effective when it considers who we are as individuals, what learning approach we prefer and what we already know to begin with. In the digital age, we strive to capture such information in the form of a digital representation—the so-called learner model—, to tailor learning-related systems to this information and build upon it to create more personalised learning experiences. Over recent years, the proliferation of diverse models across various educational applications and disciplines has made it challenging to access targeted research. In this survey, we aim to address this gap, reviewing the latest advances in learner modelling and conducting a comprehensive analysis of the existing approaches, focusing on developments from 2014 to 2023. With the help of a systematic literature review (SLR), we want to provide designers and developers of learner models with a structured overview and simplified entrance into the topic and the field of learner models. We investigate the question: What do learner models look like and how are they filled, kept up to date and used? To this end, we analyse and classify existing approaches. Our findings provide a comprehensive and structured overview of the field of learner modelling, allowing researchers to navigate and understand the diverse approaches more easily and providing developers of learner models or adaptive systems with a practical tool to access relevant information according to their needs. KW - Learner model KW - Digital twin KW - Student modelling KW - Systematic literature review KW - Systematic survey KW - Systematic review KW - Higher education KW - Computer science KW - Computer-assisted learning ER - TY - JOUR TI - Baula – die digitale Studienplanungsassistentin an der Universität Bamberg AU - Hirmer, Tobias AU - Ochs, Michaela AU - Henrich, Andreas PY - 2025 SP - 15-36 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/112053 LA - deu AB - Während die Pandemie die digitale Transformation in der Lehre beschleunigt hat, besteht bei der Studienorganisation noch Nachholbedarf. Diese Innovationslücke sollen digitale Studienassistenten (DSA) füllen. Der vorliegende Beitrag stellt die aktuelle und weitere geplante Entwicklung eines DSA an der Universität Bamberg vor, welcher Studierenden auf Basis heterogener Datenquellen eine zentrale, flexible und umfassende Möglichkeit zur individuellen, eigenständigen Studienplanung bieten soll. Eine erste Evaluation (𝑛𝑛 = 26) zeigt das positive Feedback Studierender und verdeutlicht das Potenzial eines solchen Systems, dessen Entwicklung vor dem Hintergrund organisatorischer Hürden des Hochschulkontexts betrachtet wird. KW - Studienplanung KW - Digitalisierung der Hochschule KW - Studienassistent KW - Webanwendung KW - study planning KW - web application KW - digitalisation of the university KW - study assistant ER - TY - CPAPER TI - Assessing the FAIRness of Software Repositories Using RDF and SHACL AU - Hummel, Tobias AU - Martin, Leon AU - Henrich, Andreas PY - 2025 SP - 160-175 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/111941 LA - eng AB - Purpose: A previous paper proposed the usage of SHACL to assess the FAIRness of software repositories. Following this call to action, this paper introduces and discusses the changes made to QUARE, a SHACL-based tool for validating GitHub repositories against sets of quality criteria, to facilitate this task. Methodology: An operationalization of the abstract FAIR best practices from previous work is devised to enable a FAIRness assessment based on concrete quality criteria. Afterwards, a SHACL shapes graph implementing these constraints is introduced, followed by a discussion of the efficient generation of suitable RDF representations for GitHub repositories. Improvements regarding the usability of QUARE are examined, as well. An evaluation on the FAIRness of 223 GitHub repositories and on the runtime performance of the assessment is conducted. Findings: On average, trending repositories comply with fewer FAIR best practices than repositories expected to be FAIR. However, the latter still exhibit deficiencies, for example, regarding the correct application of semantic versioning. The low average runtime of the FAIRness assessment of respectively 3.50 and 5.73 seconds per repository permits the integration of QUARE in, e.g., CI/CD pipelines. Value: The FAIR principles are often mentioned as a measure to tackle the reproducibility crisis, which continues to have a significant impact on science. To implement these principles in practice, it is crucial to provide tools that facilitate the automated assessment of the FAIRness of software repositories. The enhanced version of QUARE introduced in this paper represents our proposal for this demand. KW - FAIR software KW - GitHub repositories KW - SHACL ER - TY - CPAPER TI - An Approach towards Unsupervised Text Simplification on Paragraph-Level for German Texts AU - Fruth, Leon AU - Jegan, Robin AU - Henrich, Andreas PY - 2025 SP - 77–89 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/111935 LA - eng AB - Text simplification as a research field has received attention in recent years for English and other languages, however, German text simplification techniques are lacking thus far. We present an unsupervised simplification approach for German texts using reinforcement learning (self-critical sequence training). Our main contributions are the adaption of an existing method for English, the selection and creation of German corpora for this task and the customization of rewards for particular aspects of the German language. In our paper, we describe our system and an evaluation, including still present issues and problems due to the complexity of the German language, as well as directions for future research. KW - Unsupervised Text Simplification ER - TY - CPAPER TI - Upcycling UnivIS : Discovering Study Planning 2.0 AU - Ochs, Michaela AU - Hirmer, Tobias AU - Henrich, Andreas PY - 2025 SP - 859-865 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/111431 LA - eng AB - Technical innovation in university settings often progresses slowly, with legacy systems frequently remaining in use for years. This can lead to outdated technologies that no longer meet user needs. In this demonstration, we explore the revival of such legacy systems through the example of UnivIS, a course administration system used at the University of Bamberg for over two decades. We introduce Baula, a digital study assistant that builds on UnivIS data and functionality, integrating them into a modern, user-friendly interface. By upcycling existing infrastructure, Baula addresses significant student concerns regarding usability and functionality. This demonstration illustrates how such legacy systems can be modernized to better align with contemporary user requirements, showcasing a model for innovation within a traditionally slow-moving environment. KW - Legacy Systems KW - Digital Transformation KW - Higher Education KW - Study Planning ER - TY - CPAPER TI - Upcycling UnivIS : Discovering Study Planning 2.0 AU - Ochs, Michaela AU - Hirmer, Tobias AU - Henrich, Andreas PY - 2025 T2 - Datenbanksysteme für Business, Technologie und Web (BTW 2025) : 03. -07. März 2025 Bamberg ; Proceedings SP - 859-865 PB - Gesellschaft für Informatik e.V. CY - Bonn T3 - Lecture Notes in Informatics (LNI), SN - 2944-7682 DO - 10.18420/btw2025-52 UR - https://fis.uni-bamberg.de/handle/uniba/111483 LA - eng AB - Technical innovation in university settings often progresses slowly, with legacy systems frequently remaining in use for years. This can lead to outdated technologies that no longer meet user needs. In this demonstration, we explore the revival of such legacy systems through the example of UnivIS, a course administration system used at the University of Bamberg for over two decades. We introduce Baula, a digital study assistant that builds on UnivIS data and functionality, integrating them into a modern, user-friendly interface. By upcycling existing infrastructure, Baula addresses significant student concerns regarding usability and functionality. This demonstration illustrates how such legacy systems can be modernized to better align with contemporary user requirements, showcasing a model for innovation within a traditionally slow-moving environment. KW - Legacy Systems KW - Digital Transformation KW - Higher Education KW - Study Planning ER - TY - JOUR TI - A Flexible Search System for Integrated Authority Data : ADISS AU - Fruth, Leon AU - Gradl, Tobias AU - Hebeis, Maximilian AU - Henrich, Andreas PY - 2025 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V. VL - 25 IS - 3 SP - 167-178 PB - Springer CY - Berlin ; Heidelberg SN - 1618-2162 DO - 10.1007/s13222-025-00515-7 UR - https://fis.uni-bamberg.de/handle/uniba/111276 LA - eng AB - This paper presents ADISS, a generic and flexible search system designed to integrate heterogeneous authority file providers. Authority data is used to unambiguously identify entities such as persons, places, and institutions. As individual data providers typically do not offer both broad, universal coverage and domain-specific, in-depth data, many real-world application scenarios require combined access to multiple datasets. In the context of Digital Humanities, combining multiple authority data providers helps to improve the coverage and to resolve ambiguities more effectively during data curation. Instead of relying on separate endpoints to access multiple data sources, we address this need by aggregating the datasets and exposing them through integrated query and result models, thus simplifying access at the level of technical interfaces and schema integration. We present a highly configurable search API, which offers a diverse range of search and filtering options, to leverage the integrated data sources. We demonstrate its practical value through two active projects, that require semi-automatic retrieval, as well as user-centered search scenarios for different authority file providers. An evaluation based on manually curated data shows high retrieval accuracy, highlighting the system’s effectiveness. We further illustrate how ADISS’s generic and highly configurable design makes it adaptable and reusable for a wide range of use cases, and we outline directions for future improvements. KW - FAIR KW - Digital Humanities KW - Authority Data KW - Data Curation ER - TY - CPAPER TI - Contrasting Traditional Models and LLMs : An Evaluation Based on Text Segmentation AU - Jegan, Robin AU - Henrich, Andreas PY - 2025 T2 - Proceedings of the 21st Conference on Natural Language Processing (KONVENS 2025) : Workshops SP - 274–281 PB - HsH Applied Academics CY - Hannover UR - https://fis.uni-bamberg.de/handle/uniba/111250 LA - eng AB - This paper presents a discussion of the relevancy of older natural language processing approaches compared to modern large language models (LLMs), with experimental results for a specific application: the segmentation of video transcripts. An analysis was conducted, if powerful modern LLMs are necessary for tasks such as text segmentation or if traditional and more efficient models – here TextTiling – suffice. In the end, LLMs provide comparable performance to the other models, but the results produced by TextTiling are promising and suggest a discussion about a trade-off regarding efficiency, performance, energy-consumption and other factors. KW - - ER - TY - CPAPER TI - Automatic Creation of Marginalia AU - Lang, Aaron AU - Jegan, Robin AU - Henrich, Andreas PY - 2025 T2 - Proceedings of the 21st Conference on Natural Language Processing (KONVENS 2025) : Long and Short Papers SP - 228–240 PB - HsH Applied Academics CY - Hannover UR - https://fis.uni-bamberg.de/handle/uniba/111251 LA - eng AB - In contrast to similar tasks such as keyphrase prediction or text summarization, the automatic creation of marginalia has not been explored yet. This paper takes the first steps to advance research in this area. For our experiments, we used marginalia data extracted from German computer science textbooks and analyzed the marginalia’s properties. We utilized methods from the similar task of keyphrase prediction to test how suitable they are for the creation of marginalia and adapted the methods accord-ing to the observed marginalia properties and for the use with the German language. The results are evaluated quantitatively and quali-tatively. We also highlight limitations of frequently used measures such as F1 and describe why it is desirable to advance research on suit-able evaluation measures. We find that GPT-4o and mT5 perform best while for the non-LLM-based methods, SIFRank+ and TF-IDF show promising results. KW - - ER - TY - CPAPER TI - A Hybrid Index Structure for Geo-Textual Searches AU - Göbel, Richard AU - Henrich, Andreas AU - Niemann, Raik AU - Blank, Daniel PY - 2025 SP - 1625–1628 UR - https://fis.uni-bamberg.de/handle/uniba/106660 LA - eng AB - The efficient execution of multi-criteria queries has gained increasing interest over the last years. In the present paper we propose an R-tree based approach for queries addressing textual as well as geographic filter conditions. Whereas most previous approaches use an index structure optimised for a single criterion adding special treatment for the other criterion at the leaf nodes or end points of this index structure, our approach uses a deeper integration. In short, R-trees are maintained for certain subsets of the whole term set. Furthermore, in each of these R-trees bit sets are used within the nodes to indicate whether entries for the terms associated with the single bits can be found in the corresponding sub-tree. Our index structure aims to be both, time and space efficient. The paper investigates the efficiency and applicability of the proposed index structure via practical experiments based on real-world and synthetic data. KW - R-Tree KW - Inverted Index KW - Geographical IR ER - TY - CPAPER TI - The update of index structures in object-oriented DBMS AU - Henrich, Andreas PY - 2025 SP - 136-143 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106654 LA - eng AB - Index structures in object-oriented database management systems should support selections not only with respect to physical object attributes, but also with respect to derived attributes. A simple example arises, if we assume the object types Company, Division, and Employee, with the relationships has-division born Company to Division, and employsfrom Division to Employee. In this case the index structureshould allow to support queries for companies specifying thenumber of employees of the company. Unfortunately, there is one main problem with indexstructures addressing derived attributes, namely the question: Which entries in which index structures have to beupdated after a certain update in the object base? In the example above, the creation of a new employee must trigger an index update for the corresponding company. In the present paper we propose a practical solution for this problem. This solution is based on so-called index update definitions which comprise (1) an event description for the event causing the need for the index update, (2) a reference for the affected index structure, (3) a query determining the elements for which the respective index entries have to be updated, and (4) the corresponding tipdnte operation. Using these index update definitions we can handle complex derived attributes defined e.g. employing regular path expressions. The paper first describes the environment for our considerations originating from the fields of software engineering environments and information retrieval. Thereafter the use of our approach is demonstrated by the help of a comprehensive example. Finally we sketch the implementation of our approach based on a multi-thread architecture KW - index structures ER - TY - CPAPER TI - Scalable summary based retrieval in P2P networks AU - Müller, Wolfgang AU - Eisenhardt, Martin AU - Henrich, Andreas PY - 2025 SP - 586-593 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106621 LA - deu AB - Much of the present P2P-IR literature is focused on distributed indexing structures. Within this paper, we present an approach based on the replication of peer data summaries via rumor spreading and multicast in a structured overlay.We will describe Rumorama, a P2P framework for similar-ity queries inspired by GlOSS and CORI and their P2P-adaptation, PlanetP. Rumorama achieves a hierarchization of PlanetP-like summary-based P2P-IR networks. In a Rumorama network, each peer views the network as a small PlanetP network with connections to peers that see other small PlanetP networks. One important aspect is that each peer can choose the size of the PlanetP network it wants to see according to its local processing power and bandwidth. Even in this adaptive environment, Rumorama manages to process a query such that the summary of each peer is considered exactly once in a network without churn. However, the actual number of peers to be contacted for a query is a small fraction of the total number of peers in the network.Within this article, we present the Rumorama base protocol, as well as experiments demonstrating the scalability and viability of the approach under churn. KW - P2P KW - Similarity Search KW - Distributed IR ER - TY - CPAPER TI - Sample-based Creation of Peer Summaries for Efficient Similarity Search in Scalable Peer-to-Peer Networks AU - Blank, Daniel AU - El Allali, Soufyane AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2025 SP - 143-151 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106620 LA - eng AB - In this paper we introduce a simple yet experimentally convincing approach in the research field of source selection for content-based similarity search in P2P networks or, more concretely, in summary-based P2P systems. In these systems, summaries are used for data source selection when performing k-NN queries on distributed collections of documents represented by feature vectors. We introduce a new type of cluster-based summaries for source selection that can efficiently and cheaply be calculated and distributed in P2P networks. For the summaries generation, a very large number of sample points is used. Each peer in the network assigns its indexing data to their corresponding closest sample points and publishes its constructed summary. We evaluate the quality of these summaries when changing the number of sample points used in experiments on real-world image feature data obtained from a large crawl of the flickr web photo community and show that for higher numbers of sample points we achieve a better retrieval performance. Our experiments show that the proposed summaries yield four times better performance with respect to previous methods. Intuitively, there are some disadvantages to this approach due to the large size of the generated summaries. We show experimentally, that these disadvantages can easily be overcome due to the sparse nature of the generated summaries by simple compression techniques. KW - P2P KW - CBIR KW - Source selection ER - TY - CPAPER TI - LFRP-Search: Multi-Layer Ranked Visual Faceted Search : an Approach to Cope with Complex Search Situations AU - Eckstein, Raiko AU - Henrich, Andreas AU - Weber, Nadine PY - 2025 SP - 1713-1717 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106616 LA - eng AB - In enterprise search scenarios information needs are quite diverse. If users know exactly which items they are looking for, they need support in known-item searches. But often information needs are vague and unclear, which means that users cannot explicitly define the search criteria that specify their search request. In these cases, exploratory search approaches are necessary to support users in interactively refining their search queries. Our approach for a retrieval system for complex search situations can be characterized by its four constituent parts: The approach deals with the heterogeneity of potential target objects when performing a search considering multiple artifact layers (e. g. projects, products, persons, and documents). The basic search paradigm applied is faceted search which is well-suited for exploratory interactive retrieval. To cope with result sets of different granularity, we include ranking facilities based on facet values as well as Query-by-Example (QbE) functionalities. Users can easily state their priorities visually by using preference functions. Finally, parallel coordinates (PC) are used to visualize the characteristics and dependencies of (intermediate) results in order to provide users with a deeper understanding of the data under investigation. These four cornerstones of our approach are reflected in the acronym LFRP-search (Multi-Layer Faceted Search with Ranking using Parallel Coordinates). The main contribution of this paper is the semi-formal description of the query options. KW - Information Retrieval KW - Retrieval Model KW - Multi-Criteria KW - Visualization KW - Faceted Search KW - Parallel Coordinates ER - TY - CPAPER TI - Interaction and user experiences with multimedia technologies : challenges and future topics AU - Scherp, Ansgar AU - Nack, Frank AU - Nahrstedt, Klara AU - Inoue, Masashi AU - Girgensohn, Andreas AU - Henrich, Andreas AU - Sandhaus, Philipp AU - Thieme, Sabine AU - Zhou, Michelle PY - 2025 SP - 1-6 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106615 LA - eng AB - In this paper, we investigate future topics and challenges of interaction and user experience in multimedia We bring together different perspectives from overlapping fields of research such as multimedia, human-computer interaction, information retrieval, networked multimedia, and creative arts. Based on potential intersections, we define three application domains to be investigated further, as they create high demand and good prospect for long-lasting developments in the future. These application domains are: media working environments, media enter-/edutainment, and social media engagement. Each application domain is analyzed along five dimensions, namely: information quality, presentation quality, ambience, interactivity, and user expectations. Based on this analysis, we identify the most pressing research questions and key challenges for each area. Finally, we advocate a user-centered approach to tackle these challenges and questions in order to develop relevant multimedia applications that best meet the users' expectations. KW - Interaction KW - User Experience KW - Multimedia KW - Human-computer Interaction KW - Information Retrieval KW - Networked Multimedia KW - Creative Arts ER - TY - CPAPER TI - Fast Retrieval of High-Dimensional Feature Vectors in P2P Networks Using Compact Peer Data Summaries AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2025 SP - 79–86 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106613 LA - deu AB - The retrieval facilities of most Peer-to-Peer (P2P) systems are limited to queries based on a unique identifier or a small set of keywords. The techniques used for this purpose are hardly applicable for content-based image retrieval (CBIR) in a P2P network. Furthermore, we will argue that the curse of dimensionality and the high communication overhead prevent the adaptation of multidimensional search trees or fast sequential scan techniques for P2P CBIR. In the present paper we will propose two compact data representations which can be distributed in a P2P network and used as the basis for a source selection. This allows to communicate only with a small fraction of all peers during query processing without deteriorating the result quality significantly. We will also present experimental results confirming our approach. KW - Algorithms KW - Performance ER - TY - CPAPER TI - Exposing the Vagueness of Query Results on Partly Inaccessible Databases AU - Haase, Oliver AU - Henrich, Andreas PY - 2025 SP - 49-56 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106608 LA - eng AB - Query processing on partly inaccessible databases generally does not yield exact, but vague result sets. A good notion of vague sets fulfills two aims: It keeps the degree of vagueness of the query result as small as possible, and it clarifies the degree of and the reasons for the vagueness to the end user. The first goal requires a good internal representation, while the second goal requires a good external representation of a vague set. In this paper, we present a novel calculus for expressive vague sets that meets both requirements. This is the first approach that is well suited for both internal and external representation of vagueness induced by partial inaccessibility. It consists of a data representation that is capable of holding all the necessary information. Complementary, we have accordingly adapted the usual query language operations. These adaptations are independent of a concrete query language, to make them applicable to most existing query languages. The adapted operations minimize the vagueness of the result, propagate the reasons of uncertainty of the individual vague candidates, and compute an expressive description of the missing elements. KW - Query Processing KW - Inaccessibility KW - Vagueness ER - TY - CPAPER TI - Document retrieval facilities for repository-based system development environments AU - Henrich, Andreas PY - 2025 SP - 101-109 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106607 LA - eng AB - Modern system development environments usually deploy the object management facilities of a so-called repository to store the documents created and maintained during system development. PCTE is the ISO and ECMA standard for a public tool interface for an open repository [23]. In this paper we present document retrieval extensions for an OQL-oriented query language for PCTE. The extensions proposed cover (1) pattern matching, (2) term based document retrieval with automatically generated document description vectors, (3) the flexible definition of what is addressed as a “document” in a given query, and (4) the integration of these facilities into a CASE tool. Whereas the integration of pattern matching facilities into query languages has been addressed by other authors before, the main contribution of our approach is the homogeneous integration of term based document retrieval and the flexible definition of documents. KW - Document retrieval facilities ER - TY - CPAPER TI - Determining geographic representations for arbitrary concepts at query time AU - Henrich, Andreas AU - Lüdecke, Volker PY - 2025 SP - 17-24 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106606 LA - eng AB - In typical concept@location-queries, the location is sometimes given by terms that cannot be found in gazetteers or geographic databases. Such terms usually describe vague geographical regions, but might also include more general terms like mining or theme parks, in which case the corresponding geographic footprint is less obvious. In the present paper we describe our approach to deal with such vague location specifications in geographic queries. Roughly, we determine a geographic representation for these location specifications from toponyms found in the top documents resulting from a query using the terms describing the location. In this paper we describe an efficient process to derive the geographic representation for such situations at query time. Furthermore, we present experiments depicting the performance of our approach as well as the result quality. Our approach allows for an efficient execution of queries such as camping ground near theme park. It can also be used as a standalone-application giving a visual impression of the geographic footprint of arbitrary terms. KW - Vague geographic regions KW - Geographic search engines ER - TY - CPAPER TI - Characteristics of geographic information needs AU - Henrich, Andreas AU - Lüdecke, Volker PY - 2025 SP - 1-6 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106604 LA - eng AB - A Geographic Information Retrieval (GIR) system for answering geographic queries has to cope with various information needs, which have a wide range of contexts and implicit requirements. A user, for example, who is looking for a place to spend his or her holidays certainly has a different understanding of distance than a user looking for a bar in the city he or she lives in. To get a better understanding of geographic information needs and their implications for GIR systems, we analysed real world (geographic) queries with regard to different facets of geographic references in queries. The results of this analysis are presented in this paper, the aim of which was a classification of the geographic aspects of information needs. We present empirical results and line out possible classification criteria, which could be helpful in designing GIR systems that are able to consider different semantics of geographic references in queries. KW - Experimentation KW - Human Factors ER - TY - CPAPER TI - Approaches for determining the geographic footprint of arbitrary terms for retrieval and visualization AU - Henrich, Andreas AU - Lüdecke, Volker AU - Blank, Daniel PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106602 LA - eng AB - Determining the bounds of geographic regions is an important task for geographic search engines which use concept@location-type of queries. The location a user specifies is often not contained in the underlying gazetteer or geographic database, which might be due to vernacular descriptions of regions or because the location is not a geographic region in the narrow sense, which is the case in queries like campground near theme park. In the present paper we describe different ways for automatically determining a geographic footprint for those locations so that a geographic search engine is able to deal with all kinds of location-descriptions. The same approaches can be used to visualize the geographic correlation of arbitrary terms, like the visualization of the spread of certain colloquialisms. The basic idea is to mine locations found in the top documents resulting from a query consisting of the terms the user has chosen to specify the location. We describe how this can be done using kernel density estimation, clustering and a combination thereof. KW - Vague geographic regions KW - Geographic search engines ER - TY - CPAPER TI - Adapting a spatial access structure for document representations in vector space AU - Henrich, Andreas PY - 2025 SP - 19-26 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106577 LA - eng AB - In the field of information-retrieval the vector space model has been proposed. In this model queries and documents are represented ae term vectors where each coefficient represents the relevance of a given term with respect to the document or query. A typical task in this context is to search for the documents most similar to a given query vector. On the other hand, algorithms to perform nearest neighbor and distance scan queries have been proposed for various types of spatial access structures. Unfortunately, these access structures assume implicitly that the number of dimensions is relatively small — which is not the case for document representation vectors. In this paper we discuss the adaptation of spatial access structures for document representation vectors. We describe how some peculiarities of document representation vectors can be exploited to overcome the problems with higher dimensions to a certain extend. We exploit these peculiarities introducing a new cluster split technique and a sophisticated algorithm to calculate an upper bound for the similarity of the documents located in a subtree of the access structure. KW - spatial access structure ER - TY - CPAPER TI - A hybrid split strategy for k-d-tree based access structures AU - Henrich, Andreas PY - 2025 SP - 1-8 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106537 LA - eng AB - With spatial access structures the split strategy determining how the objects stored in an overflowing bucket are distributed over two buckets. is crucial for the performance and robustness. Two categories of split strategies can be distinguished: Data dependent split strategies depend only on the objects stored in the bucket to be split. Distribution dependent split strategies choose the split dimension and the split position independently of the objects actually stored in the bucket to be split based on an hypothesis about the object distribution. Unfortunately both types of split strategies have specific drawbacks. For a distribution dependent split strategy a sound hypothesis for the spatial distribution of the objects is needed in advance and with data dependent split strategies the directory tree becomes extremely unbalanced for insertions in a geometrically presorted order. In this paper we present a hybrid split strategy which tries to combine the advantages of both types of split strategies. Normally it adapts the behavior of a data dependent split strategy, but when the risk of a degeneration of the access structure is detected, it mutates to a distribution dependent split strategy. We will show that this hybrid split strategy is robust with respect to skew distributions and with respect to insertions in presorted order. KW - hybrid split strategy ER - TY - CPAPER TI - IT Company Atlas Upper Franconia : A Practical Application of Expert Search Techniques AU - Blank, Daniel AU - Boosz, Sebastian AU - Henrich, Andreas PY - 2025 SP - 1048-1053 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106535 LA - eng AB - Identifying a competent service provider or contractor is not an easy task. This is especially true in the IT sector with its short-lived trends and products. In this context an"IT Company Atlas" giving substantiated information about the IT companies in a certain region seems to be a promising idea. However, a B2B directory administered manually for this purpose is expensive to establish and to maintain. An alternative approach discussed in this paper is to apply expert search techniques and provide a search engine searching for companies instead of documents. We propose a system searching for companies with expertise in a given field sketched by a keyword query. The system exploits the websites of the companies and covers all aspects: determining and representing the expertise of the companies, query processing and retrieval models, as well as query formulation and result presentation. In addition to the theoretical background and a system description we present experimental results comparing the effectiveness of different retrieval models adopted from expert search in the scenario we call "company search". KW - Company search KW - Expertise retrieval KW - Expert search KW - Domain specific search solutions KW - IR systems ER - TY - CPAPER TI - Hybrid Quantized Resource Descriptions for Geospatial Source Selection AU - Kufer, Stefan AU - Henrich, Andreas PY - 2025 SP - 17-24 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106533 LA - eng AB - Location nowadays is an important aspect of the Web. One scenario in this respect are archives or collections of geo-tagged media items. More concretely, we can think of collections in the arts and humanities available via OAI-PMH (a protocol for metadata harvesting) on the web or web accessible personal media archives maintained in a peer-to-peer manner. In such scenarios for search problems, source selection becomes an important aspect. For example, we would like to access only those collections containing media items in a certain geospatial region (maybe we are interested in images from Shanghai only). Here, the geospatial search criterion allows for a high selectivity. What is needed in such a scenario are expressive and nevertheless compact representations or descriptions of the ``geospatial footprint'' of each collection. A minimum bounding rectangle would be a trivial but not very accurate option. Generally, summarization techniques for this purpose can be distinguished into three categories, geometric approaches, space partitioning approaches and hybrid approaches. In this work, we present novel hybrid techniques, which mostly apply a set of approximating minimum area rectangles for subspace description together with quantization techniques in order to increase the selectivity of the summaries and, at the same time, keep the storage requirements small. KW - Geographic Information Retrieval KW - Distributed Information Retrieval KW - Source Selection KW - Summarization KW - Quantization ER - TY - CPAPER TI - Georeferencing River Networks Using Spatial Reasoning AU - Wolter, Diedrich AU - Blank, Daniel AU - Henrich, Andreas PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106525 LA - eng AB - This paper is concerned with automatic georeferencing of river networks from raster images such as aerial photos or maps. Determining reasonable assignments between a given network of rivers derived from a textual description and an image is subject to high combinatorial complexity and uncertainty. We investigate the application of spatial reasoning in automatic georeferencing. KW - georeferencing river networks KW - spatial reasoning KW - GIS ER - TY - CPAPER TI - Extending Data Models by Declaratively Specifying Contextual Knowledge AU - Gradl, Tobias AU - Henrich, Andreas PY - 2025 SP - 123-126 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106485 LA - eng AB - The research data landscape of the arts and humanities is characterized by a high degree of heterogeneity. To improve interoperability, recent initiatives and research infrastructures are encouraging the use of standards and best practices. However, custom data models are often considered necessary to exactly reflect the requirements of a particular collection or research project. To address the needs of scholars in the arts and humanities for a composition of research data irrespective of the degree of structuredness and standardization, we propose a concept on the basis of formal languages, which facilitates declarative data modeling by respective domain experts. By identifying and defining grammatical patterns and deriving transformation functions, the structure of data is generated or extended in accordance with the particular context and needs of the domain. KW - digital humanities KW - descriptive data modeling KW - language applications KW - DARIAH ER - TY - CPAPER TI - Characterization of toponym usages in texts AU - Wolf, Sebastian Johannes AU - Henrich, Andreas AU - Blank, Daniel PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106484 LA - eng AB - Toponyms in texts and search queries are often used figuratively and do not directly refer to the locations they reference in their literal sense. Different usage kinds and stylistic devices characterize toponym usages in texts. It is thus crucial for a Geographic Information Retrieval (GIR) system to precisely distinguish these different toponym usages at indexing and at query time in order to best address a given information need and the geospatial footprint of a document. For that purpose, we analyze which of the classic stylistic devices such as allegories, metaphors, or metonymies are used together with toponyms. We use these categories as a foundation for a systematic approach towards the characterization of toponym usages in texts which we believe is necessary to further boost retrieval effectiveness of future GIR systems. A prototype implements this characterization exemplary for texts written in German. We evaluate the effectiveness of our approach against a reference corpus to show the general feasibility. Our approach provides a basis for a wide range of more sophisticated applications such as for example text genre detection. KW - Computational Linguistics KW - Linguistic Devices KW - Geographical Information Retrieval KW - Geospatial Grounding ER - TY - CPAPER TI - Assessing Interestingness and Importance of Information Retrieval Course Topics in a Course for Three Different Target Groups AU - Blank, Daniel AU - Henrich, Andreas PY - 2025 SP - 1-8 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106453 LA - eng AB - Teaching an information retrieval (IR) course for three different target groups is challenging. These target groups are i) resident students at the University of Bamberg, Germany ii) remote full-time students from other Bavarian universities, and iii) remote but part-time students from all parts of Germany which usually study the course besides their day-to-day work relationship. As a consequence, we have participants with heterogeneous previous knowledge and potentially different expectations with respect to the course content. In this paper we will only briefly describe the didactic aspects and challenges of the course. The clear focus of the paper lies on an in-depth quantitative evaluation how various IR topics presented in the lectures and tutorials fit the needs of the different target groups. We evaluate interestingness and importance of the course topics according to the students' impressions. The goal of the evaluation is to get hints for future refinements of IR course content---in general but also with respect to the needs of different target groups. KW - Teaching Information Retrieval KW - Evaluation of Course Content KW - Distance Learning ER - TY - CHAP TI - Teaching IR : Curricular Considerations AU - Blank, Daniel AU - Fuhr, Norbert AU - Henrich, Andreas AU - Mandl, Thomas AU - Rölleke, Thomas AU - Schütze, Hinrich AU - Stein, Benno PY - 2025 SP - 31-46 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106427 LA - eng AB - Information retrieval (IR) is nowadays accepted as an important topic in various disciplines. Information science, computer science, information systems, and library science are obvious candidates. But also in disciplines such as marketing, bioinformatics, or linguistics, IR topics are considered important and should be covered by respective curricula. For those who are teaching IR topics, this brings up serious questions: Which topics should be addressed in an IR course? Can one course serve the different target groups? What would be an appropriate set of IR courses to satisfy all potentially interested parties? In this chapter, we try to provide a landscape giving hints with respect to the topics relevant for the different target groups. In fact, a single IR course will hardly satisfy the needs of all target groups. A coordinated set of smaller IR courses where each group can select an appropriate subset might be a solution. Another important aspect is practical exercises. An IR course has to integrate such exercises, and a huge variety of available tools and frameworks are useful in this respect. This chapter will exemplarily consider some of these tools and discuss their use in IR courses. KW - Teaching IR ER - TY - CHAP TI - Search Support in Data Management Systems AU - Henrich, Andreas PY - 2025 SP - 137-157 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106422 LA - eng AB - In consequence of the change in the nature of data management systems the requirements for search support have shifted. In the early days of data management systems, efficient access techniques and optimization strategies for exact match queries had been the main focus. Most of the problems in this field are satisfactorily solved today and new types of applications for data management systems have turned the focus of current research to content-based similarity queries and queries on distributed databases. The present contribution addresses these two aspects. In the first part, algorithms and data structures supporting similarity queries are presented together with considerations about their integration in data management systems, whereas search techniques for distributed data management systems and especially for peer-to-peer networks are discussed in the second part. Here, techniques for exact match queries and for similarity queries are addressed. KW - Data Management Systems ER - TY - CHAP TI - Ad Hoc Determination of Geographic Regions for Concept@Location Queries AU - Henrich, Andreas AU - Lüdecke, Volker PY - 2025 SP - 169-194 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106417 LA - eng AB - Textual geographic queries to search engines usually consist of the desired concept and also of one or more terms describing a location, which is often the name of a city, which in turn can usually be grounded with the help of a gazetteer. On other occasions, though, the location refers to a (vague) geographic region and may also be a vernacular expression for that region, so that this location specification cannot be found in a gazetteer. In this chapter we describe an approach to determine the boundaries for such locations and how to integrate this approach into the query process. The key features of our approach are that a geographic search engine is able to handle any textual description of a geographic region at query time and that this computation can be done completely automatically. In our approach we derive a representation for a region from the toponyms found in the top web documents resulting from a query using the terms describing the location. In addition to that, we introduce two other uses of this approach: first, this method can be used for answering where-is queries (where only a query location, but no query concept is given), and second, we can determine geographic representations for arbitrary terms that are not genuine geographic regions. In that case, the geographic representation provides a visual impression of the geographic correlation of those terms. KW - Concept@Location Queries ER - TY - JOUR TI - Blended learning and pure e-learning concepts for information retrieval : experiences and future directions AU - Henrich, Andreas AU - Sieber, Stefanie PY - 2025 SP - 117-147 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106412 LA - eng AB - Today, teaching and learning are mostly supported by digital material and electronic communication ranging from the provision of slides or scripts in digital form to elaborate, interactive learning environments. This article describes the prospects and risks of blended learning and e-learning for information retrieval courses. It deals with adequate content presentation and representation, as well as with interaction concepts and didactic considerations concerning the cost-benefit ratio of animations, applets, and multimedia elements. We present lessons learnt from 6 years of teaching information retrieval in blended learning and pure e-learning scenarios, and derive graded concepts for basic and advanced topics based on a book-like content representation on the one side, and lecture-recordings on the other side. Each concept is complemented by a pragmatic and focussed use of auxiliary elements such as forums and self-tests. Examples for beneficial and misguided applets and animations are given, along with criteria for their differentiation. Finally, critical success factors for technology enhanced learning approaches in the information retrieval field are derived concerning the creation, utilisation, and maintenance of courses. In short, we will argue that taking into account the nature and stability of the presented content, as well as a thorough consideration of the affordable creation and maintenance effort, are crucial for the success of such concepts. In addition, the closer the concept is to pure e-learning, the more important a high digital presence of the lecturer becomes. KW - Teaching information retrieval KW - Blended learning KW - e-Learning KW - Interaction ER - TY - JOUR TI - Editorial : Schwerpunktthema: Informationsmanagement für Digital Humanities AU - Henrich, Andreas AU - Heyer, Gerhard AU - Schlieder, Christoph AU - Härder, Theo PY - 2025 SP - 1-6 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106407 LA - deu AB - - KW - Informationsmanagement KW - Digital Humanities ER - TY - JOUR TI - Architektur Multimedialer Informationssysteme AU - Berthold, Henrike AU - Binkowski, Frank AU - Henrich, Andreas AU - Hollfelder, Silvia AU - Lindner, Wolfgang AU - Marder, Ulrich AU - Meyer-Wegener, Klaus AU - Robbert, Günter PY - 2025 SP - 77-89 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106406 LA - deu AB - - KW - Multimediale Informationssysteme ER - TY - CPAPER TI - Using Hybrid Techniques for Resource Description and Selection in the Context of Distributed Geographic Information Retrieval AU - Kufer, Stefan AU - Blank, Daniel AU - Henrich, Andreas PY - 2025 SP - 330-347 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture Notes in Computer Science UR - https://fis.uni-bamberg.de/handle/uniba/106400 LA - eng AB - The amount of media items on the web is increasing tremendously, especially regarding personal media items. To effectively collaborate over and share these massive amounts of media objects, there is a strong need for adequate indexing and search techniques. Trends like social networks, large-storage mobile devices and high-bandwidth networks make peer-to-peer (P2P) information retrieval systems of deep interest. Hence, resource selection based on compact resource descriptions is used to efficiently determine promising peers w.r.t. a query. To design effective media search applications, multiple search criteria need to be addressed. Subsequently, besides text or visual media content, geospatial data is frequently used. We propose techniques to summarize and select collections of georeferenced media items in P2P systems. Generally, these summarization techniques can be divided into geometric and space partitioning approaches. This paper presents and evaluates techniques of a third category, hybrid approaches that combine features of geometric and space partitioning techniques. KW - Distributed Geographic Information Retrieval 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 - CPAPER TI - Data Integration for the Arts and Humanities : A Language Theoretical Concept AU - Gradl, Tobias AU - Henrich, Andreas PY - 2025 SP - 281-293 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture Notes in Computer Science UR - https://fis.uni-bamberg.de/handle/uniba/106381 LA - eng AB - In the context of the arts and humanities, heterogeneity largely corresponds to the variety of disciplines, their research questions and communities. Resulting from the diversity of the application domain, the analysis of overall requirements and the subsequent derivation of appropriate unifying schemata is prevented by the complexity and size of the domain. The approach presented in this paper is based on the hypothesis that data integration problems in the arts and humanities can be solved on the theoretical foundation of formal languages. In applying a theoretically substantiated framework, integrative solutions on the formal basis of language specifications can be tailored to specific and individual research needs—abstracting from reoccurring technical difficulties and leading the focus of domain experts on semantic aspects. KW - Data Integration ER - TY - CPAPER TI - Aspects of Adaptivity in P2P Information Retrieval AU - Müller, Wolfgang AU - Henrich, Andreas AU - Eisenhardt, Martin PY - 2025 SP - 164-178 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106380 LA - eng AB - Peer-to-Peer networks are comprised of multiple independently administered computers (peers) that cooperate via a common protocol in order to achieve a goal common to the peers. Helping the user find relevant information in a P2P network is the subject of the field of Peer-to-Peer IR. In order to be successful, a P2P-IR system needs to be adaptive in several respects. It has to adapt both to the user and to its environment. Within this article we detail the motivations and challenges of P2P-IR, as well as the ways in which P2P-IR systems adapt and where improvement is needed in order to achieve adaptive multimedia retrieval. KW - P2P Information Retrieval ER - TY - CPAPER TI - Using a query language to state consistency constraints for repositories AU - Henrich, Andreas AU - Däberitz, Dirk PY - 2025 SP - 59-68 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/106379 LA - eng AB - Modern system development environments usually deploy the object management facilities of a repository to store the documents created and maintained during system development. In this paper we present a pragmatic approach to express various levels of consistency for the data maintained in such a repository. The levels of consistency are achieved by means of a query language. Consistency constraints are stated as queries searching for inconsistent items in the repository. The queries are handled by a generic analyzer, which checks the defined constraints whenever appropriate. Furthermore, we present a general classification schema for consistency constraints and describe how different classes of constraints are handled by our approach. KW - query language ER - TY - CPAPER TI - Searching Multiple Artifacts : a Comprehensive Framework for Complex Search Situations AU - Weber, Nadine AU - Eckstein, Raiko AU - Henrich, Andreas PY - 2025 SP - 251-262 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/106378 LA - eng AB - The paper presents a comprehensive search framework that deals with different types of artifacts and therefore is suitable for situations where the information need behind a search request is sketchy. Such situations are characteristic for the product development domain, on which our research is focused. To support design engineers, various search concepts for specific computer aided engineering (CAE) document types, like e.g. 3D shape similarity methods, have been proposed. Although these methods might be beneficial for certain situations, there is a strong demand for a more generic approach that enables goal-oriented as well as exploratory searching for multiple artifacts such as products, documents, and materials. Hence, we base our framework on the ideas of faceted search, ranking, query-by-example, and parallel coordinates. Furthermore, we extend these concepts by artifact type hierarchies facilitating the generation of artifact type-specific facet data and the adaptability of this integrated approach for other domains as well. KW - Complex Search Situations ER - TY - CPAPER TI - Image Data Source Selection Using Gaussian Mixture Models AU - El Allali, Soufyane AU - Blank, Daniel AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2025 SP - 170-181 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106376 LA - eng AB - In peer-to-peer (P2P) networks, computers with equal rights form a logical (overlay) network in order to provide a common service that lies beyond the capacity of every single participant. Efficient similarity search is generally recognized as a frontier in research about P2P systems. In literature, a variety of approaches exist. One of which is data source selection based approaches where peers summarize the data they contribute to the network, generating typically one summary per peer. When processing queries, these summaries are used to choose the peers (data sources) that are most likely to contribute to the query result. Only those data sources are contacted. In this paper we use a Gaussian mixture model to generate peer summaries using the peers’ local data. We compare this method to other local unsupervised clustering methods for generating peer summaries and show that a Gaussian mixture model is promising when it comes to locally generated summaries for peers without the need for a distributed summary computation that needs coordination between peers. KW - Image Data KW - Source Selection KW - Gaussian Mixture Models ER - TY - CPAPER TI - Hybrid Learning : A Powerful Opportunity to Integrate SMEs in Courses as a Third Party AU - Fries, Tobias AU - Henrich, Andreas PY - 2025 SP - 176-187 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106375 LA - eng AB - In typical teaching scenarios students and lecturers are involved. Nowadays, however, learning management systems (LMS) are used intensively to foster communication between students and lecturers and so reduce the need to meet in person in order to communicate. Additionally an increased involvement of practitioners and companies in teaching efforts at universities seems desirable for a variety of reasons. (1) Examples and comments from practitioners can augment teaching content. (2) Students can get in touch early and casually with potential future employers. (3) The lecturer might receive valuable feedback with respect to his/her teaching content and style and potentially more intense forms of co-operation might result. On the company side such co-operation might be especially appealing for Small and Medium-sized Enterprises (SMEs), because large companies usually have other options, as well. Therefore, we set up a project using a university wide LMS as an enabling platform to escalate the involvement of SMEs and their employees in teaching efforts. In the present paper we report on the experiences derived from this project. KW - Hybrid Learning ER - TY - CPAPER TI - Hybrid Learning : "Neither Fish Nor Fowl" or "The Golden Mean" AU - Henrich, Andreas AU - Sieber, Stefanie PY - 2025 SP - 82-93 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/106374 LA - eng AB - Traditionalists will argue that conventional classroom lectures have been and always will be the most effective form of teaching. In contrast, people focusing on progress will put pure e-teaching on a pedestal. Confronted with these two extremes, a natural reflex is to search for a compromise. Hybrid learning could be such a compromise. However, the important question is whether this is only a compromise for the anxious, an interim arrangement on the transition to pure e-teaching, or the best conceivable solution, that is meant to stay. In the present paper we are giving evidence for the latter position based on practitioners’ experiences of more than ten years of technology enhanced teaching. We address the need for university wide learning management systems and advocate simple, cost-effective, and sustainable solutions not asking too much from lecturers, but—nevertheless—causing a significant added value for the students. KW - Hybrid Learning ER - TY - CPAPER TI - Effectively Managing and Processing Personal Learning Content AU - Sieber, Stefanie AU - Henrich, Andreas PY - 2025 SP - 363-366 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106373 LA - eng AB - Comparing the typical learner only about one or two decades ago and today, an undeniable difference is evident. By now, most of traditional learning has been moved into a continuum of blended learning, as defined by Jones [1]. In this context, especially ways for distributing learning material and contacting each other have completely changed. Learning Management Systems (LMS) are, in the majority of cases, employed to provide a basis for modern learning. Whether it comes to distance learning or not, all required material, including additional information for further reading and tasks controlling the learner’s success, is provided online such that learners can easily access all desired information any time and any place. Communication has been detached from specific points or periods in time as well. This digitalization of the learning process also bears new challenges, which have to be faced by learners as well as lecturers. The concept, introduced in this paper, addresses these facts by delivering a service to set the stage for a personal learning environment adjusted to the needs of a single user. Hence, it provides facilities for integrated maintenance and search in heterogeneous personal learning material. KW - Personal Learning Content ER - TY - JOUR TI - Using Summaries to Search and Visualize Distributed Resources Addressing Spatial and Multimedia Features AU - Blank, Daniel AU - Henrich, Andreas AU - Kufer, Stefan PY - 2025 SP - 67-76 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106431 LA - eng AB - Summarization is an important means to cope with the challenges of big data. Summaries can help to achieve a first overview, they can be used to characterize subsets, they allow for the targeted access to data, and they build the basis for visualization techniques. In the present article, we point out the role of summaries as well as potential application scenarios. As examples, summarization techniques for spatial data (as an example for specific low dimensional techniques) and for general metric spaces (as a generic example with a broad spectrum of applications) are described. Furthermore, their use for resource selection and resource visualization in large distributed scenarios is outlined. KW - Resource description and selection KW - Distributed metric and spatial access methods KW - Big data summarization ER - TY - CPAPER TI - Supporting Collaborative Software Development by Context-Aware Information Retrieval Facilities AU - Henrich, Andreas AU - Morgenroth, Karlheinz PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106885 LA - eng AB - The development of large software systems is a typical example for collaborative development efforts. Moreover, software development becomes more and more component-oriented. The source for these components can be either a component repository inside an organization or one of the emerging open source development networks available on the Internet. In this paper we describe an approach to search for potentially useful components during software development. Our approach is by no means restricted to components in an implementation oriented sense, but covers all types of artifacts created within a software development process. It is based on retrieval techniques for structures documents and uses contextual information about the user and his or her current work to refine the queries. KW - Collaborative Software Development ER - TY - CPAPER TI - The LSDh-Tree : an access structure for feature vectors AU - Henrich, Andreas PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106884 LA - eng AB - Efficient access structures for similarity queries on feature vectors are an important research topic for application areas such as multimedia databases, molecular biology or time series analysis. Different access structures for high dimensional feature vectors have been proposed, namely: the SS-tree, the VAMSplit R-tree, the TV-tree, the SR-tree and the X-tree. All these access structures are derived from the R-tree. As a consequence, the fanout of the directory of these access structures decreases drastically for higher dimensions. Therefore we argue that the R-tree is not the best possible starting point for the derivation of an access structure for high-dimensional data. We show that k-d-tree-based access structures are at least as well suited for this application area and we introduce the LSD/sup h/-tree as an example for such a k-d-tree-based access structure for high-dimensional feature vectors. We describe the algorithms for the LSD/sup h/-tree and present experimental results comparing the LSD/sup h/-tree and the X-tree. KW - LSDh-Tree ER - TY - CPAPER TI - Clustering-Based Source Selection for Efficient Image Retrieval in Peer-to-Peer Networks AU - Eisenhardt, Martin AU - Müller, Wolfgang AU - Henrich, Andreas AU - Blank, Daniel AU - El Allali, Soufyane PY - 2025 SP - 1-6 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106883 LA - deu AB - In peer-to-peer (P2P) networks, computers with equal rights form a logical (overlay) network in order to provide a common service that lies beyond the capacity of every single participant. Efficient similarity search is generally recognized as a frontier in research about P2P systems. One way to address it is using data source selection based approaches where peers summarize the data they contribute to the network, generating typically one summary per peer. When processing queries, these summaries are used to choose the peers (data sources) that are most likely to contribute to the query result. Only those data sources are contacted. There are two main contributions of this paper. We extend earlier work, adding a data source selection method for high-dimensional vector data, comparing different peer ranking schemes. More importantly, we present a method that uses progressive stepwise data exchange between peers to better each peer's summary and therefore improve the system's performance. KW - Efficient Image Retrieval KW - Peer-to-Peer Networks ER - TY - CPAPER TI - Improving the performance of multi-dimensional access structures based on k-d-Trees AU - Henrich, Andreas PY - 2025 SP - 68-75 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106879 LA - eng AB - In recent years, various k-d-tree based multidimensional access structures have been proposed. All these structures share an average bucket utilization of at most ln 2/spl ap/69.3%. We present two algorithms which perform local redistributions of objects to improve the storage utilization of these access structures. We show that under fair conditions a good improvement algorithm can save up to 20% of space and up to 15% of query processing time. On the other hand we also show that a local redistribution scheme designed without care, can improve the storage utilization and at the same time worsen the performance of range queries drastically. Furthermore we show the dependencies between split strategies and local redistribution schemes and the general limitations which can be derived from these dependencies. KW - k-d-Trees ER - TY - CPAPER TI - Picadomo : Faceted Image Browsing for Mobile Devices AU - Hub, Adrian AU - Blank, Daniel AU - Henrich, Andreas AU - Müller, Wolfgang PY - 2025 SP - 249-254 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106877 LA - eng AB - Picadomo combines content-based image retrieval and faceted search on mobile devices. It is designed for finding images with desired visual properties, tags or other known metadata. Due to the limitations of mobile devices such as small screen sizes and low processing power, we had to carefully select the features that come in use (dominant color, GPS data, tags, etc.). With Picadomo the user can pick visualized facets directly via touch screen, while using very little screen size for the facet browsing navigation. We present our architecture, the facets used for image browsing, our new control concept and user experiments. KW - Picadomo ER - TY - JOUR TI - A hybrid representation of vague collections for distributed object management systems AU - Haase, Oliver AU - Henrich, Andreas PY - 2025 SP - 448-467 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106876 LA - eng AB - An important characteristic of distributed object management systems is that due to network or machine failure, the environment may become partitioned into subenvironments that cannot communicate with each other. In some application scenarios, it is important that the subenvironments remain operable even in this case. In particular, queries should be processed in an appropriate way. To this end, the final and all intermediate results of a query in a distributed object management system must be regarded as potentially vague. We propose a hybrid representation for vague sets and vague multisets designed for this application context. The representation consists of an enumerating part, which contains the elements we could access during query processing, and a descriptive part, which describes the relevant elements we could not access. We introduce propagation rules which can be used to minimize the vagueness of a query result represented in this hybrid way. The main advantage of our approach is that the descriptive part of the representation can be used to improve the enumerating part during query processing. KW - distributed systems KW - distributed databases KW - query processing KW - query languages KW - vagueness KW - inaccessibility ER - TY - CPAPER TI - Feature-based object recognition : A case study for car model detection AU - Sperker, Hans-Christian AU - Henrich, Andreas PY - 2025 SP - 127-130 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106708 LA - eng AB - Recognition of untextured as well as shiny objects introduces problems to most of the present interest point detectors and descriptors. Those problems arise from changes in brightness intensities around potential interest points, caused by reflections on such an object's surface. Since the selection of the best performing recognition algorithm heavily depends on the underlying task, an evaluation of some algorithms tested especially for the respective data collection and typical query types has to be taken into account. If the task is for example the model detection of a car, most of the existing algorithm evaluations are misleading since they use data sets with mostly textured and matt objects. The present paper introduces a data set of car images which stands for untextured, shiny objects and evaluates different algorithms namely SIFT, ASIFT, SURF, ORB, and BRISK on that data set. Findings are that most algorithms have a low effectiveness recognizing such objects. This mainly depends on the kind of interest point detector and is not so much dependent on the kind of descriptor. Detectors preferring points on edges and corners are more reliable than those preferring interest points on blob-like structures. KW - Feature-based object recognition ER - TY - JOUR TI - DARIAH(-DE): Digital Research Infrastructure for the Arts and Humanities : Concepts and Perspectives AU - Henrich, Andreas AU - Gradl, Tobias PY - 2025 SP - 47-58 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106705 LA - eng AB - DARIAH (Digital Research Infrastructure for the Arts and Humanities) is part of the European Strategy on Research Infrastructures. Among 38 projects originally on this roadmap, DARIAH is one of two projects addressing social sciences and humanities. According to its self-conception and its political mandate DARIAH has the mission to enhance and support digitally-enabled research across the humanities and arts. DARIAH aims to develop and maintain an infrastructure in support of ICT-based research practices. One main distinguishing aspect of DARIAH is that it is not focusing on one application domain but especially addresses the support of interdisciplinary research in the humanities and arts. The present paper first gives an overview on DARIAH as a whole and then focuses on the important aspect of technical, syntactic and semantic interoperability. Important aspects in this respect are metadata registries and crosswalk definitions allowing for meaningful cross-collection and inter-collection services and analysis. KW - research infrastructure KW - digital humanities KW - DARIAH KW - DARIAH-DE ER - TY - CPAPER TI - The Text+ Registry : Federating Research Data Catalogues for the Digital Humanities AU - Gradl, Tobias AU - Fruth, Leon AU - Henrich, Andreas PY - 2025 T2 - Linking Theory and Practice of Digital Libraries : 29th International Conference on Theory and Practice of Digital Libraries, TPDL 2025, Tampere, Finland, September 23–26, 2025, Proceedings SP - 378-394 PB - Springer Nature Switzerland CY - Cham SN - 978-3-032-05409-8 DO - 10.1007/978-3-032-05409-8_22 UR - https://fis.uni-bamberg.de/handle/uniba/111116 LA - eng ER - TY - CPAPER TI - VisualFlamenco : Dependable, Interactive Image Browsing Based on Visual Properties AU - Müller, Wolfgang AU - Zech, Markus AU - Henrich, Andreas AU - Blank, Daniel PY - 2025 SP - 568-575 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106875 LA - eng AB - Faceted search as a method for exploratory search is a search interface technique for Boolean retrieval that provides a good compromise between the wish to guide the user and the need to give freedom to the user. Both, guidance and freedom are needed in order to enable him (or her) to accomplish his search goal as quickly and efficiently as possible. The search goal can be both, to retrieve a target image (lookup search) or to get an overview of a collection as the basis for accomplishing complex search tasks (exploratory search). VisualFlamenco is about bringing content-based image retrieval and faceted search together. While there is some preexisting work towards faceted search based on automatically extracted metadata, the base innovation of our work is to visualize the meaning of facets and let the user pick visualized facets directly. The main point is this research is to give the user the right expectations about what the system can achieve. We see this as a step towards dependable multimedia search, search interfaces that do not promise more than they can achieve. A mismatch of expectations and possibilities has been denoted by some as one of the main problems in current research about multimedia search. Within this paper we present a visual faceted search tool that seeks to provide dependable image search. We describe its base idea, the features used, as well as user experiments done using the system. KW - VisualFlamenco ER - TY - CPAPER TI - Evaluation, Analysis, and Future Issues of a University-wide Learning Management System Concluding a Two-year Initiation Phase AU - Henrich, Andreas AU - Sieber, Stefanie AU - Wolf, Sven-Uwe PY - 2025 SP - 103-114 PB - Otto-Friedrich-Universität CY - Bamberg ET - 1 UR - https://fis.uni-bamberg.de/handle/uniba/106888 LA - eng AB - This paper presents the review and evaluation of the two-year introduction phase of a university-wide learning management system at the University of Bamberg. For deeper insights the project settings ar described at first and to receive an impression of the success some usage statistics arc presented. Subsequently the evaluation accomplished to conclude the introduction phase is sketched. The two parts of this evaluation designed for the most important user groups -student and lectures - are described and the most important results are presented in short. As response to the received resuIts three evolved issues are selected and possible solutions are shown. Finally a conclusion depicting the changes and the new situation after these two years complete this contribution. KW - Learning Management System ER - TY - JOUR TI - Exzellente Ideen schneller marktreif : Der Forschungsverbund FORFLOW optimiert IT-Abläufe in der Produktentwicklung AU - Henrich, Andreas AU - Morgenroth, Karlheinz PY - 2025 VL - 6 SP - 10-13 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106889 LA - deu AB - Für Unternehmen ist es heute ein entscheidender Wettbewerbsfaktor, exzellente Ideen schnell und effizient in innovative Produkte umsetzen zu können. Dabei spielt seit Jahren die Unterstützung durch IT-Systeme eine entscheidende Rolle. Allerdings sind existierende IT-Systeme bisher nicht oder nur in unbefriedigender Form aufeinander abgestimmt. Die Bayerische Forschungsstiftung erhofft sich durch den geförderten Forschungsverbund FORFLOW eine Optimierung. KW - FORFLOW ER - TY - CHAP TI - Knowledge Management for Hybrid Learning AU - Sieber, Stefanie AU - Henrich, Andreas PY - 2025 SP - 424-449 UR - https://fis.uni-bamberg.de/handle/uniba/106890 LA - eng AB - The merging of knowledge management and hybrid learning has gained more and more attraction and has been put in the focus of interests lately, for the simple reason that both areas can benefit from each other. As a result, this chapter deals with knowledge management for hybrid learning. This chapter begins with a short introduction, followed by a brief clarification showing our understanding of hybrid learning. Afterwards, knowledge and associated attributes are defined precisely - definitions are derived and taxonomies for knowledge are described. This section closes with a first reflection on knowledge in the context of hybrid learning. Subsequently, the authors take a closer look at knowledge management by introducing different schools of thought and models for knowledge management. Opportunities to delve deeper into the subject individually are offered passim. The main part of the chapter provides a comprehensive view of knowledge management for hybrid learning. The described features range from general conclusions to theoretical aspects, exemplary projects, and finally practical aspects - previous deliberations are brought together, current insights concerning the research perspective are described and tools as well as techniques which foster knowledge management for hybrid learning are presented. Finally a critical reflection as well as an outlook and some thoughts concerning future issues conclude this chapter. KW - knowledge management KW - hybrid learning ER - TY - CPAPER TI - Faster exact histogram intersection on large data collections using inverted VA-files AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2025 SP - 455-463 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/106897 LA - eng AB - Most indexing structures for high-dimensional vectors used in multimedia retrieval today rely on determining the importance of each vector component at indexing time in order to create the index. However for Histogram Intersection and other important distance measures this is not possible because the importance of vector components depends on the query. We present an indexing structure inspired by VA-file and Inverted file that does not need to determine the importance at indexing time in order to perform well. Instead, our structure adapts to the importance of vector components at query processing time. Success of this approach is demonstrated in experiments on feature data extracted from a large image collection. KW - histogram intersection KW - large data collections ER - TY - CPAPER TI - Repository based software cost estimation AU - Henrich, Andreas PY - 2025 SP - 653-662 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/106899 LA - eng AB - One important problem with software development projects is to get an early and nevertheless accurate estimation of the software development costs. In the literature various methods have been developed for this purpose. The most popular examples are Boehm's COCOMO, Albrecht's function-Point method or Sneed's object-point method. The two last-named methods are based on early results of the analysis phase, whereas COCOMO is based on an a priori estimation of the software size in “lines of code”. On the other hand, modern software development environments usually employ the object management facilities of a repository to store the documents created and maintained during software development. Hence, software cost estimation methods like the object-Point method, which are based on early analysis results, can be implemented easily on top of the repository. In this paper we present such a repository based realization of software cost estimation methods. KW - Repository ER - TY - CPAPER TI - Retrieval-Dienste für Software-Entwicklungsumgebungen AU - Henrich, Andreas PY - 2025 SP - 147-162 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106901 LA - deu AB - Moderne Software-Entwicklungsumgebungen bestehen aus einer Vielzahl von Werkzeugen, die hinsichtlich der Benutzungsoberfläche, der Ablaufsteuerung und der Datenhaltung integriert sind. Die integrierte Datenhaltung wird dabei i. allg. durch die Verwendung eines Repository unterstützt. Sowohl die kommerziell verfügbaren Repositories als auch die Standards zu diesem Bereich stellen aber leider nur unzureichende Anfragemöglichkeiten zu den verwalteten Daten zur Verfügung. Deshalb haben wir beispielhaft Retrieval-Dienste für den ISO-Standard PCTE entwickelt, die Möglichkeiten des navigierenden Zugriffs mit der Funktionalität einer OQL-artigen Anfragesprache und Techniken des Dokumenten-Retrieval kombinieren. Das vorliegende Papier beschreibt diese Retrieval-Dienste und stellt exemplarisch einige Anwendungen vor. KW - Retrieval-Dienste ER - TY - JOUR TI - Das LFRP-Framework : ein Ansatz zur interaktiven Suche für unternehmensspezifische Informationen AU - Eckstein, Raiko AU - Henrich, Andreas AU - Weber, Nadine PY - 2025 SP - 20-29 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106944 LA - deu AB - Der Bedarf an unterschiedlichen »Informationsträgern«, nachfolgend als Artefakte bezeichnet, sowie eine unklare Vorstellung über die benötigte Information beim Nutzer führen zu komplexen Suchsituationen, wie sie heutzutage in vielen Unternehmen vorzufinden sind. So werden z.B. bei der Entwicklung technischer Produkte unterschiedlichste Artefakte wie Dokumente, Produkte oder Materialien benötigt, wobei Informationsbedürfnisse oft nur vage und ungenau beschrieben werden können. Zusätzlich erschweren die Heterogenität der vorhandenen Ablagesysteme und das fehlen einer übergreifenden Suchfunktionalität das Auffinden relevanter Information. Aus diesem Grund wird mit dem LFRP-Framework ein Forschungsansatz vorgestellt, der durch die Bereitstellung eines interaktiven Retrieval-Modells zur Beherrschung derartig komplexer Suchsituationen beiträgt. LFRP steht hierbei für die vier Basiselemente, die zu einem übergreifenden Framework integriert werden: Durch die Verwendung mehrerer Artefaktebenen (l.ayer) wird der Vielfalt nachgefragter Artefakte begegnet. Die Suche nach den Artefakten selbst erfolgt gemäß dem Paradigma der facettierten Suche. Allerdings erlaubt eine reine Filterung der Ergebnismenge keine Aussage hinsichtlich der Relevanz der Ergebnisse. Folglich erweitern wir das bekannte Konzept um Möglichkeiten zur Erstellung eines Bankings auf Basis sowohl von Facettenwerten als auch Query-by-Example-{QbE-)Ansätzen. Zusätzlich schlagen wir eine visuelle Form der Anfrageformulierung mittels paralleler Koordinaten vor, die Einblicke in die Charakteristika und Abhängigkeiten der gefundenen Ergebnisse bietet. KW - LFRP-Framework ER - TY - JOUR TI - Geografisches Information Retrieval AU - Graf, Jens AU - Henrich, Andreas AU - Lüdecke, Volker AU - Schlieder, Christoph PY - 2025 SP - 48-56 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106986 LA - deu AB - Im klassischen Infonnation Retrieval ( IR) werden Suchanfragen gestellt, die sich auf den Inhalt von Dokumenten beziehen. Das geografische IR (GIR) bezieht daneben den räumlichen Aspekt ein, mit dem nur solche Webseiten gefunden werden sollen, die einen bestimmten geografischen Kontext besitzen. Dazu müssen bestehende IR-Systeme um entsprechende Komponenten erweitert werden, die den geografischen Kontext einer Webseite erkennen, geografische Anfragen verarbeiten und bei der Ergebnispräsentation die räumlichen Zusammenhänge darstellen können. In diesem Artikel soll ein Überblick iiber die Problemstellungen in diesem Gebiet gegeben und die grundsätzlichen Komponenten eines geografischen lnformation-Retrieval-Systems vorgestellt werden. KW - Geografisches Information Retrieval ER - TY - JOUR TI - Information Retrieval : Concepts and Practical Considerations for Teaching a Rising Topic AU - Blank, Daniel AU - Fuhr, Norbert AU - Henrich, Andreas AU - Mandl, Thomas AU - Rölleke, Thomas AU - Schütze, Hinrich AU - Stein, Benno PY - 2025 SP - 30-41 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106988 LA - eng AB - The last two decades have seen an enormous increase in the amount of information available, in the form of text documents as well as multimedia data such as images, speech and video. As a result, information retrieval (IR) has become a central topic of computer science and related disciplines and is now part of many curricula for bachelor and master programs. In this article, we outline which concepts should be integral part of IR courses depending on the orientation of the degree program (e.g. business vs. research). In addition to the theoretical content of IR courses, we also address practical considerations, based on the authors extensive experience in teaching IR. We comment on the suitability of a number of tools and systems and of different forms of teaching, including e-learning, in the IR classroom. KW - Information Retrieval ER - TY - JOUR TI - Inhaltsbasierte Suche in P2P-Systemen AU - Eisenhardt, Martin AU - Henrich, Andreas AU - Müller, Wolfgang PY - 2025 SP - 5-15 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106989 LA - deu AB - Pcer-to-Peer-Netze ( P2P-Netze) erfreuen sich zunehmender Beliebtheit hei der verteilten und administrationsarmen Verwaltung größerer Dokumentenkollektionen. Ein wichtiges Problem ist dabei die Suche und insbesondere die inhaltsbasierte Suche nach Dokumenten in P2P-Netzen. Der vorliegende Beitrag gibt einen Überblick über entsprechende Ansätze und zeigt interessante Forschungsaspekte auf. KW - P2P-Systeme ER - TY - CPAPER TI - Applying document retrieval techniques in software engineering environments AU - Henrich, Andreas PY - 2025 SP - 240-249 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106990 LA - eng AB - In previous papers we have proposed the integration of content-based document retrieval facilities into the repository underlying a software engineering environment. In the present paper we describe the application of these facilities in typical application areas, such as searching reusable components or identifying project dependencies. Furthermore we describe the integration of the facilities into a concrete software engineering environment. KW - document retrieval techniques ER - TY - CPAPER TI - On the optimization of queries containing regular path expressions AU - Henrich, Andreas AU - Jamin, Stefan PY - 2025 SP - 58-75 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106991 LA - eng AB - One of the main characteristics of object-oriented database management systems is the explicit representation of relationships between objects. A simple example for a query addressing these relationships arises, if we assume the object types Company, and Division with the relationship has_division from Company to Division. In this case a query might ask for the companies which have a division called "strategy". The query might start with the companies and navigate to the divisions which can be reached via the has_division relationship. Finally the query has to check if the name attribute of the Division object is "strategy". Since there is no direct condition for the companies in the query, this query execution will be costly. If we assume that there is a reverse relationship division_of from Division to Company, an alternative execution plan might start with the "strategy" divisions and follow this reverse relationship. In this case an index structure for the name attribute of the Division objects can be exploited to speed up query processing. In the present paper we describe a query optimizer which exploits this potential invertibility of navigational operations in queries. Our approach is based on, but not limited to the context of the ISO and ECMA standard PCTE and P-OQL. KW - regular path expressions ER - TY - CPAPER TI - Comparing the performance of two CBIRS indexing schemes AU - Müller, Wolfgang AU - Robbert, Günter AU - Henrich, Andreas PY - 2025 SP - 9-20 PB - Otto-Friedrich-Universität CY - Bamberg SN - 0277-786X UR - https://fis.uni-bamberg.de/handle/uniba/106994 LA - eng AB - Content based image retrieval (CBIR) as it is known today has to deal with a number of challenges. Quickly summarized, the main challenges are firstly, to bridge the semantic gap between high-level concepts and low-level features using feedback, secondly to provide performance under adverse conditions. High-dimensional spaces, as well as a demanding machine learning task make the right way of indexing an important issue. When indexing multimedia data, most groups opt for extraction of high-dimensional feature vectors from the data, followed by dimensionality reduction like PCA (Principal Components Analysis) or LSI (Latent Semantic Indexing). The resulting vectors are indexed using spatial indexing structures such as kd-trees or R-trees, for example. Other projects, such as MARS and Viper propose the adaptation of text indexing techniques, notably the inverted file. Here, the Viper system is the most direct adaptation of text retrieval techniques to quantized vectors. However, while the Viper query engine provides decent performance together with impressive user-feedback behavior, as well as the possibility for easy integration of long-term learning algorithms, and support for potentially infinite feature vectors, there has been no comparison of vector-based methods and inverted-file-based methods under similar conditions. In this publication, we compare a CBIR query engine that uses inverted files (Bothrops, a rewrite of the Viper query engine based on a relational database), and a CBIR query engine based on LSD (Local Split Decision) trees for spatial indexing using the same feature sets. The Benchathlon initiative works on providing a set of images and ground truth for simulating image queries by example and corresponding user feedback. ·when performing the Benchathlon benchmark on a CBIR system (the System Under Test, SUT), a benchmarking harness connects over internet to the SUT, performing a number of queries using an agreed-upon protocol, the multimedia retrieval markup language (MRML). Using this bench-mark one can measure the quality of retrieval, as well as the overall (speed) performance of the benchmarked system. Our Benchmarks will draw on the Benchathlon's work for documenting the retrieval performance of both inverted file-based and LSD tree based techniques. However, in addition to these results, we will present statistics, that can be obtained only inside the system under test. These statistics will include the number of complex mathematical operations, as well as the amount of data that has to be read from disk during operation of a query. KW - CBIRS indexing schemes ER - TY - CPAPER TI - Efficient content-based P2P image retrieval using peer content descriptions AU - Müller, Wolfgang AU - Eisenhardt, Martin AU - Henrich, Andreas PY - 2025 SP - 57-68 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/107002 LA - eng AB - Peer-to-peer (P2P) networks are overlay networks that connect independent computers (also called nodes or peers). In contrast to client/server solutions, all nodes offer and request services from other peers in a P2P network. P2P networks are very attractive in that they harness the computing power of many common desktop machines and necessitate little administrative overhead. While the resulting computing power is impressive, efficiently looking up data still is the major challenge in P2P networks. Current work comprises fast lookup of one-dimensional values (Distributed Hash Tables, DHT) and retrieval of texts using few keywords. However, the lookup of multimedia data in P2P networks is still attacked by very few groups. In this paper, we present experiments with efficient Content Based Image Retrieval in a P2P environment, thus a P2P-CBIR system. The challenge in such systems is to limit the number of messages sent, and to maximize the usefulness of each peer contacted in the query process. We achieve this by distributing peer data summaries over the network. Obviously, the data summaries have to be compact in order to limit the communication overhead. We propose an CBIR scheme based on a compact peer data summary. This peer data summary relies on cluster frequencies. To obtain the compact representation of a peer's collection, a. global clustering of the data is efficiently calculated in a distributed manner. After that, each peer publishes how many of its images fall into each cluster. These cluster frequencies are then used by the querying peer to contact only those peers that have the largest number of images present in one cluster given by the query. In our paper we further detail the various challenges that have to be met by the designers of such a P2P- CBIR, and we present experiments with varying degree of data replication (duplicates of images) , as well as quality of clustering within the network. KW - P2P ER - TY - CPAPER TI - Company Search : When Documents are only Second Class Citizens AU - Blank, Daniel AU - Boosz, Sebastian AU - Henrich, Andreas PY - 2025 SP - 361-368 PB - Otto-Friedrich-Universität CY - Bamberg T3 - CEUR workshop proceedings SN - 1613-0073 UR - https://fis.uni-bamberg.de/handle/uniba/107003 LA - eng AB - Usually retrieval systems search for documents relevant to a certain query or|more general|information need. However, in some situations the user is not interested in documents but other types of entities. In the paper at hand, we will propose a system searching for companies with expertise in a given eld sketched by a keyword query. The system covers all aspects: determining and representing the expertise of the companies, query processing and retrieval models, as well as query formulation and result presentation. KW - domain specific search solutions KW - expertise retrieval ER - TY - CPAPER TI - Die computergestützte Erschließung und Visualisierung historischer Itinerare AU - Blank, Daniel AU - Henrich, Andreas PY - 2025 SP - 367-371 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/107008 LA - deu AB - - KW - Erschließung KW - historische Itinerare ER - TY - CPAPER TI - Judaica recherchieren : Unterstützung bei der Realisierung forschungsspezifischer Suchlösungen durch die generische Suche von DARIAH-DE AU - Gradl, Tobias AU - Lordick, Harald AU - Henrich, Andreas PY - 2025 SP - 230-235 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/107009 LA - deu AB - - KW - Judaica ER - TY - CPAPER TI - Nutzung und Kombination von Daten aus strukturierten und unstrukturierten Quellen zur Identifikation transnationaler Lebensläufe AU - Gradl, Tobias AU - Henrich, Andreas PY - 2025 SP - 261-265 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/107010 LA - deu AB - - KW - transnationale Lebensläufe ER - TY - CHAP TI - Management von Multimediaprojekten AU - Henrich, Andreas PY - 2025 SP - 298-317 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/107053 LA - deu AB - - KW - Multimediaprojekte ER - TY - CHAP TI - Describing and selecting collections of georeferenced media items in peer-to-peer information retrieval systems AU - Blank, Daniel AU - Henrich, Andreas PY - 2025 SP - 1-20 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/107054 LA - eng AB - The ever-increasing amount of media items on the World Wide Web and on private devices lead to a strong need for adequate indexing and search techniques. Trends such as personal media archives. social networks, mobile devices with huge storage space, and networks with high bandwidth capacities make distributed solutions and in particular Peer-to-Peer (P2P) lnformation Rertrieval (IR) systems attractive. On the other hand, when designing effective media search applications, various search criteria have to be addressed. Hereby, geospatial information is frequently used as well as other criteria, such as text, audio or visual media content, and date and time information. In this chapter the authors outline how collections of georeferenced media items can be indexed and searched in P2P IR systems. They discuss different types of P2P IR systems and focus in detail on an approach based on collection description and selection techniques. This approach tries to adequately describe and select collections of georeferenced media items. Finally, the authors discuss its broad applicability in various application fields. KW - peer-to-peer information retrieval systems ER - TY - CPAPER TI - A Relaxed Algorithm for Similarity Queries Performed with High-Dimensional Access Structures AU - Henrich, Andreas PY - 2025 SP - 376–390 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/107058 LA - eng AB - Similarity queries searching for the most similar objects in a database compared to a given sample object are an important requirement for multimedia databases. However, strict mathematical correctness is not essential in many applications of similarity queries. For example, if we are concerned with image retrieval based on color and texture similarity, slight mathematical inaccuracies will hardly be recognized by the human observer. Therefore we present a relaxed algorithm to perform similarity queries for multidimensional index structures. This algorithm assures only that a user defined portion of the result list containing n elements actually belongs to the n most similar objects — the remaining elements are subject to a best effort semantics. As we will demonstrate, this allows to improve the performance of similarity queries by about 25 % with only marginal inaccuracies in the result. KW - Relaxed Algorithm ER - TY - CPAPER TI - Query processing techniques for partly inaccessible distributed databases AU - Haase, Oliver AU - Henrich, Andreas PY - 2025 SP - 123-125 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/107064 LA - eng AB - - KW - Query processing techniques ER - TY - JOUR TI - VC : Der Virtuelle Campus als Ergänzung zum Hörsaal AU - Henrich, Andreas PY - 2025 SP - 28 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/107377 LA - deu AB - - KW - Virtueller Campus ER - TY - GEN TI - A Structured Literature Review on Traditional Approaches in Current Natural Language Processing AU - Jegan, Robin AU - Henrich, Andreas PY - 2025 PB - arXiv DO - 10.48550/arxiv.2505.12970 UR - https://fis.uni-bamberg.de/handle/uniba/108458 LA - eng ER - TY - CPAPER TI - ADISS : Authority Data Integration Search System AU - Fruth, Leon AU - Gradl, Tobias AU - Henrich, Andreas ED - Gesellschaft für Informatik, Bonn PY - 2025 T2 - Datenbanksysteme für Business, Technologie und Web : Workshopband (BTW 2025) SP - 189-200 PB - Gesellschaft für Informatik CY - Bonn DO - 10.18420/btw2025-123 UR - https://fis.uni-bamberg.de/handle/uniba/108435 LA - eng AB - This paper introduces ADISS, a generic search system designed to integrate heterogeneous authority file providers. Authority data is used to unambiguously identify entities such as persons, places, and organizations. As single data providers do not offer both quantity and quality of data, a combined access to multiple datasets is often required to support real-world use cases. In the context of Digital Humanities this combination improves the resolution of ambiguities in data curation processes. Our work is mainly motivated by two projects that require semi-automatic retrieval, as well as user-centered search scenarios for different authority file providers. Instead of using multiple existing endpoints to access the various datasets, we gather the heterogeneous data and make it accessible via integrated query and result models. In this paper, we present our highly configurable search API, which offers a diverse range of search and filtering options. We show that by its generic and highly configurable nature, our system is adaptable and reusable for a diverse set of use cases and conclude the paper with ideas for further steps and improvements. KW - FAIR KW - Digital Humanities KW - Authority Data KW - Data Curation ER - TY - JOUR TI - Reactive environments AU - Henrich, Andreas PY - 2025 SP - 538-540 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/108043 LA - deu AB - - KW - Reactive environments 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 - CPAPER TI - Geocoding place names from historic route descriptions AU - Blank, Daniel AU - Henrich, Andreas PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106486 LA - eng AB - Many gazetteers contain only a small amount of historic place name information and spelling variants of places. Even more focused historic gazetteers are far from being complete and often specialize on certain geographic regions or particular time periods. On the other hand, there are huge amounts of historic route descriptions, so called itineraries. They represent massive knowledge sources from which historic place names and spelling variants can be deduced. The analysis and geocoding of those route descriptions---often done by hand---is an important task in the humanities. To cope with these problems, we present preliminary ideas how to automatically deduce historic place names and thus travel routes from historic route descriptions. KW - itinerary resolution KW - geocoding KW - gazetteer enrichment ER - TY - CPAPER TI - RDFtex : Knowledge Exchange Between LaTeX-Based Research Publications and Scientific Knowledge Graphs AU - Martin, Leon AU - Henrich, Andreas PY - 2025 SP - 26-38 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture Notes in Computer Science UR - https://fis.uni-bamberg.de/handle/uniba/106305 LA - deu AB - Scientific Knowledge Graphs (SciKGs) aim to integrate scientific knowledge in a machine-readable manner. For populating SciKGs, research publications pose a central source of knowledge. The goal is to represent both contextual information, i.e., metadata, and contentual information, i.e., original contributions like definitions and experimental results, of research publications in SciKGs. However, typical forms of research publications like traditional papers do not provide means of integrating contributions into SciKGs. Furthermore, they do not support making direct use of the rich information SciKGs provide. To tackle this, the present paper proposes RDFtex, a framework enabling (1) the import of contributions represented in SciKGs to facilitate the preparation of Latex-based research publications and (2) the export of original contributions to facilitate their integration into SciKGs. As a proof of concept, an RDFtex implementation is provided. We demonstrate the framework’s functionality using the example of the present paper itself since it was prepared using this implementation. KW - Research data management KW - Data and research infrastructure KW - Latex research publications ER - TY - CPAPER TI - Measuring Similarity of Geographic Regions for Geographic Information Retrieval AU - Henrich, Andreas AU - Lüdecke, Volker PY - 2025 SP - 781-785 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture Notes in Computer Science UR - https://fis.uni-bamberg.de/handle/uniba/106304 LA - eng AB - Representations of geographic regions play a decisive role in geographic information retrieval, where the query is specified by a conceptual part and a geographic part. One aspect is to use them as query footprint which is then applied for the geographic ranking of documents. Users often specify textual descriptions of geographic regions that are not contained in the underlying gazetteer or geographic database. Approaches that automatically determine a geographic footprint for those locations have a strong need for measuring the quality of this footprint, for evaluation as well as for automatical parameter learning. This quality is determined by the ’similarity’ between the footprint and a correct representation of that region. In this paper we introduce three domain-specific points of view for measuring the similarity between representations of geographic regions for geographic information retrieval. For each point of view (strict similarity, visual similarity and similarity in ranking) we introduce a dedicated measure, two of which are novel measures that we propose in this paper. KW - Geographic Information Retrieval ER - TY - CPAPER TI - Lecture Recordings at the University : Analysis and Evaluation of Implementation Possibilities AU - Hirmer, Tobias AU - Henrich, Andreas PY - 2025 SP - 151-163 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture Notes in Computer Science UR - https://fis.uni-bamberg.de/handle/uniba/106293 LA - eng AB - Despite constant criticism on lectures as didactic instruments, they remain the most common form of teaching [11]. Due to the rising need for flexibility in the learning process, lecture recordings are seen as a possibility to capture this demand. This paper presents an empirical study conducted at the University of Bamberg, Germany, and a literature review that evaluated main requirements for a lecture recording solution in the specific blended learning scenario at the faculty of Information Systems and Applied Computer Sciences at the University of Bamberg. Additionally, possible recording and distribution solutions have been analyzed. The results have been captured in a summarizing recommendation for the specific case at the University of Bamberg. KW - Blended learning KW - Lecture recordings KW - Requirements ER - TY - JOUR TI - Baula – die digitale Studienplanungsassistentin an der Universität Bamberg AU - Hirmer, Tobias AU - Ochs, Michaela AU - Henrich, Andreas PY - 2024 JO - Zeitschrift für Hochschulentwicklung VL - 19 IS - 4 SP - 15-36 PB - Forum neue Medien Austria CY - Graz SN - 2219-6994 DO - 10.21240/zfhe/19-4/02 UR - https://fis.uni-bamberg.de/handle/uniba/105590 LA - deu AB - Während die Pandemie die digitale Transformation in der Lehre beschleunigt hat, besteht bei der Studienorganisation noch Nachholbedarf. Diese Innovationslücke sollen digitale Studienassistenten (DSA) füllen. Der vorliegende Beitrag stellt die aktuelle und weitere geplante Entwicklung eines DSA an der Universität Bamberg vor, welcher Studierenden auf Basis heterogener Datenquellen eine zentrale, flexible und umfassende Möglichkeit zur individuellen, eigenständigen Studienplanung bieten soll. Eine erste Evaluation (𝑛𝑛 = 26) zeigt das positive Feedback Studierender und verdeutlicht das Potenzial eines solchen Systems, dessen Entwicklung vor dem Hintergrund organisatorischer Hürden des Hochschulkontexts betrachtet wird. KW - Studienplanung KW - Digitalisierung der Hochschule KW - Studienassistent KW - Webanwendung KW - study planning KW - web application KW - digitalisation of the university KW - study assistant ER - TY - CPAPER TI - Assessing the FAIRness of Software Repositories Using RDF and SHACL AU - Hummel, Tobias AU - Martin, Leon AU - Henrich, Andreas PY - 2024 T2 - Knowledge Graphs in the Age of Language Models and Neuro-Symbolic AI SP - 160-175 PB - IOS Press T3 - Studies on the Semantic Web SN - 978-1-64368-537-3 DO - 10.3233/ssw240014 UR - https://fis.uni-bamberg.de/handle/uniba/104187 LA - eng AB - Purpose: A previous paper proposed the usage of SHACL to assess the FAIRness of software repositories. Following this call to action, this paper introduces and discusses the changes made to QUARE, a SHACL-based tool for validating GitHub repositories against sets of quality criteria, to facilitate this task. Methodology: An operationalization of the abstract FAIR best practices from previous work is devised to enable a FAIRness assessment based on concrete quality criteria. Afterwards, a SHACL shapes graph implementing these constraints is introduced, followed by a discussion of the efficient generation of suitable RDF representations for GitHub repositories. Improvements regarding the usability of QUARE are examined, as well. An evaluation on the FAIRness of 223 GitHub repositories and on the runtime performance of the assessment is conducted. Findings: On average, trending repositories comply with fewer FAIR best practices than repositories expected to be FAIR. However, the latter still exhibit deficiencies, for example, regarding the correct application of semantic versioning. The low average runtime of the FAIRness assessment of respectively 3.50 and 5.73 seconds per repository permits the integration of QUARE in, e.g., CI/CD pipelines. Value: The FAIR principles are often mentioned as a measure to tackle the reproducibility crisis, which continues to have a significant impact on science. To implement these principles in practice, it is crucial to provide tools that facilitate the automated assessment of the FAIRness of software repositories. The enhanced version of QUARE introduced in this paper represents our proposal for this demand. KW - FAIR software KW - GitHub repositories KW - SHACL ER - TY - CPAPER TI - An Approach towards Unsupervised Text Simplification on Paragraph-Level for German Texts AU - Fruth, Leon AU - Jegan, Robin AU - Henrich, Andreas PY - 2024 T2 - Proceedings of the Workshop on DeTermIt! Evaluating Text Difficulty in a Multilingual Context @ LREC-COLING 2024 SP - 77–89 PB - ELRA and ICCL UR - https://fis.uni-bamberg.de/handle/uniba/103945 LA - eng AB - Text simplification as a research field has received attention in recent years for English and other languages, however, German text simplification techniques are lacking thus far. We present an unsupervised simplification approach for German texts using reinforcement learning (self-critical sequence training). Our main contributions are the adaption of an existing method for English, the selection and creation of German corpora for this task and the customization of rewards for particular aspects of the German language. In our paper, we describe our system and an evaluation, including still present issues and problems due to the complexity of the German language, as well as directions for future research. KW - Unsupervised Text Simplification ER - TY - JOUR TI - RDFtex in-depth : knowledge exchange between LATEX-based research publications and Scientific Knowledge Graphs AU - Martin, Leon AU - Henrich, Andreas PY - 2024 SP - 517-535 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/98431 LA - eng AB - For populating Scientific Knowledge Graphs (SciKGs), research publications pose a central information source. However, typical forms of research publications like traditional papers do not provide means of integrating contributions into SciKGs. Furthermore, they do not support making direct use of the rich information SciKGs provide. To tackle this, the present paper proposes RDFtex, a framework enabling (1) the import of contributions represented in SciKGs to facilitate the preparation of Latex-based research publications and (2) the export of original contributions from papers to facilitate their integration into SciKGs. The framework’s functionality is demonstrated using the present paper itself since it was prepared with our proof-of-concept implementation of RDFtex. The runtime of the implementation’s preprocessor was evaluated based on three Latex projects with different numbers of imports and exports. A small user study (N=10) was conducted to obtain initial user feedback. The concept and the process of preparing a Latex-based research publication using RDFtex are discussed thoroughly. RDFtex’s import functionality takes considerably more time than its export functionality. Nevertheless, the entire preprocessing takes only a fraction of the time required to compile the PDF. The users were able to solve all predefined tasks but preferred the import functionality over the export functionality because of its general simplicity. RDFtex is a promising approach to facilitate the move toward knowledge graph augmented research since it only introduces minor differences compared to the preparation of traditional Latex-based publications while narrowing the gap between papers and SciKGs. KW - Research data management KW - Data and research infrastructure KW - Latex-based research publications KW - Scientific Knowledge Graphs ER - TY - JOUR TI - RDFtex in-depth : knowledge exchange between LATEX-based research publications and Scientific Knowledge Graphs AU - Martin, Leon AU - Henrich, Andreas PY - 2024 JO - International journal on digital libraries VL - 25 IS - 3 SP - 517-535 PB - Springer CY - Berlin ; Heidelberg SN - 1432-5012 DO - 10.1007/s00799-023-00370-5 UR - https://fis.uni-bamberg.de/handle/uniba/98430 LA - eng AB - For populating Scientific Knowledge Graphs (SciKGs), research publications pose a central information source. However, typical forms of research publications like traditional papers do not provide means of integrating contributions into SciKGs. Furthermore, they do not support making direct use of the rich information SciKGs provide. To tackle this, the present paper proposes RDFtex, a framework enabling (1) the import of contributions represented in SciKGs to facilitate the preparation of Latex-based research publications and (2) the export of original contributions from papers to facilitate their integration into SciKGs. The framework’s functionality is demonstrated using the present paper itself since it was prepared with our proof-of-concept implementation of RDFtex. The runtime of the implementation’s preprocessor was evaluated based on three Latex projects with different numbers of imports and exports. A small user study (N=10) was conducted to obtain initial user feedback. The concept and the process of preparing a Latex-based research publication using RDFtex are discussed thoroughly. RDFtex’s import functionality takes considerably more time than its export functionality. Nevertheless, the entire preprocessing takes only a fraction of the time required to compile the PDF. The users were able to solve all predefined tasks but preferred the import functionality over the export functionality because of its general simplicity. RDFtex is a promising approach to facilitate the move toward knowledge graph augmented research since it only introduces minor differences compared to the preparation of traditional Latex-based publications while narrowing the gap between papers and SciKGs. KW - Research data management KW - Data and research infrastructure KW - Latex-based research publications KW - Scientific Knowledge Graphs ER - TY - CPAPER TI - Design Principles for a Study Planning Assistant in Higher Education AU - Bartel, Lena AU - Ochs, Michaela AU - Hirmer, Tobias AU - Henrich, Andreas PY - 2024 SP - 1-18 PB - ACM CY - New York UR - https://fis.uni-bamberg.de/handle/uniba/96166 LA - eng AB - Digital study assistants (DSA) aim to support the challenging tasks of searching for relevant information and organizing this data for individual study planning. Although such systems are characterized by complex process flows, their user experience (UX) has rarely been examined adequately. This research comprehensively analyzes the UX of such a system at the University of Bamberg, which includes short-term planning for one semester as well as the distinctive feature of long-term planning beyond one semester. Via remote usability testing including an online questionnaire and involving 26 participants, this study explores students’ interactions with the system and evaluates the impact of the system design on the UX, identifying strengths and weaknesses. The study has revealed that participants faced major challenges related to complexnprocesses resulting from the lack of functional and terminological differentiation between short- and long-term study planning for users. In addition, certain features, including extended search options, were hidden and could not be found immediately. Derived from these findings, we present nine design principles to guide the development of effective DSA and similar support systems. KW - study planning assistant KW - information-intensive decision tasks KW - usability study KW - design principles ER - TY - CPAPER TI - Design Principles for a Study Planning Assistant in Higher Education AU - Bartel, Lena AU - Ochs, Michaela AU - Hirmer, Tobias AU - Henrich, Andreas PY - 2024 T2 - CHIIR '24: Proceedings of the 2024 Conference on Human Information Interaction and Retrieval SP - 243–253 PB - ACM CY - New York SN - 979-8-4007-0434-5 DO - 10.1145/3627508.3638327 UR - https://fis.uni-bamberg.de/handle/uniba/96437 LA - eng AB - Digital study assistants (DSA) aim to support the challenging tasks of searching for relevant information and organizing this data for individual study planning. Although such systems are characterized by complex process flows, their user experience (UX) has rarely been examined adequately. This research comprehensively analyzes the UX of such a system at the University of Bamberg, which includes short-term planning for one semester as well as the distinctive feature of long-term planning beyond one semester. Via remote usability testing including an online questionnaire and involving 26 participants, this study explores students’ interactions with the system and evaluates the impact of the system design on the UX, identifying strengths and weaknesses. The study has revealed that participants faced major challenges related to complexnprocesses resulting from the lack of functional and terminological differentiation between short- and long-term study planning for users. In addition, certain features, including extended search options, were hidden and could not be found immediately. Derived from these findings, we present nine design principles to guide the development of effective DSA and similar support systems. KW - study planning assistant KW - information-intensive decision tasks KW - usability study KW - design principles ER - TY - JOUR TI - Editorial AU - Henrich, Andreas AU - Müller, Wolfgang AU - Seeger, Bernhard AU - Störl, Uta PY - 2024 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie VL - 24 IS - 2, Data Management for Research Data Infrastructures SP - Online First PB - Springer CY - Berlin ; Heidelberg SN - 1610-1995 DO - 10.1007/s13222-024-00482-5 UR - https://fis.uni-bamberg.de/handle/uniba/96235 LA - deu ER - TY - CPAPER TI - A Testbed for Dual-Entity Knowledge Panels AU - Martin, Leon AU - Henrich, Andreas PY - 2024 SP - 231-238 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/95615 LA - eng AB - Currently, web search engines reliably display knowledge panels with summarizing information only when the issued query mentions exactly one entity. That being said, queries mentioning multiple entities are relatively common. The present paper introduces a testbed for developing and evaluating dual-entity knowledge panels. The idea is to populate these novel knowledge panels with an explanation of the relationship between the entities of dual-entity queries in order to serve the users’ information need. To this end, previous research showed the feasibility of finding paths in Wikidata that connect two arbitrary entities. Although such paths provide a rich foundation for elucidating the relationship between two entities, it has not yet been studied how to present them in this context with usability in mind. Hence, this paper showcases a selection of conceivable presentation formats, including graph-based visualizations and LLM-based textual approaches, to promote research in this direction KW - Web Search Engines KW - Knowledge Panels KW - Entity Relationship Explanation KW - Wikidata ER - TY - CPAPER TI - Applied Face Recognition in the Humanities AU - Bullin, Martin AU - Henrich, Andreas PY - 2024 SP - 179-191 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/95619 LA - eng AB - Several research areas in the humanities and social sciences could potentially benefit from state-of-the-art machine learning technologies. In the field of computer vision, there are exemplary face detection (FD) and face recognition (FR) algorithms that could provide support on several levels. We discuss two application scenarios where the deployment of trained networks can be used to generate further information. We show how FD can be used to recognize scene types such as dialogue and speech on non-photographic images such as Emblematica. The second part shows another application scenario where FR can be used to combine or link images in research datasets with authority records by finding personalities from the Wikidata dataset. KW - Face Recognition KW - Face Detection KW - Scene Classification KW - Personality Mapping KW - Personality Recognition ER - TY - CPAPER TI - Baula – die Studienplanungsassistentin AU - Hirmer, Tobias AU - Stöckl, Andreas AU - Struck, Olaf AU - Henrich, Andreas PY - 2024 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-94632 UR - https://fis.uni-bamberg.de/handle/uniba/94632 LA - deu AB - Baula – die digitale Studienplanungsassistentin an der Universität Bamberg – soll Studierende durch ein individualisierbares Dashboard, ein interaktives Modulhandbuch sowie durch Stunden- und Studienverlaufsplanung unterstützen. Erweitert wird dieses Grundsystem durch Zusatzfunktionen wie eine Kompetenzvisualisierung und Modulempfehlungen. Baula adressiert die Herausforderung der komplexen Studienplanung mit leicht zugänglichen Informationen und gezielter Unterstützung. Eine erste Nutzerstudie zeigte sehr gute Usability-Scores, welche die positive Akzeptanz unter Studierenden unterstreicht und das Potenzial eines Studienplanungsassistenten aufzeigt. KW - Digitaler Studienassistent KW - Studienplanung KW - Modulempfehlung KW - Nutzerstudie KW - Unterstützungssystem ER - TY - CHAP TI - Suchwerkzeuge für Sammlungen : Herausforderungen, Trends und Strategien AU - Henrich, Andreas AU - Gradl, Tobias AU - Jegan, Robin PY - 2024 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/95306 LA - deu AB - - KW - Suchwerkzeuge ER - TY - CPAPER TI - Vertical Search Scenarios within a Digital Study Planning Assistant AU - Hirmer, Tobias AU - Ochs, Michaela AU - Henrich, Andreas PY - 2024 SP - 239-246 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/93407 LA - eng AB - The process of study planning can be complex and challenging for students. Due to decentralized information and complex study structures, a demand for individualized assistance arises. Search functionality plays an essential role in providing such support to the students in various ways. Therefore, we introduce the vertical search scenario of a digital study planning assistant (DSPA), which is currently developed, as a promising area of research for the information retrieval community. As a main contribution, we explore four exemplary search scenarios, including major challenges and potential solutions for each. KW - Digital Study Planning Assistant KW - Vertical Search KW - Search Scenarios KW - Recommendation Systems ER - TY - CPAPER TI - Concept and Possible Impacts of a Study Planning Assistant in Higher Education AU - Ochs, Michaela AU - Hirmer, Tobias AU - Henrich, Andreas PY - 2024 SP - 161-165 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92934 LA - eng AB - While digital study assistants (DSA) have been subject to a rising scholarly interest, the university system landscapes which they are to be integrated into are often decentralized and historically grown. In this paper, we introduce a concept of a DSA against the background of the exemplary system landscape of the University of Bamberg, Germany. We outline such a system’s functionality based on a prototypical implementation, touching upon related research and discussing possible broader impact in higher education. We also address the challenges that are faced when integrating a DSA into a university context. KW - study planning KW - higher education KW - digital study planning assistant ER - TY - CHAP TI - Suchwerkzeuge für Sammlungen : Herausforderungen, Trends und Strategien AU - Henrich, Andreas AU - Gradl, Tobias AU - Jegan, Robin PY - 2024 T2 - Forschen in Sammlungen : Dynamiken, Transformationen, Perspektiven SP - 57-77 PB - Wallstein CY - Göttingen SN - 978-3-8353-3573-8 DO - 10.15499/kds-003-004 UR - https://fis.uni-bamberg.de/handle/uniba/93235 LA - deu AB - - KW - Suchwerkzeuge ER - TY - CPAPER TI - Anforderungen an das Forschungsdatenmanagement an einer mittelgroßen Universität und Konzeption einer prototypischen Lösung AU - Jegan, Robin AU - Gradl, Tobias AU - Henrich, Andreas PY - 2024 SP - 274-275 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/93093 LA - deu AB - - KW - Forschungsdatenmanagement ER - TY - CPAPER TI - Die DARIAH-DE Architektur zur forschungsorientierten Föderation von Kollektionen in den Digital Humanities AU - Gradl, Tobias AU - Plutte, Christoph AU - Henrich, Andreas PY - 2024 SP - 1-8 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/93096 LA - deu AB - In diesem Beitrag stellen wir eine neuartige Föderationsarchitektur vor, die auf eine Erfassung und Fall-basierte Zusammenführung von Forschungsdaten nach den individuellen Bedürfnissen von Forschungsprojekten abzielt. Digitale Sammlungen werden zentral verzeichnet, zur Vermeidung von Informationsverlusten jedoch nicht harmonisiert, sondern in Form von Beziehungen auf Schemaebene assoziiert, wodurch die Verwendung einer dynamisch föderierten Datenbasis in breiten und interdisziplinären, wie auch in fachspezifischen Anwendungskontexten ermöglicht werden kann KW - DARIAH-DE Architektur KW - Digital Humanities ER - TY - GEN TI - uni.vers Forschung : das Magazin der Otto-Friedrich-Universität Bamberg AU - Albrecht, Stephan AU - Holl, Kristina AU - Bellendorf, Paul AU - Diederich, Viviane AU - Schreg, Rainer AU - Wittmann, Barbara AU - Redepenning, Marc AU - Scheunpflug, Annette AU - Franz, Julia AU - Kühn, Claudia AU - Keldenich, Georg-Vincent AU - Alzheimer, Heidrun AU - Vinken, Gerhard AU - Brassat, Wolfgang AU - Wagner, Bettina AU - Henrich, Andreas AU - Gradl, Tobias AU - Wings, Oliver ED - Fischbach, Kai PY - 2023 IS - Mai 23, Historisches und kulturelles Erbe – zwischen Bedrohung und Chance = Historical and Cultural Heritage - Between threat and opportunity SP - 1-48 PB - Otto-Friedrich-Universität CY - Bamberg T3 - uni.vers Forschung : das Magazin der Otto-Friedrich-Universität Bamberg SN - 1618-9019 UR - https://fis.uni-bamberg.de/handle/uniba/96243 LA - deu AB - Vor 30 Jahren wurde die Stadt Bamberg in die UNESCO-Welterbeliste aufgenommen – das ist ein Grund zur Freude. Wir gratulieren herzlich mit dieser Ausgabe! Die Bewahrung kulturellen Erbes stellt uns aber auch vor vielfältige Herausforderungen und gibt mitunter Grund zur Sorge. Lesen Sie, wie Bamberger Wissenschaftler*innen sich mit Fragestellungen zum historischen und kulturellen Erbe der Menschheit auseinandersetzen. KW - Kulturerbe KW - Kulturgutsicherung KW - Kulturguterhaltung KW - Kunstgeschichte KW - Archäologie KW - Denkmalpflege ER - TY - CPAPER TI - Exploiting Exif Data to Improve Image Classification Using Convolutional Neural Networks AU - Lederer, Ralf AU - Bullin, Martin Heinrich AU - Henrich, Andreas PY - 2023 T2 - Image Analysis and Processing – ICIAP 2023 22nd International Conference, ICIAP 2023, Udine, Italy, September 11–15, 2023, Proceedings, Part I SP - 475-486 PB - Springer Nature CY - Cham T3 - LNCS SN - 9783031431470 DO - 10.1007/978-3-031-43148-7_40 UR - https://fis.uni-bamberg.de/handle/uniba/94805 LA - eng ER - TY - CHAP TI - Integration von Forschungsdaten : Wie können Forschungsinfrastrukturen helfen? AU - Henrich, Andreas AU - Gradl, Tobias PY - 2023 SP - 749-762 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/91864 LA - deu AB - - KW - Forschungsdaten ER - TY - JOUR TI - Multimedia Information Retrieval AU - Henrich, Andreas PY - 2023 SP - 336-342 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/91871 LA - deu AB - Der Umfang, in dem multimediale Daten verfügbar sind, nimmt ständig zu. Dies gilt für das Internet ebenso wie für die Daten auf dem heimischen PC oder auch auf einem PDA. Eine wesentliche Herausforderung stellt dabei die Suche nach Medienobjekten dar. Der vorliegende Artikel geht auf grundlegende Konzepte und Problemstellungen zur Suche nach Medienobjekten und multimedialen Dokumenten ein und gibt einen Überblick über die für verschiedene Medientypen existierenden Ansätze. KW - Suche KW - Multimedia KW - Suchmaschine KW - Bildsuche KW - search KW - multimedia KW - search engine KW - image retrieval ER - TY - JOUR TI - Die DARIAH-DE-Föderationsarchitektur : Datenintegration im Spannungsfeld forschungsspezifischer und domänenübergreifender Anforderungen AU - Gradl, Tobias AU - Henrich, Andreas PY - 2023 SP - 222-228 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/91872 LA - deu AB - Dieser Beitrag gibt einen Überblick über die Konzepte und Komponenten der DARIAH-DE-Föderationsarchitektur. Nach einer Abgrenzung grundlegender Anforderungen forschungsspezifischer und domänenübergreifender Integration wird zwischen dem Erstellungs- und Verwendungskontext von Forschungsdaten unterschieden und verdeutlicht, wie die Föderationsarchitektur bei deren Modellierung unterstützt. Die Anwendung im Rahmen der generischen Suche zeigt abschließend, wie in dieser Umgebung generische und forschungsspezifische Anfragen unterstützt werden können. KW - Forschungsdaten KW - Integration KW - Föderation KW - generische Suche KW - DARIAH-DE KW - research data KW - integration KW - federation KW - generic search KW - DARIAH-DE ER - TY - CPAPER TI - Resource Description and Selection for Range Query Processing in General Metric Spaces AU - Blank, Daniel AU - Henrich, Andreas PY - 2023 SP - 93-112 PB - Otto-Friedrich-Universität CY - Bamberg T3 - GI-Edition : Proceedings UR - https://fis.uni-bamberg.de/handle/uniba/91874 LA - eng AB - Similarity search in general metric spaces is a key aspect in many application fields. Metric space indexing provides a flexible indexing paradigm and is solely based on the use of a distance metric. No assumption is made about the representation of the database objects. Nowadays, ever-increasing data volumes require large-scale distributed retrieval architectures. Here, local and global indexing schemes are distinguished. In the local indexing approach, every resource administers a set of documents and indexes them locally. Resource descriptions providing the basis for resource selection can be disseminated to avoid all resources being contacted when answering a query. On the other hand, global indexing schemes are based on a single index which is distributed so that every resource is responsible for a certain part of the index. For local indexing, only few exact approaches have been proposed which support general metric space indexing. In this paper, we introduce RS4MI-an exact resource selection approach for general metric space indexing. We compare RS4MI with approaches presented in literature based on a peer-to-peer scenario when searching for similar images by image content. RS4MI can outperform two exact general metric space resource selection schemes in case of range queries. Fewer resources are contacted by RS4MI with-at the same time-more space efficient resource descriptions. KW - Range Query Processing ER - TY - CPAPER TI - Implementierung von IR-Modellen auf Basis spaltenorientierter Datenbanken oder invertierter Listen AU - Stadelmann, Thomas AU - Blank, Daniel AU - Henrich, Andreas PY - 2023 SP - 299-308 PB - Otto-Friedrich-Universität CY - Bamberg T3 - GI-Edition / Proceedings UR - https://fis.uni-bamberg.de/handle/uniba/91879 LA - deu AB - Im Information Retrieval (IR) wird die Anwendung spaltenorientierter Da- tenbankmanagementsysteme (DBMS) diskutiert, um u.a. durch die Trennung von Da- tenhaltung und Suchlogik zusätzliche Flexibilität zu gewinnen. Es stellt sich die Frage, ob sich solche Systeme für den praktischen Einsatz eignen, oder ob deren Einsatz auf das Prototyping beschränkt ist. Ziel dieser Arbeit ist es daher, IR-Systeme auf Basis spaltenorientierter DBMS mit konventionellen IR-Bibliotheken auf Basis invertierter Listen bzgl. ihrer Effektivität und Effizienz unter Verwendung des weit verbreiteten Okapi BM25 Retrieval-Modells zu vergleichen. Dabei werden bisherige Arbeiten insbesondere im Hinblick auf die Anzahl und den Typ der untersuchten Anfragen sowie die durchgängige Verwendung von Kompressionsmöglichkeiten erweitert. KW - IR-Modelle ER - TY - CPAPER TI - Ein Ansatz zur Übertragung von Rangordnungen bei der Suche auf strukturierten Daten AU - Henrich, Andreas AU - Robbert, Günter PY - 2023 SP - 167-186 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/91898 LA - deu AB - Ähnlichkeitsanfragen – oder allgemeiner Anfragen, die eine Rangordnung auf den Ergebnisdokumenten definieren – erlangen in Bereichen wie Multimedia oder Bioinformatik immer mehr an Bedeutung. Insbesondere im Bereich strukturierter Dokumente kommen dabei auch Anfragen vor, bei denen die Kriterien für die Rangordnung über verbundene Objekte definiert wird. So kann z.B. nach Bildern aufgrund einer Bedingung für den umgebenden Text gesucht werden. Steht nun eine Zugriffsstruktur für die Textblöcke bereit, so erscheint es vielversprechend, zunächst mit der Zugriffsstruktur ein Ranking der Textblöcke zu erstellen und dieses dann auf die Bilder zu überragen. Mit der Semantik dieser Übertragung und einem dazu anwendbaren Algorithmus beschäftigt sich die vorliegende Arbeit. Sie umfasst ferner eine Betrachtung verwandter Ansätze sowie die Präsentation experimenteller Ergebnisse. KW - strukturierte Daten ER - TY - CPAPER TI - Ein Plädoyer für Datenflussdiagramme aus der Sicht der Aufwandsschätzung und der agilen Softwareentwicklung AU - Daubner, Bernhard AU - Henrich, Andreas PY - 2023 SP - 191-195 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/91904 LA - deu AB - Die mit der Strukturierten Analyse von DeMarco bekannt gewordenen Datenflussdiagramme zur Modellierung von Softwaresystemen sind mit zunehmender Verbreitung objektorientierter Modellierungstechniken in Vergessenheit geraten. Wir wollen zeigen, dass dieser Diagrammtyp aus der Sicht der Aufwandsschätzung und der agilen Softwareentwicklung Vorteile gegenüber den üblicherweise in der objektorientierten Analyse verwendeten Modellierungstechniken aufweist und auch heute noch sinnvoll eingesetzt werden kann. KW - Datenflussdiagramm ER - TY - CPAPER TI - Integrierte Softwaremessung durch Verankerung der Softwaremaße an Elementen des Vorgehensmodells AU - Daubner, Bernhard AU - Henrich, Andreas AU - Westfechtel, Bernhard PY - 2023 SP - 157-162 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/91912 LA - deu AB - Wird Softwaremessung mit dem Ziel der Prozessverbesserung angewendet, so sollte die Erfassung der Messwerte in geeigneter Weise standardisiert erfolgen, um verschiedene Softwareentwicklungsprojekte vergleichen zu können. Dieser Beitrag stellt einen Ansatz vor, die Softwaremaße an den Elementen des dem Entwicklungsprozess zugrunde liegenden Vorgehensmodells zu verankern. Neu dabei ist, dass wir nicht nur Projektmeilensteine, sondern beliebige im Vorgehensmodell definierte Aktivitäten oder Produkte als Anknüpfungspunkte für die Softwaremaße verwenden. Dadurch ist es möglich, die relevanten Softwaremaße unabhängig von einem konkreten Projekt festzulegen. Über den Projektstrukturplan wird zur Laufzeit des Projekts die Verbindung von den Aktivitäten des Vorgehensmodells zu den tatsächlich zu messenden Entitäten hergestellt. Durch den Einsatz des Projektverwaltungstools Maven kann dann die Erfassung der Softwaremaße automatisiert durchgeführt werden. KW - Integrierte Softwaremessung ER - TY - CPAPER TI - Applied Face Recognition in the Humanities AU - Bullin, Martin AU - Henrich, Andreas PY - 2023 VL - 3630 SP - 179-191 CY - Aachen, Germany SN - 1613-0073 UR - https://fis.uni-bamberg.de/handle/uniba/93457 LA - eng AB - Several research areas in the humanities and social sciences could potentially benefit from state-of-the-art machine learning technologies. In the field of computer vision, there are exemplary face detection (FD) and face recognition (FR) algorithms that could provide support on several levels. We discuss two application scenarios where the deployment of trained networks can be used to generate further information. We show how FD can be used to recognize scene types such as dialogue and speech on non-photographic images such as Emblematica. The second part shows another application scenario where FR can be used to combine or link images in research datasets with authority records by finding personalities from the Wikidata dataset. KW - Face Recognition KW - Face Detection KW - Scene Classification KW - Personality Mapping KW - Personality Recognition ER - TY - CPAPER TI - A Testbed for Dual-Entity Knowledge Panels AU - Martin, Leon AU - Henrich, Andreas PY - 2023 VL - 3630 SP - 231-238 CY - Aachen, Germany SN - 1613-0073 UR - https://fis.uni-bamberg.de/handle/uniba/93459 LA - eng AB - Currently, web search engines reliably display knowledge panels with summarizing information only when the issued query mentions exactly one entity. That being said, queries mentioning multiple entities are relatively common. The present paper introduces a testbed for developing and evaluating dual-entity knowledge panels. The idea is to populate these novel knowledge panels with an explanation of the relationship between the entities of dual-entity queries in order to serve the users’ information need. To this end, previous research showed the feasibility of finding paths in Wikidata that connect two arbitrary entities. Although such paths provide a rich foundation for elucidating the relationship between two entities, it has not yet been studied how to present them in this context with usability in mind. Hence, this paper showcases a selection of conceivable presentation formats, including graph-based visualizations and LLM-based textual approaches, to promote research in this direction KW - Web Search Engines KW - Knowledge Panels KW - Entity Relationship Explanation KW - Wikidata ER - TY - CPAPER TI - Vertical Search Scenarios within a Digital Study Planning Assistant AU - Hirmer, Tobias AU - Ochs, Michaela AU - Henrich, Andreas PY - 2023 VL - 3630 SP - 239-246 CY - Aachen, Germany SN - 1613-0073 UR - https://fis.uni-bamberg.de/handle/uniba/93461 LA - eng AB - The process of study planning can be complex and challenging for students. Due to decentralized information and complex study structures, a demand for individualized assistance arises. Search functionality plays an essential role in providing such support to the students in various ways. Therefore, we introduce the vertical search scenario of a digital study planning assistant (DSPA), which is currently developed, as a promising area of research for the information retrieval community. As a main contribution, we explore four exemplary search scenarios, including major challenges and potential solutions for each. KW - Digital Study Planning Assistant KW - Vertical Search KW - Search Scenarios KW - Recommendation Systems ER - TY - CPAPER TI - Parameters in P2P-IR AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2023 SP - 4-11 PB - Otto-Friedrich-Universität CY - Bamberg T3 - GI-Edition : Proceedings UR - https://fis.uni-bamberg.de/handle/uniba/92263 LA - eng AB - P2P Information Retrieval (P2P-IR) is a challenging and potentially very useful area of research. Its goal is to enable powerful, efficient, massively distributed IR. A large fraction of current research is focused on efficiency. However, we feel that P2P-IR needs to address the complicated combination of indexing structure and networking issues. KW - Parameter ER - TY - CPAPER TI - Probleme und Lösungsansätze für P2P-IR-Systeme AU - Eisenhardt, Martin AU - Henrich, Andreas PY - 2023 SP - 171-175 PB - Otto-Friedrich-Universität CY - Bamberg T3 - GI- Edition : Proceedings SN - 3885793482 UR - https://fis.uni-bamberg.de/handle/uniba/92267 LA - deu AB - Zentralisierte Information Retrieval Systeme gelangen angesichts verteilter Datenbestände an ihre Grenzen. Bisherige Ansätze zum verteilten Information Retrieval lösen einige dieser Probleme, werfen jedoch neue auf. Der dezentrale Peer-to-Peer-Ansatz verspricht, auf grundlegend andere Art und Weise L ösungen aufzuzeigen. KW - P2P-IR-Systeme ER - TY - CPAPER TI - Spektrale Bloom-Filter für Peer-to-Peer Information Retrieval AU - Eisenhardt, Martin AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2023 SP - 44-48 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92268 LA - deu AB - Spektrale Bloomfilter können als Zusammenfassung von Peer-Daten in verteiltem P2P-Retrieval verwendet werden. Dies ermöglicht eine messbar bessere Auswahl derjenigen Peers, an die eine Anfrage gestellt wird, und somit auch eine höhere Effizienz der Anfragebearbeitung. Experimentelle Daten belegen diese Verbesserung des Retrievals in P2P-Netzen. KW - Spektrale Bloom-Filter ER - TY - CPAPER TI - Untersuchung des Einflusses verschiedener Bild- Features und Distanzmaße im inhaltsbasierten P2P Information Retrieval AU - El Allali, Soufyane AU - Blank, Daniel AU - Eisenhardt, Martin AU - Henrich, Andreas AU - Müller, Wolfgang PY - 2023 SP - 382-396 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92293 LA - deu AB - Gegenstand der vorliegenden Arbeit ist die feature-basierte Ähnlichkeitssuche in Bilddatenbeständen, die in einem P2P-Netz verteilt sind. Wir untersuchen dabei die Eignung verschiedener Featuresätze und Distanzmaße für die Nutzung in diesem Szenario. Hierzu beziehen wir uns primär auf PlanetP-artige P2P-Netze und vergleichen die in Abhängigkeit von der Anzahl der kontaktierten Peers erreichten Ergebnisse zunächst mit einem zentralen System mit gleichem Featuresatz und Distanzmaß. Ferner vergleichen wir unser System mit einer Erweiterung, die Indexdaten im P2P-Netz transferiert, sowie mit der Implementierung einer auf CANs basierenden verteilten Indexstruktur. Schließlich evaluieren wir das System auch mittels Relevanzbeurteilungen, die von Testnutzern gegeben wurden. Die Ergebnisse zeigen deutlich die unterschiedliche Eignung verschiedener Featuresätze und Distanzmaße für unser P2P-Szenario auf. KW - Information Retrieval ER - TY - CPAPER TI - Quadtree-based Resource Description Techniques for Spatial Data in Distributed Databases AU - Kufer, Stefan AU - Henrich, Andreas PY - 2023 SP - 445-464 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture notes in informatics UR - https://fis.uni-bamberg.de/handle/uniba/92295 LA - eng AB - In the social media age, content creation and distribution of all sorts of digital media is of growing importance. The variety of media types, devices, and user groups results in the generated media items being stored in a very heterogeneous landscape which can be seen as a large distributed database consisting of personal computers, mobile devices, or web servers of social media sites, demanding for an appropriate overarching search system. Resource selection based on compact resource descriptions allows to e ciently determine resources maintaining relevant media items. Among other aspects, geospatial footprints have to be addressed for an e ective media search. We propose and evaluate quadtree-based techniques to summarize collections of geo-referenced media items in a distributed geographic IR context. Based on these summaries, resource selection decisions are made when searching for media items close to a given geographic location. The quadtree-based approaches are evaluated against previous work. The quadtree-based summaries prove to be very flexible and competetive. KW - Spatial Data ER - TY - CPAPER TI - A Study on the Use of Lecture Recordings in Different Mobile Learning Settings AU - Henrich, Andreas AU - Hub, Adrian AU - Sieber, Stefanie PY - 2023 SP - 159-166 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92365 LA - eng AB - Lecture recordings represent a convenient means to supplement traditional face-to-face lectures and also to establish pure e-learning scenarios. We provide lecture recordings to our students since roughly one decade by now. The recordings are used by traditional students present at the universitys campus as well as students studying a virtual study path who are not on-site. In the last two semesters we have provided the lecture recordings in different complementary formats: a rich proprietary format based on special presentation softwarewell suited for desktop-PCs, notebooks, and netbooksand a standard video format allowing the use on smartphones and other mobile devices. In this paper we present the results of a survey on the usage of the lecture recordingsespecially considering the mobile use of the lecture recordings and the expected future potential. In particular, the two different student groups involved make these results interesting. In our perception the main finding is that mobile learning using lecture recordings is beneficial in specific situations, but not as a dominant learning model. A perspective can be seen in mobile learning as part of a broader ubiquitous learning scenario. KW - Lecture Recordings KW - Mobile Learning KW - User Study KW - MPEG-4 KW - Ubiquitous Learning ER - TY - CPAPER TI - Metadata for Learning Objects : A Cure for Information Overflow? AU - Sieber, Stefanie AU - Henrich, Andreas PY - 2023 SP - 251-255 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92366 LA - eng AB - Information overflow is one of the downsides that digitalisation brought with it. This obvious fact also applies to the field of e-learning. For this reason, concepts and systems supporting learners in handling the enormous amount of information such as personal learning environments have recently gained more attention. It gets more and more important to offer individual capabilities to store, retrieve, and keep track of the different learning contents or learning objects. Of course, metadata can be very useful to organise learning objects. Therefore, we have examined different metadata standards. Based on our insights, we developed a structure of metadata attributes in order to efficiently store learning objects. The results are presented in this paper. Also, thoughts on how to gain this metadata by employing different specific standards are given. To our understanding the use of a reasonable subset of metadata supports tutors and learners at the same time. KW - Learning Objects KW - Learning Context KW - Learning Reference KW - Metadata Standards KW - Dublin Core KW - Learning Object Metadata ER - TY - CPAPER TI - Integrating Industrial Partners into e-Teaching Efforts : a Portal to Support the Initiation of Co-operations AU - Fries, Tobias AU - Henrich, Andreas PY - 2023 SP - 89-96 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92367 LA - eng AB - Learning Management Systems (LMS) form a powerful basis to integrate practitioners and industrial partners into teaching activities. Taking a university-wide LMS as the basis, one critical issue in this respect is to bring together lecturers and industrial partners willing to co-operate in teaching efforts addressing a mutual field of interest. In the present paper we introduce an approach to support the initiation phase of such co-operations between academic and industrial partners based on a web portal filled with content from the existing IT systems maintaining module descriptions, administrative data, and teaching content. We describe the requirements and basic as well as advanced use cases the portal should fulfill and explain the difficulties in integrating the portal into the heterogeneous system landscape at a university using the example of the University of Bamberg. We especially illustrate the different interfaces to be used to harvest information from the connected systems and to automate processes within a connected LMS to set up co-operations to be mediated by the LMS after being established. We also briefly describe the system architecture of the portal and how we tried to make it flexible and maintainable for the usage in different environments. KW - Learning management systems KW - IT infrastructure KW - integration of practitioners KW - practical projects ER - TY - CPAPER TI - Ansätze zur Bestimmung von Locality für deutsche Webseiten AU - Eckstein, Raiko AU - Henrich, Andreas AU - Lüdecke, Volker PY - 2023 SP - 69-76 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92386 LA - deu AB - Das geographische Information Retrieval (GeoIR) berücksichtigt bei Suchanfragen – insb. nach Webseiten – neben dem Inhalt von Dokumenten auch eine räumliche Komponente, um gezielt nach Seiten suchen zu können, die für eine spezifsche Region bedeutsam sind. Dazu müssen GeoIR-Systeme den geographischen Kontext einer Webseite erkennen können und in der Lage sein zu entscheiden, ob eine Seite überhaupt regional-spezifsch (”lokal“) ist oder einen rein informativen Charakter besitzt, der keinen geographischen Bezug besitzt. Im Folgenden werden Ansätze vorgestellt, Merkmale lokaler Seiten zu ermitteln und diese für eine Einteilung von Webseiten in globale und lokale Seiten zu verwenden. Dabei sollen insbesondere die sprachlichen und geographischen Eigenschaften deutscher Webseiten berücksichtigt werden. KW - Webseiten ER - TY - JOUR TI - Digital Humanities studieren : vielfältige Möglichkeiten vom einzelnen Modul bis zum speziellen Studiengang AU - Henrich, Andreas PY - 2023 SP - 56-59 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92392 LA - deu AB - Die Digitalisierung der Geisteswissenschaften schafft für die Forschung und berufliche Tätigkeiten z. B. im Verlagswesen, in der Presse- und Öffentlichkeitsarbeit, in der Stadt- und Regionalplanung oder im Kulturmanagement neue Möglichkeiten und auch Herausforderungen. Für die Universität Bamberg ist es dabei prägend, dass den Studierenden eine Vielzahl von Möglichkeiten geboten wird, sich im Studium auf dieses wichtige Feld vorzubereiten. Die Angebote reichen von der geisteswissenschaftlichen Lehrveranstaltung mit IT-Bezug bis zum Bachelor- und Masterstudium der Angewandten Informatik oder dem seit dem Wintersemester 2010/11 eingeführten Masterstudiengang Computing in the Humanities. KW - Digital Humanities ER - TY - JOUR TI - Erforschung der Weltenwanderer : Über die Nutzung der Wikipedia zur Identifikation grenzüberschreitender Lebensläufe AU - Henrich, Andreas AU - Gradl, Tobias PY - 2023 SP - 46-49 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92393 LA - deu AB - Für die Geschichtswissenschaften können die Datenbestände von Wikipedia und Wikidata wertvoll sein. Dies betrifft etwa die Erforschung von Biografien: War jemand im 19. Jahr-hundert bereits international vernetzt? Die Nationalbiografien geben hierüber mitunter nur unzureichend Auskunft, da die nationale Perspektive überwiegt. Wikipedia und Wikidata liefern wertvolle zusätzliche Informationen. Für die Auswertung der Daten entwickelt die Bamberger Medieninformatik derzeit einen Prototypen, Historiker und Informatiker arbeiten Hand in Hand. KW - Wikipedia ER - TY - JOUR TI - Forschungsinfrastruktur : Auf dem (langen) Weg zu den e-Humanities AU - Henrich, Andreas PY - 2023 SP - 11-15 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92394 LA - deu AB - Es ist eine verlockende Vision: Wenn die in zahlreichen kultur- und geisteswissenschaftlichen Einzelprojekten gesammelten Forschungsdaten miteinander verknüpft werden, könnte dies fachübergreifende Analysen erheblich vereinfachen. Wie sinnvoll der wissenschaftliche Austausch zwischen ganz unterschiedlichen Disziplinen in der Praxis sein kann, zeigt ein Beispiel: Um universelle Trends in der Literatur und Architektur des Mittelalters ableiten zu können, müssen Spezialisten aus mehreren Bereichen zusammenarbeiten - nämlich Bauhistoriker und Philologen. Aber auch innerhalb der Einzeldisziplinen ist ein umfassender Erkenntnisaustausch durchaus vielversprechend. So lassen sich beispielsweise aus mehreren, unabhängig voneinander entstandenen Arbeiten über die Portraitmalerei verschiedener Epochen ggf. neue Erkenntnisse über das Bildverständnis im Zeitverlaufgewinnen. Die Forschungsinitiative DARIAH-DE (Digital Re-search lnfrastructure for the Artsand Humanities) leistet einen wichtigen Beitrag dazu, diese Vision schon bald Realität werden zu lassen. Im Rahmen des umfangreichen Projekts befassen sich Bamberger Informatiker mit der Datenintegration und der Etablierung von übergreifenden Suchdiensten. KW - Forschungsinfrastruktur ER - TY - CPAPER TI - Image Retrieval on Mobile Devices AU - Hub, Adrian AU - Henrich, Andreas PY - 2023 SP - 205-208 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Kasseler Informatikschriften UR - https://fis.uni-bamberg.de/handle/uniba/92419 LA - eng AB - With the growing number of mobile devices and the access possibility to thousands of images from these devices, the users call for efficient image search techniques for mobile devices. Desktop paradigms cannot be used with the smaller screen sizes, hence it is needful to offer alternative searching and browsing strategies, which are adapted for mobile devices. In this paper we describe our ideas how image retrieval on mobile devices can be accomplished. KW - Image Retrieval ER - TY - CPAPER TI - Binary Histograms for Resource Selection in Peer-to-Peer Media Retrieval AU - Blank, Daniel AU - Henrich, Andreas PY - 2023 SP - 183-190 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Kasseler Informatikschriften UR - https://fis.uni-bamberg.de/handle/uniba/92422 LA - eng AB - With the ever increasing amount of media data and collections on the world wide web and on private devices arises a strong need for adequate indexing and search techniques. Trends such as personal media archives, social networks, mobile devices with huge storage space and networks with high bandwidth capacities make distributed solutions and peer-to-peer (P2P) systems attractive. Here, resource selection can be applied to determine a ranking of promising resources based on descriptions of their content. Resources are contacted in ranked order to retrieve appropriate media items w.r.t. a user’s information need. In this paper we apply and adapt resource descriptions in the form of binary histograms and corresponding selection techniques which were designed for low-dimensional spatial data to high-dimensional data in the context of contentbased image retrieval (CBIR). W.r.t. related work in distributed information retrieval, which is also discussed in this paper, a main characteristic of our approach are more space efficient resource descriptions. This makes them applicable for a wider range of application fields apart from the P2P domain. KW - Binary Histograms ER - TY - CPAPER TI - Concept and Possible Impacts of a Study Planning Assistant in Higher Education AU - Ochs, Michaela AU - Hirmer, Tobias AU - Henrich, Andreas PY - 2023 SP - 161-165 PB - IEEE CY - New York SN - 979-8-3503-0491-6 DO - 10.1109/iset58841.2023.00039 UR - https://fis.uni-bamberg.de/handle/uniba/93254 LA - eng AB - While digital study assistants (DSA) have been subject to a rising scholarly interest, the university system landscapes which they are to be integrated into are often decentralized and historically grown. In this paper, we introduce a concept of a DSA against the background of the exemplary system landscape of the University of Bamberg, Germany. We outline such a system’s functionality based on a prototypical implementation, touching upon related research and discussing possible broader impact in higher education. We also address the challenges that are faced when integrating a DSA into a university context. KW - study planning KW - higher education KW - digital study planning assistant ER - TY - CPAPER TI - Course Selection Criteria and Digital Assistance in a Modularized World AU - Hirmer, Tobias AU - Ochs, Michaela AU - Sebastian Rottmann AU - Katherina Past AU - Henrich, Andreas PY - 2023 SP - 4626-4631 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92224 LA - eng AB - The Bologna reform has transformed higher education in Europe leading to more flexibility but also complexity in the structure of study programs. As study planning becomes more challenging for students, supporting this process becomes more relevant in research. This paper’s main contribution is an in-depth exploration of the factors which influence students’ course selection and how they might be addressed by a digital study planning assistant or related systems. To gain insights on how exactly students select their courses, previously collected interviews were reanalyzed, personas of typical student behaviour were extracted and further social aspects of planning were conducted via a group interview. For course selection, 14 aspects and three personas representing different types of selection behaviour were extracted from the interviews. For the group interview, several social factors on the group, community and external level that are related to students’ study planning decisions were collected. Emerging ideas regarding the realization of these factors in a supporting system are presented and may be valuable to similar projects. KW - digital study assistant KW - course selection KW - social influences KW - student support ER - TY - CPAPER TI - POQLMM : A Query Language for Structured Multimedia Documents AU - Henrich, Andreas AU - Robbert, Günter PY - 2023 PB - Otto-Friedrich-Universität CY - Bamberg T3 - CEUR workshop proceedings UR - https://fis.uni-bamberg.de/handle/uniba/92423 LA - eng AB - An important research issue with multimedia databases is the formulation of queries to the database. Here the search for structured multimedia documents or relevant parts of it gains more and more significance. Unfortunately text retrieval on its own is not sufficient for the realization of capable search services in this respect. Therefore, an efficient combination of automatic text retrieval, retrieval in meta data and content based retrieval on structured multimedia documents is needed. In the present paper we propose POQLMM as a general purpose query language for an object oriented multimedia database, which supports the combination of text retrieval, content-based retrieval for other media types and traditional fact retrieval on structured multimedia documents. To this end, we describe the significant features of POQLMM and point out the applicability of POQLMM by means of some query examples. KW - structured multimedia documents KW - query language ER - TY - CPAPER TI - Design-Focused Development of a Course Recommender System for Digital Study Planning AU - Ochs, Michaela AU - Hirmer, Tobias AU - Past, Katherina AU - Henrich, Andreas PY - 2023 SP - 1-12 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/92486 LA - eng AB - In recent years, universities have been offering a rising number of courses, creating not only greater flexibility of choice, but simultaneously a more complex decision-making process for students. Therefore, this paper seeks to identify key aspects that should be considered when designing a course recommender system (CRS). To achieve this, the paper introduces the field of course selection as a decision-making process, and a suitable area of application for a recommender system (RS). Through an analysis of students’ selection criteria and processes, the paper develops requirements and a prototypical implementation, following the double diamond design process model. The implementation is evaluated via think-aloud user tests in its initial iteration. The results of this study indicate that a multidimensional approach shall be taken to optimize the user experience. As an additional contribution, we identify six guidelines for the design of effective CRS. KW - Study Planning KW - Course Recommendation KW - Decision Support KW - Design-Focused ER - TY - CPAPER TI - Design-Focused Development of a Course Recommender System for Digital Study Planning AU - Ochs, Michaela AU - Hirmer, Tobias AU - Past, Katherina AU - Henrich, Andreas PY - 2023 T2 - New Trends in Database and Information Systems : ADBIS 2023 Short Papers, Doctoral Consortium and Workshops: AIDMA, DOING, K-Gals, MADEISD, PeRS, Barcelona, Spain, September 4–7, 2023 ; Proceedings SP - 575-582 PB - Springer Nature Switzerland CY - Cham SN - 978-3-031-42941-5 DO - 10.1007/978-3-031-42941-5_50 UR - https://fis.uni-bamberg.de/handle/uniba/92539 LA - eng AB - In recent years, universities have been offering a rising number of courses, creating not only greater flexibility of choice, but simultaneously a more complex decision-making process for students. Therefore, this paper seeks to identify key aspects that should be considered when designing a course recommender system (CRS). To achieve this, the paper introduces the field of course selection as a decision-making process, and a suitable area of application for a recommender system (RS). Through an analysis of students’ selection criteria and processes, the paper develops requirements and a prototypical implementation, following the double diamond design process model. The implementation is evaluated via think-aloud user tests in its initial iteration. The results of this study indicate that a multidimensional approach shall be taken to optimize the user experience. As an additional contribution, we identify six guidelines for the design of effective CRS. KW - Study Planning KW - Course Recommendation KW - Decision Support KW - Design-Focused ER - TY - CPAPER TI - Course Selection Criteria and Digital Assistance in a Modularized World AU - Hirmer, Tobias AU - Ochs, Michaela AU - Rottmann, Sebastian AU - Past, Katherina AU - Henrich, Andreas PY - 2023 T2 - ICERI2023 Proceedings SP - 4626-4631 PB - IATED CY - Valencia SN - 978-84-09-55942-8 DO - 10.21125/iceri.2023.1150 UR - https://fis.uni-bamberg.de/handle/uniba/92346 LA - eng AB - The Bologna reform has transformed higher education in Europe leading to more flexibility but also complexity in the structure of study programs. As study planning becomes more challenging for students, supporting this process becomes more relevant in research. This paper’s main contribution is an in-depth exploration of the factors which influence students’ course selection and how they might be addressed by a digital study planning assistant or related systems. To gain insights on how exactly students select their courses, previously collected interviews were reanalyzed, personas of typical student behaviour were extracted and further social aspects of planning were conducted via a group interview. For course selection, 14 aspects and three personas representing different types of selection behaviour were extracted from the interviews. For the group interview, several social factors on the group, community and external level that are related to students’ study planning decisions were collected. Emerging ideas regarding the realization of these factors in a supporting system are presented and may be valuable to similar projects. KW - digital study assistant KW - course selection KW - social influences KW - student support ER - TY - CPAPER TI - Studierende und die Studienplanung : Untersuchung von Herausforderungen und Entwicklungsperspektiven eines digitalen Studienplanungsassistenten : Poster AU - Hirmer, Tobias AU - Ochs, Michaela AU - Henrich, Andreas PY - 2023 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-91100 UR - https://fis.uni-bamberg.de/handle/uniba/91100 LA - deu AB - Das Poster stellt ausgewählte Ergebnisse einer Online-Umfrage zur aktuellen Situation der Studien-planung an der Universität Bamberg vor. Dabei werden Herausforderungen für Studierende in der Studienplanung identifiziert und Potentiale und Grenzen zur Adressierung dieser Faktoren durch einen Studienplanungsassistenten vorgestellt. KW - Studienplanung KW - Digitaler Studienassisstent ER - TY - JOUR TI - Heterogene Daten in den Digital Humanities : Eine Architektur zur forschungsorientierten Föderation von Kollektionen AU - Gradl, Tobias AU - Henrich, Andreas AU - Plutte, Christoph PY - 2023 SP - 1-10 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90215 LA - deu AB - Traditionelle Ansätze der Datenintegration basieren zumeist auf einer Harmonisierung heterogener Daten im Rahmen einer übergeordneten, integrativen Datenstruktur wie einem globalen Schema oder einer globalen Ontologie. Der vorliegende Beitrag verdeutlicht die Limitationen eines derartigen Harmonisierungsansatzes für den speziellen Kontext der Digital Humanities und zeigt, wie im Rahmen von DARIAH-DE eine forschungsorientierte und fallbasierte Föderation von Daten erreicht werden kann. Mit Hilfe von Collection, Schema und Crosswalk Registry können durch die Registrierung und Assoziation von Kollektionen und darin verwendeten Datenschemata sowohl übergreifende als auch disziplinspezifische Sichten auf Forschungsdaten geschaffen werden. KW - Datenintegration KW - Digital Humanities KW - Softwaresystem ER - TY - CHAP TI - Die inhaltsbasierte Bildsuche und Bilderschließung : Ansätze und Problemfelder AU - Bullin, Martin Heinrich AU - Henrich, Andreas PY - 2023 SP - 11-34 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90120 LA - deu AB - Bilder zu suchen und zu analysieren erweist sich als deutlich komplexer als die – ohnehin schon schwierige – Suche und Analyse von und in Textdokumenten. Der vorliegende Beitrag gibt in diesem Kontext einen Überblick über Grundlagen und Konzepte der inhaltsbasierten Bildrecherche für Anwender aus den Geistes- und Kulturwissenschaften. Der erste Teil behandelt die Geschichte und Konzepte zum inhaltsbasierten Image Retrieval: typische Anwendungsfälle, Arten von Bildern, die Rolle der Semantik, die Auswirkungen einer Segmentierung, die sensorische bzw. semantische Lücke sowie Standards der Bildrecherche. Der zweite Teil des Beitrags erläutert verschiedene Herangehensweisen zur Bildsuche und Bildanalyse. Beginnend mit klassischen Bildeigenschaften (Farbe, Textur, Form) über Segmentierungsverfahren und lokale Bildeigenschaften bis hin zu Ansätzen des Deep Learning werden verschiedene Verfahren skizziert und in ihren Stärken und Schwächen charakterisiert. Ein Blick auf einige exemplarische Anwendungen rundet den Beitrag ab. KW - Bilder KW - Suche KW - Erschließung ER - TY - CPAPER TI - Studierende und die Studienplanung : Untersuchung von Herausforderungen und Entwicklungsperspektiven eines digitalen Studienplanungsassistenten : Abstract AU - Hirmer, Tobias AU - Ochs, Michaela AU - Henrich, Andreas PY - 2023 SP - 1-2 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/91023 LA - deu AB - Das Poster stellt ausgewählte Ergebnisse einer Online-Umfrage zur aktuellen Situation der Studienplanung an der Universität Bamberg vor. Dabei werden Herausforderungen für Studierende in der Studienplanung identifiziert und Potentiale und Grenzen zur Adressierung dieser Faktoren durch einen Studienplanungsassistenten vorgestellt. KW - Digitaler Studienassistent KW - Studienplanung ER - TY - CPAPER TI - Studierende und die Studienplanung : Untersuchung von Herausforderungen und Entwicklungsperspektiven eines digitalen Studienplanungsassistenten : Abstract AU - Hirmer, Tobias AU - Ochs, Michaela AU - Henrich, Andreas PY - 2023 T2 - GI Edition Proceedings : 21. Fachtagung Bildungstechnologien (DELFI) SP - 291-292 PB - Köllen CY - Bonn SN - 978-3-88579-732-6 DO - 10.18420/delfi2023-60 UR - https://fis.uni-bamberg.de/handle/uniba/91099 LA - deu AB - Das Poster stellt ausgewählte Ergebnisse einer Online-Umfrage zur aktuellen Situation der Studienplanung an der Universität Bamberg vor. Dabei werden Herausforderungen für Studierende in der Studienplanung identifiziert und Potentiale und Grenzen zur Adressierung dieser Faktoren durch einen Studienplanungsassistenten vorgestellt. KW - Digitaler Studienassistent KW - Studienplanung ER - TY - CPAPER TI - Specification and Validation of Quality Criteria for Git Repositories using RDF and SHACL AU - Martin, Leon AU - Henrich, Andreas PY - 2023 PB - Otto-Friedrich-Universität CY - Bamberg T3 - CEUR workshop proceedings UR - https://fis.uni-bamberg.de/handle/uniba/90477 LA - eng AB - As part of quality management, it is important to ensure that Git repositories meet certain quality criteria depending on the type of the respective project. In academia, for instance, repositories of finished research projects should always comprise a readme file providing usage instructions. The range of heterogeneous resources within modern Git repositories leads to a large number of conceivable quality criteria, thus increasing the effort for validating Git repositories against the project type specific quality criteria. At the same time, there is a lack of approaches and tools supporting this validation. Hence, this paper proposes and discusses an approach based on RDF and SHACL for validating a given Git repository against a set of quality criteria defined for its intended project type. QuaRe, a working prototype implementing the approach, is provided and discussed. KW - Applications of knowledge management KW - Representation of Git repositories KW - Git repository quality ER - TY - CPAPER TI - First Thoughts on a Data Lake Architecture for an Open Search Infrastructure AU - Martin, Leon AU - Henrich, Andreas PY - 2023 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90478 LA - eng AB - The goal of the Open Search Foundation is to establish a decentralized open search infrastructure for navigating, searching, and analyzing the internet. Due to the variety of requirements, the need for a robust and extensible architecture arises. This paper gives first thoughts on an architecture for such an infrastructure. As a starting point, a basic architecture for a Data-Lake-based document-centric search engine is proposed. Afterwards, components are added and extended to meet further requirements of the envisaged search infrastructure. KW - Data Lake Architecture ER - TY - CPAPER TI - A novel approach for a reusable federation of research data within the arts and humanities AU - Gradl, Tobias AU - Henrich, Andreas PY - 2023 SP - 1-6 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90490 LA - eng AB - In distributed systems literature the orthogonal but interdependent characteristics of autonomy, distribution and heterogeneity are used to classify distributed systems. From a holistic perspective on the arts and humanities, collections have evolved over decades or centuries from highly autonomous disciplines and institutions and are widely spread, which resulted in heterogeneous perspectives and data models. Despite its negative notion as data integration problem, the term heterogeneity also symbolizes the diversity of research methodologies within the disciplines of the arts and humanities. Resolving heterogeneity hence implies an abstraction from the specifics that are valuable for focused disciplinary and interdisciplinary research projects. Our approach presents a novel concept for data federation in the arts and humanities, which focuses the needs of research projects as well as interdisciplinary and broad use-cases. We especially address the reusability of explicated knowledge on correlations between schemata and digital collections and show where domain experts are required to bridge semantic gaps. KW - data integration KW - data federation KW - digital humanities KW - research data KW - DARIAH-DE ER - TY - CPAPER TI - Description and Selection of Media Archives for Geographic Nearest Neighbor Queries in P2P Networks AU - Henrich, Andreas AU - Blank, Daniel PY - 2023 SP - 22-29 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90494 LA - eng AB - In recent years, there has been a tremendous increase in personal media data stored on people’s PCs, mobile devices, and social media sites in the web. Additionally, people are increasingly collaborating and interacting by sharing and commenting media items. These trends call for retrieval services integrating resources heterogeneous in update frequencies, media types, and size. In this context, peer-to-peer (P2P) technologies offer interesting solutions. When performing a query on certain types of P2P networks, resource selection is important. Compact summaries (i.e. resource descriptions) of each peer’s data collection are known to other peers and used by them in order to determine promising peers for a given query. Summaries have to describe not only textual information, content-based media features, and information about date and time, but also the locations where e.g. images were taken, videos were recorded, or to which a user travelled. The present paper proposes and evaluates different resource selection techniques based on descriptions of the geographic footprint of personal media archives when querying for media items that are geographically close to a given query location. These techniques are not restricted to P2P networks and can e.g. be applied in hybrid index structures or distributed IR systems in general. KW - Resource Selection KW - Peer-to-Peer IR KW - Multimedia IR KW - Summarization ER - TY - CPAPER TI - Explicating knowledge on data models through domain specific languages AU - Gradl, Tobias AU - Henrich, Andreas PY - 2023 SP - 1125-1136 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Gesellschaft für Informatik: GI-Edition / Proceedings UR - https://fis.uni-bamberg.de/handle/uniba/90497 LA - eng AB - Digital artifacts and metadata of the arts and humanities exhibit a wide spectrum of formats, structures and contexts, and hence a high level of heterogeneity. With particular respect of the characteristics of the application domain, we propose a concept on the basis of formal languages, which allows the separation of technical and contextual aspects of data modeling. Based on a developed framework, domain experts explicate knowledge about data in terms of domain specific languages and derived transformation functions. Independent of actual technical aspects of data transformation and integration (e.g. formats, access protocols, schema languages), experts of particular disciplines, collections or research questions can describe and define data models and relations in an extensive, declarative fashion—utilizing custom data models or standards as applicable. As implicit knowledge is continuously explicated within the data models, interpretations external to the generative context of data are facilitated—thereby promoting interoperability. KW - digital humanities KW - descriptive data modeling KW - language applications KW - DARIAH ER - TY - CPAPER TI - Georeferencing Old Large-Scale Maps from a Research on Historical Routes Perspective AU - Blank, Daniel AU - Henrich, Andreas PY - 2023 SP - 9-11 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90499 LA - eng AB - - KW - Map ER - TY - CHAP TI - Data Retrieval AU - Henrich, Andreas AU - Jegan, Robin AU - Gradl, Tobias PY - 2023 SP - 427-450 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90099 LA - deu AB - Die Ermöglichung einer effektiven und effizienten Suche nach und in Forschungsdaten ist eine der wesentlichen Zielsetzungen des Forschungsdatenmanagements. Um Suchfunktionalitäten passend nutzen und bereitstellen zu können, sind verschiedene Aspekte des Data Retrieval relevant. Diese reichen vom Verständnis des einer Suche zugrundeliegenden Informationsbedarfs über Modelle zum inhaltsbasierten Ranking von Datensätzen bis hin zu Frameworks und Beispielsystemen für die Suche. Der vorliegende Beitrag gibt hierzu einen Überblick und eine Einführung. KW - Data Retrieval ER - TY - CPAPER TI - Die kompetenzorientierte Studienplanung : Entwicklung eines Tools zur Unterstützung von (Lehramts-)Studierenden AU - Hirmer, Tobias AU - Heyne, Nora AU - Henrich, Andreas PY - 2023 SP - 121-126 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/59866 LA - deu AB - Durch die Bologna-Reform wurde der Kompetenzorientierung an der Hochschule eine zentralere Rolle eingeräumt. Ein Großteil der Studiengänge wurde modularisiert und daran ausgerichtet, welche Kompetenzen Studierende am Ende ihres Studiums haben sollten. Doch nicht immer sind diese Kompetenzen durch die Struktur eines Studiengangs vollständig determiniert. Gerade in Studiengängen mit umfangreicheren Freiheiten bei der Kurswahl, liegt die zentrale Verantwortung für den Erwerb relevanter Kompetenzen auch bei den Studierenden selbst [Rö12, S. 243]. Dieser Beitrag befasst sich daher mit der Frage, wie man (Lehramts-)Studierende bei der kompetenzorientierten Planung ihres Studiums unterstützen kann. Wir stellen eine Anwendung vor, welche für Studierende erstens die in den Lehrveranstaltungen zu vermittelnden Kompetenzen visualisiert und zweitens die sich aus Wahlentscheidungen ergebenden Konsequenzen für das individuelle Kompetenzprofil nachvollziehbarer macht. Dabei wird kurz der theoretische Rahmen umrissen sowie das Konzept, der aktuelle Stand und die weiteren Entwicklungsschritte vorgestellt. KW - Lehrerbildung KW - Kompetenzen KW - Standards KW - Kompetenzorientierte Studienplanung ER - TY - CPAPER TI - Integrating Access to Authority Data for Improved Interoperability of Research Data in the Digital Humanities AU - Jegan, Robin AU - Fruth, Leon AU - Gradl, Tobias AU - Henrich, Andreas PY - 2023 SP - 829-836 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/59341 LA - eng AB - Authority data is used to unambiguously identify persons, organisations and places. In this paper, a means to integrate access to several providers of authority data into data curation processes is described, which facilitates disambiguation of geographic data. Combined access to general datasets, in our case the Gemeinsame Normdatei (GND), as well as highly specialized datasets, here the Memorial Archives, improves the resolution of ambiguities and particularly benefits use cases of the Digital Humanities. The integration is necessary in order to abstract from technical, syntactical and semantic heterogeneity of the providers. Operations such as querying geographic information and receiving enriched data from different data sources are facilitated. An overview of the goals of the system, related projects and authority data providers are presented, as well as details on the implementation and further steps. KW - authority file KW - geographic data KW - bases data integration ER - TY - CPAPER TI - The LSD tree : spatial access to multidimensional point and non-point objects AU - Henrich, Andreas AU - Six, Hans-Werner AU - Widmayer, Peter PY - 2023 SP - 45-53 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-58916 UR - https://fis.uni-bamberg.de/handle/uniba/58916 LA - eng AB - - KW - Entscheidungsbaum ER - TY - CPAPER TI - Paging binary trees with external balancing AU - Henrich, Andreas AU - Six, Hans-Werner AU - Widmayer, Peter PY - 2023 SP - 260-276 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-58919 UR - https://fis.uni-bamberg.de/handle/uniba/58919 LA - eng AB - - KW - Gewichteter Binärbaum ER - TY - CPAPER TI - Integrating Access to Authority Data for Improved Interoperability of Research Data in the Digital Humanities AU - Jegan, Robin AU - Fruth, Leon AU - Gradl, Tobias AU - Henrich, Andreas PY - 2023 T2 - Datenbanksysteme für Business, Technologie und Web (BTW 2023) : 06.-10. März 2023 in Dresden, Deutschland SP - 829-836 PB - Gesellschaft für Informatik e.V. SN - 978-3-88579-725-8 DO - 10.18420/BTW2023-54 UR - https://fis.uni-bamberg.de/handle/uniba/59235 LA - eng AB - Authority data is used to unambiguously identify persons, organisations and places. In this paper, a means to integrate access to several providers of authority data into data curation processes is described, which facilitates disambiguation of geographic data. Combined access to general datasets, in our case the Gemeinsame Normdatei (GND), as well as highly specialized datasets, here the Memorial Archives, improves the resolution of ambiguities and particularly benefits use cases of the Digital Humanities. The integration is necessary in order to abstract from technical, syntactical and semantic heterogeneity of the providers. Operations such as querying geographic information and receiving enriched data from different data sources are facilitated. An overview of the goals of the system, related projects and authority data providers are presented, as well as details on the implementation and further steps. KW - authority file KW - geographic data KW - bases data integration ER - TY - CPAPER TI - Exploiting Geodata to Improve Image Recognition with Deep Learning AU - Arbinger, Christian AU - Bullin, Martin AU - Henrich, Andreas PY - 2022 T2 - WWW '22 Companion : Companion Proceedings of the Web Conference 2022 SP - 648-655 PB - Association for Computing Machinery CY - New York, NY DO - 10.1145/3487553.3524645 UR - https://fis.uni-bamberg.de/handle/uniba/112620 LA - eng ER - TY - CPAPER TI - Specification and Validation of Quality Criteria for Git Repositories using RDF and SHACL AU - Martin, Leon AU - Henrich, Andreas PY - 2022 T2 - LWDA 2022 Lernen, Wissen, Daten, Analysen 2022 : Proceedings of the LWDA 2022 Workshops: FGWM, FGKD, and FGDB SP - 124-135 PB - RWTH Aachen CY - Aachen, Germany T3 - CEUR workshop proceedings UR - https://fis.uni-bamberg.de/handle/uniba/89863 LA - eng AB - As part of quality management, it is important to ensure that Git repositories meet certain quality criteria depending on the type of the respective project. In academia, for instance, repositories of finished research projects should always comprise a readme file providing usage instructions. The range of heterogeneous resources within modern Git repositories leads to a large number of conceivable quality criteria, thus increasing the effort for validating Git repositories against the project type specific quality criteria. At the same time, there is a lack of approaches and tools supporting this validation. Hence, this paper proposes and discusses an approach based on RDF and SHACL for validating a given Git repository against a set of quality criteria defined for its intended project type. QuaRe, a working prototype implementing the approach, is provided and discussed. KW - Applications of knowledge management KW - Representation of Git repositories KW - Git repository quality ER - TY - CPAPER TI - RDFtex : Knowledge Exchange Between LaTeX-Based Research Publications and Scientific Knowledge Graphs AU - Martin, Leon AU - Henrich, Andreas PY - 2022 T2 - Linking Theory and Practice of Digital Libraries : 26th International Conference on Theory and Practice of Digital Libraries, TPDL 2022, Padua, Italy, September 20–23, 2022, Proceedings SP - 26-38 PB - Springer CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-031-16801-7 DO - 10.1007/978-3-031-16802-4_3 UR - https://fis.uni-bamberg.de/handle/uniba/56997 LA - deu AB - Scientific Knowledge Graphs (SciKGs) aim to integrate scientific knowledge in a machine-readable manner. For populating SciKGs, research publications pose a central source of knowledge. The goal is to represent both contextual information, i.e., metadata, and contentual information, i.e., original contributions like definitions and experimental results, of research publications in SciKGs. However, typical forms of research publications like traditional papers do not provide means of integrating contributions into SciKGs. Furthermore, they do not support making direct use of the rich information SciKGs provide. To tackle this, the present paper proposes RDFtex, a framework enabling (1) the import of contributions represented in SciKGs to facilitate the preparation of Latex-based research publications and (2) the export of original contributions to facilitate their integration into SciKGs. As a proof of concept, an RDFtex implementation is provided. We demonstrate the framework’s functionality using the example of the present paper itself since it was prepared using this implementation. KW - Research data management KW - Data and research infrastructure KW - Latex research publications 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 - CPAPER TI - Requirements and Prototypical Implementation of a Study Planning Assistant in CS Programs AU - Hirmer, Tobias AU - Etschmann, Jana AU - Henrich, Andreas PY - 2022 SP - 281-285 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/55522 LA - eng AB - Planning and organizing their studies by selecting modules and the order in which to attend them is an important challenge for students. Bachelor students, in particular, usually perceive this as an obstacle [1]. However, universities rarely provide tools to support students in this decision-making process. Using the method of qualitative interviews, this paper elicits requirements for a digital tool that supports the process of study planning for computer science students at the University of Bamberg, Germany. The resulting requirements are used as a foundation for a prototypical implementation. Based on this prototype, the feasibility of the collected requirements is analyzed and potential further developments are discussed. KW - study planning KW - requirements KW - web application KW - higher education KW - computer science programs ER - TY - CPAPER TI - Requirements and Prototypical Implementation of a Study Planning Assistant in CS Programs AU - Hirmer, Tobias AU - Etschmann, Jana AU - Henrich, Andreas PY - 2022 SP - 281-285 PB - IEEE CY - New York SN - 978-1-6654-8467-1 DO - 10.1109/ISET55194.2022.00066 UR - https://fis.uni-bamberg.de/handle/uniba/55550 LA - eng AB - Planning and organizing their studies by selecting modules and the order in which to attend them is an important challenge for students. Bachelor students, in particular, usually perceive this as an obstacle [1]. However, universities rarely provide tools to support students in this decision-making process. Using the method of qualitative interviews, this paper elicits requirements for a digital tool that supports the process of study planning for computer science students at the University of Bamberg, Germany. The resulting requirements are used as a foundation for a prototypical implementation. Based on this prototype, the feasibility of the collected requirements is analyzed and potential further developments are discussed. KW - study planning KW - requirements KW - web application KW - higher education KW - computer science programs ER - TY - CPAPER TI - Search and evaluation methods for class level information retrieval : extended use and evaluation of methods applied in expertise retrieval AU - Henrich, Andreas AU - Wegmann, Markus PY - 2021 T2 - SAC '21 : Proceedings of the 36th Annual ACM Symposium on Applied Computing SP - 681-684 PB - ACM SN - 978-1-4503-8104-8 DO - 10.1145/3412841.3442092 UR - https://fis.uni-bamberg.de/handle/uniba/111297 LA - eng ER - TY - CPAPER TI - Requirements for an Open Search Infrastructure from the Perspective of a Vertical Provider AU - Martin, Leon AU - Engl, Felix AU - Henrich, Andreas PY - 2021 PB - Zenodo DO - 10.5281/ZENODO.6139647 UR - https://fis.uni-bamberg.de/handle/uniba/89861 LA - eng ER - TY - CPAPER TI - An Architecture for the Automated Assessment of Web Programming Tasks AU - Aubele, Lara AU - Martin, Leon AU - Hirmer, Tobias AU - Henrich, Andreas PY - 2021 T2 - Proceedings of the Fifth Workshop "Automatische Bewertung von Programmieraufgaben" (ABP 2021),virtual event, October 28-29, 2021 SP - 11-18 DO - 10.18420/ABP2021-2 UR - https://fis.uni-bamberg.de/handle/uniba/89862 LA - eng ER - TY - CPAPER TI - Die kompetenzorientierte Studienplanung : Entwicklung eines Tools zur Unterstützung von (Lehramts-)Studierenden AU - Hirmer, Tobias AU - Heyne, Nora AU - Henrich, Andreas PY - 2021 T2 - DELFI 2021. Die 19. Fachtagung Bildungstechnologien der Gesellschaft für Informatik e.V. SP - 121-126 PB - Köllen CY - Bonn SN - 978-3-88579-710-4 UR - https://fis.uni-bamberg.de/handle/uniba/51667 LA - deu AB - Durch die Bologna-Reform wurde der Kompetenzorientierung an der Hochschule eine zentralere Rolle eingeräumt. Ein Großteil der Studiengänge wurde modularisiert und daran ausgerichtet, welche Kompetenzen Studierende am Ende ihres Studiums haben sollten. Doch nicht immer sind diese Kompetenzen durch die Struktur eines Studiengangs vollständig determiniert. Gerade in Studiengängen mit umfangreicheren Freiheiten bei der Kurswahl, liegt die zentrale Verantwortung für den Erwerb relevanter Kompetenzen auch bei den Studierenden selbst [Rö12, S. 243]. Dieser Beitrag befasst sich daher mit der Frage, wie man (Lehramts-)Studierende bei der kompetenzorientierten Planung ihres Studiums unterstützen kann. Wir stellen eine Anwendung vor, welche für Studierende erstens die in den Lehrveranstaltungen zu vermittelnden Kompetenzen visualisiert und zweitens die sich aus Wahlentscheidungen ergebenden Konsequenzen für das individuelle Kompetenzprofil nachvollziehbarer macht. Dabei wird kurz der theoretische Rahmen umrissen sowie das Konzept, der aktuelle Stand und die weiteren Entwicklungsschritte vorgestellt. KW - Lehrerbildung KW - Kompetenzen KW - Standards KW - Kompetenzorientierte Studienplanung ER - TY - CHAP TI - Integration von Forschungsdaten : Wie können Forschungsinfrastrukturen helfen? AU - Henrich, Andreas AU - Gradl, Tobias PY - 2021 T2 - Innovation in der Bauwirtschaft SP - 749-762 PB - De Gruyter CY - Berlin, Boston SN - 978-3-11-053891-5 DO - 10.1515/9783110538915-039 UR - https://fis.uni-bamberg.de/handle/uniba/51560 LA - deu AB - - KW - Forschungsdaten ER - TY - CHAP TI - Data Retrieval AU - Henrich, Andreas AU - Jegan, Robin AU - Gradl, Tobias PY - 2021 T2 - Praxishandbuch Forschungsdatenmanagement SP - 427-450 PB - De Gruyter Saur CY - Berlin SN - 978-3-11-065365-6 DO - 10.1515/9783110657807-024 UR - https://fis.uni-bamberg.de/handle/uniba/49405 LA - deu AB - Die Ermöglichung einer effektiven und effizienten Suche nach und in Forschungsdaten ist eine der wesentlichen Zielsetzungen des Forschungsdatenmanagements. Um Suchfunktionalitäten passend nutzen und bereitstellen zu können, sind verschiedene Aspekte des Data Retrieval relevant. Diese reichen vom Verständnis des einer Suche zugrundeliegenden Informationsbedarfs über Modelle zum inhaltsbasierten Ranking von Datensätzen bis hin zu Frameworks und Beispielsystemen für die Suche. Der vorliegende Beitrag gibt hierzu einen Überblick und eine Einführung. KW - Data Retrieval ER - TY - CPAPER TI - First Thoughts on a Data Lake Architecture for an Open Search Infrastructure AU - Martin, Leon AU - Henrich, Andreas PY - 2020 PB - Zenodo DO - 10.5281/ZENODO.4593427 UR - https://fis.uni-bamberg.de/handle/uniba/49716 LA - eng AB - The goal of the Open Search Foundation is to establish a decentralized open search infrastructure for navigating, searching, and analyzing the internet. Due to the variety of requirements, the need for a robust and extensible architecture arises. This paper gives first thoughts on an architecture for such an infrastructure. As a starting point, a basic architecture for a Data-Lake-based document-centric search engine is proposed. Afterwards, components are added and extended to meet further requirements of the envisaged search infrastructure. KW - Data Lake Architecture ER - TY - CHAP TI - Die inhaltsbasierte Bildsuche und Bilderschließung : Ansätze und Problemfelder AU - Bullin, Martin Heinrich AU - Henrich, Andreas PY - 2020 T2 - Bilddaten in den Digitalen Geisteswissenschaften SP - 11-34 PB - Harrassowitz Verlag CY - Wiesbaden T3 - Episteme in Bewegung: Wissenstransfer von der Alten Welt bis in die Frühe Neuzeit SN - 978-3-447-11460-8 DO - 10.13173/9783447114608.011 UR - https://fis.uni-bamberg.de/handle/uniba/49234 LA - deu AB - Bilder zu suchen und zu analysieren erweist sich als deutlich komplexer als die – ohnehin schon schwierige – Suche und Analyse von und in Textdokumenten. Der vorliegende Beitrag gibt in diesem Kontext einen Überblick über Grundlagen und Konzepte der inhaltsbasierten Bildrecherche für Anwender aus den Geistes- und Kulturwissenschaften. Der erste Teil behandelt die Geschichte und Konzepte zum inhaltsbasierten Image Retrieval: typische Anwendungsfälle, Arten von Bildern, die Rolle der Semantik, die Auswirkungen einer Segmentierung, die sensorische bzw. semantische Lücke sowie Standards der Bildrecherche. Der zweite Teil des Beitrags erläutert verschiedene Herangehensweisen zur Bildsuche und Bildanalyse. Beginnend mit klassischen Bildeigenschaften (Farbe, Textur, Form) über Segmentierungsverfahren und lokale Bildeigenschaften bis hin zu Ansätzen des Deep Learning werden verschiedene Verfahren skizziert und in ihren Stärken und Schwächen charakterisiert. Ein Blick auf einige exemplarische Anwendungen rundet den Beitrag ab. KW - Bilder KW - Suche KW - Erschließung 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 - Anforderungen an das Forschungsdatenmanagement an einer mittelgroßen Universität und Konzeption einer prototypischen Lösung AU - Jegan, Robin AU - Gradl, Tobias AU - Henrich, Andreas PY - 2020 T2 - DHd 2020 Spielräume : Digital Humanities zwischen Modellierung und Interpretation ; Konferenzabstracts SP - 274-275 SN - 978-3-945437-07-0 DO - 10.5281/zenodo.3666690 UR - https://fis.uni-bamberg.de/handle/uniba/47806 LA - deu AB - - KW - Forschungsdatenmanagement ER - TY - CPAPER TI - Lecture Recordings at the University : Analysis and Evaluation of Implementation Possibilities AU - Hirmer, Tobias AU - Henrich, Andreas PY - 2019 T2 - Blended Learning: Educational Innovation for Personalized Learning : 12th International Conference, ICBL 2019, Hradec Kralove, Czech Republic, July 2–4, 2019, Proceedings SP - 151-163 PB - Springer CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-030-21561-3 DO - 10.1007/978-3-030-21562-0_13 UR - https://fis.uni-bamberg.de/handle/uniba/46828 LA - eng AB - Despite constant criticism on lectures as didactic instruments, they remain the most common form of teaching [11]. Due to the rising need for flexibility in the learning process, lecture recordings are seen as a possibility to capture this demand. This paper presents an empirical study conducted at the University of Bamberg, Germany, and a literature review that evaluated main requirements for a lecture recording solution in the specific blended learning scenario at the faculty of Information Systems and Applied Computer Sciences at the University of Bamberg. Additionally, possible recording and distribution solutions have been analyzed. The results have been captured in a summarizing recommendation for the specific case at the University of Bamberg. KW - Blended learning KW - Lecture recordings KW - Requirements ER - TY - CHAP TI - Digital Technologies in Heritage Conservation. Methods of Teaching and Learning This M.Sc. Degree, Unique in Germany AU - Hess, Mona AU - Schlieder, Christoph AU - Troi, Alexandra AU - Huth, Olaf AU - Jagfeld, Matthias AU - Hindmarch, John AU - Henrich, Andreas PY - 2019 T2 - Proceedings of the 1st International and Interdisciplinary Conference on Digital Environments for Education, Arts and Heritage : EARTH 2018 SP - 53-63 PB - Springer CY - Cham T3 - Advances in Intelligent Systems and Computing SN - 978-3-030-12240-9 DO - 10.1007/978-3-030-12240-9_7 UR - https://fis.uni-bamberg.de/handle/uniba/45697 LA - eng AB - A new master's degree commenced in 2017 at the University of Bamberg. The purpose of the M.Sc. Digital Technologies in Heritage Conservation is to impart theoretical and practical knowledge and develop competence in critical assessment and object-oriented solutions. The aims, curriculum and methods of teaching will be discussed in this paper. ER - TY - CHAP TI - Digital Technologies in Heritage Conservation : Methods of Teaching and Learning This M.Sc. Degree, Unique in Germany AU - Hess, Mona AU - Schlieder, Christoph AU - Troi, Alexandra AU - Huth, Olaf AU - Jagfeld, Matthias AU - Hindmarch, John AU - Henrich, Andreas PY - 2019 PB - opus CY - Bamberg DO - 10.20378/irbo-54902 UR - https://fis.uni-bamberg.de/handle/uniba/45694 LA - eng AB - A new master's degree commenced in 2017 at the University of Bamberg. The purpose of the M.Sc. Digital Technologies in Heritage Conservation is to impart theoretical and practical knowledge and develop competence in critical assessment and object-oriented solutions. The aims, curriculum and methods of teaching will be discussed in this paper. ER - TY - CPAPER TI - Nutzung und Kombination von Daten aus strukturierten und unstrukturierten Quellen zur Identifikation transnationaler Lebensläufe AU - Gradl, Tobias AU - Henrich, Andreas PY - 2017 T2 - DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016 SP - 261-265 PB - nisaba Verlag CY - Duisburg ET - 2. überarbeitete und erweiterte Ausgabe SN - 978-3-941379-06-0 DO - 10.5281/zenodo.3679331 UR - https://fis.uni-bamberg.de/handle/uniba/107007 LA - deu AB - - KW - transnationale Lebensläufe ER - TY - CPAPER TI - Judaica recherchieren : Unterstützung bei der Realisierung forschungsspezifischer Suchlösungen durch die generische Suche von DARIAH-DE AU - Gradl, Tobias AU - Lordick, Harald AU - Henrich, Andreas PY - 2017 T2 - DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016 SP - 230-235 PB - nisaba Verlag CY - Duisburg ET - 2. überarbeitete und erweiterte Ausgabe SN - 978-3-941379-06-0 DO - 10.5281/zenodo.3679331 UR - https://fis.uni-bamberg.de/handle/uniba/107006 LA - deu AB - - KW - Judaica ER - TY - CPAPER TI - Die computergestützte Erschließung und Visualisierung historischer Itinerare AU - Blank, Daniel AU - Henrich, Andreas PY - 2017 T2 - DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016 SP - 367-371 PB - nisaba Verlag CY - Duisburg ET - 2. überarbeitete und erweiterte Ausgabe SN - 978-3-941379-06-0 DO - 10.5281/zenodo.3679331 UR - https://fis.uni-bamberg.de/handle/uniba/107005 LA - deu AB - - KW - Erschließung KW - historische Itinerare ER - TY - CPAPER TI - Explicating knowledge on data models through domain specific languages AU - Gradl, Tobias AU - Henrich, Andreas PY - 2017 T2 - Informatik 2017 : 25.- 29. September 2017 Chemnitz, Deutschland, Proceedings SP - 1125-1136 CY - Bonn T3 - Gesellschaft für Informatik: GI-Edition / Proceedings SN - 978-3-88579-669-5 DO - 10.18420/in2017_114 UR - https://fis.uni-bamberg.de/handle/uniba/43161 LA - eng AB - Digital artifacts and metadata of the arts and humanities exhibit a wide spectrum of formats, structures and contexts, and hence a high level of heterogeneity. With particular respect of the characteristics of the application domain, we propose a concept on the basis of formal languages, which allows the separation of technical and contextual aspects of data modeling. Based on a developed framework, domain experts explicate knowledge about data in terms of domain specific languages and derived transformation functions. Independent of actual technical aspects of data transformation and integration (e.g. formats, access protocols, schema languages), experts of particular disciplines, collections or research questions can describe and define data models and relations in an extensive, declarative fashion—utilizing custom data models or standards as applicable. As implicit knowledge is continuously explicated within the data models, interpretations external to the generative context of data are facilitated—thereby promoting interoperability. KW - digital humanities KW - descriptive data modeling KW - language applications KW - DARIAH ER - TY - CPAPER TI - Georeferencing Old Large-Scale Maps from a Research on Historical Routes Perspective AU - Blank, Daniel AU - Henrich, Andreas PY - 2017 T2 - Proceedings of the 2nd International Workshop on Exploring Old Maps SP - 9-11 CY - Würzburg UR - https://fis.uni-bamberg.de/handle/uniba/43012 LA - eng AB - - KW - Map ER - TY - CPAPER TI - Georeferencing River Networks Using Spatial Reasoning AU - Wolter, Diedrich AU - Blank, Daniel AU - Henrich, Andreas PY - 2017 T2 - GIR'17 : Proceedings of the 11th Workshop on Geographic Information Retrieval PB - ACM CY - New York, NY, USA SN - 978-1-4503-5338-0 DO - 10.1145/3155902.3155907 UR - https://fis.uni-bamberg.de/handle/uniba/43007 LA - eng AB - This paper is concerned with automatic georeferencing of river networks from raster images such as aerial photos or maps. Determining reasonable assignments between a given network of rivers derived from a textual description and an image is subject to high combinatorial complexity and uncertainty. We investigate the application of spatial reasoning in automatic georeferencing. KW - georeferencing river networks KW - spatial reasoning KW - GIS ER - TY - CPAPER TI - Quadtree-based Resource Description Techniques for Spatial Data in Distributed Databases AU - Kufer, Stefan AU - Henrich, Andreas PY - 2017 T2 - Datenbanksysteme für Business, Technologie und Web (BTW 2017) : 17. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssyteme" (DBIS) : 06.-10.03.2017 in Stuttgart, Deutschland SP - 445-464 PB - Gesellschaft für Informatik e.V. CY - Bonn T3 - Lecture notes in informatics SN - 978-3-88579-659-6 UR - https://fis.uni-bamberg.de/handle/uniba/41922 LA - eng AB - In the social media age, content creation and distribution of all sorts of digital media is of growing importance. The variety of media types, devices, and user groups results in the generated media items being stored in a very heterogeneous landscape which can be seen as a large distributed database consisting of personal computers, mobile devices, or web servers of social media sites, demanding for an appropriate overarching search system. Resource selection based on compact resource descriptions allows to e ciently determine resources maintaining relevant media items. Among other aspects, geospatial footprints have to be addressed for an e ective media search. We propose and evaluate quadtree-based techniques to summarize collections of geo-referenced media items in a distributed geographic IR context. Based on these summaries, resource selection decisions are made when searching for media items close to a given geographic location. The quadtree-based approaches are evaluated against previous work. The quadtree-based summaries prove to be very flexible and competetive. KW - Spatial Data ER - TY - CPAPER TI - A depth-first branch-and-bound algorithm for geocoding historic itinerary tables AU - Blank, Daniel AU - Henrich, Andreas PY - 2016 SP - 1-10 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106443 LA - eng AB - The work in this paper is motivated from two different perspectives: First, gazetteers as an important data source for Geographic Information Retrieval (GIR) applications often lack historic place name information. More focused historic gazetteers are a far cry from being complete and often specialize only on certain geographic regions or time periods. Second, research on historic route descriptions---so called itineraries---is an important task in many research disciplines such as geography, linguistics, history, religion, or even medicine. This research on historic itineraries is characterized by manual, time-consuming work with only minimalistic IT support through gazetteers and map services. We address both perspectives and present a depth-first branch-and-bound (DFBnB) algorithm for deducing historic place names and thus the stops of ancient travel routes from itinerary tables. Multiple phonetic and character-based string distances are evaluated when resolving parts of an itinerary first published in 1563. KW - itinerary resolution KW - historic place name disambiguation KW - geocoding KW - depth-first branch-and-bound KW - gazetteer enrichment ER - TY - CPAPER TI - Assessing Interestingness and Importance of Information Retrieval Course Topics in a Course for Three Different Target Groups AU - Blank, Daniel AU - Henrich, Andreas PY - 2016 T2 - CERI '16 : Proceedings of the 4th Spanish Conference on Information Retrieval IS - 20 SP - 1-8 PB - ACM CY - New York, NY, USA SN - 978-1-4503-4141-7 DO - 10.1145/2934732.2934751 UR - https://fis.uni-bamberg.de/handle/uniba/43050 LA - eng AB - Teaching an information retrieval (IR) course for three different target groups is challenging. These target groups are i) resident students at the University of Bamberg, Germany ii) remote full-time students from other Bavarian universities, and iii) remote but part-time students from all parts of Germany which usually study the course besides their day-to-day work relationship. As a consequence, we have participants with heterogeneous previous knowledge and potentially different expectations with respect to the course content. In this paper we will only briefly describe the didactic aspects and challenges of the course. The clear focus of the paper lies on an in-depth quantitative evaluation how various IR topics presented in the lectures and tutorials fit the needs of the different target groups. We evaluate interestingness and importance of the course topics according to the students' impressions. The goal of the evaluation is to get hints for future refinements of IR course content---in general but also with respect to the needs of different target groups. KW - Teaching Information Retrieval KW - Evaluation of Course Content KW - Distance Learning ER - TY - CPAPER TI - A depth-first branch-and-bound algorithm for geocoding historic itinerary tables AU - Blank, Daniel AU - Henrich, Andreas PY - 2016 T2 - GIR '16 : Proceedings of the 10th Workshop on Geographic Information Retrieval IS - 3 SP - 1-10 PB - ACM CY - New York, NY SN - 978-1-4503-4588-0 DO - 10.1145/3003464.3003467 UR - https://fis.uni-bamberg.de/handle/uniba/41653 LA - eng AB - The work in this paper is motivated from two different perspectives: First, gazetteers as an important data source for Geographic Information Retrieval (GIR) applications often lack historic place name information. More focused historic gazetteers are a far cry from being complete and often specialize only on certain geographic regions or time periods. Second, research on historic route descriptions---so called itineraries---is an important task in many research disciplines such as geography, linguistics, history, religion, or even medicine. This research on historic itineraries is characterized by manual, time-consuming work with only minimalistic IT support through gazetteers and map services. We address both perspectives and present a depth-first branch-and-bound (DFBnB) algorithm for deducing historic place names and thus the stops of ancient travel routes from itinerary tables. Multiple phonetic and character-based string distances are evaluated when resolving parts of an itinerary first published in 1563. KW - itinerary resolution KW - historic place name disambiguation KW - geocoding KW - depth-first branch-and-bound KW - gazetteer enrichment ER - TY - CPAPER TI - Extending Data Models by Declaratively Specifying Contextual Knowledge AU - Gradl, Tobias AU - Henrich, Andreas PY - 2016 T2 - DocEng '16 : Proceedings of the 2016 ACM Symposium on Document Engineering SP - 123-126 PB - ACM CY - New York, NY, USA SN - 978-1-4503-4438-8 DO - 10.1145/2960811.2967147 UR - https://fis.uni-bamberg.de/handle/uniba/40999 LA - eng AB - The research data landscape of the arts and humanities is characterized by a high degree of heterogeneity. To improve interoperability, recent initiatives and research infrastructures are encouraging the use of standards and best practices. However, custom data models are often considered necessary to exactly reflect the requirements of a particular collection or research project. To address the needs of scholars in the arts and humanities for a composition of research data irrespective of the degree of structuredness and standardization, we propose a concept on the basis of formal languages, which facilitates declarative data modeling by respective domain experts. By identifying and defining grammatical patterns and deriving transformation functions, the structure of data is generated or extended in accordance with the particular context and needs of the domain. KW - digital humanities KW - descriptive data modeling KW - language applications KW - DARIAH ER - TY - CPAPER TI - Data Integration for the Arts and Humanities : A Language Theoretical Concept AU - Gradl, Tobias AU - Henrich, Andreas PY - 2016 T2 - Research and Advanced Technology for Digital Libraries : 20th International Conference on Theory and Practice of Digital Libraries, TPDL 2016, Hannover, Germany, September 5–9, 2016, Proceedings SP - 281-293 PB - Springer CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-319-43996-9 DO - 10.1007/978-3-319-43997-6_22 UR - https://fis.uni-bamberg.de/handle/uniba/40908 LA - eng AB - In the context of the arts and humanities, heterogeneity largely corresponds to the variety of disciplines, their research questions and communities. Resulting from the diversity of the application domain, the analysis of overall requirements and the subsequent derivation of appropriate unifying schemata is prevented by the complexity and size of the domain. The approach presented in this paper is based on the hypothesis that data integration problems in the arts and humanities can be solved on the theoretical foundation of formal languages. In applying a theoretically substantiated framework, integrative solutions on the formal basis of language specifications can be tailored to specific and individual research needs—abstracting from reoccurring technical difficulties and leading the focus of domain experts on semantic aspects. KW - Data Integration ER - TY - CPAPER TI - Die computergestützte Erschließung und Visualisierung historischer Itinerare AU - Blank, Daniel AU - Henrich, Andreas PY - 2016 T2 - DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016 SP - 272-275 PB - nisaba Verlag CY - Duisburg SN - 978-3-941379-05-3 UR - https://fis.uni-bamberg.de/handle/uniba/40767 LA - deu ER - TY - JOUR TI - Die DARIAH-DE-Föderationsarchitektur : Datenintegration im Spannungsfeld forschungsspezifischer und domänenübergreifender Anforderungen AU - Gradl, Tobias AU - Henrich, Andreas PY - 2016 JO - Bibliothek : Forschung und Praxis VL - 40 IS - 2 SP - 222-228 PB - de Gruyter Saur CY - Berlin ; New York, NY SN - 1865-7648 DO - 10.1515/bfp-2016-0027 UR - https://fis.uni-bamberg.de/handle/uniba/40766 LA - deu AB - Dieser Beitrag gibt einen Überblick über die Konzepte und Komponenten der DARIAH-DE-Föderationsarchitektur. Nach einer Abgrenzung grundlegender Anforderungen forschungsspezifischer und domänenübergreifender Integration wird zwischen dem Erstellungs- und Verwendungskontext von Forschungsdaten unterschieden und verdeutlicht, wie die Föderationsarchitektur bei deren Modellierung unterstützt. Die Anwendung im Rahmen der generischen Suche zeigt abschließend, wie in dieser Umgebung generische und forschungsspezifische Anfragen unterstützt werden können. KW - Forschungsdaten KW - Integration KW - Föderation KW - generische Suche KW - DARIAH-DE KW - research data KW - integration KW - federation KW - generic search KW - DARIAH-DE ER - TY - CPAPER TI - Judaica recherchieren : Unterstützung bei der Realisierung forschungsspezifischer Suchlösungen durch die generische Suche von DARIAH-DE AU - Gradl, Tobias AU - Lordick, Harald AU - Henrich, Andreas PY - 2016 T2 - DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016 SP - 132-136 PB - nisaba Verlag CY - Duisburg SN - 978-3-941379-05-3 UR - https://fis.uni-bamberg.de/handle/uniba/40759 LA - deu ER - TY - CPAPER TI - Nutzung und Kombination von Daten aus strukturierten und unstrukturierten Quellen zur Identifikation transnationaler Lebensläufe AU - Gradl, Tobias AU - Henrich, Andreas PY - 2016 T2 - DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016 SP - 129-132 PB - nisaba Verlag CY - Duisburg SN - 978-3-941379-05-3 UR - https://fis.uni-bamberg.de/handle/uniba/40770 LA - deu ER - TY - JOUR TI - Using Summaries to Search and Visualize Distributed Resources Addressing Spatial and Multimedia Features AU - Blank, Daniel AU - Henrich, Andreas AU - Kufer, Stefan PY - 2016 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V. VL - 16 IS - 1 SP - 67-76 PB - Springer CY - Berlin ; Heidelberg SN - 1618-2162 DO - 10.1007/s13222-015-0210-5 UR - https://fis.uni-bamberg.de/handle/uniba/40595 LA - eng AB - Summarization is an important means to cope with the challenges of big data. Summaries can help to achieve a first overview, they can be used to characterize subsets, they allow for the targeted access to data, and they build the basis for visualization techniques. In the present article, we point out the role of summaries as well as potential application scenarios. As examples, summarization techniques for spatial data (as an example for specific low dimensional techniques) and for general metric spaces (as a generic example with a broad spectrum of applications) are described. Furthermore, their use for resource selection and resource visualization in large distributed scenarios is outlined. KW - Resource description and selection KW - Distributed metric and spatial access methods KW - Big data summarization ER - TY - CPAPER TI - IT Company Atlas Upper Franconia : A Practical Application of Expert Search Techniques AU - Blank, Daniel AU - Boosz, Sebastian AU - Henrich, Andreas PY - 2016 T2 - SAC '16 : Proceedings of the 31st Annual ACM Symposium on Applied Computing SP - 1048-1053 PB - ACM CY - New York, NY, USA SN - 978-1-4503-3739-7 DO - 10.1145/2851613.2851695 UR - https://fis.uni-bamberg.de/handle/uniba/40573 LA - eng AB - Identifying a competent service provider or contractor is not an easy task. This is especially true in the IT sector with its short-lived trends and products. In this context an"IT Company Atlas" giving substantiated information about the IT companies in a certain region seems to be a promising idea. However, a B2B directory administered manually for this purpose is expensive to establish and to maintain. An alternative approach discussed in this paper is to apply expert search techniques and provide a search engine searching for companies instead of documents. We propose a system searching for companies with expertise in a given field sketched by a keyword query. The system exploits the websites of the companies and covers all aspects: determining and representing the expertise of the companies, query processing and retrieval models, as well as query formulation and result presentation. In addition to the theoretical background and a system description we present experimental results comparing the effectiveness of different retrieval models adopted from expert search in the scenario we call "company search". KW - Company search KW - Expertise retrieval KW - Expert search KW - Domain specific search solutions KW - IR systems ER - TY - JOUR TI - Editorial : Schwerpunktthema: Informationsmanagement für Digital Humanities AU - Henrich, Andreas AU - Heyer, Gerhard AU - Schlieder, Christoph AU - Härder, Theo PY - 2015 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V. VL - 15 IS - 1 SP - 1-6 PB - Springer CY - Berlin ; Heidelberg SN - 1618-2162 DO - 10.1007/s13222-015-0181-6 UR - https://fis.uni-bamberg.de/handle/uniba/46611 LA - deu AB - - KW - Informationsmanagement KW - Digital Humanities ER - TY - JOUR TI - Erforschung der Weltenwanderer : Über die Nutzung der Wikipedia zur Identifikation grenzüberschreitender Lebensläufe AU - Henrich, Andreas AU - Gradl, Tobias PY - 2015 JO - Uni.vers Forschung : das Magazin der Otto-Friedrich-Universität Bamberg IS - Ein Universum des Wissens für alle - Bamberger Perspektiven auf die Wikipedia SP - 46-49 PB - Otto-Friedrich-Universität CY - Bamberg SN - 2195-2558 UR - https://fis.uni-bamberg.de/handle/uniba/40769 LA - deu AB - Für die Geschichtswissenschaften können die Datenbestände von Wikipedia und Wikidata wertvoll sein. Dies betrifft etwa die Erforschung von Biografien: War jemand im 19. Jahr-hundert bereits international vernetzt? Die Nationalbiografien geben hierüber mitunter nur unzureichend Auskunft, da die nationale Perspektive überwiegt. Wikipedia und Wikidata liefern wertvolle zusätzliche Informationen. Für die Auswertung der Daten entwickelt die Bamberger Medieninformatik derzeit einen Prototypen, Historiker und Informatiker arbeiten Hand in Hand. KW - Wikipedia ER - TY - JOUR TI - Heterogene Daten in den Digital Humanities : Eine Architektur zur forschungsorientierten Föderation von Kollektionen AU - Gradl, Tobias AU - Henrich, Andreas AU - Plutte, Christoph PY - 2015 JO - Zeitschrift für digitale Geisteswissenschaften IS - Sonderband 1, Grenzen und Möglichkeiten der Digital Humanities PB - Wolfenbüttel SN - 2510-1366 DO - 10.17175/sb001_020 UR - https://fis.uni-bamberg.de/handle/uniba/40772 LA - deu AB - Traditionelle Ansätze der Datenintegration basieren zumeist auf einer Harmonisierung heterogener Daten im Rahmen einer übergeordneten, integrativen Datenstruktur wie einem globalen Schema oder einer globalen Ontologie. Der vorliegende Beitrag verdeutlicht die Limitationen eines derartigen Harmonisierungsansatzes für den speziellen Kontext der Digital Humanities und zeigt, wie im Rahmen von DARIAH-DE eine forschungsorientierte und fallbasierte Föderation von Daten erreicht werden kann. Mit Hilfe von Collection, Schema und Crosswalk Registry können durch die Registrierung und Assoziation von Kollektionen und darin verwendeten Datenschemata sowohl übergreifende als auch disziplinspezifische Sichten auf Forschungsdaten geschaffen werden. KW - Datenintegration KW - Digital Humanities KW - Softwaresystem ER - TY - CPAPER TI - Implementierung von IR-Modellen auf Basis spaltenorientierter Datenbanken oder invertierter Listen AU - Stadelmann, Thomas AU - Blank, Daniel AU - Henrich, Andreas PY - 2015 T2 - Datenbanksysteme für Business, Technologie und Web (BTW 2015) SP - 299-308 PB - Gesellschaft für Informatik e. V. CY - Bonn T3 - GI-Edition / Proceedings SN - 978-3-88579-635-0 UR - https://fis.uni-bamberg.de/handle/uniba/40584 LA - deu AB - Im Information Retrieval (IR) wird die Anwendung spaltenorientierter Da- tenbankmanagementsysteme (DBMS) diskutiert, um u.a. durch die Trennung von Da- tenhaltung und Suchlogik zusätzliche Flexibilität zu gewinnen. Es stellt sich die Frage, ob sich solche Systeme für den praktischen Einsatz eignen, oder ob deren Einsatz auf das Prototyping beschränkt ist. Ziel dieser Arbeit ist es daher, IR-Systeme auf Basis spaltenorientierter DBMS mit konventionellen IR-Bibliotheken auf Basis invertierter Listen bzgl. ihrer Effektivität und Effizienz unter Verwendung des weit verbreiteten Okapi BM25 Retrieval-Modells zu vergleichen. Dabei werden bisherige Arbeiten insbesondere im Hinblick auf die Anzahl und den Typ der untersuchten Anfragen sowie die durchgängige Verwendung von Kompressionsmöglichkeiten erweitert. KW - IR-Modelle ER - TY - CPAPER TI - Company Search : When Documents are only Second Class Citizens AU - Blank, Daniel AU - Boosz, Sebastian AU - Henrich, Andreas PY - 2015 T2 - Proceedings of the LWA 2015 Workshops : KDML, FGWM, IR, and FGDB (LWA 2015) ; Trier, Germany, October 7-9, 2015 SP - 361-368 PB - RWTH CY - Aachen T3 - CEUR workshop proceedings SN - 1613-0073 UR - https://fis.uni-bamberg.de/handle/uniba/40568 LA - eng AB - Usually retrieval systems search for documents relevant to a certain query or|more general|information need. However, in some situations the user is not interested in documents but other types of entities. In the paper at hand, we will propose a system searching for companies with expertise in a given eld sketched by a keyword query. The system covers all aspects: determining and representing the expertise of the companies, query processing and retrieval models, as well as query formulation and result presentation. KW - domain specific search solutions KW - expertise retrieval ER - TY - CPAPER TI - Geocoding place names from historic route descriptions AU - Blank, Daniel AU - Henrich, Andreas PY - 2015 T2 - GIR '15 : Proceedings of the 9th Workshop on Geographic Information Retrieval IS - 9 PB - ACM CY - New York SN - 978-1-4503-3937-7 DO - 10.1145/2837689.2837698 UR - https://fis.uni-bamberg.de/handle/uniba/40570 LA - eng AB - Many gazetteers contain only a small amount of historic place name information and spelling variants of places. Even more focused historic gazetteers are far from being complete and often specialize on certain geographic regions or particular time periods. On the other hand, there are huge amounts of historic route descriptions, so called itineraries. They represent massive knowledge sources from which historic place names and spelling variants can be deduced. The analysis and geocoding of those route descriptions---often done by hand---is an important task in the humanities. To cope with these problems, we present preliminary ideas how to automatically deduce historic place names and thus travel routes from historic route descriptions. KW - itinerary resolution KW - geocoding KW - gazetteer enrichment ER - TY - CPAPER TI - Hybrid Quantized Resource Descriptions for Geospatial Source Selection AU - Kufer, Stefan AU - Henrich, Andreas PY - 2014 T2 - LocWeb '14 : Proceedings of the 4th International Workshop on Location and the Web SP - 17-24 PB - ACM CY - New York SN - 978-1-4503-1459-6 DO - 10.1145/2663713.2664428 UR - https://fis.uni-bamberg.de/handle/uniba/41202 LA - eng AB - Location nowadays is an important aspect of the Web. One scenario in this respect are archives or collections of geo-tagged media items. More concretely, we can think of collections in the arts and humanities available via OAI-PMH (a protocol for metadata harvesting) on the web or web accessible personal media archives maintained in a peer-to-peer manner. In such scenarios for search problems, source selection becomes an important aspect. For example, we would like to access only those collections containing media items in a certain geospatial region (maybe we are interested in images from Shanghai only). Here, the geospatial search criterion allows for a high selectivity. What is needed in such a scenario are expressive and nevertheless compact representations or descriptions of the ``geospatial footprint'' of each collection. A minimum bounding rectangle would be a trivial but not very accurate option. Generally, summarization techniques for this purpose can be distinguished into three categories, geometric approaches, space partitioning approaches and hybrid approaches. In this work, we present novel hybrid techniques, which mostly apply a set of approximating minimum area rectangles for subspace description together with quantization techniques in order to increase the selectivity of the summaries and, at the same time, keep the storage requirements small. KW - Geographic Information Retrieval KW - Distributed Information Retrieval KW - Source Selection KW - Summarization KW - Quantization ER - TY - CPAPER TI - A novel approach for a reusable federation of research data within the arts and humanities AU - Gradl, Tobias AU - Henrich, Andreas PY - 2014 T2 - Digital humanities 2014 : conference abstracts EPFL-UNIL Lausanne, Switzerland 8-12 July 2014 SP - 382-384 CY - Lausanne DO - 10.5281/zenodo.58210 UR - https://fis.uni-bamberg.de/handle/uniba/40756 LA - eng AB - In distributed systems literature the orthogonal but interdependent characteristics of autonomy, distribution and heterogeneity are used to classify distributed systems. From a holistic perspective on the arts and humanities, collections have evolved over decades or centuries from highly autonomous disciplines and institutions and are widely spread, which resulted in heterogeneous perspectives and data models. Despite its negative notion as data integration problem, the term heterogeneity also symbolizes the diversity of research methodologies within the disciplines of the arts and humanities. Resolving heterogeneity hence implies an abstraction from the specifics that are valuable for focused disciplinary and interdisciplinary research projects. Our approach presents a novel concept for data federation in the arts and humanities, which focuses the needs of research projects as well as interdisciplinary and broad use-cases. We especially address the reusability of explicated knowledge on correlations between schemata and digital collections and show where domain experts are required to bridge semantic gaps. KW - data integration KW - data federation KW - digital humanities KW - research data KW - DARIAH-DE ER - TY - CPAPER TI - Die DARIAH-DE Architektur zur forschungsorientierten Föderation von Kollektionen in den Digital Humanities AU - Gradl, Tobias AU - Plutte, Christoph AU - Henrich, Andreas PY - 2014 SP - 1-8 DO - 10.5281/zenodo.57894 UR - https://fis.uni-bamberg.de/handle/uniba/40752 LA - deu AB - In diesem Beitrag stellen wir eine neuartige Föderationsarchitektur vor, die auf eine Erfassung und Fall-basierte Zusammenführung von Forschungsdaten nach den individuellen Bedürfnissen von Forschungsprojekten abzielt. Digitale Sammlungen werden zentral verzeichnet, zur Vermeidung von Informationsverlusten jedoch nicht harmonisiert, sondern in Form von Beziehungen auf Schemaebene assoziiert, wodurch die Verwendung einer dynamisch föderierten Datenbasis in breiten und interdisziplinären, wie auch in fachspezifischen Anwendungskontexten ermöglicht werden kann KW - DARIAH-DE Architektur KW - Digital Humanities ER - TY - CPAPER TI - Characterization of toponym usages in texts AU - Wolf, Sebastian Johannes AU - Henrich, Andreas AU - Blank, Daniel PY - 2014 T2 - GIR '14 : Proceedings of the 8th Workshop on Geographic Information Retrieval IS - 7 PB - ACM CY - New York SN - 978-1-4503-3135-7 DO - 10.1145/2675354.2675703 UR - https://fis.uni-bamberg.de/handle/uniba/40565 LA - eng AB - Toponyms in texts and search queries are often used figuratively and do not directly refer to the locations they reference in their literal sense. Different usage kinds and stylistic devices characterize toponym usages in texts. It is thus crucial for a Geographic Information Retrieval (GIR) system to precisely distinguish these different toponym usages at indexing and at query time in order to best address a given information need and the geospatial footprint of a document. For that purpose, we analyze which of the classic stylistic devices such as allegories, metaphors, or metonymies are used together with toponyms. We use these categories as a foundation for a systematic approach towards the characterization of toponym usages in texts which we believe is necessary to further boost retrieval effectiveness of future GIR systems. A prototype implements this characterization exemplary for texts written in German. We evaluate the effectiveness of our approach against a reference corpus to show the general feasibility. Our approach provides a basis for a wide range of more sophisticated applications such as for example text genre detection. KW - Computational Linguistics KW - Linguistic Devices KW - Geographical Information Retrieval KW - Geospatial Grounding ER - TY - CPAPER TI - LWA 2013 : Lernen, Wissen & Adaptivität ; Workshop Proceedings Bamberg, 7.-9. October 2013 AU - Bergner, Arndt AU - Schmid, Ute ED - Henrich, Andreas ED - Sperker, Hans-Christian PY - 2014 PB - opus CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/2837 LA - other AB - LWA Workshop Proceedings: LWA stands for "Lernen, Wissen, Adaption" (Learning, Knowledge, Adaptation). It is the joint forum of four special interest groups of the German Computer Science Society (GI). Following the tradition of the last years, LWA provides a joint forum for experienced and for young researchers, to bring insights to recent trends, technologies and applications, and to promote interaction among the SIGs. ER - TY - JOUR TI - DARIAH(-DE): Digital Research Infrastructure for the Arts and Humanities : Concepts and Perspectives AU - Henrich, Andreas AU - Gradl, Tobias PY - 2013 JO - International Journal of Humanities and Arts Computing VL - 7 IS - Issue supplement: Convergence, Collaboration, and Creativity Essays from the 2012 Taiwan SP - 47-58 PB - Edinburgh Univ. Press CY - Edinburgh SN - 1753-8548 DO - 10.3366/ijhac.2013.0059 UR - https://fis.uni-bamberg.de/handle/uniba/40761 LA - eng AB - DARIAH (Digital Research Infrastructure for the Arts and Humanities) is part of the European Strategy on Research Infrastructures. Among 38 projects originally on this roadmap, DARIAH is one of two projects addressing social sciences and humanities. According to its self-conception and its political mandate DARIAH has the mission to enhance and support digitally-enabled research across the humanities and arts. DARIAH aims to develop and maintain an infrastructure in support of ICT-based research practices. One main distinguishing aspect of DARIAH is that it is not focusing on one application domain but especially addresses the support of interdisciplinary research in the humanities and arts. The present paper first gives an overview on DARIAH as a whole and then focuses on the important aspect of technical, syntactic and semantic interoperability. Important aspects in this respect are metadata registries and crosswalk definitions allowing for meaningful cross-collection and inter-collection services and analysis. KW - research infrastructure KW - digital humanities KW - DARIAH KW - DARIAH-DE ER - TY - CPAPER TI - Feature-based object recognition : A case study for car model detection AU - Sperker, Hans-Christian AU - Henrich, Andreas PY - 2013 T2 - 11th International Workshop on Content-Based Multimedia Indexing (CBMI), 2013 ; Proceedings SP - 127-130 PB - IEEE CY - New York, NY, USA SN - 978-1-4799-0955-1 DO - 10.1109/CBMI.2013.6576568 UR - https://fis.uni-bamberg.de/handle/uniba/40580 LA - eng AB - Recognition of untextured as well as shiny objects introduces problems to most of the present interest point detectors and descriptors. Those problems arise from changes in brightness intensities around potential interest points, caused by reflections on such an object's surface. Since the selection of the best performing recognition algorithm heavily depends on the underlying task, an evaluation of some algorithms tested especially for the respective data collection and typical query types has to be taken into account. If the task is for example the model detection of a car, most of the existing algorithm evaluations are misleading since they use data sets with mostly textured and matt objects. The present paper introduces a data set of car images which stands for untextured, shiny objects and evaluates different algorithms namely SIFT, ASIFT, SURF, ORB, and BRISK on that data set. Findings are that most algorithms have a low effectiveness recognizing such objects. This mainly depends on the kind of interest point detector and is not so much dependent on the kind of descriptor. Detectors preferring points on edges and corners are more reliable than those preferring interest points on blob-like structures. KW - Feature-based object recognition ER - TY - CPAPER TI - Resource Description and Selection for Range Query Processing in General Metric Spaces AU - Blank, Daniel AU - Henrich, Andreas PY - 2013 T2 - Datenbanksysteme für Business, Technologie und Web (BTW) 2013 : Tagung vom 13. - 15. März 2013 in Magdeburg SP - 93-112 PB - Ges. für Informatik CY - Bonn T3 - GI-Edition : Proceedings SN - 978-3-88579-608-4 UR - https://fis.uni-bamberg.de/handle/uniba/40557 LA - eng AB - Similarity search in general metric spaces is a key aspect in many application fields. Metric space indexing provides a flexible indexing paradigm and is solely based on the use of a distance metric. No assumption is made about the representation of the database objects. Nowadays, ever-increasing data volumes require large-scale distributed retrieval architectures. Here, local and global indexing schemes are distinguished. In the local indexing approach, every resource administers a set of documents and indexes them locally. Resource descriptions providing the basis for resource selection can be disseminated to avoid all resources being contacted when answering a query. On the other hand, global indexing schemes are based on a single index which is distributed so that every resource is responsible for a certain part of the index. For local indexing, only few exact approaches have been proposed which support general metric space indexing. In this paper, we introduce RS4MI-an exact resource selection approach for general metric space indexing. We compare RS4MI with approaches presented in literature based on a peer-to-peer scenario when searching for similar images by image content. RS4MI can outperform two exact general metric space resource selection schemes in case of range queries. Fewer resources are contacted by RS4MI with-at the same time-more space efficient resource descriptions. KW - Range Query Processing ER - TY - CPAPER TI - Using Hybrid Techniques for Resource Description and Selection in the Context of Distributed Geographic Information Retrieval AU - Kufer, Stefan AU - Blank, Daniel AU - Henrich, Andreas PY - 2013 T2 - Advances in Spatial and Temporal Databases : 13th International Symposium, SSTD 2013, Munich, Germany, August 21-23, 2013 ; Proceedings SP - 330-347 PB - Springer CY - Berlin, Heidelberg T3 - Lecture Notes in Computer Science SN - 978-3-642-40234-0 DO - 10.1007/978-3-642-40235-7_19 UR - https://fis.uni-bamberg.de/handle/uniba/40559 LA - eng AB - The amount of media items on the web is increasing tremendously, especially regarding personal media items. To effectively collaborate over and share these massive amounts of media objects, there is a strong need for adequate indexing and search techniques. Trends like social networks, large-storage mobile devices and high-bandwidth networks make peer-to-peer (P2P) information retrieval systems of deep interest. Hence, resource selection based on compact resource descriptions is used to efficiently determine promising peers w.r.t. a query. To design effective media search applications, multiple search criteria need to be addressed. Subsequently, besides text or visual media content, geospatial data is frequently used. We propose techniques to summarize and select collections of georeferenced media items in P2P systems. Generally, these summarization techniques can be divided into geometric and space partitioning approaches. This paper presents and evaluates techniques of a third category, hybrid approaches that combine features of geometric and space partitioning techniques. KW - Distributed Geographic Information Retrieval ER - TY - CPAPER TI - A machine learning approach to drought stress level classification of tobacco plants AU - Stocker, Christoph AU - Uhrmann, Franz AU - Scholz, Oliver AU - Hügel, C. AU - Rademacher, T. AU - Siebers, Michael AU - Schmid, Ute ED - Henrich, Andreas ED - Sperker, Hans-Christian PY - 2013 T2 - LWA 2013: Lernen, Wissen & Adaptivität Workshop Proceedings, Bamberg, 7.-9.Oktober 2013 SP - 174-178 PB - opus CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/2731 LA - eng ER - TY - CPAPER TI - Erkennung von Sequenzen mimischer Schmerzausdrücke durch genetische Programmierung AU - Stocker, Christoph AU - Siebers, Michael AU - Schmid, Ute ED - Henrich, Andreas ED - Sperker, Hans-Christian PY - 2013 SP - 117-120 PB - opus CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/2726 LA - deu ER - TY - CHAP TI - Describing and selecting collections of georeferenced media items in peer-to-peer information retrieval systems AU - Blank, Daniel AU - Henrich, Andreas PY - 2012 T2 - Discovery of geospatial resources : methodologies, technologies, and emergent applications SP - 1-20 PB - IGI Global CY - Hershey PA SN - 978-1-466-60945-7 DO - 10.4018/978-1-4666-0945-7.ch001 UR - https://fis.uni-bamberg.de/handle/uniba/626 LA - eng AB - The ever-increasing amount of media items on the World Wide Web and on private devices lead to a strong need for adequate indexing and search techniques. Trends such as personal media archives. social networks, mobile devices with huge storage space, and networks with high bandwidth capacities make distributed solutions and in particular Peer-to-Peer (P2P) lnformation Rertrieval (IR) systems attractive. On the other hand, when designing effective media search applications, various search criteria have to be addressed. Hereby, geospatial information is frequently used as well as other criteria, such as text, audio or visual media content, and date and time information. In this chapter the authors outline how collections of georeferenced media items can be indexed and searched in P2P IR systems. They discuss different types of P2P IR systems and focus in detail on an approach based on collection description and selection techniques. This approach tries to adequately describe and select collections of georeferenced media items. Finally, the authors discuss its broad applicability in various application fields. KW - peer-to-peer information retrieval systems ER - TY - JOUR TI - Spatial grounding with vague place models AU - Schlieder, Christoph AU - Henrich, Andreas PY - 2011 SP - 20-23 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106661 LA - eng AB - Vagueness arises as a problem in the context of grounding named entities, a central task in geographic information retrieval (GIR) which consists in establishing the entities' "denotation with respect to the world or a model" [8]. We use the term spatial grounding in a slightly more general sense to refer to the association of any type of spatial descriptor with a place model. In the simplest case, the descriptor consists of a toponym and the place model is provided by a (vague) geographic region. More complex descriptors make use of prepositional phrases or even a text span comprising many sentences, e.g. a travel blog entry. However, descriptors are in no way limited to natural language expressions. A frequently used descriptor in mobile GIR is the geographic position of the user as part of the specification of an information need. Furthermore, spatial activities such as taking photographs can also act as descriptors for places models ("tell me more about the focused object"). Different place models for representing the vagueness of regions have been proposed including supervaluation semantics and qualitatively augmented fuzzy footprints [12]. In this paper we concentrate on approaches to grounding that exploit diverse information sources, for instance, topographic data or the spatial behavior of a user community, to determine place models which are sometimes more complex than point sets. KW - vague place models ER - TY - JOUR TI - Spatial grounding with vague place models AU - Schlieder, Christoph AU - Henrich, Andreas PY - 2011 JO - SIGSPATIAL special VL - 3 IS - 2: Special Issue on Geographic Information Retrieval SP - 20-23 PB - ACM CY - New York, NY SN - 1946-7729 DO - 10.1145/2047296.2047301 UR - https://fis.uni-bamberg.de/handle/uniba/5447 LA - eng AB - Vagueness arises as a problem in the context of grounding named entities, a central task in geographic information retrieval (GIR) which consists in establishing the entities' "denotation with respect to the world or a model" [8]. We use the term spatial grounding in a slightly more general sense to refer to the association of any type of spatial descriptor with a place model. In the simplest case, the descriptor consists of a toponym and the place model is provided by a (vague) geographic region. More complex descriptors make use of prepositional phrases or even a text span comprising many sentences, e.g. a travel blog entry. However, descriptors are in no way limited to natural language expressions. A frequently used descriptor in mobile GIR is the geographic position of the user as part of the specification of an information need. Furthermore, spatial activities such as taking photographs can also act as descriptors for places models ("tell me more about the focused object"). Different place models for representing the vagueness of regions have been proposed including supervaluation semantics and qualitatively augmented fuzzy footprints [12]. In this paper we concentrate on approaches to grounding that exploit diverse information sources, for instance, topographic data or the spatial behavior of a user community, to determine place models which are sometimes more complex than point sets. KW - vague place models ER - TY - CPAPER TI - The Spatial Visibility of Terms and Phrases on the Internet: Approaches, Observations and Perspectives AU - Henrich, Andreas PY - 2011 T2 - Visibility in Information Spaces and in Geographic Environments. Post- Proceedings of the KI'11 Workshop (October 4th, 2011, TU Berlin, Germany) SP - 35 - 37 CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/5419 LA - eng ER - TY - JOUR TI - Forschungsinfrastruktur : Auf dem (langen) Weg zu den e-Humanities AU - Henrich, Andreas PY - 2011 JO - Uni.vers Forschung : das Magazin der Otto-Friedrich-Universität Bamberg IS - 17: Digital Humanities : Technologien für die Geisteswissenschaften SP - 11 - 15 PB - Otto-Friedrich-Universität CY - Bamberg SN - 2195-2558 UR - https://fis.uni-bamberg.de/handle/uniba/4808 LA - deu AB - Es ist eine verlockende Vision: Wenn die in zahlreichen kultur- und geisteswissenschaftlichen Einzelprojekten gesammelten Forschungsdaten miteinander verknüpft werden, könnte dies fachübergreifende Analysen erheblich vereinfachen. Wie sinnvoll der wissenschaftliche Austausch zwischen ganz unterschiedlichen Disziplinen in der Praxis sein kann, zeigt ein Beispiel: Um universelle Trends in der Literatur und Architektur des Mittelalters ableiten zu können, müssen Spezialisten aus mehreren Bereichen zusammenarbeiten - nämlich Bauhistoriker und Philologen. Aber auch innerhalb der Einzeldisziplinen ist ein umfassender Erkenntnisaustausch durchaus vielversprechend. So lassen sich beispielsweise aus mehreren, unabhängig voneinander entstandenen Arbeiten über die Portraitmalerei verschiedener Epochen ggf. neue Erkenntnisse über das Bildverständnis im Zeitverlaufgewinnen. Die Forschungsinitiative DARIAH-DE (Digital Re-search lnfrastructure for the Artsand Humanities) leistet einen wichtigen Beitrag dazu, diese Vision schon bald Realität werden zu lassen. Im Rahmen des umfangreichen Projekts befassen sich Bamberger Informatiker mit der Datenintegration und der Etablierung von übergreifenden Suchdiensten. KW - Forschungsinfrastruktur ER - TY - CPAPER TI - IR-Unterstützung für die Digital Humanities: Problemstellungen und erste Lösungsideen AU - Henrich, Andreas AU - Gradl, Tobias PY - 2011 T2 - LWA 2011 : Lernen, Wissen, Adaption UR - https://fis.uni-bamberg.de/handle/uniba/4813 LA - deu ER - TY - CPAPER TI - Hybrid Learning : "Neither Fish Nor Fowl" or "The Golden Mean" AU - Henrich, Andreas AU - Sieber, Stefanie PY - 2011 T2 - Hybrid Learning : Third International Conference, ICHL 2010, Beijing, China, August 16-18, 2010 ; Proceedings SP - 82-93 PB - Springer CY - Berlin u.a. T3 - Lecture notes in computer science SN - 978-3-642-14656-5 DO - 10.1007/978-3-642-14657-2_9 UR - https://fis.uni-bamberg.de/handle/uniba/4785 LA - eng AB - Traditionalists will argue that conventional classroom lectures have been and always will be the most effective form of teaching. In contrast, people focusing on progress will put pure e-teaching on a pedestal. Confronted with these two extremes, a natural reflex is to search for a compromise. Hybrid learning could be such a compromise. However, the important question is whether this is only a compromise for the anxious, an interim arrangement on the transition to pure e-teaching, or the best conceivable solution, that is meant to stay. In the present paper we are giving evidence for the latter position based on practitioners’ experiences of more than ten years of technology enhanced teaching. We address the need for university wide learning management systems and advocate simple, cost-effective, and sustainable solutions not asking too much from lecturers, but—nevertheless—causing a significant added value for the students. KW - Hybrid Learning ER - TY - CHAP TI - Teaching IR : Curricular Considerations AU - Blank, Daniel AU - Fuhr, Norbert AU - Henrich, Andreas AU - Mandl, Thomas AU - Rölleke, Thomas AU - Schütze, Hinrich AU - Stein, Benno PY - 2011 T2 - Teaching and Learning in Information Retrieval SP - 31-46 PB - Springer CY - Berlin u.a. SN - 978-3-642-22510-9 DO - 10.1007/978-3-642-22511-6_3 UR - https://fis.uni-bamberg.de/handle/uniba/4783 LA - eng AB - Information retrieval (IR) is nowadays accepted as an important topic in various disciplines. Information science, computer science, information systems, and library science are obvious candidates. But also in disciplines such as marketing, bioinformatics, or linguistics, IR topics are considered important and should be covered by respective curricula. For those who are teaching IR topics, this brings up serious questions: Which topics should be addressed in an IR course? Can one course serve the different target groups? What would be an appropriate set of IR courses to satisfy all potentially interested parties? In this chapter, we try to provide a landscape giving hints with respect to the topics relevant for the different target groups. In fact, a single IR course will hardly satisfy the needs of all target groups. A coordinated set of smaller IR courses where each group can select an appropriate subset might be a solution. Another important aspect is practical exercises. An IR course has to integrate such exercises, and a huge variety of available tools and frameworks are useful in this respect. This chapter will exemplarily consider some of these tools and discuss their use in IR courses. KW - Teaching IR ER - TY - CPAPER TI - A Study on the Use of Lecture Recordings in Different Mobile Learning Settings AU - Henrich, Andreas AU - Hub, Adrian AU - Sieber, Stefanie PY - 2011 T2 - Proceedings of the 7th IADIS international conference on Mobile Learning 2011 SP - 159 - 166 PB - IADIS CY - Lisbon SN - 978-972-8939-45-8 UR - https://fis.uni-bamberg.de/handle/uniba/4763 LA - eng AB - Lecture recordings represent a convenient means to supplement traditional face-to-face lectures and also to establish pure e-learning scenarios. We provide lecture recordings to our students since roughly one decade by now. The recordings are used by traditional students present at the universitys campus as well as students studying a virtual study path who are not on-site. In the last two semesters we have provided the lecture recordings in different complementary formats: a rich proprietary format based on special presentation softwarewell suited for desktop-PCs, notebooks, and netbooksand a standard video format allowing the use on smartphones and other mobile devices. In this paper we present the results of a survey on the usage of the lecture recordingsespecially considering the mobile use of the lecture recordings and the expected future potential. In particular, the two different student groups involved make these results interesting. In our perception the main finding is that mobile learning using lecture recordings is beneficial in specific situations, but not as a dominant learning model. A perspective can be seen in mobile learning as part of a broader ubiquitous learning scenario. KW - Lecture Recordings KW - Mobile Learning KW - User Study KW - MPEG-4 KW - Ubiquitous Learning ER - TY - JOUR TI - Digital Humanities studieren : vielfältige Möglichkeiten vom einzelnen Modul bis zum speziellen Studiengang AU - Henrich, Andreas PY - 2011 JO - Uni.vers Forschung : das Magazin der Otto-Friedrich-Universität Bamberg IS - 17: Digital Humanities : Technologien für die Geisteswissenschaften SP - 56-59 PB - Otto-Friedrich Universität CY - Bamberg SN - 2195-2558 UR - https://fis.uni-bamberg.de/handle/uniba/4764 LA - deu AB - Die Digitalisierung der Geisteswissenschaften schafft für die Forschung und berufliche Tätigkeiten z. B. im Verlagswesen, in der Presse- und Öffentlichkeitsarbeit, in der Stadt- und Regionalplanung oder im Kulturmanagement neue Möglichkeiten und auch Herausforderungen. Für die Universität Bamberg ist es dabei prägend, dass den Studierenden eine Vielzahl von Möglichkeiten geboten wird, sich im Studium auf dieses wichtige Feld vorzubereiten. Die Angebote reichen von der geisteswissenschaftlichen Lehrveranstaltung mit IT-Bezug bis zum Bachelor- und Masterstudium der Angewandten Informatik oder dem seit dem Wintersemester 2010/11 eingeführten Masterstudiengang Computing in the Humanities. KW - Digital Humanities ER - TY - CPAPER TI - Hybrid Learning : A Powerful Opportunity to Integrate SMEs in Courses as a Third Party AU - Fries, Tobias AU - Henrich, Andreas PY - 2011 T2 - Hybrid learning : 4th international conference, ICHL 2011, Hong Kong, China, August 10 - 12, 2011 ; proceedings SP - 176-187 PB - Springer CY - Berlin u. a. SN - 978-3-642-22762-2 DO - 10.1007/978-3-642-22763-9_17 UR - https://fis.uni-bamberg.de/handle/uniba/4767 LA - eng AB - In typical teaching scenarios students and lecturers are involved. Nowadays, however, learning management systems (LMS) are used intensively to foster communication between students and lecturers and so reduce the need to meet in person in order to communicate. Additionally an increased involvement of practitioners and companies in teaching efforts at universities seems desirable for a variety of reasons. (1) Examples and comments from practitioners can augment teaching content. (2) Students can get in touch early and casually with potential future employers. (3) The lecturer might receive valuable feedback with respect to his/her teaching content and style and potentially more intense forms of co-operation might result. On the company side such co-operation might be especially appealing for Small and Medium-sized Enterprises (SMEs), because large companies usually have other options, as well. Therefore, we set up a project using a university wide LMS as an enabling platform to escalate the involvement of SMEs and their employees in teaching efforts. In the present paper we report on the experiences derived from this project. KW - Hybrid Learning ER - TY - CPAPER TI - Integrating industrial partners into e-teaching efforts - using social networks to support the initiation of co-operations AU - Fries, Tobias AU - Boosz, Sebastian AU - Henrich, Andreas PY - 2011 T2 - Information und Wissen : global, sozial und frei? ; Proceedings des 12. Internationalen Symposiums für Informationswissenschaft (ISI 2011) ; Hildesheim, 9. - 11. März 2011 SP - 454 - 466 PB - Verlag Werner Hülsbusch CY - Boizenburg T3 - Schriften zur Informationswissenschaft UR - https://fis.uni-bamberg.de/handle/uniba/4766 LA - eng ER - TY - BOOK TI - Digitale Geisteswissenschaften AU - Henrich, Andreas AU - Deschauer, Bernd ED - Thaller, Manfred PY - 2011 PB - DARIAH-DE CY - Köln ET - 1 UR - https://fis.uni-bamberg.de/handle/uniba/424 LA - deu KW - Deutschland KW - Universität KW - Geisteswissenschaften KW - Digitalisierung ER - TY - CPAPER TI - Visibility in Information Spaces and in Geographic Environments : Post-Proceedings of the KI'11 Workshop (October 4th, 2011, TU Berlin, Germany) AU - Henrich, Andreas AU - Schlieder, Christoph AU - Schmid, Ute AU - Seifert, Inessa AU - Saendig, Bertram AU - Kremer, Dominik AU - Grossmann, Peter AU - Wachter, Markus AU - Raab, Marius AU - Carbon, Claus-Christian AU - Faerber, Stella J. ED - Henrich, Andreas ED - Schlieder, Christoph ED - Schmid, Ute PY - 2011 PB - opus CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik UR - https://fis.uni-bamberg.de/handle/uniba/321 LA - eng AB - In the post-proceedings of the Workshop "Visibility in Information Spaces and in Geographic Environments" a selection of research papers is presented where the topic of visibility is addressed in different contexts. Visibility governs information selection in geographic environments as well as in information spaces and in cognition. The users of social media navigate in information spaces and at the same time, as embodied agents, they move in geographic environments. Both activities follow a similar type of information economy in which decisions by individuals or groups require a highly selective filtering to avoid information overload. In this context, visibility refers to the fact that in social processes some actors, topics or places are more salient than others. Formal notions of visibility include the centrality measures from social network analysis or the plethora of web page ranking methods. Recently, comparable approaches have been proposed to analyse activities in geographic environments: Place Rank, for instance, describes the social visibility of urban places based on the temporal sequence of tourist visit patterns. The workshop aimed to bring together researchers from AI, Geographic Information Science, Cognitive Science, and other disciplines who are interested in understanding how the different forms of visibility in information spaces and geographic environments relate to one another and how the results from basic research can be used to improve spatial search engines, geo-recommender systems or location-based social networks. KW - Raum-zeitliches Verhalten, Mobile Assistenz, Visualisierung , Prototypen, Geo-Information Retrieval KW - Raum-zeitliches Verhalten KW - Mobile Assistenz KW - Visualisierung KW - Prototypen KW - Geo-Information Retrieval ER - TY - CPAPER TI - Integrating Industrial Partners into e-Teaching Efforts : a Portal to Support the Initiation of Co-operations AU - Fries, Tobias AU - Henrich, Andreas PY - 2010 T2 - Proceedings of the IADIS International Conference e-Learning 2010 SP - 89-96 PB - IADIS CY - Freiburg SN - 978-972-8939-17-5 UR - https://fis.uni-bamberg.de/handle/uniba/4759 LA - eng AB - Learning Management Systems (LMS) form a powerful basis to integrate practitioners and industrial partners into teaching activities. Taking a university-wide LMS as the basis, one critical issue in this respect is to bring together lecturers and industrial partners willing to co-operate in teaching efforts addressing a mutual field of interest. In the present paper we introduce an approach to support the initiation phase of such co-operations between academic and industrial partners based on a web portal filled with content from the existing IT systems maintaining module descriptions, administrative data, and teaching content. We describe the requirements and basic as well as advanced use cases the portal should fulfill and explain the difficulties in integrating the portal into the heterogeneous system landscape at a university using the example of the University of Bamberg. We especially illustrate the different interfaces to be used to harvest information from the connected systems and to automate processes within a connected LMS to set up co-operations to be mediated by the LMS after being established. We also briefly describe the system architecture of the portal and how we tried to make it flexible and maintainable for the usage in different environments. KW - Learning management systems KW - IT infrastructure KW - integration of practitioners KW - practical projects ER - TY - CPAPER TI - Integrating industrial partners into e-teaching efforts - legal pitfalls and circumventions AU - Fries, Tobias AU - Henrich, Andreas PY - 2010 T2 - International Conference on Technology Supported Learning & Training <16, 2010, Berlin>: Proceedings CY - Berlin UR - https://fis.uni-bamberg.de/handle/uniba/4756 LA - eng ER - TY - CPAPER TI - LFRP-Search: Multi-Layer Ranked Visual Faceted Search : an Approach to Cope with Complex Search Situations AU - Eckstein, Raiko AU - Henrich, Andreas AU - Weber, Nadine PY - 2010 T2 - SAC '10 : Proceedings of the 2010 ACM Symposium on Applied Computing SP - 1713-1717 PB - ACM CY - New York SN - 978-1-60558-639-7 DO - 10.1145/1774088.1774455 UR - https://fis.uni-bamberg.de/handle/uniba/4776 LA - eng AB - In enterprise search scenarios information needs are quite diverse. If users know exactly which items they are looking for, they need support in known-item searches. But often information needs are vague and unclear, which means that users cannot explicitly define the search criteria that specify their search request. In these cases, exploratory search approaches are necessary to support users in interactively refining their search queries. Our approach for a retrieval system for complex search situations can be characterized by its four constituent parts: The approach deals with the heterogeneity of potential target objects when performing a search considering multiple artifact layers (e. g. projects, products, persons, and documents). The basic search paradigm applied is faceted search which is well-suited for exploratory interactive retrieval. To cope with result sets of different granularity, we include ranking facilities based on facet values as well as Query-by-Example (QbE) functionalities. Users can easily state their priorities visually by using preference functions. Finally, parallel coordinates (PC) are used to visualize the characteristics and dependencies of (intermediate) results in order to provide users with a deeper understanding of the data under investigation. These four cornerstones of our approach are reflected in the acronym LFRP-search (Multi-Layer Faceted Search with Ranking using Parallel Coordinates). The main contribution of this paper is the semi-formal description of the query options. KW - Information Retrieval KW - Retrieval Model KW - Multi-Criteria KW - Visualization KW - Faceted Search KW - Parallel Coordinates ER - TY - CPAPER TI - Metadata for Learning Objects : A Cure for Information Overflow? AU - Sieber, Stefanie AU - Henrich, Andreas PY - 2010 T2 - Proceedings of the IADIS International Conference e-Learning 2010 SP - 251-255 PB - IADIS CY - Freiburg SN - 978-972-8939-17-5 UR - https://fis.uni-bamberg.de/handle/uniba/4760 LA - eng AB - Information overflow is one of the downsides that digitalisation brought with it. This obvious fact also applies to the field of e-learning. For this reason, concepts and systems supporting learners in handling the enormous amount of information such as personal learning environments have recently gained more attention. It gets more and more important to offer individual capabilities to store, retrieve, and keep track of the different learning contents or learning objects. Of course, metadata can be very useful to organise learning objects. Therefore, we have examined different metadata standards. Based on our insights, we developed a structure of metadata attributes in order to efficiently store learning objects. The results are presented in this paper. Also, thoughts on how to gain this metadata by employing different specific standards are given. To our understanding the use of a reasonable subset of metadata supports tutors and learners at the same time. KW - Learning Objects KW - Learning Context KW - Learning Reference KW - Metadata Standards KW - Dublin Core KW - Learning Object Metadata ER - TY - CPAPER TI - Binary Histograms for Resource Selection in Peer-to-Peer Media Retrieval AU - Blank, Daniel AU - Henrich, Andreas PY - 2010 T2 - LWA 2010 : Lernen, Wissen & Adaptivität ; Workshop Proceedings SP - 183-190 CY - Kassel T3 - Kasseler Informatikschriften UR - https://fis.uni-bamberg.de/handle/uniba/4737 LA - eng AB - With the ever increasing amount of media data and collections on the world wide web and on private devices arises a strong need for adequate indexing and search techniques. Trends such as personal media archives, social networks, mobile devices with huge storage space and networks with high bandwidth capacities make distributed solutions and peer-to-peer (P2P) systems attractive. Here, resource selection can be applied to determine a ranking of promising resources based on descriptions of their content. Resources are contacted in ranked order to retrieve appropriate media items w.r.t. a user’s information need. In this paper we apply and adapt resource descriptions in the form of binary histograms and corresponding selection techniques which were designed for low-dimensional spatial data to high-dimensional data in the context of contentbased image retrieval (CBIR). W.r.t. related work in distributed information retrieval, which is also discussed in this paper, a main characteristic of our approach are more space efficient resource descriptions. This makes them applicable for a wider range of application fields apart from the P2P domain. KW - Binary Histograms ER - TY - CPAPER TI - Description and Selection of Media Archives for Geographic Nearest Neighbor Queries in P2P Networks AU - Henrich, Andreas AU - Blank, Daniel PY - 2010 T2 - Proceedings of the ECIR2010 workshop on information access for personal media archives : (IAPMA2010), Milton Keynes, UK, 28 March 2010. IAPMA Workshop Proceedings SP - 22 - 29 CY - Dublin UR - https://fis.uni-bamberg.de/handle/uniba/4738 LA - eng AB - In recent years, there has been a tremendous increase in personal media data stored on people’s PCs, mobile devices, and social media sites in the web. Additionally, people are increasingly collaborating and interacting by sharing and commenting media items. These trends call for retrieval services integrating resources heterogeneous in update frequencies, media types, and size. In this context, peer-to-peer (P2P) technologies offer interesting solutions. When performing a query on certain types of P2P networks, resource selection is important. Compact summaries (i.e. resource descriptions) of each peer’s data collection are known to other peers and used by them in order to determine promising peers for a given query. Summaries have to describe not only textual information, content-based media features, and information about date and time, but also the locations where e.g. images were taken, videos were recorded, or to which a user travelled. The present paper proposes and evaluates different resource selection techniques based on descriptions of the geographic footprint of personal media archives when querying for media items that are geographically close to a given query location. These techniques are not restricted to P2P networks and can e.g. be applied in hybrid index structures or distributed IR systems in general. KW - Resource Selection KW - Peer-to-Peer IR KW - Multimedia IR KW - Summarization ER - TY - CPAPER TI - Image Retrieval on Mobile Devices AU - Hub, Adrian AU - Henrich, Andreas PY - 2010 T2 - LWA 2010 : Lernen, Wissen & Adaptivität ; Workshop Proceedings SP - 205-208 CY - Kassel T3 - Kasseler Informatikschriften UR - https://fis.uni-bamberg.de/handle/uniba/4741 LA - eng AB - With the growing number of mobile devices and the access possibility to thousands of images from these devices, the users call for efficient image search techniques for mobile devices. Desktop paradigms cannot be used with the smaller screen sizes, hence it is needful to offer alternative searching and browsing strategies, which are adapted for mobile devices. In this paper we describe our ideas how image retrieval on mobile devices can be accomplished. KW - Image Retrieval ER - TY - CHAP TI - Knowledge Management for Hybrid Learning AU - Sieber, Stefanie AU - Henrich, Andreas PY - 2010 T2 - Handbook of Research on Hybrid Learning Models : Advanced Tools, Technologies, and Applications SP - 424-449 PB - IGI Global CY - Hershey, PA SN - 978-1-60566-380-7 DO - 10.4018/978-1-60566-380-7.ch026 UR - https://fis.uni-bamberg.de/handle/uniba/3286 LA - eng AB - The merging of knowledge management and hybrid learning has gained more and more attraction and has been put in the focus of interests lately, for the simple reason that both areas can benefit from each other. As a result, this chapter deals with knowledge management for hybrid learning. This chapter begins with a short introduction, followed by a brief clarification showing our understanding of hybrid learning. Afterwards, knowledge and associated attributes are defined precisely - definitions are derived and taxonomies for knowledge are described. This section closes with a first reflection on knowledge in the context of hybrid learning. Subsequently, the authors take a closer look at knowledge management by introducing different schools of thought and models for knowledge management. Opportunities to delve deeper into the subject individually are offered passim. The main part of the chapter provides a comprehensive view of knowledge management for hybrid learning. The described features range from general conclusions to theoretical aspects, exemplary projects, and finally practical aspects - previous deliberations are brought together, current insights concerning the research perspective are described and tools as well as techniques which foster knowledge management for hybrid learning are presented. Finally a critical reflection as well as an outlook and some thoughts concerning future issues conclude this chapter. KW - knowledge management KW - hybrid learning ER - TY - JOUR TI - Multimedia Information Retrieval AU - Henrich, Andreas PY - 2009 JO - Information technology : methods and applications of informatics and information technology VL - 51 IS - 6 SP - 336 - 342 PB - De Gruyter Oldenbourg CY - Berlin SN - 2196-7032 DO - 10.1524/itit.2009.0560 UR - https://fis.uni-bamberg.de/handle/uniba/20406 LA - deu AB - Der Umfang, in dem multimediale Daten verfügbar sind, nimmt ständig zu. Dies gilt für das Internet ebenso wie für die Daten auf dem heimischen PC oder auch auf einem PDA. Eine wesentliche Herausforderung stellt dabei die Suche nach Medienobjekten dar. Der vorliegende Artikel geht auf grundlegende Konzepte und Problemstellungen zur Suche nach Medienobjekten und multimedialen Dokumenten ein und gibt einen Überblick über die für verschiedene Medientypen existierenden Ansätze. KW - Suche KW - Multimedia KW - Suchmaschine KW - Bildsuche KW - search KW - multimedia KW - search engine KW - image retrieval ER - TY - CPAPER TI - Searching Multiple Artifacts : a Comprehensive Framework for Complex Search Situations AU - Weber, Nadine AU - Eckstein, Raiko AU - Henrich, Andreas PY - 2009 T2 - Flexible query answering systems : 8th international conference, FQAS 2009, Roskilde, Denmark, October 26 - 28, 2009 ; proceedings SP - 251-262 PB - Springer CY - Berlin u.a. T3 - Lecture notes in computer science SN - 978-3-642-04956-9 DO - 10.1007/978-3-642-04957-6_22 UR - https://fis.uni-bamberg.de/handle/uniba/20365 LA - eng AB - The paper presents a comprehensive search framework that deals with different types of artifacts and therefore is suitable for situations where the information need behind a search request is sketchy. Such situations are characteristic for the product development domain, on which our research is focused. To support design engineers, various search concepts for specific computer aided engineering (CAE) document types, like e.g. 3D shape similarity methods, have been proposed. Although these methods might be beneficial for certain situations, there is a strong demand for a more generic approach that enables goal-oriented as well as exploratory searching for multiple artifacts such as products, documents, and materials. Hence, we base our framework on the ideas of faceted search, ranking, query-by-example, and parallel coordinates. Furthermore, we extend these concepts by artifact type hierarchies facilitating the generation of artifact type-specific facet data and the adaptability of this integrated approach for other domains as well. KW - Complex Search Situations ER - TY - CHAP TI - Ad Hoc Determination of Geographic Regions for Concept@Location Queries AU - Henrich, Andreas AU - Lüdecke, Volker PY - 2009 T2 - Weaving Services and People on the World Wide Web SP - 169-194 PB - Springer CY - Berlin u.a. ET - 1. Aufl. SN - 978-3-642-42562-2 DO - 10.1007/978-3-642-00570-1_9 UR - https://fis.uni-bamberg.de/handle/uniba/18790 LA - eng AB - Textual geographic queries to search engines usually consist of the desired concept and also of one or more terms describing a location, which is often the name of a city, which in turn can usually be grounded with the help of a gazetteer. On other occasions, though, the location refers to a (vague) geographic region and may also be a vernacular expression for that region, so that this location specification cannot be found in a gazetteer. In this chapter we describe an approach to determine the boundaries for such locations and how to integrate this approach into the query process. The key features of our approach are that a geographic search engine is able to handle any textual description of a geographic region at query time and that this computation can be done completely automatically. In our approach we derive a representation for a region from the toponyms found in the top web documents resulting from a query using the terms describing the location. In addition to that, we introduce two other uses of this approach: first, this method can be used for answering where-is queries (where only a query location, but no query concept is given), and second, we can determine geographic representations for arbitrary terms that are not genuine geographic regions. In that case, the geographic representation provides a visual impression of the geographic correlation of those terms. KW - Concept@Location Queries ER - TY - CPAPER TI - Das LFRP-Framework zur Beherrschung komplexer Suchsituationen AU - Eckstein, Raiko AU - Henrich, Andreas AU - Weber, Nadine PY - 2009 T2 - WIR 2009 : Workshop Information Retrieval 2009 ; Lernen Wissen Adaptivität, LWA 2009 Darmstadt 21. - 23. Sept. 2009 SP - 84 - 91 CY - Darmstadt UR - https://fis.uni-bamberg.de/handle/uniba/18794 LA - deu ER - TY - CPAPER TI - A Hybrid Index Structure for Geo-Textual Searches AU - Göbel, Richard AU - Henrich, Andreas AU - Niemann, Raik AU - Blank, Daniel PY - 2009 T2 - CIKM '09 : Proceedings of the 18th ACM conference on Information and knowledge management SP - 1625–1628 PB - ACM CY - New York SN - 978-1-60558-512-3 DO - 10.1145/1645953.1646188 UR - https://fis.uni-bamberg.de/handle/uniba/18759 LA - eng AB - The efficient execution of multi-criteria queries has gained increasing interest over the last years. In the present paper we propose an R-tree based approach for queries addressing textual as well as geographic filter conditions. Whereas most previous approaches use an index structure optimised for a single criterion adding special treatment for the other criterion at the leaf nodes or end points of this index structure, our approach uses a deeper integration. In short, R-trees are maintained for certain subsets of the whole term set. Furthermore, in each of these R-trees bit sets are used within the nodes to indicate whether entries for the terms associated with the single bits can be found in the corresponding sub-tree. Our index structure aims to be both, time and space efficient. The paper investigates the efficiency and applicability of the proposed index structure via practical experiments based on real-world and synthetic data. KW - R-Tree KW - Inverted Index KW - Geographical IR ER - TY - JOUR TI - Das LFRP-Framework : ein Ansatz zur interaktiven Suche für unternehmensspezifische Informationen AU - Eckstein, Raiko AU - Henrich, Andreas AU - Weber, Nadine PY - 2009 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V. VL - 9 IS - 30 SP - 20-29 PB - Springer CY - Berlin ; Heidelberg SN - 1618-2162 UR - https://fis.uni-bamberg.de/handle/uniba/18762 LA - deu AB - Der Bedarf an unterschiedlichen »Informationsträgern«, nachfolgend als Artefakte bezeichnet, sowie eine unklare Vorstellung über die benötigte Information beim Nutzer führen zu komplexen Suchsituationen, wie sie heutzutage in vielen Unternehmen vorzufinden sind. So werden z.B. bei der Entwicklung technischer Produkte unterschiedlichste Artefakte wie Dokumente, Produkte oder Materialien benötigt, wobei Informationsbedürfnisse oft nur vage und ungenau beschrieben werden können. Zusätzlich erschweren die Heterogenität der vorhandenen Ablagesysteme und das fehlen einer übergreifenden Suchfunktionalität das Auffinden relevanter Information. Aus diesem Grund wird mit dem LFRP-Framework ein Forschungsansatz vorgestellt, der durch die Bereitstellung eines interaktiven Retrieval-Modells zur Beherrschung derartig komplexer Suchsituationen beiträgt. LFRP steht hierbei für die vier Basiselemente, die zu einem übergreifenden Framework integriert werden: Durch die Verwendung mehrerer Artefaktebenen (l.ayer) wird der Vielfalt nachgefragter Artefakte begegnet. Die Suche nach den Artefakten selbst erfolgt gemäß dem Paradigma der facettierten Suche. Allerdings erlaubt eine reine Filterung der Ergebnismenge keine Aussage hinsichtlich der Relevanz der Ergebnisse. Folglich erweitern wir das bekannte Konzept um Möglichkeiten zur Erstellung eines Bankings auf Basis sowohl von Facettenwerten als auch Query-by-Example-{QbE-)Ansätzen. Zusätzlich schlagen wir eine visuelle Form der Anfrageformulierung mittels paralleler Koordinaten vor, die Einblicke in die Charakteristika und Abhängigkeiten der gefundenen Ergebnisse bietet. KW - LFRP-Framework ER - TY - CPAPER TI - Effectively Managing and Processing Personal Learning Content AU - Sieber, Stefanie AU - Henrich, Andreas PY - 2009 T2 - Advances in Web Based Learning : ICWL 2009 ; 8th International Conference, Aachen, Germany, August 19-21, 2009, Proceedings SP - 363-366 PB - Springer CY - Berlin SN - 978-3-642-03426-8 DO - 10.1007/978-3-642-03426-8_43 UR - https://fis.uni-bamberg.de/handle/uniba/18770 LA - eng AB - Comparing the typical learner only about one or two decades ago and today, an undeniable difference is evident. By now, most of traditional learning has been moved into a continuum of blended learning, as defined by Jones [1]. In this context, especially ways for distributing learning material and contacting each other have completely changed. Learning Management Systems (LMS) are, in the majority of cases, employed to provide a basis for modern learning. Whether it comes to distance learning or not, all required material, including additional information for further reading and tasks controlling the learner’s success, is provided online such that learners can easily access all desired information any time and any place. Communication has been detached from specific points or periods in time as well. This digitalization of the learning process also bears new challenges, which have to be faced by learners as well as lecturers. The concept, introduced in this paper, addresses these facts by delivering a service to set the stage for a personal learning environment adjusted to the needs of a single user. Hence, it provides facilities for integrated maintenance and search in heterogeneous personal learning material. KW - Personal Learning Content ER - TY - CPAPER TI - Picadomo : Faceted Image Browsing for Mobile Devices AU - Hub, Adrian AU - Blank, Daniel AU - Henrich, Andreas AU - Müller, Wolfgang PY - 2009 T2 - 2009 Seventh International Workshop on Content-Based Multimedia Indexing SP - 249-254 PB - IEEE CY - Piscataway, NJ DO - 10.1109/CBMI.2009.34 UR - https://fis.uni-bamberg.de/handle/uniba/18766 LA - eng AB - Picadomo combines content-based image retrieval and faceted search on mobile devices. It is designed for finding images with desired visual properties, tags or other known metadata. Due to the limitations of mobile devices such as small screen sizes and low processing power, we had to carefully select the features that come in use (dominant color, GPS data, tags, etc.). With Picadomo the user can pick visualized facets directly via touch screen, while using very little screen size for the facet browsing navigation. We present our architecture, the facets used for image browsing, our new control concept and user experiments. KW - Picadomo ER - TY - CPAPER TI - Summarizing Georeferenced Photo Collections for Image Retrieval in P2P Networks AU - Blank, Daniel AU - Henrich, Andreas PY - 2009 T2 - Proceedings: Workshop on Geographic Information on the Internet, 2009, im Rahmen der 31st European Conference on Information Retrieval) 6. April 2009. UR - https://fis.uni-bamberg.de/handle/uniba/18761 LA - eng ER - TY - JOUR TI - Blended learning and pure e-learning concepts for information retrieval : experiences and future directions AU - Henrich, Andreas AU - Sieber, Stefanie PY - 2009 JO - Information retrieval journal VL - 12 IS - 2 SP - 117-147 PB - Springer CY - New York SN - 1386-4564 DO - 10.1007/s10791-008-9079-3 UR - https://fis.uni-bamberg.de/handle/uniba/18752 LA - eng AB - Today, teaching and learning are mostly supported by digital material and electronic communication ranging from the provision of slides or scripts in digital form to elaborate, interactive learning environments. This article describes the prospects and risks of blended learning and e-learning for information retrieval courses. It deals with adequate content presentation and representation, as well as with interaction concepts and didactic considerations concerning the cost-benefit ratio of animations, applets, and multimedia elements. We present lessons learnt from 6 years of teaching information retrieval in blended learning and pure e-learning scenarios, and derive graded concepts for basic and advanced topics based on a book-like content representation on the one side, and lecture-recordings on the other side. Each concept is complemented by a pragmatic and focussed use of auxiliary elements such as forums and self-tests. Examples for beneficial and misguided applets and animations are given, along with criteria for their differentiation. Finally, critical success factors for technology enhanced learning approaches in the information retrieval field are derived concerning the creation, utilisation, and maintenance of courses. In short, we will argue that taking into account the nature and stability of the presented content, as well as a thorough consideration of the affordable creation and maintenance effort, are crucial for the success of such concepts. In addition, the closer the concept is to pure e-learning, the more important a high digital presence of the lecturer becomes. KW - Teaching information retrieval KW - Blended learning KW - e-Learning KW - Interaction ER - TY - JOUR TI - Information Retrieval : Concepts and Practical Considerations for Teaching a Rising Topic AU - Blank, Daniel AU - Fuhr, Norbert AU - Henrich, Andreas AU - Mandl, Thomas AU - Rölleke, Thomas AU - Schütze, Hinrich AU - Stein, Benno PY - 2009 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V. VL - 9 IS - 29 SP - 30-41 PB - Springer CY - Berlin ; Heidelberg SN - 1618-2162 UR - https://fis.uni-bamberg.de/handle/uniba/18756 LA - eng AB - The last two decades have seen an enormous increase in the amount of information available, in the form of text documents as well as multimedia data such as images, speech and video. As a result, information retrieval (IR) has become a central topic of computer science and related disciplines and is now part of many curricula for bachelor and master programs. In this article, we outline which concepts should be integral part of IR courses depending on the orientation of the degree program (e.g. business vs. research). In addition to the theoretical content of IR courses, we also address practical considerations, based on the authors extensive experience in teaching IR. We comment on the suitability of a number of tools and systems and of different forms of teaching, including e-learning, in the IR classroom. KW - Information Retrieval ER - TY - CPAPER TI - Measuring Similarity of Geographic Regions for Geographic Information Retrieval AU - Henrich, Andreas AU - Lüdecke, Volker PY - 2009 T2 - Advances in information retrieval : 31th European Conference on IR Research, ECIR 2009, Toulouse, France, April 6-9, 2009, Proceedings SP - 781-785 PB - Springer CY - Berlin u.a. T3 - Lecture Notes in Computer Science SN - 978-3-642-00957-0 DO - 10.1007/978-3-642-00958-7_85 UR - https://fis.uni-bamberg.de/handle/uniba/18753 LA - eng AB - Representations of geographic regions play a decisive role in geographic information retrieval, where the query is specified by a conceptual part and a geographic part. One aspect is to use them as query footprint which is then applied for the geographic ranking of documents. Users often specify textual descriptions of geographic regions that are not contained in the underlying gazetteer or geographic database. Approaches that automatically determine a geographic footprint for those locations have a strong need for measuring the quality of this footprint, for evaluation as well as for automatical parameter learning. This quality is determined by the ’similarity’ between the footprint and a correct representation of that region. In this paper we introduce three domain-specific points of view for measuring the similarity between representations of geographic regions for geographic information retrieval. For each point of view (strict similarity, visual similarity and similarity in ranking) we introduce a dedicated measure, two of which are novel measures that we propose in this paper. KW - Geographic Information Retrieval ER - TY - CPAPER TI - Visual Browsing in Product Development Processes AU - Eckstein, Raiko AU - Henrich, Andreas PY - 2009 T2 - DS 58-8 : Proceedings of ICED 09, the 17th International Conference on Engineering Design SP - 183-194 PB - The Design Society CY - Glasgow UR - https://fis.uni-bamberg.de/handle/uniba/18757 LA - eng ER - TY - BOOK TI - Flexible Prozessunterstützung in der Produktentwicklung : Prozesse - Daten - Navigation ; Abschlussbericht 01.10.2006 - 30.09. 2009 ED - Meerkamm, Harald ED - Henrich, Andreas ED - Jablonski, Stefan ED - Krcmar, Helmut ED - Lindemann, U. ED - Rieg, Frank PY - 2009 PB - Shaker CY - Aachen SN - 978-3-8322-8640-8 UR - https://fis.uni-bamberg.de/handle/uniba/18654 LA - deu ER - TY - CPAPER TI - Approaches for determining the geographic footprint of arbitrary terms for retrieval and visualization AU - Henrich, Andreas AU - Lüdecke, Volker AU - Blank, Daniel PY - 2008 T2 - GIS '08 : Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems IS - 43 PB - ACM CY - New York SN - 978-1-60558-323-5 DO - 10.1145/1463434.1463488 UR - https://fis.uni-bamberg.de/handle/uniba/18749 LA - eng AB - Determining the bounds of geographic regions is an important task for geographic search engines which use concept@location-type of queries. The location a user specifies is often not contained in the underlying gazetteer or geographic database, which might be due to vernacular descriptions of regions or because the location is not a geographic region in the narrow sense, which is the case in queries like campground near theme park. In the present paper we describe different ways for automatically determining a geographic footprint for those locations so that a geographic search engine is able to deal with all kinds of location-descriptions. The same approaches can be used to visualize the geographic correlation of arbitrary terms, like the visualization of the spread of certain colloquialisms. The basic idea is to mine locations found in the top documents resulting from a query consisting of the terms the user has chosen to specify the location. We describe how this can be done using kernel density estimation, clustering and a combination thereof. KW - Vague geographic regions KW - Geographic search engines ER - TY - CPAPER TI - Evaluation, Analysis, and Future Issues of a University-wide Learning Management System Concluding a Two-year Initiation Phase AU - Henrich, Andreas AU - Sieber, Stefanie AU - Wolf, Sven-Uwe PY - 2008 T2 - e-Learning Baltics 2008 : Proceedings of the 1st International eLBa Science Conference, 17. Juni - 19. Juni 2008, Rostock SP - 103-114 PB - Fraunhofer IRB Verlag CY - Stuttgart ET - 1 SN - 978-3-8167-7781-6 UR - https://fis.uni-bamberg.de/handle/uniba/18746 LA - eng AB - This paper presents the review and evaluation of the two-year introduction phase of a university-wide learning management system at the University of Bamberg. For deeper insights the project settings ar described at first and to receive an impression of the success some usage statistics arc presented. Subsequently the evaluation accomplished to conclude the introduction phase is sketched. The two parts of this evaluation designed for the most important user groups -student and lectures - are described and the most important results are presented in short. As response to the received resuIts three evolved issues are selected and possible solutions are shown. Finally a conclusion depicting the changes and the new situation after these two years complete this contribution. KW - Learning Management System ER - TY - CPAPER TI - Determining geographic representations for arbitrary concepts at query time AU - Henrich, Andreas AU - Lüdecke, Volker PY - 2008 T2 - LOCWEB '08 : Proceedings of the first international workshop on Location and the web SP - 17-24 PB - ACM CY - New York SN - 978-1-60558-160-6 DO - 10.1145/1367798.1367802 UR - https://fis.uni-bamberg.de/handle/uniba/17573 LA - eng AB - In typical concept@location-queries, the location is sometimes given by terms that cannot be found in gazetteers or geographic databases. Such terms usually describe vague geographical regions, but might also include more general terms like mining or theme parks, in which case the corresponding geographic footprint is less obvious. In the present paper we describe our approach to deal with such vague location specifications in geographic queries. Roughly, we determine a geographic representation for these location specifications from toponyms found in the top documents resulting from a query using the terms describing the location. In this paper we describe an efficient process to derive the geographic representation for such situations at query time. Furthermore, we present experiments depicting the performance of our approach as well as the result quality. Our approach allows for an efficient execution of queries such as camping ground near theme park. It can also be used as a standalone-application giving a visual impression of the geographic footprint of arbitrary terms. KW - Vague geographic regions KW - Geographic search engines ER - TY - BOOK TI - Information Retrieval 1 (Grundlagen, Modelle und Anwendungen) AU - Henrich, Andreas PY - 2008 PB - Lehrstuhl für Medieninformatik CY - Bamberg ET - Version 1.2 (07.01.2008) UR - https://fis.uni-bamberg.de/handle/uniba/17569 LA - deu ER - TY - CPAPER TI - Reaching the Boundaries of Context-Aware IR: Accepting Help from the User AU - Eckstein, Raiko AU - Henrich, Andreas PY - 2008 T2 - Proceedings of the Second International Workshop on Adaptive Information Retrieval (AIR 2008) ; 18 October 2008 London, UK SP - 1 - 6 CY - London UR - https://fis.uni-bamberg.de/handle/uniba/17577 LA - eng ER - TY - CPAPER TI - Designing Benchmarks for the Evaluation of Peer-to- Peer Information Retrieval Systems AU - Blank, Daniel AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2008 T2 - LWA 2008 : Workshop-Woche: Lernen, Wissen & Adaptivität ; Würzburg, 6.-8. Oktober 2008 SP - 57 - 64 CY - Würzburg T3 - University of Würzburg, Germany / Department of Computer Science: Technical Report UR - https://fis.uni-bamberg.de/handle/uniba/17551 LA - eng ER - TY - CPAPER TI - Image Data Source Selection Using Gaussian Mixture Models AU - El Allali, Soufyane AU - Blank, Daniel AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2008 T2 - Adaptive multimedial retrieval: retrieval, user, and semantics : 5th International Workshop, AMR 2007, Paris, France, July 5 - 6, 2007 ; revised selected papers SP - 170-181 PB - Springer CY - Berlin u.a. SN - 978-3-540-79859-0 DO - 10.1007/978-3-540-79860-6_14 UR - https://fis.uni-bamberg.de/handle/uniba/17555 LA - eng AB - In peer-to-peer (P2P) networks, computers with equal rights form a logical (overlay) network in order to provide a common service that lies beyond the capacity of every single participant. Efficient similarity search is generally recognized as a frontier in research about P2P systems. In literature, a variety of approaches exist. One of which is data source selection based approaches where peers summarize the data they contribute to the network, generating typically one summary per peer. When processing queries, these summaries are used to choose the peers (data sources) that are most likely to contribute to the query result. Only those data sources are contacted. In this paper we use a Gaussian mixture model to generate peer summaries using the peers’ local data. We compare this method to other local unsupervised clustering methods for generating peer summaries and show that a Gaussian mixture model is promising when it comes to locally generated summaries for peers without the need for a distributed summary computation that needs coordination between peers. KW - Image Data KW - Source Selection KW - Gaussian Mixture Models ER - TY - CPAPER TI - Interaction and user experiences with multimedia technologies : challenges and future topics AU - Scherp, Ansgar AU - Nack, Frank AU - Nahrstedt, Klara AU - Inoue, Masashi AU - Girgensohn, Andreas AU - Henrich, Andreas AU - Sandhaus, Philipp AU - Thieme, Sabine AU - Zhou, Michelle PY - 2008 T2 - HCC '08 : Proceedings of the 3rd ACM international workshop on Human-centered computing SP - 1-6 PB - ACM CY - New York SN - 978-1-60558-320-4 DO - 10.1145/1462027.1462028 UR - https://fis.uni-bamberg.de/handle/uniba/17550 LA - eng AB - In this paper, we investigate future topics and challenges of interaction and user experience in multimedia We bring together different perspectives from overlapping fields of research such as multimedia, human-computer interaction, information retrieval, networked multimedia, and creative arts. Based on potential intersections, we define three application domains to be investigated further, as they create high demand and good prospect for long-lasting developments in the future. These application domains are: media working environments, media enter-/edutainment, and social media engagement. Each application domain is analyzed along five dimensions, namely: information quality, presentation quality, ambience, interactivity, and user expectations. Based on this analysis, we identify the most pressing research questions and key challenges for each area. Finally, we advocate a user-centered approach to tackle these challenges and questions in order to develop relevant multimedia applications that best meet the users' expectations. KW - Interaction KW - User Experience KW - Multimedia KW - Human-computer Interaction KW - Information Retrieval KW - Networked Multimedia KW - Creative Arts ER - TY - CPAPER TI - VisualFlamenco : Dependable, Interactive Image Browsing Based on Visual Properties AU - Müller, Wolfgang AU - Zech, Markus AU - Henrich, Andreas AU - Blank, Daniel PY - 2008 T2 - Proceedings: 2008 International Workshop on Content-Based Multimedia Indexing : CBMI 2008 ; London, United Kingdom, 18 - 20 June 2008 SP - 568-575 PB - IEEE CY - Piscataway, NJ DO - 10.1109/CBMI.2008.4564998 UR - https://fis.uni-bamberg.de/handle/uniba/17554 LA - eng AB - Faceted search as a method for exploratory search is a search interface technique for Boolean retrieval that provides a good compromise between the wish to guide the user and the need to give freedom to the user. Both, guidance and freedom are needed in order to enable him (or her) to accomplish his search goal as quickly and efficiently as possible. The search goal can be both, to retrieve a target image (lookup search) or to get an overview of a collection as the basis for accomplishing complex search tasks (exploratory search). VisualFlamenco is about bringing content-based image retrieval and faceted search together. While there is some preexisting work towards faceted search based on automatically extracted metadata, the base innovation of our work is to visualize the meaning of facets and let the user pick visualized facets directly. The main point is this research is to give the user the right expectations about what the system can achieve. We see this as a step towards dependable multimedia search, search interfaces that do not promise more than they can achieve. A mismatch of expectations and possibilities has been denoted by some as one of the main problems in current research about multimedia search. Within this paper we present a visual faceted search tool that seeks to provide dependable image search. We describe its base idea, the features used, as well as user experiments done using the system. KW - VisualFlamenco ER - TY - CPAPER TI - An integrated context model for the product development domain and its implications on design reuse AU - Eckstein, Raiko AU - Henrich, Andreas PY - 2008 T2 - Proceedings of the 10th International Design Conference : (DESIGN 2008 Cavtat - Dubrovnik, Croatia May 19 - 22, 2008) SP - 761 - 768 CY - Dubrovnik, Croatia UR - https://fis.uni-bamberg.de/handle/uniba/17540 LA - eng ER - TY - CPAPER TI - Characteristics of geographic information needs AU - Henrich, Andreas AU - Lüdecke, Volker PY - 2007 T2 - GIR '07 : Proceedings of the 4th ACM workshop on Geographical information retrieval SP - 1-6 PB - ACM CY - New York SN - 978-1-59593-828-2 DO - 10.1145/1316948.1316950 UR - https://fis.uni-bamberg.de/handle/uniba/17544 LA - eng AB - A Geographic Information Retrieval (GIR) system for answering geographic queries has to cope with various information needs, which have a wide range of contexts and implicit requirements. A user, for example, who is looking for a place to spend his or her holidays certainly has a different understanding of distance than a user looking for a bar in the city he or she lives in. To get a better understanding of geographic information needs and their implications for GIR systems, we analysed real world (geographic) queries with regard to different facets of geographic references in queries. The results of this analysis are presented in this paper, the aim of which was a classification of the geographic aspects of information needs. We present empirical results and line out possible classification criteria, which could be helpful in designing GIR systems that are able to consider different semantics of geographic references in queries. KW - Experimentation KW - Human Factors ER - TY - CPAPER TI - Concepts of Blended Learning for Different Content Types AU - Henrich, Andreas AU - Sieber, Stefanie PY - 2007 T2 - Blended Learning : Workshop on Blended Learning 2007 Edinburgh, United Kingdom 15 - 17.08.07 SP - 150 - 161 CY - Edinburgh UR - https://fis.uni-bamberg.de/handle/uniba/17546 LA - eng ER - TY - CPAPER TI - Integration eines hochschulweiten LMS in die Systemlandschaft einer Hochschule - ein pragmatischer Ansatz AU - Henrich, Andreas AU - Sieber, Stefanie AU - Wolf, Sven-Uwe PY - 2007 T2 - Flexibel integrierbares e-Learning : nahe Zukunft oder Utopie?; proceedings of the Workshop on E-Learning 2007, HTWK Leipzig, 09. - 10. Juli 2007 (WEL '07) CY - Leipzig UR - https://fis.uni-bamberg.de/handle/uniba/17536 LA - deu ER - TY - BOOK TI - Rechner- und Betriebssysteme, Kommunikationssysteme, Verteilte Systeme AU - Eisenhardt, Martin AU - Henrich, Andreas AU - Sieber, Stefanie PY - 2007 PB - Lehrstuhl für Medieninformatik CY - Bamberg ET - 39427 UR - https://fis.uni-bamberg.de/handle/uniba/17547 LA - deu ER - TY - CPAPER TI - Integration possibilities of a context-based search engine into a project planning portal in the mechanical engineering domain AU - Eckstein, Raiko AU - Henrich, Andreas PY - 2007 T2 - LWA 2007 : Lernen, Wissen, Adaption, Halle, September 2007 ; Workshop Proceedings SP - 244 - 251 CY - Halle UR - https://fis.uni-bamberg.de/handle/uniba/16403 LA - eng ER - TY - CPAPER TI - Retrieval of technical drawings in DXF format - concepts and problems AU - Weber, Nadine AU - Henrich, Andreas PY - 2007 T2 - LWA 2007 : Lernen, Wissen, Adaption, Halle, September 2007 ; Workshop Proceedings SP - 213 - 220 CY - Halle UR - https://fis.uni-bamberg.de/handle/uniba/16363 LA - eng ER - TY - CPAPER TI - Sample-based Creation of Peer Summaries for Efficient Similarity Search in Scalable Peer-to-Peer Networks AU - Blank, Daniel AU - El Allali, Soufyane AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2007 T2 - MIR '07 : Proceedings of the international workshop on Workshop on multimedia information retrieval SP - 143-151 PB - ACM CY - New York SN - 978-1-59593-778-0 DO - 10.1145/1290082.1290104 UR - https://fis.uni-bamberg.de/handle/uniba/16361 LA - eng AB - In this paper we introduce a simple yet experimentally convincing approach in the research field of source selection for content-based similarity search in P2P networks or, more concretely, in summary-based P2P systems. In these systems, summaries are used for data source selection when performing k-NN queries on distributed collections of documents represented by feature vectors. We introduce a new type of cluster-based summaries for source selection that can efficiently and cheaply be calculated and distributed in P2P networks. For the summaries generation, a very large number of sample points is used. Each peer in the network assigns its indexing data to their corresponding closest sample points and publishes its constructed summary. We evaluate the quality of these summaries when changing the number of sample points used in experiments on real-world image feature data obtained from a large crawl of the flickr web photo community and show that for higher numbers of sample points we achieve a better retrieval performance. Our experiments show that the proposed summaries yield four times better performance with respect to previous methods. Intuitively, there are some disadvantages to this approach due to the large size of the generated summaries. We show experimentally, that these disadvantages can easily be overcome due to the sparse nature of the generated summaries by simple compression techniques. KW - P2P KW - CBIR KW - Source selection ER - TY - CPAPER TI - Untersuchung des Einflusses verschiedener Bild- Features und Distanzmaße im inhaltsbasierten P2P Information Retrieval AU - El Allali, Soufyane AU - Blank, Daniel AU - Eisenhardt, Martin AU - Henrich, Andreas AU - Müller, Wolfgang PY - 2007 T2 - Datenbanksysteme in Business, Technologie und Web (BTW) : 12. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS) ; 07. - 09.03.2007 in Aachen SP - 382 - 396 PB - Gesellschaft für Informatik e.V. CY - Bonn SN - 978-3-88579-197-3 UR - https://fis.uni-bamberg.de/handle/uniba/16364 LA - deu AB - Gegenstand der vorliegenden Arbeit ist die feature-basierte Ähnlichkeitssuche in Bilddatenbeständen, die in einem P2P-Netz verteilt sind. Wir untersuchen dabei die Eignung verschiedener Featuresätze und Distanzmaße für die Nutzung in diesem Szenario. Hierzu beziehen wir uns primär auf PlanetP-artige P2P-Netze und vergleichen die in Abhängigkeit von der Anzahl der kontaktierten Peers erreichten Ergebnisse zunächst mit einem zentralen System mit gleichem Featuresatz und Distanzmaß. Ferner vergleichen wir unser System mit einer Erweiterung, die Indexdaten im P2P-Netz transferiert, sowie mit der Implementierung einer auf CANs basierenden verteilten Indexstruktur. Schließlich evaluieren wir das System auch mittels Relevanzbeurteilungen, die von Testnutzern gegeben wurden. Die Ergebnisse zeigen deutlich die unterschiedliche Eignung verschiedener Featuresätze und Distanzmaße für unser P2P-Szenario auf. KW - Information Retrieval ER - TY - JOUR TI - VC : Der Virtuelle Campus als Ergänzung zum Hörsaal AU - Henrich, Andreas PY - 2007 JO - Uni.vers : das Magazin der Otto-Friedrich-Universität Bamberg VL - 7 IS - 12 = Studieren in Bamberg SP - 28 SN - 1618-9019 UR - https://fis.uni-bamberg.de/handle/uniba/16027 LA - deu AB - - KW - Virtueller Campus ER - TY - CPAPER TI - Information Retrieval as eLearning Course in German : Lessons Learned after 5 Years of Experience AU - Henrich, Andreas AU - Morgenroth, Karlheinz PY - 2007 T2 - TLIR'07: Proceedings of the First international conference on Teaching and Learning of Information Retrieval SP - 18 - 23 PB - BCS Learning & Development Ltd. CY - Swindon, United Kingdom UR - https://fis.uni-bamberg.de/handle/uniba/14820 LA - eng ER - TY - CPAPER TI - Aspects of Adaptivity in P2P Information Retrieval AU - Müller, Wolfgang AU - Henrich, Andreas AU - Eisenhardt, Martin PY - 2007 T2 - Adaptive Multimedia Retrieval:User, Context, and Feedback : 4th International Workshop, AMR 2006, Geneva, Switzerland, July, 27-28, 2006 ; Revised Selected Papers SP - 164-178 PB - Springer CY - Berlin ; Heidelberg SN - 978-3-540-71544-3 DO - 10.1007/978-3-540-71545-0_13 UR - https://fis.uni-bamberg.de/handle/uniba/14573 LA - eng AB - Peer-to-Peer networks are comprised of multiple independently administered computers (peers) that cooperate via a common protocol in order to achieve a goal common to the peers. Helping the user find relevant information in a P2P network is the subject of the field of Peer-to-Peer IR. In order to be successful, a P2P-IR system needs to be adaptive in several respects. It has to adapt both to the user and to its environment. Within this article we detail the motivations and challenges of P2P-IR, as well as the ways in which P2P-IR systems adapt and where improvement is needed in order to achieve adaptive multimedia retrieval. KW - P2P Information Retrieval ER - TY - CPAPER TI - Clustering-Based Source Selection for Efficient Image Retrieval in Peer-to-Peer Networks AU - Eisenhardt, Martin AU - Müller, Wolfgang AU - Henrich, Andreas AU - Blank, Daniel AU - El Allali, Soufyane PY - 2006 T2 - Proceedings : ISM 2006, Eighth IEEE International Symposium on Multimedia : 11 - 13 December 2006, San Diego, CA SP - 823-830 PB - IEEE CY - Los Alamitos, Calif. DO - 10.1109/ISM.2006.47 UR - https://fis.uni-bamberg.de/handle/uniba/16359 LA - deu AB - In peer-to-peer (P2P) networks, computers with equal rights form a logical (overlay) network in order to provide a common service that lies beyond the capacity of every single participant. Efficient similarity search is generally recognized as a frontier in research about P2P systems. One way to address it is using data source selection based approaches where peers summarize the data they contribute to the network, generating typically one summary per peer. When processing queries, these summaries are used to choose the peers (data sources) that are most likely to contribute to the query result. Only those data sources are contacted. There are two main contributions of this paper. We extend earlier work, adding a data source selection method for high-dimensional vector data, comparing different peer ranking schemes. More importantly, we present a method that uses progressive stepwise data exchange between peers to better each peer's summary and therefore improve the system's performance. KW - Efficient Image Retrieval KW - Peer-to-Peer Networks ER - TY - CPAPER TI - Bedeutung des Design for X für die Informationsversorgung von Entwicklern innerhalb des Entwicklungsprozesses AU - Henrich, Andreas AU - Morgenroth, Karlheinz PY - 2006 T2 - Design for X : Beiträge zum 17. Symposium, Neukirchen, 12. und 13. Oktober 2006 SP - 81-102 PB - Friedrich-Alexander-Universität Erlangen-Nürnberg CY - Erlangen SN - 978-3-9808539-4-1 UR - https://fis.uni-bamberg.de/handle/uniba/14868 LA - deu ER - TY - CPAPER TI - Ansätze zur Bestimmung von Locality für deutsche Webseiten AU - Eckstein, Raiko AU - Henrich, Andreas AU - Lüdecke, Volker PY - 2006 T2 - LWA 2006 : Lernen – Wissensentdeckung – Adaptivität (9.–11.10.2006 in Hildesheim) SP - 69-76 CY - Hildesheim UR - https://fis.uni-bamberg.de/handle/uniba/14825 LA - deu AB - Das geographische Information Retrieval (GeoIR) berücksichtigt bei Suchanfragen – insb. nach Webseiten – neben dem Inhalt von Dokumenten auch eine räumliche Komponente, um gezielt nach Seiten suchen zu können, die für eine spezifsche Region bedeutsam sind. Dazu müssen GeoIR-Systeme den geographischen Kontext einer Webseite erkennen können und in der Lage sein zu entscheiden, ob eine Seite überhaupt regional-spezifsch (”lokal“) ist oder einen rein informativen Charakter besitzt, der keinen geographischen Bezug besitzt. Im Folgenden werden Ansätze vorgestellt, Merkmale lokaler Seiten zu ermitteln und diese für eine Einteilung von Webseiten in globale und lokale Seiten zu verwenden. Dabei sollen insbesondere die sprachlichen und geographischen Eigenschaften deutscher Webseiten berücksichtigt werden. KW - Webseiten ER - TY - CPAPER TI - Parameters in P2P-IR AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2006 T2 - Informatik 2006: Informatik für Menschen ; Beiträge der 36. Jahrestagung der Gesellschaft für Informatik e.V. (GI) ; 2. bis 6. Oktober 2006 in Dresden SP - 4-11 PB - Gesellschaft für Informatik e.V. CY - Bonn T3 - GI-Edition : Proceedings SN - 978-3-88579-187 UR - https://fis.uni-bamberg.de/handle/uniba/14818 LA - eng AB - P2P Information Retrieval (P2P-IR) is a challenging and potentially very useful area of research. Its goal is to enable powerful, efficient, massively distributed IR. A large fraction of current research is focused on efficiency. However, we feel that P2P-IR needs to address the complicated combination of indexing structure and networking issues. KW - Parameter ER - TY - JOUR TI - Geografisches Information Retrieval AU - Graf, Jens AU - Henrich, Andreas AU - Lüdecke, Volker AU - Schlieder, Christoph PY - 2006 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V. VL - 6 IS - 18 = Themenschwerpunkt: Multimedia Retrieval SP - 48-56 PB - Springer CY - Berlin ; Heidelberg SN - 1618-2162 UR - https://fis.uni-bamberg.de/handle/uniba/14574 LA - deu AB - Im klassischen Infonnation Retrieval ( IR) werden Suchanfragen gestellt, die sich auf den Inhalt von Dokumenten beziehen. Das geografische IR (GIR) bezieht daneben den räumlichen Aspekt ein, mit dem nur solche Webseiten gefunden werden sollen, die einen bestimmten geografischen Kontext besitzen. Dazu müssen bestehende IR-Systeme um entsprechende Komponenten erweitert werden, die den geografischen Kontext einer Webseite erkennen, geografische Anfragen verarbeiten und bei der Ergebnispräsentation die räumlichen Zusammenhänge darstellen können. In diesem Artikel soll ein Überblick iiber die Problemstellungen in diesem Gebiet gegeben und die grundsätzlichen Komponenten eines geografischen lnformation-Retrieval-Systems vorgestellt werden. KW - Geografisches Information Retrieval ER - TY - CPAPER TI - Integrierte Softwaremessung durch Verankerung der Softwaremaße an Elementen des Vorgehensmodells AU - Daubner, Bernhard AU - Henrich, Andreas AU - Westfechtel, Bernhard PY - 2006 T2 - Software Engineering 2006 : Fachtagung des GI-Fachbereichs Softwaretechnik, 28. - 31. März 2006 in Leipzig SP - 157-162 PB - Gesellschaft für Informatik e. V. CY - Bonn SN - 978-3-88579-173-7 UR - https://fis.uni-bamberg.de/handle/uniba/14566 LA - deu AB - Wird Softwaremessung mit dem Ziel der Prozessverbesserung angewendet, so sollte die Erfassung der Messwerte in geeigneter Weise standardisiert erfolgen, um verschiedene Softwareentwicklungsprojekte vergleichen zu können. Dieser Beitrag stellt einen Ansatz vor, die Softwaremaße an den Elementen des dem Entwicklungsprozess zugrunde liegenden Vorgehensmodells zu verankern. Neu dabei ist, dass wir nicht nur Projektmeilensteine, sondern beliebige im Vorgehensmodell definierte Aktivitäten oder Produkte als Anknüpfungspunkte für die Softwaremaße verwenden. Dadurch ist es möglich, die relevanten Softwaremaße unabhängig von einem konkreten Projekt festzulegen. Über den Projektstrukturplan wird zur Laufzeit des Projekts die Verbindung von den Aktivitäten des Vorgehensmodells zu den tatsächlich zu messenden Entitäten hergestellt. Durch den Einsatz des Projektverwaltungstools Maven kann dann die Erfassung der Softwaremaße automatisiert durchgeführt werden. KW - Integrierte Softwaremessung ER - TY - CPAPER TI - Towards Anchoring Software Measures on Elements of the Process Model AU - Daubner, Bernhard AU - Henrich, Andreas AU - Westfechtel, Bernhard PY - 2006 T2 - Proceedings / VISAPP 2006, First International Conference on Computer Vision Theory and Applications, Setúbal, Portugal, February 25-28, 2006 UR - https://fis.uni-bamberg.de/handle/uniba/14565 LA - eng ER - TY - CPAPER TI - Virtueller Campus der Uni Bamberg: ein übergreifendes eLearning-System auf Basis von Moodle AU - Henrich, Andreas AU - Wolf, Sven-Uwe PY - 2006 T2 - E-Learning: Weg von der lokalen Insel zur globalen community : proceedings of the Workshop on E-Learning 2006, HTWK Leipzig, 10. - 11. Juli 2006 SP - 18 CY - Leipzig UR - https://fis.uni-bamberg.de/handle/uniba/14575 LA - deu ER - TY - JOUR TI - Exzellente Ideen schneller marktreif : Der Forschungsverbund FORFLOW optimiert IT-Abläufe in der Produktentwicklung AU - Henrich, Andreas AU - Morgenroth, Karlheinz PY - 2006 JO - Uni.vers : das Magazin der Otto-Friedrich-Universität Bamberg VL - 6 IS - 11 = Wissenstransfer an der Universität Bamberg SP - 10-13 PB - Otto-Friedrich-Universität CY - Bamberg SN - 1618-9019 UR - https://fis.uni-bamberg.de/handle/uniba/14224 LA - deu AB - Für Unternehmen ist es heute ein entscheidender Wettbewerbsfaktor, exzellente Ideen schnell und effizient in innovative Produkte umsetzen zu können. Dabei spielt seit Jahren die Unterstützung durch IT-Systeme eine entscheidende Rolle. Allerdings sind existierende IT-Systeme bisher nicht oder nur in unbefriedigender Form aufeinander abgestimmt. Die Bayerische Forschungsstiftung erhofft sich durch den geförderten Forschungsverbund FORFLOW eine Optimierung. KW - FORFLOW ER - TY - JOUR TI - Inhaltsbasierte Suche in P2P-Systemen AU - Eisenhardt, Martin AU - Henrich, Andreas AU - Müller, Wolfgang PY - 2005 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V. VL - 5 IS - 12 = Themenschwerpunkt: Web-Suche und Web-Caching SP - 5-15 PB - Springer CY - Berlin ; Heidelberg SN - 1618-2162 UR - https://fis.uni-bamberg.de/handle/uniba/14569 LA - deu AB - Pcer-to-Peer-Netze ( P2P-Netze) erfreuen sich zunehmender Beliebtheit hei der verteilten und administrationsarmen Verwaltung größerer Dokumentenkollektionen. Ein wichtiges Problem ist dabei die Suche und insbesondere die inhaltsbasierte Suche nach Dokumenten in P2P-Netzen. Der vorliegende Beitrag gibt einen Überblick über entsprechende Ansätze und zeigt interessante Forschungsaspekte auf. KW - P2P-Systeme ER - TY - CPAPER TI - Scalable summary based retrieval in P2P networks AU - Müller, Wolfgang AU - Eisenhardt, Martin AU - Henrich, Andreas PY - 2005 T2 - CIKM '05 : Proceedings of the 14th ACM international conference on Information and knowledge management SP - 586-593 PB - ACM CY - New York SN - 978-1-59593-140-5 DO - 10.1145/1099554.1099706 UR - https://fis.uni-bamberg.de/handle/uniba/14571 LA - deu AB - Much of the present P2P-IR literature is focused on distributed indexing structures. Within this paper, we present an approach based on the replication of peer data summaries via rumor spreading and multicast in a structured overlay.We will describe Rumorama, a P2P framework for similar-ity queries inspired by GlOSS and CORI and their P2P-adaptation, PlanetP. Rumorama achieves a hierarchization of PlanetP-like summary-based P2P-IR networks. In a Rumorama network, each peer views the network as a small PlanetP network with connections to peers that see other small PlanetP networks. One important aspect is that each peer can choose the size of the PlanetP network it wants to see according to its local processing power and bandwidth. Even in this adaptive environment, Rumorama manages to process a query such that the summary of each peer is considered exactly once in a network without churn. However, the actual number of peers to be contacted for a query is a small fraction of the total number of peers in the network.Within this article, we present the Rumorama base protocol, as well as experiments demonstrating the scalability and viability of the approach under churn. KW - P2P KW - Similarity Search KW - Distributed IR ER - TY - CHAP TI - Management von Multimediaprojekten AU - Henrich, Andreas PY - 2005 T2 - Taschenbuch der Medieninformatik : mit 39 Tabellen SP - 298-317 PB - Fachbuchverl. Leipzig im Carl-Hanser-Verl. CY - München u.a. SN - 978-3-446-40299-7 UR - https://fis.uni-bamberg.de/handle/uniba/13484 LA - deu AB - - KW - Multimediaprojekte ER - TY - CHAP TI - Search Support in Data Management Systems AU - Henrich, Andreas PY - 2005 T2 - Data management in a connected world : essays dedicated to Hartmut Wedekind on the occasion of his 70th birthday SP - 137-157 PB - Springer CY - Berlin u.a. SN - 978-3-540-26295-4 DO - 10.1007/11499923_8 UR - https://fis.uni-bamberg.de/handle/uniba/13438 LA - eng AB - In consequence of the change in the nature of data management systems the requirements for search support have shifted. In the early days of data management systems, efficient access techniques and optimization strategies for exact match queries had been the main focus. Most of the problems in this field are satisfactorily solved today and new types of applications for data management systems have turned the focus of current research to content-based similarity queries and queries on distributed databases. The present contribution addresses these two aspects. In the first part, algorithms and data structures supporting similarity queries are presented together with considerations about their integration in data management systems, whereas search techniques for distributed data management systems and especially for peer-to-peer networks are discussed in the second part. Here, techniques for exact match queries and for similarity queries are addressed. KW - Data Management Systems ER - TY - CPAPER TI - Online Kursangebot Information Retrieval - Ein Beispiel für ein Multi- Channel eLearning-Angebot AU - Henrich, Andreas AU - Morgenroth, Karlheinz PY - 2005 T2 - Education, research and new media : chances and challenges for science ; 10. Tagung der IuK-Initiative der wissenschaftlichen Fachgesellschaften vom 11. - 14. März 2004 in Darmstadt SP - 99 - 103 PB - Czwalina CY - Hamburg T3 - Schriften der Deutschen Vereinigung für Sportwissenschaft SN - 978-3-88020-448-5 UR - https://fis.uni-bamberg.de/handle/uniba/12238 LA - deu ER - TY - BOOK TI - Kontextbasiertes Information Retrieval : Methoden und Anwendungen ; Beiträge des Seminars im Sommersemester 2004 an der Universität Bamberg ED - Henrich, Andreas ED - Morgenroth, Karlheinz PY - 2004 CY - Bamberg SN - 3-00-015171-0 UR - https://fis.uni-bamberg.de/handle/uniba/15106 LA - deu AB - Gegenstand des Information Retrieval ist die Suche nach Dokumenten. Traditionell handelt es sich dabei im Allgemeinen um Textdokumente. In neuerer Zeit kommt aber verstärkt auch die Suche nach multimedialen Dokumenten (Bilder, Audio, Video, Hypertext- Dokumente) hinzu. Ferner hat das Gebiet des Information Retrieval insbesondere auch durch das Aufkommen des Internets und World Wide Webs an Bedeutung und Aktualität gewonnen. Im Detail geht es im Information Retrieval darum, aus einer Kollektion von Dokumenten zu einem von einem Nutzer explizit formulierten Informationswunsch relevante Dokumente zu ermitteln. Hierzu werden Techniken eingesetzt, die weit über eine einfache zeichenkettenbasierte Suche hinausgehen. So versucht man, von der konkreten Wortwahl in einem Dokument zu abstrahieren und stattdessen die Semantik des Dokumentes zu adressieren. Kontextbasiertes Information Retrieval nutzt Informationen über die aktuelle Situation, den Kontext, in der sich ein Nutzer befindet, um daraus auf einen möglichen Informationsbedarf des Nutzers zu schließen. Der Kontext, in dem sich ein Nutzer befindet kann die aktuelle Tätigkeit oder auch seinen Aufenthaltsort umfassen. Ein entsprechendes kontextbasiertes Information Retrieval System beobachtet kontinuierlich einen Nutzer, erfasst entsprechende Daten über seinen Kontext und liefert zu diesem Kontext entsprechend relevante Informationen aus einer oder mehreren Datenquellen. Die erfassten Informationen über den Kontext eines Nutzers können neben der automatischen Anfragestellung auch zur Verfeinerung manuell gestellter Anfrage Verwendung finden. In den vergangenen Jahren wurden von verschiedenen Autoren kontextbasierte bzw. berücksichtigende Information Retrieval Systeme und Ansätze vorgeschlagen. Diese Ansätze setzten jeweils auf verschiedene Quellen für die Gewinnung von Kontextinformationen über die aktuelle Arbeitsumgebung oder die Aufgaben, die eine Person zu einem bestimmten Zeitpunkt vollführt. Ebenfalls verwenden sie verschiedene Quellen für die Gewinnung von relevanten Informationen oder Dokumenten, die einem Benutzer in seiner aktuellen Arbeitssituation nützlich sein könnten. Dieser Sammelband stellt die im Rahmen des Seminars "Kontextbasiertes Information Retrieval" im Sommersemester 2004 an der Otto-Friedrich-Universität Bamberg entstandenen Beiträge zusammen. Diese Beiträge präsentieren jeweils Ansätze und Systeme, die sowohl dem Forschungsbereich des Information Retrieval als auch verwandte Gebieten entstammen. KW - Information Retrieval KW - Data Mining KW - Suchmaschine KW - Wissensmanagement ER - TY - CPAPER TI - Comparison and Evaluation of Fusion Algorithms and Transfer Semantics for Structured Multimedia Data AU - Henrich, Andreas AU - Robbert, Günter PY - 2004 T2 - Multimedialne i sieciowe systemy informacyjne : materialy konferencyjne = Multimedia and network information systems ; 1st International Workshop on Multimedia Information Systems Technology. Szklarska Poreba, Poland September 16-17, 2004 SP - 181 - 192 CY - Wroclaw UR - https://fis.uni-bamberg.de/handle/uniba/14824 LA - eng ER - TY - CPAPER TI - Reducing I/O Cost of Similarity Queries by Processing Several at a Time AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2004 T2 - Proceedings MDDE '04, 4th International Workshop on Multimedia Data and Document Engineering, Washington, DC, USA, July 2nd 2004. IEEE Computer Society 2004 UR - https://fis.uni-bamberg.de/handle/uniba/14663 LA - eng ER - TY - JOUR TI - Integration of software measurement into the software development environment AU - Daubner, Bernhard AU - Henrich, Andreas PY - 2004 JO - Metrics news : journal of the software metrics community VL - 9 IS - 1 SP - 17-23 SN - 1431-8008 UR - https://fis.uni-bamberg.de/handle/uniba/14610 LA - eng ER - TY - CPAPER TI - Efficient content-based P2P image retrieval using peer content descriptions AU - Müller, Wolfgang AU - Eisenhardt, Martin AU - Henrich, Andreas PY - 2004 T2 - Internet Imaging V : Proceedings of Electronic Imaging, Science and Technology 2004 SP - 57-68 PB - SPIE CY - Bellingham, Wash., USA T3 - SPIE Proceedings SN - 0-8194-5207-6 DO - 10.1117/12.531184 UR - https://fis.uni-bamberg.de/handle/uniba/14609 LA - eng AB - Peer-to-peer (P2P) networks are overlay networks that connect independent computers (also called nodes or peers). In contrast to client/server solutions, all nodes offer and request services from other peers in a P2P network. P2P networks are very attractive in that they harness the computing power of many common desktop machines and necessitate little administrative overhead. While the resulting computing power is impressive, efficiently looking up data still is the major challenge in P2P networks. Current work comprises fast lookup of one-dimensional values (Distributed Hash Tables, DHT) and retrieval of texts using few keywords. However, the lookup of multimedia data in P2P networks is still attacked by very few groups. In this paper, we present experiments with efficient Content Based Image Retrieval in a P2P environment, thus a P2P-CBIR system. The challenge in such systems is to limit the number of messages sent, and to maximize the usefulness of each peer contacted in the query process. We achieve this by distributing peer data summaries over the network. Obviously, the data summaries have to be compact in order to limit the communication overhead. We propose an CBIR scheme based on a compact peer data summary. This peer data summary relies on cluster frequencies. To obtain the compact representation of a peer's collection, a. global clustering of the data is efficiently calculated in a distributed manner. After that, each peer publishes how many of its images fall into each cluster. These cluster frequencies are then used by the querying peer to contact only those peers that have the largest number of images present in one cluster given by the query. In our paper we further detail the various challenges that have to be met by the designers of such a P2P- CBIR, and we present experiments with varying degree of data replication (duplicates of images) , as well as quality of clustering within the network. KW - P2P ER - TY - CPAPER TI - Faster exact histogram intersection on large data collections using inverted VA-files AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2004 T2 - Image and video retrieval : third International Conference, CIVR 2004, Dublin, Ireland, July 21 - 23, 2004 ; proceedings SP - 455-463 PB - Springer CY - Berlin T3 - Lecture notes in computer science SN - 978-3-540-22539-3 DO - 10.1007/978-3-540-27814-6_54 UR - https://fis.uni-bamberg.de/handle/uniba/12774 LA - eng AB - Most indexing structures for high-dimensional vectors used in multimedia retrieval today rely on determining the importance of each vector component at indexing time in order to create the index. However for Histogram Intersection and other important distance measures this is not possible because the importance of vector components depends on the query. We present an indexing structure inspired by VA-file and Inverted file that does not need to determine the importance at indexing time in order to perform well. Instead, our structure adapts to the importance of vector components at query processing time. Success of this approach is demonstrated in experiments on feature data extracted from a large image collection. KW - histogram intersection KW - large data collections ER - TY - CPAPER TI - Spektrale Bloom-Filter für Peer-to-Peer Information Retrieval AU - Eisenhardt, Martin AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2004 T2 - Informatik 2004 : Informatik verbindet ; Beiträge der 34. Jahrestagung der Gesellschaft für Informatik e.V. (GI) ; Ulm, 20. - 24. September 2004 SP - 44 - 48 PB - Gesellschaft für Informatik e.V. CY - Bonn SN - 3-88579-380-6 UR - https://fis.uni-bamberg.de/handle/uniba/12728 LA - deu AB - Spektrale Bloomfilter können als Zusammenfassung von Peer-Daten in verteiltem P2P-Retrieval verwendet werden. Dies ermöglicht eine messbar bessere Auswahl derjenigen Peers, an die eine Anfrage gestellt wird, und somit auch eine höhere Effizienz der Anfragebearbeitung. Experimentelle Daten belegen diese Verbesserung des Retrievals in P2P-Netzen. KW - Spektrale Bloom-Filter ER - TY - CPAPER TI - Perspektiven der inhaltsbasierten Suche: strukturierte Dokumente, Einbeziehung des Kontextes, Peer-to-Peer .Vortrag: Eingeladener Vortrag auf dem 16. Workshop Grundlagen von Datenbanken 2004, GI- Arbeitskreis "Grundlagen von Inform ationssystemen", Monheim, NRW, 3.6.2004 AU - Henrich, Andreas PY - 2004 T2 - Tagungsband zum 16. GI-Workshop über Grundlagen von Datenbanken (16th GI-Workshop on the Foundations of Databases) CY - Monheim UR - https://fis.uni-bamberg.de/handle/uniba/11989 LA - deu ER - TY - CPAPER TI - Proceedings MDDE '04, IEEE Computer Society : 4th International Workshop on Multimedia Data and Document Engineering ED - Guler, Sadiye ED - Hauptmann, Alexander G. ED - Henrich, Andreas PY - 2004 CY - Washington, DC UR - https://fis.uni-bamberg.de/handle/uniba/11952 LA - eng ER - TY - BOOK TI - Kontextbasiertes Information Retrieval : Methoden und Anwendungen : Beiträge des Seminars im Sommersemester 2004 an der Universität Bamberg ED - Henrich, Andreas ED - Morgenroth, Karlheinz PY - 2004 PB - opus CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/91 LA - deu AB - Gegenstand des Information Retrieval ist die Suche nach Dokumenten. Traditionell handelt es sich dabei im Allgemeinen um Textdokumente. In neuerer Zeit kommt aber verstärkt auch die Suche nach multimedialen Dokumenten (Bilder, Audio, Video, Hypertext- Dokumente) hinzu. Ferner hat das Gebiet des Information Retrieval insbesondere auch durch das Aufkommen des Internets und World Wide Webs an Bedeutung und Aktualität gewonnen. Im Detail geht es im Information Retrieval darum, aus einer Kollektion von Dokumenten zu einem von einem Nutzer explizit formulierten Informationswunsch relevante Dokumente zu ermitteln. Hierzu werden Techniken eingesetzt, die weit über eine einfache zeichenkettenbasierte Suche hinausgehen. So versucht man, von der konkreten Wortwahl in einem Dokument zu abstrahieren und stattdessen die Semantik des Dokumentes zu adressieren. Kontextbasiertes Information Retrieval nutzt Informationen über die aktuelle Situation, den Kontext, in der sich ein Nutzer befindet, um daraus auf einen möglichen Informationsbedarf des Nutzers zu schließen. Der Kontext, in dem sich ein Nutzer befindet kann die aktuelle Tätigkeit oder auch seinen Aufenthaltsort umfassen. Ein entsprechendes kontextbasiertes Information Retrieval System beobachtet kontinuierlich einen Nutzer, erfasst entsprechende Daten über seinen Kontext und liefert zu diesem Kontext entsprechend relevante Informationen aus einer oder mehreren Datenquellen. Die erfassten Informationen über den Kontext eines Nutzers können neben der automatischen Anfragestellung auch zur Verfeinerung manuell gestellter Anfrage Verwendung finden. In den vergangenen Jahren wurden von verschiedenen Autoren kontextbasierte bzw. berücksichtigende Information Retrieval Systeme und Ansätze vorgeschlagen. Diese Ansätze setzten jeweils auf verschiedene Quellen für die Gewinnung von Kontextinformationen über die aktuelle Arbeitsumgebung oder die Aufgaben, die eine Person zu einem bestimmten Zeitpunkt vollführt. Ebenfalls verwenden sie verschiedene Quellen für die Gewinnung von relevanten Informationen oder Dokumenten, die einem Benutzer in seiner aktuellen Arbeitssituation nützlich sein könnten. Dieser Sammelband stellt die im Rahmen des Seminars "Kontextbasiertes Information Retrieval" im Sommersemester 2004 an der Otto-Friedrich-Universität Bamberg entstandenen Beiträge zusammen. Diese Beiträge präsentieren jeweils Ansätze und Systeme, die sowohl dem Forschungsbereich des Information Retrieval als auch verwandte Gebieten entstammen. KW - Information Retrieval KW - Data Mining KW - Suchmaschine KW - Wissensmanagement ER - TY - CPAPER TI - Fast Retrieval of High-Dimensional Feature Vectors in P2P Networks Using Compact Peer Data Summaries AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2003 T2 - MIR '03 : Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval SP - 79–86 PB - ACM CY - New York SN - 978-1-58113-778-1 DO - 10.1145/973264.973278 UR - https://fis.uni-bamberg.de/handle/uniba/14659 LA - deu AB - The retrieval facilities of most Peer-to-Peer (P2P) systems are limited to queries based on a unique identifier or a small set of keywords. The techniques used for this purpose are hardly applicable for content-based image retrieval (CBIR) in a P2P network. Furthermore, we will argue that the curse of dimensionality and the high communication overhead prevent the adaptation of multidimensional search trees or fast sequential scan techniques for P2P CBIR. In the present paper we will propose two compact data representations which can be distributed in a P2P network and used as the basis for a source selection. This allows to communicate only with a small fraction of all peers during query processing without deteriorating the result quality significantly. We will also present experimental results confirming our approach. KW - Algorithms KW - Performance ER - TY - GEN TI - An Approach to Transfer Rankings when Searching on Structured Data : Abstract for a talk on the Dagstuhl Seminar No 03112 AU - Henrich, Andreas PY - 2003 T2 - Dagstuhl Seminar No 03112, Perspectives Workshop: "Multimedia Retrieval", March 2003 Seminar Nº 03112,10.03.-13.03. 2003 UR - https://fis.uni-bamberg.de/handle/uniba/14648 LA - eng ER - TY - CPAPER TI - Applying the IRStream Retrieval Engine to INEX 2003 AU - Henrich, Andreas AU - Lüdecke, Volker AU - Robbert, Günter PY - 2003 T2 - INEX 2003 Workshop Proceedings SP - 118 - 125 UR - https://fis.uni-bamberg.de/handle/uniba/14652 LA - eng ER - TY - CPAPER TI - Comparing the performance of two CBIRS indexing schemes AU - Müller, Wolfgang AU - Robbert, Günter AU - Henrich, Andreas PY - 2003 T2 - Internet Imaging IV : Proceedings of Electronic Imaging, Science and Technology 2003 SP - 9-20 PB - SPIE CY - Bellingham, Wash., USA T3 - SPIE Proceedings SN - 0-8194-4818-4 DO - 10.1117/12.473372 UR - https://fis.uni-bamberg.de/handle/uniba/14612 LA - eng AB - Content based image retrieval (CBIR) as it is known today has to deal with a number of challenges. Quickly summarized, the main challenges are firstly, to bridge the semantic gap between high-level concepts and low-level features using feedback, secondly to provide performance under adverse conditions. High-dimensional spaces, as well as a demanding machine learning task make the right way of indexing an important issue. When indexing multimedia data, most groups opt for extraction of high-dimensional feature vectors from the data, followed by dimensionality reduction like PCA (Principal Components Analysis) or LSI (Latent Semantic Indexing). The resulting vectors are indexed using spatial indexing structures such as kd-trees or R-trees, for example. Other projects, such as MARS and Viper propose the adaptation of text indexing techniques, notably the inverted file. Here, the Viper system is the most direct adaptation of text retrieval techniques to quantized vectors. However, while the Viper query engine provides decent performance together with impressive user-feedback behavior, as well as the possibility for easy integration of long-term learning algorithms, and support for potentially infinite feature vectors, there has been no comparison of vector-based methods and inverted-file-based methods under similar conditions. In this publication, we compare a CBIR query engine that uses inverted files (Bothrops, a rewrite of the Viper query engine based on a relational database), and a CBIR query engine based on LSD (Local Split Decision) trees for spatial indexing using the same feature sets. The Benchathlon initiative works on providing a set of images and ground truth for simulating image queries by example and corresponding user feedback. ·when performing the Benchathlon benchmark on a CBIR system (the System Under Test, SUT), a benchmarking harness connects over internet to the SUT, performing a number of queries using an agreed-upon protocol, the multimedia retrieval markup language (MRML). Using this bench-mark one can measure the quality of retrieval, as well as the overall (speed) performance of the benchmarked system. Our Benchmarks will draw on the Benchathlon's work for documenting the retrieval performance of both inverted file-based and LSD tree based techniques. However, in addition to these results, we will present statistics, that can be obtained only inside the system under test. These statistics will include the number of complex mathematical operations, as well as the amount of data that has to be read from disk during operation of a query. KW - CBIRS indexing schemes ER - TY - CPAPER TI - Ein Ansatz zur Übertragung von Rangordnungen bei der Suche auf strukturierten Daten AU - Henrich, Andreas AU - Robbert, Günter PY - 2003 T2 - Datenbanksysteme für Business, Technologie und Web (BTW) : 10. GI-Fachtagung, Leipzig, 26. - 28. Februar 2003 PB - Gesellschaft für Informatik e. V. CY - Bonn SN - 3-88579-355-5 UR - https://fis.uni-bamberg.de/handle/uniba/14617 LA - deu AB - Ähnlichkeitsanfragen – oder allgemeiner Anfragen, die eine Rangordnung auf den Ergebnisdokumenten definieren – erlangen in Bereichen wie Multimedia oder Bioinformatik immer mehr an Bedeutung. Insbesondere im Bereich strukturierter Dokumente kommen dabei auch Anfragen vor, bei denen die Kriterien für die Rangordnung über verbundene Objekte definiert wird. So kann z.B. nach Bildern aufgrund einer Bedingung für den umgebenden Text gesucht werden. Steht nun eine Zugriffsstruktur für die Textblöcke bereit, so erscheint es vielversprechend, zunächst mit der Zugriffsstruktur ein Ranking der Textblöcke zu erstellen und dieses dann auf die Bilder zu überragen. Mit der Semantik dieser Übertragung und einem dazu anwendbaren Algorithmus beschäftigt sich die vorliegende Arbeit. Sie umfasst ferner eine Betrachtung verwandter Ansätze sowie die Präsentation experimenteller Ergebnisse. KW - strukturierte Daten ER - TY - CPAPER TI - Ein Plädoyer für Datenflussdiagramme aus der Sicht der Aufwandsschätzung und der agilen Softwareentwicklung AU - Daubner, Bernhard AU - Henrich, Andreas PY - 2003 T2 - Innovative Informatikanwendungen : 33. Jahrestagung der Gesellschaft für Informatik e.v. (GI) ; 29. September - 2. Oktober in Frankfurt am Main SP - 191-195 PB - Gesellschaft für Informatik e. V. CY - Bonn SN - 978-3-88579-363-2 UR - https://fis.uni-bamberg.de/handle/uniba/14616 LA - deu AB - Die mit der Strukturierten Analyse von DeMarco bekannt gewordenen Datenflussdiagramme zur Modellierung von Softwaresystemen sind mit zunehmender Verbreitung objektorientierter Modellierungstechniken in Vergessenheit geraten. Wir wollen zeigen, dass dieser Diagrammtyp aus der Sicht der Aufwandsschätzung und der agilen Softwareentwicklung Vorteile gegenüber den üblicherweise in der objektorientierten Analyse verwendeten Modellierungstechniken aufweist und auch heute noch sinnvoll eingesetzt werden kann. KW - Datenflussdiagramm ER - TY - CPAPER TI - Privacy of Ideas in P2P Networks AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2003 T2 - PET2003 Dresden, Germany ; Workshop on Privacy Enhancing Technologies, Hotel Elbflorenz Dresden, Germany, 26 - 28 March 2003 / Program / Wednesday, March 26 / Rump session / works in progress (part one) UR - https://fis.uni-bamberg.de/handle/uniba/14613 LA - deu ER - TY - CPAPER TI - RSV-Transfer: An Algorithm for Similarity Queries on Structured Documents AU - Henrich, Andreas AU - Robbert, Günter PY - 2003 T2 - MIS 2003 : 9th International Workshop on Multimedia Information Systems, May 26- 28, 2003, Ischia, Italy ; Proceedings SP - 65 - 74 UR - https://fis.uni-bamberg.de/handle/uniba/14621 LA - eng ER - TY - CPAPER TI - Supporting Collaborative Software Development by Context-Aware Information Retrieval Facilities AU - Henrich, Andreas AU - Morgenroth, Karlheinz PY - 2003 T2 - 14th International Workshop on Database and Expert Systems Applications, 2003 : Proceedings SP - 249-253 PB - IEEE CY - New York SN - 0-7695-1993-8 DO - 10.1109/DEXA.2003.1232031 UR - https://fis.uni-bamberg.de/handle/uniba/14620 LA - eng AB - The development of large software systems is a typical example for collaborative development efforts. Moreover, software development becomes more and more component-oriented. The source for these components can be either a component repository inside an organization or one of the emerging open source development networks available on the Internet. In this paper we describe an approach to search for potentially useful components during software development. Our approach is by no means restricted to components in an implementation oriented sense, but covers all types of artifacts created within a software development process. It is based on retrieval techniques for structures documents and uses contextual information about the user and his or her current work to refine the queries. KW - Collaborative Software Development ER - TY - CPAPER TI - A Graphical User Interface for Complex Similarity Queries on Structured Multimedia Documents AU - Henrich, Andreas AU - Robbert, Günter PY - 2003 T2 - International Workshop on Multimedia Data and Document Engineering < 3, 2003, Berlin>: Proceedings UR - https://fis.uni-bamberg.de/handle/uniba/14601 LA - eng ER - TY - BOOK TI - Classifying Documents by Distributed P2P Clustering AU - Eisenhardt, Martin AU - Müller, Wolfgang AU - Henrich, Andreas PY - 2003 CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/14605 LA - eng ER - TY - JOUR TI - Architektur Multimedialer Informationssysteme AU - Berthold, Henrike AU - Binkowski, Frank AU - Henrich, Andreas AU - Hollfelder, Silvia AU - Lindner, Wolfgang AU - Marder, Ulrich AU - Meyer-Wegener, Klaus AU - Robbert, Günter PY - 2002 JO - Informatik, Forschung und Entwicklung : Organ der Fachbereiche Softwaretechnik, Datenbanken und Informationssysteme sowie Mensch-Computer-Interaktion der Gesellschaft für Informatik e.V. VL - 17 IS - 2 SP - 77-89 PB - Springer CY - Berlin ; Heidelberg ; New York SN - 0949-2925 DO - 10.1007/s00450-002-0101-5 UR - https://fis.uni-bamberg.de/handle/uniba/14643 LA - deu AB - - KW - Multimediale Informationssysteme ER - TY - CPAPER TI - A Relaxed Algorithm for Similarity Queries Performed with High-Dimensional Access Structures AU - Henrich, Andreas PY - 2002 T2 - XML-Based Data Management and Multimedia Engineering : EDBT 2002 Workshops ; revised papers SP - 376–390 PB - Springer CY - Berlin u.a. T3 - Lecture notes in computer science DO - 10.1007/3-540-36128-6_22 UR - https://fis.uni-bamberg.de/handle/uniba/14598 LA - eng AB - Similarity queries searching for the most similar objects in a database compared to a given sample object are an important requirement for multimedia databases. However, strict mathematical correctness is not essential in many applications of similarity queries. For example, if we are concerned with image retrieval based on color and texture similarity, slight mathematical inaccuracies will hardly be recognized by the human observer. Therefore we present a relaxed algorithm to perform similarity queries for multidimensional index structures. This algorithm assures only that a user defined portion of the result list containing n elements actually belongs to the n most similar objects — the remaining elements are subject to a best effort semantics. As we will demonstrate, this allows to improve the performance of similarity queries by about 25 % with only marginal inaccuracies in the result. KW - Relaxed Algorithm ER - TY - CPAPER TI - Applying the IRstream Retrieval Engine for Structured Documents to INEX AU - Henrich, Andreas AU - Robbert, Günter PY - 2002 T2 - ERCIM Workshop Reports 2002: Proceedings of the First Workshop of the INitiative for the Evaluation of XML Retrieval (INEX), December 9-11, 2002, Schloss Dagstuhl, International Conference and Research Center for Computer Science SP - 105 - 110 UR - https://fis.uni-bamberg.de/handle/uniba/14607 LA - eng ER - TY - CPAPER TI - Integration von kontextunterstütztem Information Retrieval in Portalsysteme AU - Henrich, Andreas AU - Morgenroth, Karlheinz PY - 2002 T2 - Management der Mitarbeiter-Expertise in IT-Beratungsbetrieben : Grundlagen, Methoden und Werkzeuge ; Tagungsband zur Multi-Konferenz Wirtschaftsinformatik 2002, 9. bis 11. September 2002 in Nürnberg CY - Aschaffenburg SN - 978-3-9808791-0-1 UR - https://fis.uni-bamberg.de/handle/uniba/14597 LA - deu ER - TY - CPAPER TI - Probleme und Lösungsansätze für P2P-IR-Systeme AU - Eisenhardt, Martin AU - Henrich, Andreas PY - 2002 T2 - Informatik bewegt : Informatik 2002 ; 32. Jahrestagung der Gesellschaft für Informatik e.V. (GI) ; 30. Sept. - 3. Okt. 2002 in Dortmund SP - 171 - 175 PB - Gesellschaft für Informatik e.V. CY - Bonn T3 - GI- Edition : Proceedings SN - 3-88579-348-2 UR - https://fis.uni-bamberg.de/handle/uniba/14603 LA - deu AB - Zentralisierte Information Retrieval Systeme gelangen angesichts verteilter Datenbestände an ihre Grenzen. Bisherige Ansätze zum verteilten Information Retrieval lösen einige dieser Probleme, werfen jedoch neue auf. Der dezentrale Peer-to-Peer-Ansatz verspricht, auf grundlegend andere Art und Weise L ösungen aufzuzeigen. KW - P2P-IR-Systeme ER - TY - CPAPER TI - An End User Retrieval Interface for Structured Multimedia Documents AU - Henrich, Andreas AU - Robbert, Günter PY - 2001 T2 - Proceedings of 7. workshop Multimedia information systems : MIS ' 01 : 7 - 9 November 2001 Villa Orlandi - Capri - Italy SP - 71-80 CY - Napoli UR - https://fis.uni-bamberg.de/handle/uniba/14587 LA - eng ER - TY - CPAPER TI - Exposing the Vagueness of Query Results on Partly Inaccessible Databases AU - Haase, Oliver AU - Henrich, Andreas PY - 2001 T2 - CIKM '01 : Proceedings of the tenth international conference on Information and knowledge management SP - 49-56 PB - ACM CY - New York SN - 978-1-58113-436-0 DO - 10.1145/502585.502595 UR - https://fis.uni-bamberg.de/handle/uniba/14593 LA - eng AB - Query processing on partly inaccessible databases generally does not yield exact, but vague result sets. A good notion of vague sets fulfills two aims: It keeps the degree of vagueness of the query result as small as possible, and it clarifies the degree of and the reasons for the vagueness to the end user. The first goal requires a good internal representation, while the second goal requires a good external representation of a vague set. In this paper, we present a novel calculus for expressive vague sets that meets both requirements. This is the first approach that is well suited for both internal and external representation of vagueness induced by partial inaccessibility. It consists of a data representation that is capable of holding all the necessary information. Complementary, we have accordingly adapted the usual query language operations. These adaptations are independent of a concrete query language, to make them applicable to most existing query languages. The adapted operations minimize the vagueness of the result, propagate the reasons of uncertainty of the individual vague candidates, and compute an expressive description of the missing elements. KW - Query Processing KW - Inaccessibility KW - Vagueness ER - TY - CPAPER TI - POQLMM : A Query Language for Structured Multimedia Documents AU - Henrich, Andreas AU - Robbert, Günter PY - 2001 T2 - MDDE'01 : Multimedia Data and Document Engineering ; Proceedings of the First International Workshop on Multimedia Data and Document Engineering, Lyon, France, July 4, 2001 CY - Lyon T3 - CEUR workshop proceedings UR - https://fis.uni-bamberg.de/handle/uniba/14599 LA - eng AB - An important research issue with multimedia databases is the formulation of queries to the database. Here the search for structured multimedia documents or relevant parts of it gains more and more significance. Unfortunately text retrieval on its own is not sufficient for the realization of capable search services in this respect. Therefore, an efficient combination of automatic text retrieval, retrieval in meta data and content based retrieval on structured multimedia documents is needed. In the present paper we propose POQLMM as a general purpose query language for an object oriented multimedia database, which supports the combination of text retrieval, content-based retrieval for other media types and traditional fact retrieval on structured multimedia documents. To this end, we describe the significant features of POQLMM and point out the applicability of POQLMM by means of some query examples. KW - structured multimedia documents KW - query language ER - TY - CPAPER TI - Combining Multimedia Retrieval and Text Retrieval to Search Structured Documents in Digital Libraries AU - Henrich, Andreas AU - Robbert, Günter PY - 2000 T2 - ERCIM Workshop Reports: First DELOS Network of Excellence Workshop: Information Seeking, Searching and Querying in Digital Libraries Zurich, 11-12 December 2000 UR - https://fis.uni-bamberg.de/handle/uniba/14584 LA - eng ER - TY - CPAPER TI - MARS: A Retrieval Service for Multimedia Authoring Environments AU - Henrich, Andreas AU - Robbert, Günter PY - 2000 T2 - Proceedings of challenges : 2000 ADBIS-DASFAA Symposium on advances in databases and information systems ; enlarged Fourth East-European Conference on Advances in Databases and Ingformation Systems, Prague, Czech Republic, September 5 - 8, 2000 SP - 88 - 98 PB - Matfyzpress CY - Prag UR - https://fis.uni-bamberg.de/handle/uniba/14586 LA - eng ER - TY - JOUR TI - A hybrid representation of vague collections for distributed object management systems AU - Haase, Oliver AU - Henrich, Andreas PY - 2000 JO - IEEE transactions on knowledge and data engineering : a publication of the IEEE Computer Society VL - 12 IS - 3 SP - 448-467 PB - IEEE CY - New York SN - 1041-4347 DO - 10.1109/69.846295 UR - https://fis.uni-bamberg.de/handle/uniba/6715 LA - eng AB - An important characteristic of distributed object management systems is that due to network or machine failure, the environment may become partitioned into subenvironments that cannot communicate with each other. In some application scenarios, it is important that the subenvironments remain operable even in this case. In particular, queries should be processed in an appropriate way. To this end, the final and all intermediate results of a query in a distributed object management system must be regarded as potentially vague. We propose a hybrid representation for vague sets and vague multisets designed for this application context. The representation consists of an enumerating part, which contains the elements we could access during query processing, and a descriptive part, which describes the relevant elements we could not access. We introduce propagation rules which can be used to minimize the vagueness of a query result represented in this hybrid way. The main advantage of our approach is that the descriptive part of the representation can be used to improve the enumerating part during query processing. KW - distributed systems KW - distributed databases KW - query processing KW - query languages KW - vagueness KW - inaccessibility ER - TY - CPAPER TI - A closed approach to vague collections in partly inaccessible distributed databases AU - Haase, Oliver AU - Henrich, Andreas PY - 1999 T2 - Advances in databases and information systems : third East European conference, ADBIS '99, Maribor, Slovenia, September 13 - 16, 1999 ; proceedings SP - 261-274 PB - Springer CY - Berlin u.a. T3 - Lecture Notes in Computer Science SN - 978-3-540-66485-7 DO - 10.1007/3-540-48252-0_20 UR - https://fis.uni-bamberg.de/handle/uniba/36031 LA - eng AB - Inaccessibility of part of the database is a research topic hardly addressed in the literature about distributed databases. However, there are various application areas, where the database has to remain operable even if part of the database is inaccessible. In particular, queries to the database should be processed in an appropriate way. This means that the final and all intermediate results of a query in a distributed database system must be regarded as potentially vague. In this paper we propose hybrid representations for vague sets, vague multisets, and vague lists, which address the accessible elements in an enumerating part and the inaccessible elements in a descriptive part. These representations allow to redefine the usual query language operations for vague sets, vague multisets, and vague lists. The main advantage of our approach is that the descriptive part of the representation can be used to improve the enumerating part during query processing. KW - distributed databases ER - TY - CPAPER TI - On the optimization of queries containing regular path expressions AU - Henrich, Andreas AU - Jamin, Stefan PY - 1999 T2 - Next generation information technologies and systems : 4th international workshop, NGITS '99, Zikhron-Yaakov, Israel, July 5 - 7, 1999 ; proceedings SP - 58-75 PB - Springer CY - Berlin u.a. T3 - Lecture Notes in Computer Science SN - 978-3-540-66225-9 DO - 10.1007/3-540-48521-X_6 UR - https://fis.uni-bamberg.de/handle/uniba/36047 LA - eng AB - One of the main characteristics of object-oriented database management systems is the explicit representation of relationships between objects. A simple example for a query addressing these relationships arises, if we assume the object types Company, and Division with the relationship has_division from Company to Division. In this case a query might ask for the companies which have a division called "strategy". The query might start with the companies and navigate to the divisions which can be reached via the has_division relationship. Finally the query has to check if the name attribute of the Division object is "strategy". Since there is no direct condition for the companies in the query, this query execution will be costly. If we assume that there is a reverse relationship division_of from Division to Company, an alternative execution plan might start with the "strategy" divisions and follow this reverse relationship. In this case an index structure for the name attribute of the Division objects can be exploited to speed up query processing. In the present paper we describe a query optimizer which exploits this potential invertibility of navigational operations in queries. Our approach is based on, but not limited to the context of the ISO and ECMA standard PCTE and P-OQL. KW - regular path expressions ER - TY - BOOK TI - On the optimization of queries containing regular path expressions AU - Henrich, Andreas AU - Jamin, Stefan PY - 1999 PB - Otto-Friedrich-Univ. CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik UR - https://fis.uni-bamberg.de/handle/uniba/35609 LA - eng ER - TY - RPRT TI - A closed approach to vague collections in partly inaccessible distributed databases AU - Haase, Oliver AU - Henrich, Andreas PY - 1999 PB - Otto-Friedrich-Univ. CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik UR - https://fis.uni-bamberg.de/handle/uniba/35585 LA - deu ER - TY - JOUR TI - Reactive environments AU - Henrich, Andreas PY - 1998 JO - Wirtschaftsinformatik : WI VL - 40 IS - 6 SP - 538-540 PB - Springer Gabler CY - Wiesbaden SN - 0937-6429 UR - https://fis.uni-bamberg.de/handle/uniba/36061 LA - deu AB - - KW - Reactive environments ER - TY - CPAPER TI - The LSDh-Tree : an access structure for feature vectors AU - Henrich, Andreas PY - 1998 T2 - Proceedings 14th International Conference on Data Engineering SP - 362-369 PB - IEEE CY - Los Alamitos, Calif. u.a. SN - 0-8186-8289-2 DO - 10.1109/ICDE.1998.655799 UR - https://fis.uni-bamberg.de/handle/uniba/36035 LA - eng AB - Efficient access structures for similarity queries on feature vectors are an important research topic for application areas such as multimedia databases, molecular biology or time series analysis. Different access structures for high dimensional feature vectors have been proposed, namely: the SS-tree, the VAMSplit R-tree, the TV-tree, the SR-tree and the X-tree. All these access structures are derived from the R-tree. As a consequence, the fanout of the directory of these access structures decreases drastically for higher dimensions. Therefore we argue that the R-tree is not the best possible starting point for the derivation of an access structure for high-dimensional data. We show that k-d-tree-based access structures are at least as well suited for this application area and we introduce the LSD/sup h/-tree as an example for such a k-d-tree-based access structure for high-dimensional feature vectors. We describe the algorithms for the LSD/sup h/-tree and present experimental results comparing the LSD/sup h/-tree and the X-tree. KW - LSDh-Tree ER - TY - CPAPER TI - Applying document retrieval techniques in software engineering environments AU - Henrich, Andreas PY - 1998 T2 - Database and expert systems applications : 9th international conference, DEXA '98, Vienna, Austria, August 24 - 28, 1998 ; proceedings SP - 240-249 PB - Springer CY - Berlin u.a. T3 - Lecture notes in computer science SN - 978-3-540-64950-2 DO - 10.1007/BFb0054485 UR - https://fis.uni-bamberg.de/handle/uniba/36025 LA - eng AB - In previous papers we have proposed the integration of content-based document retrieval facilities into the repository underlying a software engineering environment. In the present paper we describe the application of these facilities in typical application areas, such as searching reusable components or identifying project dependencies. Furthermore we describe the integration of the facilities into a concrete software engineering environment. KW - document retrieval techniques ER - TY - RPRT TI - Applying document retrieval techniques in software engineering environments AU - Henrich, Andreas PY - 1998 PB - Otto-Friedrich-Univ. CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik UR - https://fis.uni-bamberg.de/handle/uniba/35612 LA - deu ER - TY - BOOK TI - A hybrid representation of vague collections for distributed object management systems AU - Haase, Oliver AU - Henrich, Andreas PY - 1998 PB - Otto-Friedrich-Univ. CY - Bamberg T3 - Bamberger Beiträge zur Wirtschaftsinformatik UR - https://fis.uni-bamberg.de/handle/uniba/35586 LA - eng ER - TY - GEN TI - Retrieval-Dienste für Software-Entwicklungsumgebungen AU - Henrich, Andreas PY - 1998 PB - Shaker CY - Aachen T3 - Berichte aus der Informatik UR - https://fis.uni-bamberg.de/handle/uniba/34997 LA - other ER - TY - CPAPER TI - A common access structure for standard attributes and document representations in vector space AU - Henrich, Andreas PY - 1997 T2 - Proceedings of the 3rd International Workshop on Next Generation Information Technologies and Systems (NGITS '97) : held in Neve Ilan, near Jerusalem, Israel on 30 June - 3 July 1997 SP - 154 - 161 UR - https://fis.uni-bamberg.de/handle/uniba/36054 LA - eng ER - TY - CPAPER TI - Retrieval-Dienste für Software-Entwicklungsumgebungen AU - Henrich, Andreas PY - 1997 T2 - Software-Management '97 : Fachtagung der Gesellschaft für Informatik e. V. (GI), Oktober 1997 in München SP - 147-162 PB - Teubner CY - Stuttgart ; Leipzig SN - 978-3-8154-2603-6 DO - 10.1007/978-3-322-85166-6_10 UR - https://fis.uni-bamberg.de/handle/uniba/36065 LA - deu AB - Moderne Software-Entwicklungsumgebungen bestehen aus einer Vielzahl von Werkzeugen, die hinsichtlich der Benutzungsoberfläche, der Ablaufsteuerung und der Datenhaltung integriert sind. Die integrierte Datenhaltung wird dabei i. allg. durch die Verwendung eines Repository unterstützt. Sowohl die kommerziell verfügbaren Repositories als auch die Standards zu diesem Bereich stellen aber leider nur unzureichende Anfragemöglichkeiten zu den verwalteten Daten zur Verfügung. Deshalb haben wir beispielhaft Retrieval-Dienste für den ISO-Standard PCTE entwickelt, die Möglichkeiten des navigierenden Zugriffs mit der Funktionalität einer OQL-artigen Anfragesprache und Techniken des Dokumenten-Retrieval kombinieren. Das vorliegende Papier beschreibt diese Retrieval-Dienste und stellt exemplarisch einige Anwendungen vor. KW - Retrieval-Dienste ER - TY - CPAPER TI - Query processing techniques for partly inaccessible distributed databases AU - Haase, Oliver AU - Henrich, Andreas PY - 1997 T2 - Advances in databases : 15th British National Conference on Databases, BNCOD 15, London, United Kingdom, July 7 - 9, 1997 ; proceedings SP - 123-125 PB - Springer CY - Berlin u.a. T3 - Lecture notes in computer science SN - 978-3-540-63263-4 DO - 10.1007/3-540-63263-8_11 UR - https://fis.uni-bamberg.de/handle/uniba/36040 LA - eng AB - - KW - Query processing techniques ER - TY - CPAPER TI - Repository based software cost estimation AU - Henrich, Andreas PY - 1997 T2 - Database and expert systems applications : 8th international conference, DEXA '97, Toulouse, France, September 1 - 5, 1997 ; proceedings SP - 653-662 PB - Springer CY - Berlin u.a. T3 - Lecture notes in computer science SN - 978-3-540-63478-2 DO - 10.1007/BFb0022073 UR - https://fis.uni-bamberg.de/handle/uniba/36029 LA - eng AB - One important problem with software development projects is to get an early and nevertheless accurate estimation of the software development costs. In the literature various methods have been developed for this purpose. The most popular examples are Boehm's COCOMO, Albrecht's function-Point method or Sneed's object-point method. The two last-named methods are based on early results of the analysis phase, whereas COCOMO is based on an a priori estimation of the software size in “lines of code”. On the other hand, modern software development environments usually employ the object management facilities of a repository to store the documents created and maintained during software development. Hence, software cost estimation methods like the object-Point method, which are based on early analysis results, can be implemented easily on top of the repository. In this paper we present such a repository based realization of software cost estimation methods. KW - Repository ER - TY - CPAPER TI - The update of index structures in object-oriented DBMS AU - Henrich, Andreas PY - 1997 T2 - CIKM '97 : Proceedings of the sixth international conference on Information and knowledge management SP - 136-143 PB - ACM CY - New York SN - 978-0-89791-970-8 DO - 10.1145/266714.266883 UR - https://fis.uni-bamberg.de/handle/uniba/36051 LA - eng AB - Index structures in object-oriented database management systems should support selections not only with respect to physical object attributes, but also with respect to derived attributes. A simple example arises, if we assume the object types Company, Division, and Employee, with the relationships has-division born Company to Division, and employsfrom Division to Employee. In this case the index structureshould allow to support queries for companies specifying thenumber of employees of the company. Unfortunately, there is one main problem with indexstructures addressing derived attributes, namely the question: Which entries in which index structures have to beupdated after a certain update in the object base? In the example above, the creation of a new employee must trigger an index update for the corresponding company. In the present paper we propose a practical solution for this problem. This solution is based on so-called index update definitions which comprise (1) an event description for the event causing the need for the index update, (2) a reference for the affected index structure, (3) a query determining the elements for which the respective index entries have to be updated, and (4) the corresponding tipdnte operation. Using these index update definitions we can handle complex derived attributes defined e.g. employing regular path expressions. The paper first describes the environment for our considerations originating from the fields of software engineering environments and information retrieval. Thereafter the use of our approach is demonstrated by the help of a comprehensive example. Finally we sketch the implementation of our approach based on a multi-thread architecture KW - index structures ER - TY - CPAPER TI - A hybrid split strategy for k-d-tree based access structures AU - Henrich, Andreas PY - 1996 T2 - GIS '96 : Proceedings of the 4th ACM international workshop on Advances in geographic information systems SP - 1-8 PB - ACM CY - New York SN - 978-0-89791-874-9 DO - 10.1145/258319.258323 UR - https://fis.uni-bamberg.de/handle/uniba/36069 LA - eng AB - With spatial access structures the split strategy determining how the objects stored in an overflowing bucket are distributed over two buckets. is crucial for the performance and robustness. Two categories of split strategies can be distinguished: Data dependent split strategies depend only on the objects stored in the bucket to be split. Distribution dependent split strategies choose the split dimension and the split position independently of the objects actually stored in the bucket to be split based on an hypothesis about the object distribution. Unfortunately both types of split strategies have specific drawbacks. For a distribution dependent split strategy a sound hypothesis for the spatial distribution of the objects is needed in advance and with data dependent split strategies the directory tree becomes extremely unbalanced for insertions in a geometrically presorted order. In this paper we present a hybrid split strategy which tries to combine the advantages of both types of split strategies. Normally it adapts the behavior of a data dependent split strategy, but when the risk of a degeneration of the access structure is detected, it mutates to a distribution dependent split strategy. We will show that this hybrid split strategy is robust with respect to skew distributions and with respect to insertions in presorted order. KW - hybrid split strategy ER - TY - CPAPER TI - Document retrieval facilities for repository-based system development environments AU - Henrich, Andreas PY - 1996 T2 - SIGIR '96 : Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval SP - 101-109 PB - ACM CY - New York SN - 978-0-89791-792-6 DO - 10.1145/243199.243237 UR - https://fis.uni-bamberg.de/handle/uniba/36073 LA - eng AB - Modern system development environments usually deploy the object management facilities of a so-called repository to store the documents created and maintained during system development. PCTE is the ISO and ECMA standard for a public tool interface for an open repository [23]. In this paper we present document retrieval extensions for an OQL-oriented query language for PCTE. The extensions proposed cover (1) pattern matching, (2) term based document retrieval with automatically generated document description vectors, (3) the flexible definition of what is addressed as a “document” in a given query, and (4) the integration of these facilities into a CASE tool. Whereas the integration of pattern matching facilities into query languages has been addressed by other authors before, the main contribution of our approach is the homogeneous integration of term based document retrieval and the flexible definition of documents. KW - Document retrieval facilities ER - TY - CPAPER TI - Using a query language to state consistency constraints for repositories AU - Henrich, Andreas AU - Däberitz, Dirk PY - 1996 T2 - Database and expert systems applications : 7th international conference, DEXA '96, Zurich, Switzerland, September 9 - 13, 1996 ; proceedings SP - 59-68 PB - Springer CY - Berlin u. a. T3 - Lecture notes in computer science SN - 978-3-540-61656-6 DO - 10.1007/BFb0034670 UR - https://fis.uni-bamberg.de/handle/uniba/36058 LA - eng AB - Modern system development environments usually deploy the object management facilities of a repository to store the documents created and maintained during system development. In this paper we present a pragmatic approach to express various levels of consistency for the data maintained in such a repository. The levels of consistency are achieved by means of a query language. Consistency constraints are stated as queries searching for inconsistent items in the repository. The queries are handled by a generic analyzer, which checks the defined constraints whenever appropriate. Furthermore, we present a general classification schema for consistency constraints and describe how different classes of constraints are handled by our approach. KW - query language ER - TY - CPAPER TI - Adapting a spatial access structure for document representations in vector space AU - Henrich, Andreas PY - 1996 T2 - CIKM '96 : Proceedings of the fifth international conference on Information and knowledge management SP - 19-26 PB - ACM CY - New York u.a. SN - 978-0-89791-873-2 DO - 10.1145/238355.238367 UR - https://fis.uni-bamberg.de/handle/uniba/36034 LA - eng AB - In the field of information-retrieval the vector space model has been proposed. In this model queries and documents are represented ae term vectors where each coefficient represents the relevance of a given term with respect to the document or query. A typical task in this context is to search for the documents most similar to a given query vector. On the other hand, algorithms to perform nearest neighbor and distance scan queries have been proposed for various types of spatial access structures. Unfortunately, these access structures assume implicitly that the number of dimensions is relatively small — which is not the case for document representation vectors. In this paper we discuss the adaptation of spatial access structures for document representation vectors. We describe how some peculiarities of document representation vectors can be exploited to overcome the problems with higher dimensions to a certain extend. We exploit these peculiarities introducing a new cluster split technique and a sophisticated algorithm to calculate an upper bound for the similarity of the documents located in a subtree of the access structure. KW - spatial access structure ER - TY - CPAPER TI - Improving the performance of multi-dimensional access structures based on k-d-Trees AU - Henrich, Andreas PY - 1996 T2 - Proceedings of the Twelfth International Conference on Data Engineering : February 26 - March 1, 1996, New Orleans, Louisiana (ICDE '96) SP - 68-75 PB - IEEE CY - Los Alamitos, Calif. u.a. DO - 10.1109/ICDE.1996.492090 UR - https://fis.uni-bamberg.de/handle/uniba/36037 LA - eng AB - In recent years, various k-d-tree based multidimensional access structures have been proposed. All these structures share an average bucket utilization of at most ln 2/spl ap/69.3%. We present two algorithms which perform local redistributions of objects to improve the storage utilization of these access structures. We show that under fair conditions a good improvement algorithm can save up to 20% of space and up to 15% of query processing time. On the other hand we also show that a local redistribution scheme designed without care, can improve the storage utilization and at the same time worsen the performance of range queries drastically. Furthermore we show the dependencies between split strategies and local redistribution schemes and the general limitations which can be derived from these dependencies. KW - k-d-Trees ER - TY - CHAP TI - Integration von Zugriffsparadigmen in einem Repository AU - Henrich, Andreas AU - Kelter, Udo PY - 1996 T2 - Beherrschung von Informationssystemen : Tagungsband der Informatik '96 SP - 307-326 PB - Oldenbourg CY - München SN - 3-486-23822-1 UR - https://fis.uni-bamberg.de/handle/uniba/36044 LA - deu ER - TY - CPAPER TI - Paging binary trees with external balancing AU - Henrich, Andreas AU - Six, Hans-Werner AU - Widmayer, Peter PY - 1990 T2 - Graph-theoretic concepts in computer science : 15th Internat. Workshop WG '89 Castle Rolduc, The Netherlands, June 14 - 16, 1989 ; proceedings SP - 260-276 PB - Springer CY - Berlin u.a. SN - 978-3-540-52292-8 UR - https://fis.uni-bamberg.de/handle/uniba/58918 LA - eng AB - - KW - Gewichteter Binärbaum ER - TY - THES TI - Der LSD-Baum : eine mehrdimensionale Zugriffsstruktur und ihre Einsatzmoglichkeiten in Datenbanksystemen AU - Henrich, Andreas PY - 1990 UR - https://fis.uni-bamberg.de/handle/uniba/36021 LA - deu ER - TY - CPAPER TI - The LSD tree : spatial access to multidimensional point and non-point objects AU - Henrich, Andreas AU - Six, Hans-Werner AU - Widmayer, Peter PY - 1989 T2 - Proceedings of the fifteenth International Conference on Very Large Data Bases : August 22-25, 1989, Amsterdam, The Netherlands SP - 45-53 PB - Morgan Kaufmann Publishers CY - San Francisco SN - 1-55860-101-5 UR - https://fis.uni-bamberg.de/handle/uniba/58915 LA - eng AB - - KW - Entscheidungsbaum ER -