@inproceedings{lachner2026_117763,
  title = {What Makes Research Data Visible? : Factors and Implications for Humanities Research Data Infrastructures},
  author = {Lachner, Sonja and Henrich, Andreas},
  year = {2026},
  pages = {1-13},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-117763x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117763},
  language = {eng},
  abstract = {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.},
  keywords = {Humanities Research Data, Research Data Visibility, Research Data Infrastructures, Information Behavior}
}

@inproceedings{lachner2026_117760,
  title = {What Makes Research Data Visible? : Factors and Implications for Humanities Research Data Infrastructures},
  author = {Lachner, Sonja and Henrich, Andreas},
  year = {2026},
  booktitle = {JCDL '26: Proceedings of the 26th ACM/IEEE Joint Conference on Digital Libraries},
  pages = {1-13},
  publisher = {ACM},
  address = {New York, NY; United States},
  isbn = {979-8-4007-2597-5},
  doi = {10.1145/3805696.3846022},
  url = {https://fis.uni-bamberg.de/handle/uniba/117760},
  language = {eng},
  abstract = {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.},
  keywords = {Humanities Research Data, Research Data Visibility, Research Data Infrastructures, Information Behavior}
}

@inproceedings{lachner2026_117762,
  title = {Support for Reuse in Data Journals : Current State and Future Perspectives for the Humanities},
  author = {Lachner, Sonja and Fruth, Leon and Henrich, Andreas},
  year = {2026},
  pages = {1-5},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-117762x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117762},
  language = {eng},
  abstract = {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.},
  keywords = {Research Data Reuse, Humanities Research Data, Data Journals}
}

@inproceedings{lachner2026_117761,
  title = {Support for Reuse in Data Journals : Current State and Future Perspectives for the Humanities},
  author = {Lachner, Sonja and Fruth, Leon and Henrich, Andreas},
  year = {2026},
  booktitle = {JCDL '26: Proceedings of the 26th ACM/IEEE Joint Conference on Digital Libraries},
  pages = {1-5},
  publisher = {ACM},
  address = {New York, NY; United States},
  isbn = {979-8-4007-2597-5},
  doi = {10.1145/3805696.3846475},
  url = {https://fis.uni-bamberg.de/handle/uniba/117761},
  language = {eng},
  abstract = {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.},
  keywords = {Research Data Reuse, Humanities Research Data, Data Journals}
}

@inproceedings{fruth2026_115320,
  title = {ADISS : Authority Data Integration Search System},
  author = {Fruth, Leon and Gradl, Tobias and Henrich, Andreas},
  year = {2026},
  pages = {189-200},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  url = {https://fis.uni-bamberg.de/handle/uniba/115320},
  language = {eng},
  abstract = {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.},
  keywords = {FAIR, Digital Humanities, Authority Data, Data Curation}
}

@article{kohlhase2026_115195,
  title = {Project VoLL-KI : Learning from Learners},
  author = {Kohlhase, Michael and Berges, Marc and Grubert, Jens and Landes, Dieter and Leidner, Jochen L. and Henrich, Andreas and Mittag, Florian and Nicklas, Daniela and Schmid, Ute Maria and Sedlmaier, Yvonne and Ulbrich-vom Ende, Achim and Wolter, Diedrich},
  year = {2026},
  volume = {39},
  pages = {299–309},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-115195x},
  url = {https://fis.uni-bamberg.de/handle/uniba/115195},
  language = {eng},
  abstract = {“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},
  keywords = {Computer-aided education, Intelligent tutoring systems, Teaching support for artifcial intelligence education, Computer-aided learning (CAL), Data-driven learning quality management, Study course monitoring, Learning analytics}
}

@inproceedings{hebeis2026_114779,
  title = {Automatisierte Typklassifikation von Normdaten mit BERT : Poster},
  author = {Hebeis, Maximilian and Fruth, Leon and Gradl, Tobias and Henrich, Andreas},
  year = {2026},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-114779x},
  url = {https://fis.uni-bamberg.de/handle/uniba/114779},
  language = {deu},
  abstract = {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.},
  keywords = {Normdaten, Textklassifikation, Maschinelles Lernen, Forschungsdateninfrastrukturen, Metadaten, Entity Typing, BERT, Datenintegration}
}

@inproceedings{hebeis2026_114771,
  title = {Automatisierte Typklassifikation von Normdaten mit BERT},
  author = {Hebeis, Maximilian and Fruth, Leon and Gradl, Tobias and Henrich, Andreas},
  year = {2026},
  pages = {447-450},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-114771x},
  url = {https://fis.uni-bamberg.de/handle/uniba/114771},
  language = {deu},
  abstract = {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.},
  keywords = {Normdaten, Textklassifikation, Maschinelles Lernen, Forschungsdateninfrastrukturen, Metadaten, Entity Typing, BERT, Datenintegration}
}

@inproceedings{hebeis2026_114773,
  title = {Automatisierte Typklassifikation von Normdaten mit BERT},
  author = {Hebeis, Maximilian and Fruth, Leon and Gradl, Tobias and Henrich, Andreas},
  year = {2026},
  booktitle = {Book of Abstracts : DHd 2026},
  pages = {447-450},
  publisher = {Zenodo},
  doi = {10.5281/zenodo.18703020},
  url = {https://fis.uni-bamberg.de/handle/uniba/114773},
  language = {deu},
  abstract = {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.},
  keywords = {Normdaten, Textklassifikation, Maschinelles Lernen, Forschungsdateninfrastrukturen, Metadaten, Entity Typing, BERT, Datenintegration}
}

@inproceedings{hebeis2026_114772,
  title = {Automatisierte Typklassifikation von Normdaten mit BERT : Poster},
  author = {Hebeis, Maximilian and Fruth, Leon and Gradl, Tobias and Henrich, Andreas},
  year = {2026},
  publisher = {Zenodo},
  doi = {10.5281/zenodo.18999712},
  url = {https://fis.uni-bamberg.de/handle/uniba/114772},
  language = {deu},
  abstract = {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.},
  keywords = {Normdaten, Textklassifikation, Maschinelles Lernen, Forschungsdateninfrastrukturen, Metadaten, Entity Typing, BERT, Datenintegration}
}

@inproceedings{jegan2026_114487,
  title = {Contrasting Traditional Models and LLMs : An Evaluation Based on Text Segmentation},
  author = {Jegan, Robin and Henrich, Andreas},
  year = {2026},
  pages = {274–281},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-114487x},
  url = {https://fis.uni-bamberg.de/handle/uniba/114487},
  language = {eng},
  abstract = {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.},
  keywords = {-}
}

@inproceedings{lang2026_114474,
  title = {Automatic Creation of Marginalia},
  author = {Lang, Aaron and Jegan, Robin and Henrich, Andreas},
  year = {2026},
  pages = {228–240},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-114474x},
  url = {https://fis.uni-bamberg.de/handle/uniba/114474},
  language = {eng},
  abstract = {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.},
  keywords = {-}
}

@article{fruth2026_112845,
  title = {A Flexible Search System for Integrated Authority Data : ADISS},
  author = {Fruth, Leon and Gradl, Tobias and Hebeis, Maximilian and Henrich, Andreas},
  year = {2026},
  pages = {167-178},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-112845x},
  url = {https://fis.uni-bamberg.de/handle/uniba/112845},
  language = {eng},
  abstract = {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.},
  keywords = {FAIR, Digital Humanities, Authority Data, Data Curation}
}

@inproceedings{lang2025_112238,
  title = {Methoden der automatischen Sprachverarbeitung und Zugänge zu Big Data für den Fachunterricht},
  author = {Lang, Aaron},
  editor = {Henrich, Andreas},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-112238},
  urn = {urn:nbn:de:bvb:473-irb-112238x},
  url = {https://fis.uni-bamberg.de/handle/uniba/112238},
  language = {deu},
  abstract = {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.},
  keywords = {Distant Reading, DiSo}
}

@inproceedings{gradl2025_112303,
  title = {Teilprojekt Text+ – Nutzbarmachung von Sammlungen, Editionen und Co},
  author = {Gradl, Tobias and Hirmer, Tobias and Fruth, Leon and Henrich, Andreas},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-112303},
  urn = {urn:nbn:de:bvb:473-irb-112303x},
  url = {https://fis.uni-bamberg.de/handle/uniba/112303},
  language = {deu},
  abstract = {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.},
  keywords = {DiSo, lernen:digital}
}

@inproceedings{haase2025_106904,
  title = {A closed approach to vague collections in partly inaccessible distributed databases},
  author = {Haase, Oliver and Henrich, Andreas},
  year = {2025},
  pages = {261-274},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture Notes in Computer Science},
  urn = {urn:nbn:de:bvb:473-irb-1069046},
  url = {https://fis.uni-bamberg.de/handle/uniba/106904},
  language = {eng},
  abstract = {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.},
  keywords = {distributed databases}
}

@article{bock2025_111422,
  title = {Learner models : design, components, structure, and modelling ; A systematic literature review},
  author = {Böck, Felix and Ochs, Michaela and Henrich, Andreas and Landes, Dieter and Leidner, Jochen L. and Sedelmaier, Yvonne},
  year = {2025},
  pages = {1-81},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-111422x},
  url = {https://fis.uni-bamberg.de/handle/uniba/111422},
  language = {eng},
  abstract = {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.},
  keywords = {Learner model, Digital twin, Student modelling, Systematic literature review, Systematic survey, Systematic review, Higher education, Computer science, Computer-assisted learning}
}

@article{bock2025_112077,
  title = {Learner models : design, components, structure, and modelling ; A systematic literature review},
  author = {Böck, Felix and Ochs, Michaela and Henrich, Andreas and Landes, Dieter and Leidner, Jochen L. and Sedelmaier, Yvonne},
  year = {2025},
  journal = {User modeling and user adapted interaction : an international journal ; umuai},
  volume = {35},
  number = {4, 15},
  pages = {1-81},
  publisher = {Springer},
  address = {Berlin},
  issn = {1573-1391},
  doi = {10.1007/s11257-025-09434-4},
  url = {https://fis.uni-bamberg.de/handle/uniba/112077},
  language = {eng},
  abstract = {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.},
  keywords = {Learner model, Digital twin, Student modelling, Systematic literature review, Systematic survey, Systematic review, Higher education, Computer science, Computer-assisted learning}
}

@article{hirmer2025_112053,
  title = {Baula – die digitale Studienplanungsassistentin an der Universität Bamberg},
  author = {Hirmer, Tobias and Ochs, Michaela and Henrich, Andreas},
  year = {2025},
  pages = {15-36},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-112053x},
  url = {https://fis.uni-bamberg.de/handle/uniba/112053},
  language = {deu},
  abstract = {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.},
  keywords = {Studienplanung, Digitalisierung der Hochschule, Studienassistent, Webanwendung, study planning, web application, digitalisation of the university, study assistant}
}

@inproceedings{hummel2025_111941,
  title = {Assessing the FAIRness of Software Repositories Using RDF and SHACL},
  author = {Hummel, Tobias and Martin, Leon and Henrich, Andreas},
  year = {2025},
  pages = {160-175},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-111941x},
  url = {https://fis.uni-bamberg.de/handle/uniba/111941},
  language = {eng},
  abstract = {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.},
  keywords = {FAIR software, GitHub repositories, SHACL}
}

@inproceedings{fruth2025_111935,
  title = {An Approach towards Unsupervised Text Simplification on Paragraph-Level for German Texts},
  author = {Fruth, Leon and Jegan, Robin and Henrich, Andreas},
  year = {2025},
  pages = {77–89},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-111935x},
  url = {https://fis.uni-bamberg.de/handle/uniba/111935},
  language = {eng},
  abstract = {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.},
  keywords = {Unsupervised Text Simplification}
}

@inproceedings{ochs2025_111431,
  title = {Upcycling UnivIS : Discovering Study Planning 2.0},
  author = {Ochs, Michaela and Hirmer, Tobias and Henrich, Andreas},
  year = {2025},
  pages = {859-865},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-111431x},
  url = {https://fis.uni-bamberg.de/handle/uniba/111431},
  language = {eng},
  abstract = {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.},
  keywords = {Legacy Systems, Digital Transformation, Higher Education, Study Planning}
}

@inproceedings{ochs2025_111483,
  title = {Upcycling UnivIS : Discovering Study Planning 2.0},
  author = {Ochs, Michaela and Hirmer, Tobias and Henrich, Andreas},
  year = {2025},
  booktitle = {Datenbanksysteme für Business, Technologie und Web (BTW 2025) : 03. -07. März 2025 Bamberg ; Proceedings},
  pages = {859-865},
  publisher = {Gesellschaft für Informatik e.V.},
  address = {Bonn},
  series = {Lecture Notes in Informatics (LNI),},
  issn = {2944-7682},
  doi = {10.18420/btw2025-52},
  url = {https://fis.uni-bamberg.de/handle/uniba/111483},
  language = {eng},
  abstract = {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.},
  keywords = {Legacy Systems, Digital Transformation, Higher Education, Study Planning}
}

@article{fruth2025_111276,
  title = {A Flexible Search System for Integrated Authority Data : ADISS},
  author = {Fruth, Leon and Gradl, Tobias and Hebeis, Maximilian and Henrich, Andreas},
  year = {2025},
  journal = {Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V.},
  volume = {25},
  number = {3},
  pages = {167-178},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {1618-2162},
  doi = {10.1007/s13222-025-00515-7},
  url = {https://fis.uni-bamberg.de/handle/uniba/111276},
  language = {eng},
  abstract = {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.},
  keywords = {FAIR, Digital Humanities, Authority Data, Data Curation}
}

@inproceedings{jegan2025_111250,
  title = {Contrasting Traditional Models and LLMs : An Evaluation Based on Text Segmentation},
  author = {Jegan, Robin and Henrich, Andreas},
  year = {2025},
  booktitle = {Proceedings of the 21st Conference on Natural Language Processing (KONVENS 2025) : Workshops},
  pages = {274–281},
  publisher = {HsH Applied Academics},
  address = {Hannover},
  url = {https://fis.uni-bamberg.de/handle/uniba/111250},
  language = {eng},
  abstract = {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.},
  keywords = {-}
}

@inproceedings{lang2025_111251,
  title = {Automatic Creation of Marginalia},
  author = {Lang, Aaron and Jegan, Robin and Henrich, Andreas},
  year = {2025},
  booktitle = {Proceedings of the 21st Conference on Natural Language Processing (KONVENS 2025) : Long and Short Papers},
  pages = {228–240},
  publisher = {HsH Applied Academics},
  address = {Hannover},
  url = {https://fis.uni-bamberg.de/handle/uniba/111251},
  language = {eng},
  abstract = {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.},
  keywords = {-}
}

@inproceedings{gobel2025_106660,
  title = {A Hybrid Index Structure for Geo-Textual Searches},
  author = {Göbel, Richard and Henrich, Andreas and Niemann, Raik and Blank, Daniel},
  year = {2025},
  pages = {1625–1628},
  urn = {urn:nbn:de:bvb:473-irb-1066609},
  url = {https://fis.uni-bamberg.de/handle/uniba/106660},
  language = {eng},
  abstract = {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.},
  keywords = {R-Tree, Inverted Index, Geographical IR}
}

@inproceedings{henrich2025_106654,
  title = {The update of index structures in object-oriented DBMS},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {136-143},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066541},
  url = {https://fis.uni-bamberg.de/handle/uniba/106654},
  language = {eng},
  abstract = {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},
  keywords = {index structures}
}

@inproceedings{muller2025_106621,
  title = {Scalable summary based retrieval in P2P networks},
  author = {Müller, Wolfgang and Eisenhardt, Martin and Henrich, Andreas},
  year = {2025},
  pages = {586-593},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066218},
  url = {https://fis.uni-bamberg.de/handle/uniba/106621},
  language = {deu},
  abstract = {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.},
  keywords = {P2P, Similarity Search, Distributed IR}
}

@inproceedings{blank2025_106620,
  title = {Sample-based Creation of Peer Summaries for Efficient Similarity Search in Scalable Peer-to-Peer Networks},
  author = {Blank, Daniel and El Allali, Soufyane and Müller, Wolfgang and Henrich, Andreas},
  year = {2025},
  pages = {143-151},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066207},
  url = {https://fis.uni-bamberg.de/handle/uniba/106620},
  language = {eng},
  abstract = {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.},
  keywords = {P2P, CBIR, Source selection}
}

@inproceedings{eckstein2025_106616,
  title = {LFRP-Search: Multi-Layer Ranked Visual Faceted Search : an Approach to Cope with Complex Search Situations},
  author = {Eckstein, Raiko and Henrich, Andreas and Weber, Nadine},
  year = {2025},
  pages = {1713-1717},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066163},
  url = {https://fis.uni-bamberg.de/handle/uniba/106616},
  language = {eng},
  abstract = {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-<u>L</u>ayer <u>F</u>aceted Search with <u>R</u>anking using <u>P</u>arallel <u>C</u>oordinates). The main contribution of this paper is the semi-formal description of the query options.},
  keywords = {Information Retrieval, Retrieval Model, Multi-Criteria, Visualization, Faceted Search, Parallel Coordinates}
}

@inproceedings{scherp2025_106615,
  title = {Interaction and user experiences with multimedia technologies : challenges and future topics},
  author = {Scherp, Ansgar and Nack, Frank and Nahrstedt, Klara and Inoue, Masashi and Girgensohn, Andreas and Henrich, Andreas and Sandhaus, Philipp and Thieme, Sabine and Zhou,  Michelle},
  year = {2025},
  pages = {1-6},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066157},
  url = {https://fis.uni-bamberg.de/handle/uniba/106615},
  language = {eng},
  abstract = {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.},
  keywords = {Interaction, User Experience, Multimedia, Human-computer Interaction, Information Retrieval, Networked Multimedia, Creative Arts}
}

@inproceedings{muller2025_106613,
  title = {Fast Retrieval of High-Dimensional Feature Vectors in P2P Networks Using Compact Peer Data Summaries},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2025},
  pages = {79–86},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066131},
  url = {https://fis.uni-bamberg.de/handle/uniba/106613},
  language = {deu},
  abstract = {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.},
  keywords = {Algorithms, Performance}
}

@inproceedings{haase2025_106608,
  title = {Exposing the Vagueness of Query Results on Partly Inaccessible Databases},
  author = {Haase, Oliver and Henrich, Andreas},
  year = {2025},
  pages = {49-56},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066089},
  url = {https://fis.uni-bamberg.de/handle/uniba/106608},
  language = {eng},
  abstract = {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.},
  keywords = {Query Processing, Inaccessibility, Vagueness}
}

@inproceedings{henrich2025_106607,
  title = {Document retrieval facilities for repository-based system development environments},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {101-109},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066079},
  url = {https://fis.uni-bamberg.de/handle/uniba/106607},
  language = {eng},
  abstract = {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.},
  keywords = {Document retrieval facilities}
}

@inproceedings{henrich2025_106606,
  title = {Determining geographic representations for arbitrary concepts at query time},
  author = {Henrich, Andreas and Lüdecke, Volker},
  year = {2025},
  pages = {17-24},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066066},
  url = {https://fis.uni-bamberg.de/handle/uniba/106606},
  language = {eng},
  abstract = {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.},
  keywords = {Vague geographic regions, Geographic search engines}
}

@inproceedings{henrich2025_106604,
  title = {Characteristics of geographic information needs},
  author = {Henrich, Andreas and Lüdecke, Volker},
  year = {2025},
  pages = {1-6},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066043},
  url = {https://fis.uni-bamberg.de/handle/uniba/106604},
  language = {eng},
  abstract = {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.},
  keywords = {Experimentation, Human Factors}
}

@inproceedings{henrich2025_106602,
  title = {Approaches for determining the geographic footprint of arbitrary terms for retrieval and visualization},
  author = {Henrich, Andreas and Lüdecke, Volker and Blank, Daniel},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066029},
  url = {https://fis.uni-bamberg.de/handle/uniba/106602},
  language = {eng},
  abstract = {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.},
  keywords = {Vague geographic regions, Geographic search engines}
}

@inproceedings{henrich2025_106577,
  title = {Adapting a spatial access structure for document representations in vector space},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {19-26},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1065775},
  url = {https://fis.uni-bamberg.de/handle/uniba/106577},
  language = {eng},
  abstract = {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.},
  keywords = {spatial access structure}
}

@inproceedings{henrich2025_106537,
  title = {A hybrid split strategy for k-d-tree based access structures},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {1-8},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1065371},
  url = {https://fis.uni-bamberg.de/handle/uniba/106537},
  language = {eng},
  abstract = {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.},
  keywords = {hybrid split strategy}
}

@inproceedings{blank2025_106535,
  title = {IT Company Atlas Upper Franconia : A Practical Application of Expert Search Techniques},
  author = {Blank, Daniel and Boosz, Sebastian and Henrich, Andreas},
  year = {2025},
  pages = {1048-1053},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1065355},
  url = {https://fis.uni-bamberg.de/handle/uniba/106535},
  language = {eng},
  abstract = {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".},
  keywords = {Company search, Expertise retrieval, Expert search, Domain specific search solutions, IR systems}
}

@inproceedings{kufer2025_106533,
  title = {Hybrid Quantized Resource Descriptions for Geospatial Source Selection},
  author = {Kufer, Stefan and Henrich, Andreas},
  year = {2025},
  pages = {17-24},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1065333},
  url = {https://fis.uni-bamberg.de/handle/uniba/106533},
  language = {eng},
  abstract = {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.},
  keywords = {Geographic Information Retrieval, Distributed Information Retrieval, Source Selection, Summarization, Quantization}
}

@inproceedings{wolter2025_106525,
  title = {Georeferencing River Networks Using Spatial Reasoning},
  author = {Wolter, Diedrich and Blank, Daniel and Henrich, Andreas},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1065257},
  url = {https://fis.uni-bamberg.de/handle/uniba/106525},
  language = {eng},
  abstract = {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.},
  keywords = {georeferencing river networks, spatial reasoning, GIS}
}

@inproceedings{gradl2025_106485,
  title = {Extending Data Models by Declaratively Specifying Contextual Knowledge},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2025},
  pages = {123-126},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064857},
  url = {https://fis.uni-bamberg.de/handle/uniba/106485},
  language = {eng},
  abstract = {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.},
  keywords = {digital humanities, descriptive data modeling, language applications, DARIAH}
}

@inproceedings{wolf2025_106484,
  title = {Characterization of toponym usages in texts},
  author = {Wolf, Sebastian Johannes and Henrich, Andreas and Blank, Daniel},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064841},
  url = {https://fis.uni-bamberg.de/handle/uniba/106484},
  language = {eng},
  abstract = {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.},
  keywords = {Computational Linguistics, Linguistic Devices, Geographical Information Retrieval, Geospatial Grounding}
}

@inproceedings{blank2025_106453,
  title = {Assessing Interestingness and Importance of Information Retrieval Course Topics in a Course for Three Different Target Groups},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2025},
  pages = {1-8},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064536},
  url = {https://fis.uni-bamberg.de/handle/uniba/106453},
  language = {eng},
  abstract = {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.},
  keywords = {Teaching Information Retrieval, Evaluation of Course Content, Distance Learning}
}

@incollection{blank2025_106427,
  title = {Teaching IR : Curricular Considerations},
  author = {Blank, Daniel and Fuhr, Norbert and Henrich, Andreas and Mandl, Thomas and Rölleke,  Thomas and Schütze, Hinrich and Stein, Benno},
  year = {2025},
  pages = {31-46},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064279},
  url = {https://fis.uni-bamberg.de/handle/uniba/106427},
  language = {eng},
  abstract = {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.},
  keywords = {Teaching IR}
}

@incollection{henrich2025_106422,
  title = {Search Support in Data Management Systems},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {137-157},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064220},
  url = {https://fis.uni-bamberg.de/handle/uniba/106422},
  language = {eng},
  abstract = {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.},
  keywords = {Data Management Systems}
}

@incollection{henrich2025_106417,
  title = {Ad Hoc Determination of Geographic Regions for Concept@Location Queries},
  author = {Henrich, Andreas and Lüdecke, Volker},
  year = {2025},
  pages = {169-194},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064173},
  url = {https://fis.uni-bamberg.de/handle/uniba/106417},
  language = {eng},
  abstract = {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.},
  keywords = {Concept@Location Queries}
}

@article{henrich2025_106412,
  title = {Blended learning and pure e-learning concepts for information retrieval : experiences and future directions},
  author = {Henrich, Andreas and Sieber, Stefanie},
  year = {2025},
  pages = {117-147},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064124},
  url = {https://fis.uni-bamberg.de/handle/uniba/106412},
  language = {eng},
  abstract = {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.},
  keywords = {Teaching information retrieval, Blended learning, e-Learning, Interaction}
}

@article{henrich2025_106407,
  title = {Editorial : Schwerpunktthema: Informationsmanagement für Digital Humanities},
  author = {Henrich, Andreas and Heyer, Gerhard and Schlieder, Christoph and Härder, Theo},
  year = {2025},
  pages = {1-6},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064077},
  url = {https://fis.uni-bamberg.de/handle/uniba/106407},
  language = {deu},
  abstract = {-},
  keywords = {Informationsmanagement, Digital Humanities}
}

@article{berthold2025_106406,
  title = {Architektur Multimedialer Informationssysteme},
  author = {Berthold, Henrike and Binkowski, Frank and Henrich, Andreas and Hollfelder, Silvia and Lindner, Wolfgang and Marder, Ulrich and Meyer-Wegener, Klaus and Robbert, Günter},
  year = {2025},
  pages = {77-89},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064063},
  url = {https://fis.uni-bamberg.de/handle/uniba/106406},
  language = {deu},
  abstract = {-},
  keywords = {Multimediale Informationssysteme}
}

@inproceedings{kufer2025_106400,
  title = {Using Hybrid Techniques for Resource Description and Selection in the Context of Distributed Geographic Information Retrieval},
  author = {Kufer, Stefan and Blank, Daniel and Henrich, Andreas},
  year = {2025},
  pages = {330-347},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture Notes in Computer Science},
  urn = {urn:nbn:de:bvb:473-irb-1064007},
  url = {https://fis.uni-bamberg.de/handle/uniba/106400},
  language = {eng},
  abstract = {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.},
  keywords = {Distributed Geographic Information Retrieval}
}

@inproceedings{martin2025_106396,
  title = {Fast Pathfinding in Knowledge Graphs Using Word Embeddings},
  author = {Martin, Leon and Boockmann, Jan H. and Henrich, Andreas},
  year = {2025},
  pages = {305-312},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture Notes in Computer Science},
  urn = {urn:nbn:de:bvb:473-irb-1063964},
  url = {https://fis.uni-bamberg.de/handle/uniba/106396},
  language = {eng},
  abstract = {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.},
  keywords = {Knowledge graphs, Word embeddings, Pathfinding}
}

@inproceedings{gradl2025_106381,
  title = {Data Integration for the Arts and Humanities : A Language Theoretical Concept},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2025},
  pages = {281-293},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture Notes in Computer Science},
  urn = {urn:nbn:de:bvb:473-irb-1063811},
  url = {https://fis.uni-bamberg.de/handle/uniba/106381},
  language = {eng},
  abstract = {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.},
  keywords = {Data Integration}
}

@inproceedings{muller2025_106380,
  title = {Aspects of Adaptivity in P2P Information Retrieval},
  author = {Müller, Wolfgang and Henrich, Andreas and Eisenhardt, Martin},
  year = {2025},
  pages = {164-178},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1063804},
  url = {https://fis.uni-bamberg.de/handle/uniba/106380},
  language = {eng},
  abstract = {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.},
  keywords = {P2P Information Retrieval}
}

@inproceedings{henrich2025_106379,
  title = {Using a query language to state consistency constraints for repositories},
  author = {Henrich, Andreas and Däberitz, Dirk},
  year = {2025},
  pages = {59-68},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture notes in computer science},
  urn = {urn:nbn:de:bvb:473-irb-1063793},
  url = {https://fis.uni-bamberg.de/handle/uniba/106379},
  language = {eng},
  abstract = {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.},
  keywords = {query language}
}

@inproceedings{weber2025_106378,
  title = {Searching Multiple Artifacts : a Comprehensive Framework for Complex Search Situations},
  author = {Weber, Nadine and Eckstein, Raiko and Henrich, Andreas},
  year = {2025},
  pages = {251-262},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture notes in computer science},
  urn = {urn:nbn:de:bvb:473-irb-1063780},
  url = {https://fis.uni-bamberg.de/handle/uniba/106378},
  language = {eng},
  abstract = {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.},
  keywords = {Complex Search Situations}
}

@inproceedings{elallali2025_106376,
  title = {Image Data Source Selection Using Gaussian Mixture Models},
  author = {El Allali, Soufyane and Blank, Daniel and Müller, Wolfgang and Henrich, Andreas},
  year = {2025},
  pages = {170-181},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1063764},
  url = {https://fis.uni-bamberg.de/handle/uniba/106376},
  language = {eng},
  abstract = {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.},
  keywords = {Image Data, Source Selection, Gaussian Mixture Models}
}

@inproceedings{fries2025_106375,
  title = {Hybrid Learning : A Powerful Opportunity to Integrate SMEs in Courses as a Third Party},
  author = {Fries, Tobias and Henrich, Andreas},
  year = {2025},
  pages = {176-187},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1063751},
  url = {https://fis.uni-bamberg.de/handle/uniba/106375},
  language = {eng},
  abstract = {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.},
  keywords = {Hybrid Learning}
}

@inproceedings{henrich2025_106374,
  title = {Hybrid Learning : "Neither Fish Nor Fowl" or "The Golden Mean"},
  author = {Henrich, Andreas and Sieber, Stefanie},
  year = {2025},
  pages = {82-93},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture notes in computer science},
  urn = {urn:nbn:de:bvb:473-irb-1063742},
  url = {https://fis.uni-bamberg.de/handle/uniba/106374},
  language = {eng},
  abstract = {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.},
  keywords = {Hybrid Learning}
}

@inproceedings{sieber2025_106373,
  title = {Effectively Managing and Processing Personal Learning Content},
  author = {Sieber, Stefanie and Henrich, Andreas},
  year = {2025},
  pages = {363-366},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1063738},
  url = {https://fis.uni-bamberg.de/handle/uniba/106373},
  language = {eng},
  abstract = {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.},
  keywords = {Personal Learning Content}
}

@article{blank2025_106431,
  title = {Using Summaries to Search and Visualize Distributed Resources Addressing Spatial and Multimedia Features},
  author = {Blank, Daniel and Henrich, Andreas and Kufer, Stefan},
  year = {2025},
  pages = {67-76},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064315},
  url = {https://fis.uni-bamberg.de/handle/uniba/106431},
  language = {eng},
  abstract = {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.},
  keywords = {Resource description and selection, Distributed metric and spatial access methods, Big data summarization}
}

@inproceedings{henrich2025_106885,
  title = {Supporting Collaborative Software Development by Context-Aware Information Retrieval Facilities},
  author = {Henrich, Andreas and Morgenroth, Karlheinz},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1068859},
  url = {https://fis.uni-bamberg.de/handle/uniba/106885},
  language = {eng},
  abstract = {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.},
  keywords = {Collaborative Software Development}
}

@inproceedings{henrich2025_106884,
  title = {The LSDh-Tree : an access structure for feature vectors},
  author = {Henrich, Andreas},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1068849},
  url = {https://fis.uni-bamberg.de/handle/uniba/106884},
  language = {eng},
  abstract = {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.},
  keywords = {LSDh-Tree}
}

@inproceedings{eisenhardt2025_106883,
  title = {Clustering-Based Source Selection for Efficient Image Retrieval in Peer-to-Peer Networks},
  author = {Eisenhardt, Martin and Müller, Wolfgang and Henrich, Andreas and Blank, Daniel and El Allali, Soufyane},
  year = {2025},
  pages = {1-6},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1068839},
  url = {https://fis.uni-bamberg.de/handle/uniba/106883},
  language = {deu},
  abstract = {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.},
  keywords = {Efficient Image Retrieval, Peer-to-Peer Networks}
}

@inproceedings{henrich2025_106879,
  title = {Improving the performance of multi-dimensional access structures based on k-d-Trees},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {68-75},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1068798},
  url = {https://fis.uni-bamberg.de/handle/uniba/106879},
  language = {eng},
  abstract = {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.},
  keywords = {k-d-Trees}
}

@inproceedings{hub2025_106877,
  title = {Picadomo : Faceted Image Browsing for Mobile Devices},
  author = {Hub, Adrian and Blank, Daniel and Henrich, Andreas and Müller, Wolfgang},
  year = {2025},
  pages = {249-254},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1068773},
  url = {https://fis.uni-bamberg.de/handle/uniba/106877},
  language = {eng},
  abstract = {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.},
  keywords = {Picadomo}
}

@article{haase2025_106876,
  title = {A hybrid representation of vague collections for distributed object management systems},
  author = {Haase, Oliver and Henrich, Andreas},
  year = {2025},
  pages = {448-467},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1068767},
  url = {https://fis.uni-bamberg.de/handle/uniba/106876},
  language = {eng},
  abstract = {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.},
  keywords = {distributed systems, distributed databases, query processing, query languages, vagueness, inaccessibility}
}

@inproceedings{sperker2025_106708,
  title = {Feature-based object recognition : A case study for car model detection},
  author = {Sperker, Hans-Christian and Henrich, Andreas},
  year = {2025},
  pages = {127-130},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1067084},
  url = {https://fis.uni-bamberg.de/handle/uniba/106708},
  language = {eng},
  abstract = {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.},
  keywords = {Feature-based object recognition}
}

@article{henrich2025_106705,
  title = {DARIAH(-DE): Digital Research Infrastructure for the Arts and Humanities : Concepts and Perspectives},
  author = {Henrich, Andreas and Gradl, Tobias},
  year = {2025},
  pages = {47-58},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1067057},
  url = {https://fis.uni-bamberg.de/handle/uniba/106705},
  language = {eng},
  abstract = {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.},
  keywords = {research infrastructure, digital humanities, DARIAH, DARIAH-DE}
}

@inproceedings{gradl2025_111116,
  title = {The Text+ Registry : Federating Research Data Catalogues for the Digital Humanities},
  author = {Gradl, Tobias and Fruth, Leon and Henrich, Andreas},
  year = {2025},
  booktitle = {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},
  pages = {378-394},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  isbn = {978-3-032-05409-8},
  doi = {10.1007/978-3-032-05409-8\_22},
  url = {https://fis.uni-bamberg.de/handle/uniba/111116},
  language = {eng}
}

@inproceedings{muller2025_106875,
  title = {VisualFlamenco : Dependable, Interactive Image Browsing Based on Visual Properties},
  author = {Müller, Wolfgang and Zech, Markus and Henrich, Andreas and Blank, Daniel},
  year = {2025},
  pages = {568-575},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1068751},
  url = {https://fis.uni-bamberg.de/handle/uniba/106875},
  language = {eng},
  abstract = {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.},
  keywords = {VisualFlamenco}
}

@inproceedings{henrich2025_106888,
  title = {Evaluation, Analysis, and Future Issues of a University-wide Learning Management System Concluding a Two-year Initiation Phase},
  author = {Henrich, Andreas and Sieber, Stefanie and Wolf, Sven-Uwe},
  year = {2025},
  pages = {103-114},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  edition = {1},
  urn = {urn:nbn:de:bvb:473-irb-1068882},
  url = {https://fis.uni-bamberg.de/handle/uniba/106888},
  language = {eng},
  abstract = {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.},
  keywords = {Learning Management System}
}

@article{henrich2025_106889,
  title = {Exzellente Ideen schneller marktreif : Der Forschungsverbund FORFLOW optimiert IT-Abläufe in der Produktentwicklung},
  author = {Henrich, Andreas and Morgenroth, Karlheinz},
  year = {2025},
  volume = {6},
  pages = {10-13},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1068896},
  url = {https://fis.uni-bamberg.de/handle/uniba/106889},
  language = {deu},
  abstract = {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.},
  keywords = {FORFLOW}
}

@incollection{sieber2025_106890,
  title = {Knowledge Management for Hybrid Learning},
  author = {Sieber, Stefanie and Henrich, Andreas},
  year = {2025},
  pages = {424-449},
  urn = {urn:nbn:de:bvb:473-irb-1068909},
  url = {https://fis.uni-bamberg.de/handle/uniba/106890},
  language = {eng},
  abstract = {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.},
  keywords = {knowledge management, hybrid learning}
}

@inproceedings{muller2025_106897,
  title = {Faster exact histogram intersection on large data collections using inverted VA-files},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2025},
  pages = {455-463},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture notes in computer science},
  urn = {urn:nbn:de:bvb:473-irb-1068976},
  url = {https://fis.uni-bamberg.de/handle/uniba/106897},
  language = {eng},
  abstract = {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.},
  keywords = {histogram intersection, large data collections}
}

@inproceedings{henrich2025_106899,
  title = {Repository based software cost estimation},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {653-662},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture notes in computer science},
  urn = {urn:nbn:de:bvb:473-irb-1068990},
  url = {https://fis.uni-bamberg.de/handle/uniba/106899},
  language = {eng},
  abstract = {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.},
  keywords = {Repository}
}

@inproceedings{henrich2025_106901,
  title = {Retrieval-Dienste für Software-Entwicklungsumgebungen},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {147-162},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1069015},
  url = {https://fis.uni-bamberg.de/handle/uniba/106901},
  language = {deu},
  abstract = {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.},
  keywords = {Retrieval-Dienste}
}

@article{eckstein2025_106944,
  title = {Das LFRP-Framework : ein Ansatz zur interaktiven Suche für unternehmensspezifische Informationen},
  author = {Eckstein, Raiko and Henrich, Andreas and Weber, Nadine},
  year = {2025},
  pages = {20-29},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1069445},
  url = {https://fis.uni-bamberg.de/handle/uniba/106944},
  language = {deu},
  abstract = {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.},
  keywords = {LFRP-Framework}
}

@article{graf2025_106986,
  title = {Geografisches Information Retrieval},
  author = {Graf, Jens and Henrich, Andreas and Lüdecke, Volker and Schlieder, Christoph},
  year = {2025},
  pages = {48-56},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1069860},
  url = {https://fis.uni-bamberg.de/handle/uniba/106986},
  language = {deu},
  abstract = {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.},
  keywords = {Geografisches Information Retrieval}
}

@article{blank2025_106988,
  title = {Information Retrieval : Concepts and Practical Considerations for Teaching a Rising Topic},
  author = {Blank, Daniel and Fuhr, Norbert and Henrich, Andreas and Mandl, Thomas and Rölleke,  Thomas and Schütze, Hinrich and Stein, Benno},
  year = {2025},
  pages = {30-41},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1069883},
  url = {https://fis.uni-bamberg.de/handle/uniba/106988},
  language = {eng},
  abstract = {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.},
  keywords = {Information Retrieval}
}

@article{eisenhardt2025_106989,
  title = {Inhaltsbasierte Suche in P2P-Systemen},
  author = {Eisenhardt, Martin and Henrich, Andreas and Müller, Wolfgang},
  year = {2025},
  pages = {5-15},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1069893},
  url = {https://fis.uni-bamberg.de/handle/uniba/106989},
  language = {deu},
  abstract = {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.},
  keywords = {P2P-Systeme}
}

@inproceedings{henrich2025_106990,
  title = {Applying document retrieval techniques in software engineering environments},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {240-249},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1069908},
  url = {https://fis.uni-bamberg.de/handle/uniba/106990},
  language = {eng},
  abstract = {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.},
  keywords = {document retrieval techniques}
}

@inproceedings{henrich2025_106991,
  title = {On the optimization of queries containing regular path expressions},
  author = {Henrich, Andreas and Jamin, Stefan},
  year = {2025},
  pages = {58-75},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1069914},
  url = {https://fis.uni-bamberg.de/handle/uniba/106991},
  language = {eng},
  abstract = {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.},
  keywords = {regular path expressions}
}

@inproceedings{muller2025_106994,
  title = {Comparing the performance of two CBIRS indexing schemes},
  author = {Müller, Wolfgang and Robbert, Günter and Henrich, Andreas},
  year = {2025},
  pages = {9-20},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  issn = {0277-786X},
  urn = {urn:nbn:de:bvb:473-irb-1069946},
  url = {https://fis.uni-bamberg.de/handle/uniba/106994},
  language = {eng},
  abstract = {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.},
  keywords = {CBIRS indexing schemes}
}

@inproceedings{muller2025_107002,
  title = {Efficient content-based P2P image retrieval using peer content descriptions},
  author = {Müller, Wolfgang and Eisenhardt, Martin and Henrich, Andreas},
  year = {2025},
  pages = {57-68},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1070021},
  url = {https://fis.uni-bamberg.de/handle/uniba/107002},
  language = {eng},
  abstract = {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.},
  keywords = {P2P}
}

@inproceedings{blank2025_107003,
  title = {Company Search : When Documents are only Second Class Citizens},
  author = {Blank, Daniel and Boosz, Sebastian and Henrich, Andreas},
  year = {2025},
  pages = {361-368},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {CEUR workshop proceedings},
  issn = {1613-0073},
  urn = {urn:nbn:de:bvb:473-irb-1070030},
  url = {https://fis.uni-bamberg.de/handle/uniba/107003},
  language = {eng},
  abstract = {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.},
  keywords = {domain specific search solutions, expertise retrieval}
}

@inproceedings{blank2025_107008,
  title = {Die computergestützte Erschließung und Visualisierung historischer Itinerare},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2025},
  pages = {367-371},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1070083},
  url = {https://fis.uni-bamberg.de/handle/uniba/107008},
  language = {deu},
  abstract = {-},
  keywords = {Erschließung, historische Itinerare}
}

@inproceedings{gradl2025_107009,
  title = {Judaica recherchieren : Unterstützung bei der Realisierung forschungsspezifischer Suchlösungen durch die generische Suche von DARIAH-DE},
  author = {Gradl, Tobias and Lordick, Harald and Henrich, Andreas},
  year = {2025},
  pages = {230-235},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1070092},
  url = {https://fis.uni-bamberg.de/handle/uniba/107009},
  language = {deu},
  abstract = {-},
  keywords = {Judaica}
}

@inproceedings{gradl2025_107010,
  title = {Nutzung und Kombination von Daten aus strukturierten und unstrukturierten Quellen zur Identifikation transnationaler Lebensläufe},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2025},
  pages = {261-265},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1070103},
  url = {https://fis.uni-bamberg.de/handle/uniba/107010},
  language = {deu},
  abstract = {-},
  keywords = {transnationale Lebensläufe}
}

@incollection{henrich2025_107053,
  title = {Management von Multimediaprojekten},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {298-317},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1070530},
  url = {https://fis.uni-bamberg.de/handle/uniba/107053},
  language = {deu},
  abstract = {-},
  keywords = {Multimediaprojekte}
}

@incollection{blank2025_107054,
  title = {Describing and selecting collections of georeferenced media items in peer-to-peer information retrieval systems},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2025},
  pages = {1-20},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1070544},
  url = {https://fis.uni-bamberg.de/handle/uniba/107054},
  language = {eng},
  abstract = {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.},
  keywords = {peer-to-peer information retrieval systems}
}

@inproceedings{henrich2025_107058,
  title = {A Relaxed Algorithm for Similarity Queries Performed with High-Dimensional Access Structures},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {376–390},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture notes in computer science},
  urn = {urn:nbn:de:bvb:473-irb-1070589},
  url = {https://fis.uni-bamberg.de/handle/uniba/107058},
  language = {eng},
  abstract = {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.},
  keywords = {Relaxed Algorithm}
}

@inproceedings{haase2025_107064,
  title = {Query processing techniques for partly inaccessible distributed databases},
  author = {Haase, Oliver and Henrich, Andreas},
  year = {2025},
  pages = {123-125},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture notes in computer science},
  urn = {urn:nbn:de:bvb:473-irb-1070643},
  url = {https://fis.uni-bamberg.de/handle/uniba/107064},
  language = {eng},
  abstract = {-},
  keywords = {Query processing techniques}
}

@article{henrich2025_107377,
  title = {VC : Der Virtuelle Campus als Ergänzung zum Hörsaal},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {28},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1073779},
  url = {https://fis.uni-bamberg.de/handle/uniba/107377},
  language = {deu},
  abstract = {-},
  keywords = {Virtueller Campus}
}

@misc{jegan2025_108458,
  title = {A Structured Literature Review on Traditional Approaches in Current Natural Language Processing},
  author = {Jegan, Robin and Henrich, Andreas},
  year = {2025},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2505.12970},
  url = {https://fis.uni-bamberg.de/handle/uniba/108458},
  language = {eng}
}

@inproceedings{fruth2025_108435,
  title = {ADISS : Authority Data Integration Search System},
  author = {Fruth, Leon and Gradl, Tobias and Henrich, Andreas},
  editor = {Gesellschaft für Informatik, Bonn},
  year = {2025},
  booktitle = {Datenbanksysteme für Business, Technologie und Web : Workshopband (BTW 2025)},
  pages = {189-200},
  publisher = {Gesellschaft für Informatik},
  address = {Bonn},
  doi = {10.18420/btw2025-123},
  url = {https://fis.uni-bamberg.de/handle/uniba/108435},
  language = {eng},
  abstract = {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.},
  keywords = {FAIR, Digital Humanities, Authority Data, Data Curation}
}

@article{henrich2025_108043,
  title = {Reactive environments},
  author = {Henrich, Andreas},
  year = {2025},
  pages = {538-540},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1080430},
  url = {https://fis.uni-bamberg.de/handle/uniba/108043},
  language = {deu},
  abstract = {-},
  keywords = {Reactive environments}
}

@article{kohlhase2025_107128,
  title = {Project VoLL-KI : Learning from Learners},
  author = {Kohlhase, Michael and Berges, Marc and Grubert, Jens and Landes, Dieter and Leidner, Jochen L. and Henrich, Andreas and Mittag, Florian and Nicklas, Daniela and Schmid, Ute and Sedlmaier, Yvonne and Ulbrich-vom Ende, Achim and Wolter, Diedrich},
  year = {2025},
  journal = {Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen ; Organ des Fachbereichs 1 Künstliche Intelligenz der Gesellschaft für Informatik e.V., GI},
  volume = {39},
  pages = {299–309},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {0933-1875},
  doi = {10.1007/s13218-024-00846-9},
  url = {https://fis.uni-bamberg.de/handle/uniba/107128},
  language = {eng},
  abstract = {“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},
  keywords = {Computer-aided education, Intelligent tutoring systems, Teaching support for artifcial intelligence education, Computer-aided learning (CAL), Data-driven learning quality management, Study course monitoring, Learning analytics}
}

@inproceedings{blank2025_106486,
  title = {Geocoding place names from historic route descriptions},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064867},
  url = {https://fis.uni-bamberg.de/handle/uniba/106486},
  language = {eng},
  abstract = {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.},
  keywords = {itinerary resolution, geocoding, gazetteer enrichment}
}

@inproceedings{martin2025_106305,
  title = {RDFtex : Knowledge Exchange Between LaTeX-Based Research Publications and Scientific Knowledge Graphs},
  author = {Martin, Leon and Henrich, Andreas},
  year = {2025},
  pages = {26-38},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture Notes in Computer Science},
  urn = {urn:nbn:de:bvb:473-irb-1063055},
  url = {https://fis.uni-bamberg.de/handle/uniba/106305},
  language = {deu},
  abstract = {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.},
  keywords = {Research data management, Data and research infrastructure, Latex research publications}
}

@inproceedings{henrich2025_106304,
  title = {Measuring Similarity of Geographic Regions for Geographic Information Retrieval},
  author = {Henrich, Andreas and Lüdecke, Volker},
  year = {2025},
  pages = {781-785},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture Notes in Computer Science},
  urn = {urn:nbn:de:bvb:473-irb-1063045},
  url = {https://fis.uni-bamberg.de/handle/uniba/106304},
  language = {eng},
  abstract = {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.},
  keywords = {Geographic Information Retrieval}
}

@inproceedings{hirmer2025_106293,
  title = {Lecture Recordings at the University : Analysis and Evaluation of Implementation Possibilities},
  author = {Hirmer, Tobias and Henrich, Andreas},
  year = {2025},
  pages = {151-163},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture Notes in Computer Science},
  urn = {urn:nbn:de:bvb:473-irb-1062931},
  url = {https://fis.uni-bamberg.de/handle/uniba/106293},
  language = {eng},
  abstract = {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.},
  keywords = {Blended learning, Lecture recordings, Requirements}
}

@article{hirmer2024_105590,
  title = {Baula – die digitale Studienplanungsassistentin an der Universität Bamberg},
  author = {Hirmer, Tobias and Ochs, Michaela and Henrich, Andreas},
  year = {2024},
  journal = {Zeitschrift für Hochschulentwicklung},
  volume = {19},
  number = {4},
  pages = {15-36},
  publisher = {Forum neue Medien Austria},
  address = {Graz},
  issn = {2219-6994},
  doi = {10.21240/zfhe/19-4/02},
  url = {https://fis.uni-bamberg.de/handle/uniba/105590},
  language = {deu},
  abstract = {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.},
  keywords = {Studienplanung, Digitalisierung der Hochschule, Studienassistent, Webanwendung, study planning, web application, digitalisation of the university, study assistant}
}

@inproceedings{hummel2024_104187,
  title = {Assessing the FAIRness of Software Repositories Using RDF and SHACL},
  author = {Hummel, Tobias and Martin, Leon and Henrich, Andreas},
  year = {2024},
  booktitle = {Knowledge Graphs in the Age of Language Models and Neuro-Symbolic AI},
  pages = {160-175},
  publisher = {IOS Press},
  series = {Studies on the Semantic Web},
  isbn = {978-1-64368-537-3},
  doi = {10.3233/ssw240014},
  url = {https://fis.uni-bamberg.de/handle/uniba/104187},
  language = {eng},
  abstract = {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.},
  keywords = {FAIR software, GitHub repositories, SHACL}
}

@inproceedings{fruth2024_103945,
  title = {An Approach towards Unsupervised Text Simplification on Paragraph-Level for German Texts},
  author = {Fruth, Leon and Jegan, Robin and Henrich, Andreas},
  year = {2024},
  booktitle = {Proceedings of the Workshop on DeTermIt! Evaluating Text Difficulty in a Multilingual Context @ LREC-COLING 2024},
  pages = {77–89},
  publisher = {ELRA and ICCL},
  url = {https://fis.uni-bamberg.de/handle/uniba/103945},
  language = {eng},
  abstract = {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.},
  keywords = {Unsupervised Text Simplification}
}

@article{martin2024_98431,
  title = {RDFtex in-depth : knowledge exchange between LATEX-based research publications and Scientific Knowledge Graphs},
  author = {Martin, Leon and Henrich, Andreas},
  year = {2024},
  pages = {517-535},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-984315},
  url = {https://fis.uni-bamberg.de/handle/uniba/98431},
  language = {eng},
  abstract = {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.},
  keywords = {Research data management, Data and research infrastructure, Latex-based research publications, Scientific Knowledge Graphs}
}

@article{martin2024_98430,
  title = {RDFtex in-depth : knowledge exchange between LATEX-based research publications and Scientific Knowledge Graphs},
  author = {Martin, Leon and Henrich, Andreas},
  year = {2024},
  journal = {International journal on digital libraries},
  volume = {25},
  number = {3},
  pages = {517-535},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {1432-5012},
  doi = {10.1007/s00799-023-00370-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/98430},
  language = {eng},
  abstract = {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.},
  keywords = {Research data management, Data and research infrastructure, Latex-based research publications, Scientific Knowledge Graphs}
}

@inproceedings{bartel2024_96166,
  title = {Design Principles for a Study Planning Assistant in Higher Education},
  author = {Bartel, Lena and Ochs, Michaela and Hirmer, Tobias and Henrich, Andreas},
  year = {2024},
  pages = {1-18},
  publisher = {ACM},
  address = {New York},
  urn = {urn:nbn:de:bvb:473-irb-961666},
  url = {https://fis.uni-bamberg.de/handle/uniba/96166},
  language = {eng},
  abstract = {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.},
  keywords = {study planning assistant, information-intensive decision tasks, usability study, design principles}
}

@inproceedings{bartel2024_96437,
  title = {Design Principles for a Study Planning Assistant in Higher Education},
  author = {Bartel, Lena and Ochs, Michaela and Hirmer, Tobias and Henrich, Andreas},
  year = {2024},
  booktitle = {CHIIR '24: Proceedings of the 2024 Conference on Human Information Interaction and Retrieval},
  pages = {243–253},
  publisher = {ACM},
  address = {New York},
  isbn = {979-8-4007-0434-5},
  doi = {10.1145/3627508.3638327},
  url = {https://fis.uni-bamberg.de/handle/uniba/96437},
  language = {eng},
  abstract = {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.},
  keywords = {study planning assistant, information-intensive decision tasks, usability study, design principles}
}

@article{henrich2024_96235,
  title = {Editorial},
  author = {Henrich, Andreas and Müller, Wolfgang and Seeger, Bernhard and Störl, Uta},
  year = {2024},
  journal = {Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie},
  volume = {24},
  number = {2, Data Management for Research Data Infrastructures},
  pages = {Online First},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {1610-1995},
  doi = {10.1007/s13222-024-00482-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/96235},
  language = {deu}
}

@inproceedings{martin2024_95615,
  title = {A Testbed for Dual-Entity Knowledge Panels},
  author = {Martin, Leon and Henrich, Andreas},
  year = {2024},
  pages = {231-238},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-956154},
  url = {https://fis.uni-bamberg.de/handle/uniba/95615},
  language = {eng},
  abstract = {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},
  keywords = {Web Search Engines, Knowledge Panels, Entity Relationship Explanation, Wikidata}
}

@inproceedings{bullin2024_95619,
  title = {Applied Face Recognition in the Humanities},
  author = {Bullin, Martin and Henrich, Andreas},
  year = {2024},
  pages = {179-191},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-956198},
  url = {https://fis.uni-bamberg.de/handle/uniba/95619},
  language = {eng},
  abstract = {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.},
  keywords = {Face Recognition, Face Detection, Scene Classification, Personality Mapping, Personality Recognition}
}

@inproceedings{hirmer2024_94632,
  title = {Baula – die Studienplanungsassistentin},
  author = {Hirmer, Tobias and Stöckl, Andreas and Struck, Olaf and Henrich, Andreas},
  year = {2024},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-94632},
  urn = {urn:nbn:de:bvb:473-irb-946326},
  url = {https://fis.uni-bamberg.de/handle/uniba/94632},
  language = {deu},
  abstract = {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.},
  keywords = {Digitaler Studienassistent, Studienplanung, Modulempfehlung, Nutzerstudie, Unterstützungssystem}
}

@incollection{henrich2024_95306,
  title = {Suchwerkzeuge für Sammlungen : Herausforderungen, Trends und Strategien},
  author = {Henrich, Andreas and Gradl, Tobias and Jegan, Robin},
  year = {2024},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-953062},
  url = {https://fis.uni-bamberg.de/handle/uniba/95306},
  language = {deu},
  abstract = {-},
  keywords = {Suchwerkzeuge}
}

@inproceedings{hirmer2024_93407,
  title = {Vertical Search Scenarios within a Digital Study Planning Assistant},
  author = {Hirmer, Tobias and Ochs, Michaela and Henrich, Andreas},
  year = {2024},
  pages = {239-246},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-934071},
  url = {https://fis.uni-bamberg.de/handle/uniba/93407},
  language = {eng},
  abstract = {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.},
  keywords = {Digital Study Planning Assistant, Vertical Search, Search Scenarios, Recommendation Systems}
}

@inproceedings{ochs2024_92934,
  title = {Concept and Possible Impacts of a Study Planning Assistant in Higher Education},
  author = {Ochs, Michaela and Hirmer, Tobias and Henrich, Andreas},
  year = {2024},
  pages = {161-165},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-929346},
  url = {https://fis.uni-bamberg.de/handle/uniba/92934},
  language = {eng},
  abstract = {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.},
  keywords = {study planning, higher education, digital study planning assistant}
}

@incollection{henrich2024_93235,
  title = {Suchwerkzeuge für Sammlungen : Herausforderungen, Trends und Strategien},
  author = {Henrich, Andreas and Gradl, Tobias and Jegan, Robin},
  year = {2024},
  booktitle = {Forschen in Sammlungen : Dynamiken, Transformationen, Perspektiven},
  pages = {57-77},
  publisher = {Wallstein},
  address = {Göttingen},
  isbn = {978-3-8353-3573-8},
  doi = {10.15499/kds-003-004},
  url = {https://fis.uni-bamberg.de/handle/uniba/93235},
  language = {deu},
  abstract = {-},
  keywords = {Suchwerkzeuge}
}

@inproceedings{jegan2024_93093,
  title = {Anforderungen an das Forschungsdatenmanagement an einer mittelgroßen Universität und Konzeption einer prototypischen Lösung},
  author = {Jegan, Robin and Gradl, Tobias and Henrich, Andreas},
  year = {2024},
  pages = {274-275},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-930935},
  url = {https://fis.uni-bamberg.de/handle/uniba/93093},
  language = {deu},
  abstract = {-},
  keywords = {Forschungsdatenmanagement}
}

@inproceedings{gradl2024_93096,
  title = {Die DARIAH-DE Architektur zur forschungsorientierten Föderation von Kollektionen in den Digital Humanities},
  author = {Gradl, Tobias and Plutte, Christoph and Henrich, Andreas},
  year = {2024},
  pages = {1-8},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-930967},
  url = {https://fis.uni-bamberg.de/handle/uniba/93096},
  language = {deu},
  abstract = {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},
  keywords = {DARIAH-DE Architektur, Digital Humanities}
}

@misc{albrecht2023_96243,
  title = {uni.vers Forschung : das Magazin der Otto-Friedrich-Universität Bamberg},
  author = {Albrecht, Stephan and Holl, Kristina and Bellendorf, Paul and Diederich, Viviane and Schreg, Rainer and Wittmann, Barbara and Redepenning, Marc and Scheunpflug, Annette and Franz, Julia and Kühn, Claudia and Keldenich, Georg-Vincent and Alzheimer, Heidrun and Vinken, Gerhard and Brassat, Wolfgang and Wagner, Bettina and Henrich, Andreas and Gradl, Tobias and Wings, Oliver},
  editor = {Fischbach, Kai},
  year = {2023},
  number = {Mai 23, Historisches und kulturelles Erbe – zwischen Bedrohung und Chance = Historical and Cultural Heritage - Between threat and opportunity},
  pages = {1-48},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {uni.vers Forschung : das Magazin der Otto-Friedrich-Universität Bamberg},
  issn = {1618-9019},
  urn = {urn:nbn:de:bvb:473-irb-962432},
  url = {https://fis.uni-bamberg.de/handle/uniba/96243},
  language = {deu},
  abstract = {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.},
  keywords = {Kulturerbe, Kulturgutsicherung, Kulturguterhaltung, Kunstgeschichte, Archäologie, Denkmalpflege}
}

@inproceedings{lederer2023_94805,
  title = {Exploiting Exif Data to Improve Image Classification Using Convolutional Neural Networks},
  author = {Lederer, Ralf and Bullin, Martin Heinrich and Henrich, Andreas},
  year = {2023},
  booktitle = {Image Analysis and Processing – ICIAP 2023  22nd International Conference, ICIAP 2023, Udine, Italy, September 11–15, 2023, Proceedings, Part I},
  pages = {475-486},
  publisher = {Springer Nature},
  address = {Cham},
  series = {LNCS},
  isbn = {9783031431470},
  doi = {10.1007/978-3-031-43148-7\_40},
  url = {https://fis.uni-bamberg.de/handle/uniba/94805},
  language = {eng}
}

@incollection{henrich2023_91864,
  title = {Integration von Forschungsdaten : Wie können Forschungsinfrastrukturen helfen?},
  author = {Henrich, Andreas and Gradl, Tobias},
  year = {2023},
  pages = {749-762},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-918641},
  url = {https://fis.uni-bamberg.de/handle/uniba/91864},
  language = {deu},
  abstract = {-},
  keywords = {Forschungsdaten}
}

@article{henrich2023_91871,
  title = {Multimedia Information Retrieval},
  author = {Henrich, Andreas},
  year = {2023},
  pages = {336-342},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-918714},
  url = {https://fis.uni-bamberg.de/handle/uniba/91871},
  language = {deu},
  abstract = {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.},
  keywords = {Suche, Multimedia, Suchmaschine, Bildsuche, search, multimedia, search engine, image retrieval}
}

@article{gradl2023_91872,
  title = {Die DARIAH-DE-Föderationsarchitektur : Datenintegration im Spannungsfeld forschungsspezifischer und domänenübergreifender Anforderungen},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2023},
  pages = {222-228},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-918725},
  url = {https://fis.uni-bamberg.de/handle/uniba/91872},
  language = {deu},
  abstract = {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.},
  keywords = {Forschungsdaten, Integration, Föderation, generische Suche, DARIAH-DE, research data, integration, federation, generic search, DARIAH-DE}
}

@inproceedings{blank2023_91874,
  title = {Resource Description and Selection for Range Query Processing in General Metric Spaces},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2023},
  pages = {93-112},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {GI-Edition : Proceedings},
  urn = {urn:nbn:de:bvb:473-irb-918741},
  url = {https://fis.uni-bamberg.de/handle/uniba/91874},
  language = {eng},
  abstract = {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.},
  keywords = {Range Query Processing}
}

@inproceedings{stadelmann2023_91879,
  title = {Implementierung von IR-Modellen auf Basis spaltenorientierter Datenbanken oder invertierter Listen},
  author = {Stadelmann, Thomas and Blank, Daniel and Henrich, Andreas},
  year = {2023},
  pages = {299-308},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {GI-Edition / Proceedings},
  urn = {urn:nbn:de:bvb:473-irb-918796},
  url = {https://fis.uni-bamberg.de/handle/uniba/91879},
  language = {deu},
  abstract = {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.},
  keywords = {IR-Modelle}
}

@inproceedings{henrich2023_91898,
  title = {Ein Ansatz zur Übertragung von Rangordnungen bei der Suche auf strukturierten Daten},
  author = {Henrich, Andreas and Robbert, Günter},
  year = {2023},
  pages = {167-186},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-918986},
  url = {https://fis.uni-bamberg.de/handle/uniba/91898},
  language = {deu},
  abstract = {Ä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.},
  keywords = {strukturierte Daten}
}

@inproceedings{daubner2023_91904,
  title = {Ein Plädoyer für Datenflussdiagramme aus der Sicht der Aufwandsschätzung und der agilen Softwareentwicklung},
  author = {Daubner, Bernhard and Henrich, Andreas},
  year = {2023},
  pages = {191-195},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-919047},
  url = {https://fis.uni-bamberg.de/handle/uniba/91904},
  language = {deu},
  abstract = {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.},
  keywords = {Datenflussdiagramm}
}

@inproceedings{daubner2023_91912,
  title = {Integrierte Softwaremessung durch Verankerung der Softwaremaße an Elementen des Vorgehensmodells},
  author = {Daubner, Bernhard and Henrich, Andreas and Westfechtel, Bernhard},
  year = {2023},
  pages = {157-162},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-919129},
  url = {https://fis.uni-bamberg.de/handle/uniba/91912},
  language = {deu},
  abstract = {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.},
  keywords = {Integrierte Softwaremessung}
}

@inproceedings{bullin2023_93457,
  title = {Applied Face Recognition in the Humanities},
  author = {Bullin, Martin and Henrich, Andreas},
  year = {2023},
  volume = {3630},
  pages = {179-191},
  address = {Aachen, Germany},
  issn = {1613-0073},
  url = {https://fis.uni-bamberg.de/handle/uniba/93457},
  language = {eng},
  abstract = {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.},
  keywords = {Face Recognition, Face Detection, Scene Classification, Personality Mapping, Personality Recognition}
}

@inproceedings{martin2023_93459,
  title = {A Testbed for Dual-Entity Knowledge Panels},
  author = {Martin, Leon and Henrich, Andreas},
  year = {2023},
  volume = {3630},
  pages = {231-238},
  address = {Aachen, Germany},
  issn = {1613-0073},
  url = {https://fis.uni-bamberg.de/handle/uniba/93459},
  language = {eng},
  abstract = {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},
  keywords = {Web Search Engines, Knowledge Panels, Entity Relationship Explanation, Wikidata}
}

@inproceedings{hirmer2023_93461,
  title = {Vertical Search Scenarios within a Digital Study Planning Assistant},
  author = {Hirmer, Tobias and Ochs, Michaela and Henrich, Andreas},
  year = {2023},
  volume = {3630},
  pages = {239-246},
  address = {Aachen, Germany},
  issn = {1613-0073},
  url = {https://fis.uni-bamberg.de/handle/uniba/93461},
  language = {eng},
  abstract = {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.},
  keywords = {Digital Study Planning Assistant, Vertical Search, Search Scenarios, Recommendation Systems}
}

@inproceedings{muller2023_92263,
  title = {Parameters in P2P-IR},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2023},
  pages = {4-11},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {GI-Edition : Proceedings},
  urn = {urn:nbn:de:bvb:473-irb-922630},
  url = {https://fis.uni-bamberg.de/handle/uniba/92263},
  language = {eng},
  abstract = {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.},
  keywords = {Parameter}
}

@inproceedings{eisenhardt2023_92267,
  title = {Probleme und Lösungsansätze für P2P-IR-Systeme},
  author = {Eisenhardt, Martin and Henrich, Andreas},
  year = {2023},
  pages = {171-175},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {GI- Edition : Proceedings},
  isbn = {3885793482},
  urn = {urn:nbn:de:bvb:473-irb-922679},
  url = {https://fis.uni-bamberg.de/handle/uniba/92267},
  language = {deu},
  abstract = {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.},
  keywords = {P2P-IR-Systeme}
}

@inproceedings{eisenhardt2023_92268,
  title = {Spektrale Bloom-Filter für Peer-to-Peer Information Retrieval},
  author = {Eisenhardt, Martin and Müller, Wolfgang and Henrich, Andreas},
  year = {2023},
  pages = {44-48},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-922689},
  url = {https://fis.uni-bamberg.de/handle/uniba/92268},
  language = {deu},
  abstract = {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.},
  keywords = {Spektrale Bloom-Filter}
}

@inproceedings{elallali2023_92293,
  title = {Untersuchung des Einflusses verschiedener Bild- Features und Distanzmaße im inhaltsbasierten P2P Information Retrieval},
  author = {El Allali, Soufyane and Blank, Daniel and Eisenhardt, Martin and Henrich, Andreas and Müller, Wolfgang},
  year = {2023},
  pages = {382-396},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-922937},
  url = {https://fis.uni-bamberg.de/handle/uniba/92293},
  language = {deu},
  abstract = {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.},
  keywords = {Information Retrieval}
}

@inproceedings{kufer2023_92295,
  title = {Quadtree-based Resource Description Techniques for Spatial Data in Distributed Databases},
  author = {Kufer, Stefan and Henrich, Andreas},
  year = {2023},
  pages = {445-464},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture notes in informatics},
  urn = {urn:nbn:de:bvb:473-irb-922955},
  url = {https://fis.uni-bamberg.de/handle/uniba/92295},
  language = {eng},
  abstract = {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.},
  keywords = {Spatial Data}
}

@inproceedings{henrich2023_92365,
  title = {A Study on the Use of Lecture Recordings in Different Mobile Learning Settings},
  author = {Henrich, Andreas and Hub, Adrian and Sieber, Stefanie},
  year = {2023},
  pages = {159-166},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-923657},
  url = {https://fis.uni-bamberg.de/handle/uniba/92365},
  language = {eng},
  abstract = {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.},
  keywords = {Lecture Recordings, Mobile Learning, User Study, MPEG-4, Ubiquitous Learning}
}

@inproceedings{sieber2023_92366,
  title = {Metadata for Learning Objects : A Cure for Information Overflow?},
  author = {Sieber, Stefanie and Henrich, Andreas},
  year = {2023},
  pages = {251-255},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-923663},
  url = {https://fis.uni-bamberg.de/handle/uniba/92366},
  language = {eng},
  abstract = {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.},
  keywords = {Learning Objects, Learning Context, Learning Reference, Metadata Standards, Dublin Core, Learning Object Metadata}
}

@inproceedings{fries2023_92367,
  title = {Integrating Industrial Partners into e-Teaching Efforts : a Portal to Support the Initiation of Co-operations},
  author = {Fries, Tobias and Henrich, Andreas},
  year = {2023},
  pages = {89-96},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-923675},
  url = {https://fis.uni-bamberg.de/handle/uniba/92367},
  language = {eng},
  abstract = {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.},
  keywords = {Learning management systems, IT infrastructure, integration of practitioners, practical projects}
}

@inproceedings{eckstein2023_92386,
  title = {Ansätze zur Bestimmung von Locality für deutsche Webseiten},
  author = {Eckstein, Raiko and Henrich, Andreas and Lüdecke, Volker},
  year = {2023},
  pages = {69-76},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-923867},
  url = {https://fis.uni-bamberg.de/handle/uniba/92386},
  language = {deu},
  abstract = {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.},
  keywords = {Webseiten}
}

@article{henrich2023_92392,
  title = {Digital Humanities studieren : vielfältige Möglichkeiten vom einzelnen Modul bis zum speziellen Studiengang},
  author = {Henrich, Andreas},
  year = {2023},
  pages = {56-59},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-923926},
  url = {https://fis.uni-bamberg.de/handle/uniba/92392},
  language = {deu},
  abstract = {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.},
  keywords = {Digital Humanities}
}

@article{henrich2023_92393,
  title = {Erforschung der Weltenwanderer : Über die Nutzung der Wikipedia zur Identifikation grenzüberschreitender Lebensläufe},
  author = {Henrich, Andreas and Gradl, Tobias},
  year = {2023},
  pages = {46-49},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-923939},
  url = {https://fis.uni-bamberg.de/handle/uniba/92393},
  language = {deu},
  abstract = {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.},
  keywords = {Wikipedia}
}

@article{henrich2023_92394,
  title = {Forschungsinfrastruktur : Auf dem (langen) Weg zu den e-Humanities},
  author = {Henrich, Andreas},
  year = {2023},
  pages = {11-15},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-923945},
  url = {https://fis.uni-bamberg.de/handle/uniba/92394},
  language = {deu},
  abstract = {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.},
  keywords = {Forschungsinfrastruktur}
}

@inproceedings{hub2023_92419,
  title = {Image Retrieval on Mobile Devices},
  author = {Hub, Adrian and Henrich, Andreas},
  year = {2023},
  pages = {205-208},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Kasseler Informatikschriften},
  urn = {urn:nbn:de:bvb:473-irb-924196},
  url = {https://fis.uni-bamberg.de/handle/uniba/92419},
  language = {eng},
  abstract = {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.},
  keywords = {Image Retrieval}
}

@inproceedings{blank2023_92422,
  title = {Binary Histograms for Resource Selection in Peer-to-Peer Media Retrieval},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2023},
  pages = {183-190},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Kasseler Informatikschriften},
  urn = {urn:nbn:de:bvb:473-irb-924228},
  url = {https://fis.uni-bamberg.de/handle/uniba/92422},
  language = {eng},
  abstract = {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.},
  keywords = {Binary Histograms}
}

@inproceedings{ochs2023_93254,
  title = {Concept and Possible Impacts of a Study Planning Assistant in Higher Education},
  author = {Ochs, Michaela and Hirmer, Tobias and Henrich, Andreas},
  year = {2023},
  pages = {161-165},
  publisher = {IEEE},
  address = {New York},
  isbn = {979-8-3503-0491-6},
  issn = {2766-2144},
  doi = {10.1109/iset58841.2023.00039},
  url = {https://fis.uni-bamberg.de/handle/uniba/93254},
  language = {eng},
  abstract = {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.},
  keywords = {study planning, higher education, digital study planning assistant}
}

@inproceedings{hirmer2023_92224,
  title = {Course Selection Criteria and Digital Assistance in a Modularized World},
  author = {Hirmer, Tobias and Ochs, Michaela and Sebastian Rottmann and Katherina Past and Henrich, Andreas},
  year = {2023},
  pages = {4626-4631},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-922245},
  url = {https://fis.uni-bamberg.de/handle/uniba/92224},
  language = {eng},
  abstract = {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.},
  keywords = {digital study assistant, course selection, social influences, student support}
}

@inproceedings{henrich2023_92423,
  title = {POQLMM : A Query Language for Structured Multimedia Documents},
  author = {Henrich, Andreas and Robbert, Günter},
  year = {2023},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {CEUR workshop proceedings},
  urn = {urn:nbn:de:bvb:473-irb-924236},
  url = {https://fis.uni-bamberg.de/handle/uniba/92423},
  language = {eng},
  abstract = {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.},
  keywords = {structured multimedia documents, query language}
}

@inproceedings{ochs2023_92486,
  title = {Design-Focused Development of a Course Recommender System for Digital Study Planning},
  author = {Ochs, Michaela and Hirmer, Tobias and Past, Katherina and Henrich, Andreas},
  year = {2023},
  pages = {1-12},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-924864},
  url = {https://fis.uni-bamberg.de/handle/uniba/92486},
  language = {eng},
  abstract = {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.},
  keywords = {Study Planning, Course Recommendation, Decision Support, Design-Focused}
}

@inproceedings{ochs2023_92539,
  title = {Design-Focused Development of a Course Recommender System for Digital Study Planning},
  author = {Ochs, Michaela and Hirmer, Tobias and Past, Katherina and Henrich, Andreas},
  year = {2023},
  booktitle = {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},
  pages = {575-582},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  isbn = {978-3-031-42941-5},
  doi = {10.1007/978-3-031-42941-5\_50},
  url = {https://fis.uni-bamberg.de/handle/uniba/92539},
  language = {eng},
  abstract = {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.},
  keywords = {Study Planning, Course Recommendation, Decision Support, Design-Focused}
}

@inproceedings{hirmer2023_92346,
  title = {Course Selection Criteria and Digital Assistance in a Modularized World},
  author = {Hirmer, Tobias and Ochs, Michaela and Rottmann, Sebastian and Past, Katherina and Henrich, Andreas},
  year = {2023},
  booktitle = {ICERI2023 Proceedings},
  pages = {4626-4631},
  publisher = {IATED},
  address = {Valencia},
  isbn = {978-84-09-55942-8},
  issn = {2340-1095},
  doi = {10.21125/iceri.2023.1150},
  url = {https://fis.uni-bamberg.de/handle/uniba/92346},
  language = {eng},
  abstract = {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.},
  keywords = {digital study assistant, course selection, social influences, student support}
}

@inproceedings{hirmer2023_91100,
  title = {Studierende und die Studienplanung : Untersuchung von Herausforderungen und Entwicklungsperspektiven eines digitalen Studienplanungsassistenten : Poster},
  author = {Hirmer, Tobias and Ochs, Michaela and Henrich, Andreas},
  year = {2023},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-91100},
  urn = {urn:nbn:de:bvb:473-irb-911004},
  url = {https://fis.uni-bamberg.de/handle/uniba/91100},
  language = {deu},
  abstract = {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.},
  keywords = {Studienplanung, Digitaler Studienassisstent}
}

@article{gradl2023_90215,
  title = {Heterogene Daten in den Digital Humanities : Eine Architektur zur forschungsorientierten Föderation von Kollektionen},
  author = {Gradl, Tobias and Henrich, Andreas and Plutte, Christoph},
  year = {2023},
  pages = {1-10},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-902154},
  url = {https://fis.uni-bamberg.de/handle/uniba/90215},
  language = {deu},
  abstract = {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.},
  keywords = {Datenintegration, Digital Humanities, Softwaresystem}
}

@incollection{bullin2023_90120,
  title = {Die inhaltsbasierte Bildsuche und Bilderschließung : Ansätze und Problemfelder},
  author = {Bullin, Martin Heinrich and Henrich, Andreas},
  year = {2023},
  pages = {11-34},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-901204},
  url = {https://fis.uni-bamberg.de/handle/uniba/90120},
  language = {deu},
  abstract = {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.},
  keywords = {Bilder, Suche, Erschließung}
}

@inproceedings{hirmer2023_91023,
  title = {Studierende und die Studienplanung : Untersuchung von Herausforderungen und Entwicklungsperspektiven eines digitalen Studienplanungsassistenten : Abstract},
  author = {Hirmer, Tobias and Ochs, Michaela and Henrich, Andreas},
  year = {2023},
  pages = {1-2},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-910237},
  url = {https://fis.uni-bamberg.de/handle/uniba/91023},
  language = {deu},
  abstract = {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.},
  keywords = {Digitaler Studienassistent, Studienplanung}
}

@inproceedings{hirmer2023_91099,
  title = {Studierende und die Studienplanung : Untersuchung von Herausforderungen und Entwicklungsperspektiven eines digitalen Studienplanungsassistenten : Abstract},
  author = {Hirmer, Tobias and Ochs, Michaela and Henrich, Andreas},
  year = {2023},
  booktitle = {GI Edition Proceedings : 21. Fachtagung Bildungstechnologien (DELFI)},
  pages = {291-292},
  publisher = {Köllen},
  address = {Bonn},
  isbn = {978-3-88579-732-6},
  doi = {10.18420/delfi2023-60},
  url = {https://fis.uni-bamberg.de/handle/uniba/91099},
  language = {deu},
  abstract = {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.},
  keywords = {Digitaler Studienassistent, Studienplanung}
}

@inproceedings{martin2023_90477,
  title = {Specification and Validation of Quality Criteria for Git Repositories using RDF and SHACL},
  author = {Martin, Leon and Henrich, Andreas},
  year = {2023},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {CEUR workshop proceedings},
  urn = {urn:nbn:de:bvb:473-irb-904776},
  url = {https://fis.uni-bamberg.de/handle/uniba/90477},
  language = {eng},
  abstract = {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.},
  keywords = {Applications of knowledge management, Representation of Git repositories, Git repository quality}
}

@inproceedings{martin2023_90478,
  title = {First Thoughts on a Data Lake Architecture for an Open Search Infrastructure},
  author = {Martin, Leon and Henrich, Andreas},
  year = {2023},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-904785},
  url = {https://fis.uni-bamberg.de/handle/uniba/90478},
  language = {eng},
  abstract = {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.},
  keywords = {Data Lake Architecture}
}

@inproceedings{gradl2023_90490,
  title = {A novel approach for a reusable federation of research data within the arts and humanities},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2023},
  pages = {1-6},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-904903},
  url = {https://fis.uni-bamberg.de/handle/uniba/90490},
  language = {eng},
  abstract = {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.},
  keywords = {data integration, data federation, digital humanities, research data, DARIAH-DE}
}

@inproceedings{henrich2023_90494,
  title = {Description and Selection of Media Archives for Geographic Nearest Neighbor Queries in P2P Networks},
  author = {Henrich, Andreas and Blank, Daniel},
  year = {2023},
  pages = {22-29},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-904946},
  url = {https://fis.uni-bamberg.de/handle/uniba/90494},
  language = {eng},
  abstract = {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.},
  keywords = {Resource Selection, Peer-to-Peer IR, Multimedia IR, Summarization}
}

@inproceedings{gradl2023_90497,
  title = {Explicating knowledge on data models through domain specific languages},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2023},
  pages = {1125-1136},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Gesellschaft für Informatik: GI-Edition / Proceedings},
  urn = {urn:nbn:de:bvb:473-irb-904979},
  url = {https://fis.uni-bamberg.de/handle/uniba/90497},
  language = {eng},
  abstract = {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.},
  keywords = {digital humanities, descriptive data modeling, language applications, DARIAH}
}

@inproceedings{blank2023_90499,
  title = {Georeferencing Old Large-Scale Maps from a Research on Historical Routes Perspective},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2023},
  pages = {9-11},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-904994},
  url = {https://fis.uni-bamberg.de/handle/uniba/90499},
  language = {eng},
  abstract = {-},
  keywords = {Map}
}

@incollection{henrich2023_90099,
  title = {Data Retrieval},
  author = {Henrich, Andreas and Jegan, Robin and Gradl, Tobias},
  year = {2023},
  pages = {427-450},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-900996},
  url = {https://fis.uni-bamberg.de/handle/uniba/90099},
  language = {deu},
  abstract = {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.},
  keywords = {Data Retrieval}
}

@inproceedings{hirmer2023_59866,
  title = {Die kompetenzorientierte Studienplanung : Entwicklung eines Tools zur Unterstützung von (Lehramts-)Studierenden},
  author = {Hirmer, Tobias and Heyne, Nora and Henrich, Andreas},
  year = {2023},
  pages = {121-126},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-598666},
  url = {https://fis.uni-bamberg.de/handle/uniba/59866},
  language = {deu},
  abstract = {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.},
  keywords = {Lehrerbildung, Kompetenzen, Standards, Kompetenzorientierte Studienplanung}
}

@inproceedings{jegan2023_59341,
  title = {Integrating Access to Authority Data for Improved Interoperability of Research Data in the Digital Humanities},
  author = {Jegan, Robin and Fruth, Leon and Gradl, Tobias and Henrich, Andreas},
  year = {2023},
  pages = {829-836},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-593413},
  url = {https://fis.uni-bamberg.de/handle/uniba/59341},
  language = {eng},
  abstract = {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.},
  keywords = {authority file, geographic data, bases data integration}
}

@inproceedings{henrich2023_58916,
  title = {The LSD tree : spatial access to multidimensional point and non-point objects},
  author = {Henrich, Andreas and Six, Hans-Werner and Widmayer, Peter},
  year = {2023},
  pages = {45-53},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-58916},
  urn = {urn:nbn:de:bvb:473-irb-589169},
  url = {https://fis.uni-bamberg.de/handle/uniba/58916},
  language = {eng},
  abstract = {-},
  keywords = {Entscheidungsbaum}
}

@inproceedings{henrich2023_58919,
  title = {Paging binary trees with external balancing},
  author = {Henrich, Andreas and Six, Hans-Werner and Widmayer, Peter},
  year = {2023},
  pages = {260-276},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-58919},
  urn = {urn:nbn:de:bvb:473-irb-589192},
  url = {https://fis.uni-bamberg.de/handle/uniba/58919},
  language = {eng},
  abstract = {-},
  keywords = {Gewichteter Binärbaum}
}

@inproceedings{jegan2023_59235,
  title = {Integrating Access to Authority Data for Improved Interoperability of Research Data in the Digital Humanities},
  author = {Jegan, Robin and Fruth, Leon and Gradl, Tobias and Henrich, Andreas},
  year = {2023},
  booktitle = {Datenbanksysteme für Business, Technologie und Web (BTW 2023) : 06.-10. März 2023 in Dresden, Deutschland},
  pages = {829-836},
  publisher = {Gesellschaft für Informatik e.V.},
  isbn = {978-3-88579-725-8},
  doi = {10.18420/BTW2023-54},
  url = {https://fis.uni-bamberg.de/handle/uniba/59235},
  language = {eng},
  abstract = {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.},
  keywords = {authority file, geographic data, bases data integration}
}

@inproceedings{arbinger2022_112620,
  title = {Exploiting Geodata to Improve Image Recognition with Deep Learning},
  author = {Arbinger, Christian and Bullin, Martin and Henrich, Andreas},
  year = {2022},
  booktitle = {WWW '22 Companion : Companion Proceedings of the Web Conference 2022},
  pages = {648-655},
  publisher = {Association for Computing Machinery},
  address = {New York, NY},
  doi = {10.1145/3487553.3524645},
  url = {https://fis.uni-bamberg.de/handle/uniba/112620},
  language = {eng}
}

@inproceedings{martin2022_89863,
  title = {Specification and Validation of Quality Criteria for Git Repositories using RDF and SHACL},
  author = {Martin, Leon and Henrich, Andreas},
  year = {2022},
  booktitle = {LWDA 2022 Lernen, Wissen, Daten, Analysen 2022 : Proceedings of the LWDA 2022 Workshops: FGWM, FGKD, and FGDB},
  pages = {124-135},
  publisher = {RWTH Aachen},
  address = {Aachen, Germany},
  series = {CEUR workshop proceedings},
  url = {https://fis.uni-bamberg.de/handle/uniba/89863},
  language = {eng},
  abstract = {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.},
  keywords = {Applications of knowledge management, Representation of Git repositories, Git repository quality}
}

@inproceedings{martin2022_56997,
  title = {RDFtex : Knowledge Exchange Between LaTeX-Based Research Publications and Scientific Knowledge Graphs},
  author = {Martin, Leon and Henrich, Andreas},
  year = {2022},
  booktitle = {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},
  pages = {26-38},
  publisher = {Springer},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-031-16801-7},
  doi = {10.1007/978-3-031-16802-4\_3},
  url = {https://fis.uni-bamberg.de/handle/uniba/56997},
  language = {deu},
  abstract = {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.},
  keywords = {Research data management, Data and research infrastructure, Latex research publications}
}

@inproceedings{eisenmann2022_56143,
  title = {Studentische E-Portfolio-Nutzung : Begleitung der Entwicklung und Einführung von Mahara an der Universität Bamberg},
  author = {Eisenmann, Rahel and Sticht, Martin and Hirmer, Tobias and Henrich, Andreas and Scheunpflug, Annette},
  year = {2022},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-56143},
  urn = {urn:nbn:de:bvb:473-irb-561437},
  url = {https://fis.uni-bamberg.de/handle/uniba/56143},
  language = {deu},
  abstract = {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.},
  keywords = {E-Portfolio, Mahara, Erfahrungsbericht}
}

@inproceedings{hirmer2022_55522,
  title = {Requirements and Prototypical Implementation of a Study Planning Assistant in CS Programs},
  author = {Hirmer, Tobias and Etschmann, Jana and Henrich, Andreas},
  year = {2022},
  pages = {281-285},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-555228},
  url = {https://fis.uni-bamberg.de/handle/uniba/55522},
  language = {eng},
  abstract = {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.},
  keywords = {study planning, requirements, web application, higher education, computer science programs}
}

@inproceedings{hirmer2022_55550,
  title = {Requirements and Prototypical Implementation of a Study Planning Assistant in CS Programs},
  author = {Hirmer, Tobias and Etschmann, Jana and Henrich, Andreas},
  year = {2022},
  pages = {281-285},
  publisher = {IEEE},
  address = {New York},
  isbn = {978-1-6654-8467-1},
  issn = {2766-2144},
  doi = {10.1109/ISET55194.2022.00066},
  url = {https://fis.uni-bamberg.de/handle/uniba/55550},
  language = {eng},
  abstract = {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.},
  keywords = {study planning, requirements, web application, higher education, computer science programs}
}

@inproceedings{henrich2021_111297,
  title = {Search and evaluation methods for class level information retrieval : extended use and evaluation of methods applied in expertise retrieval},
  author = {Henrich, Andreas and Wegmann, Markus},
  year = {2021},
  booktitle = {SAC '21 : Proceedings of the 36th Annual ACM Symposium on Applied Computing},
  pages = {681-684},
  publisher = {ACM},
  isbn = {978-1-4503-8104-8},
  doi = {10.1145/3412841.3442092},
  url = {https://fis.uni-bamberg.de/handle/uniba/111297},
  language = {eng}
}

@inproceedings{martin2021_89861,
  title = {Requirements for an Open Search Infrastructure from the Perspective of a Vertical Provider},
  author = {Martin, Leon and Engl, Felix and Henrich, Andreas},
  year = {2021},
  publisher = {Zenodo},
  doi = {10.5281/ZENODO.6139647},
  url = {https://fis.uni-bamberg.de/handle/uniba/89861},
  language = {eng}
}

@inproceedings{aubele2021_89862,
  title = {An Architecture for the Automated Assessment of Web Programming Tasks},
  author = {Aubele, Lara and Martin, Leon and Hirmer, Tobias and Henrich, Andreas},
  year = {2021},
  booktitle = {Proceedings of the Fifth Workshop "Automatische Bewertung von Programmieraufgaben" (ABP 2021),virtual event, October 28-29, 2021},
  pages = {11-18},
  doi = {10.18420/ABP2021-2},
  url = {https://fis.uni-bamberg.de/handle/uniba/89862},
  language = {eng}
}

@inproceedings{hirmer2021_51667,
  title = {Die kompetenzorientierte Studienplanung : Entwicklung eines Tools zur Unterstützung von (Lehramts-)Studierenden},
  author = {Hirmer, Tobias and Heyne, Nora and Henrich, Andreas},
  year = {2021},
  booktitle = {DELFI 2021. Die 19. Fachtagung Bildungstechnologien der Gesellschaft für Informatik e.V.},
  pages = {121-126},
  publisher = {Köllen},
  address = {Bonn},
  isbn = {978-3-88579-710-4},
  issn = {1617-5468},
  url = {https://fis.uni-bamberg.de/handle/uniba/51667},
  language = {deu},
  abstract = {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.},
  keywords = {Lehrerbildung, Kompetenzen, Standards, Kompetenzorientierte Studienplanung}
}

@incollection{henrich2021_51560,
  title = {Integration von Forschungsdaten : Wie können Forschungsinfrastrukturen helfen?},
  author = {Henrich, Andreas and Gradl, Tobias},
  year = {2021},
  booktitle = {Innovation in der Bauwirtschaft},
  pages = {749-762},
  publisher = {De Gruyter},
  address = {Berlin, Boston},
  isbn = {978-3-11-053891-5},
  doi = {10.1515/9783110538915-039},
  url = {https://fis.uni-bamberg.de/handle/uniba/51560},
  language = {deu},
  abstract = {-},
  keywords = {Forschungsdaten}
}

@incollection{henrich2021_49405,
  title = {Data Retrieval},
  author = {Henrich, Andreas and Jegan, Robin and Gradl, Tobias},
  year = {2021},
  booktitle = {Praxishandbuch Forschungsdatenmanagement},
  pages = {427-450},
  publisher = {De Gruyter Saur},
  address = {Berlin},
  isbn = {978-3-11-065365-6},
  doi = {10.1515/9783110657807-024},
  url = {https://fis.uni-bamberg.de/handle/uniba/49405},
  language = {deu},
  abstract = {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.},
  keywords = {Data Retrieval}
}

@inproceedings{martin2020_49716,
  title = {First Thoughts on a Data Lake Architecture for an Open Search Infrastructure},
  author = {Martin, Leon and Henrich, Andreas},
  year = {2020},
  publisher = {Zenodo},
  doi = {10.5281/ZENODO.4593427},
  url = {https://fis.uni-bamberg.de/handle/uniba/49716},
  language = {eng},
  abstract = {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.},
  keywords = {Data Lake Architecture}
}

@incollection{bullin2020_49234,
  title = {Die inhaltsbasierte Bildsuche und Bilderschließung : Ansätze und Problemfelder},
  author = {Bullin, Martin Heinrich and Henrich, Andreas},
  year = {2020},
  booktitle = {Bilddaten in den Digitalen Geisteswissenschaften},
  pages = {11-34},
  publisher = {Harrassowitz Verlag},
  address = {Wiesbaden},
  series = {Episteme in Bewegung: Wissenstransfer von der Alten Welt  bis in die Frühe Neuzeit},
  isbn = {978-3-447-11460-8},
  doi = {10.13173/9783447114608.011},
  url = {https://fis.uni-bamberg.de/handle/uniba/49234},
  language = {deu},
  abstract = {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.},
  keywords = {Bilder, Suche, Erschließung}
}

@inproceedings{martin2020_49140,
  title = {Fast Pathfinding in Knowledge Graphs Using Word Embeddings},
  author = {Martin, Leon and Boockmann, Jan H. and Henrich, Andreas},
  year = {2020},
  booktitle = {KI 2020: Advances in Artificial Intelligence : 43rd German Conference on AI, Bamberg, Germany, September 21–25, 2020, Proceedings},
  pages = {305-312},
  publisher = {Springer},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-030-58284-5},
  issn = {0302-9743},
  doi = {10.1007/978-3-030-58285-2\_27},
  url = {https://fis.uni-bamberg.de/handle/uniba/49140},
  language = {eng},
  abstract = {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.},
  keywords = {Knowledge graphs, Word embeddings, Pathfinding}
}

@inproceedings{jegan2020_47806,
  title = {Anforderungen an das Forschungsdatenmanagement an einer mittelgroßen Universität und Konzeption einer prototypischen Lösung},
  author = {Jegan, Robin and Gradl, Tobias and Henrich, Andreas},
  year = {2020},
  booktitle = {DHd 2020 Spielräume : Digital Humanities zwischen Modellierung und Interpretation ; Konferenzabstracts},
  pages = {274-275},
  isbn = {978-3-945437-07-0},
  doi = {10.5281/zenodo.3666690},
  url = {https://fis.uni-bamberg.de/handle/uniba/47806},
  language = {deu},
  abstract = {-},
  keywords = {Forschungsdatenmanagement}
}

@inproceedings{hirmer2019_46828,
  title = {Lecture Recordings at the University : Analysis and Evaluation of Implementation Possibilities},
  author = {Hirmer, Tobias and Henrich, Andreas},
  year = {2019},
  booktitle = {Blended Learning: Educational Innovation for Personalized Learning : 12th International Conference, ICBL 2019, Hradec Kralove, Czech Republic, July 2–4, 2019, Proceedings},
  pages = {151-163},
  publisher = {Springer},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-030-21561-3},
  doi = {10.1007/978-3-030-21562-0\_13},
  url = {https://fis.uni-bamberg.de/handle/uniba/46828},
  language = {eng},
  abstract = {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.},
  keywords = {Blended learning, Lecture recordings, Requirements}
}

@incollection{hess2019_45697,
  title = {Digital Technologies in Heritage Conservation. Methods of Teaching and Learning This M.Sc. Degree, Unique in Germany},
  author = {Hess, Mona and Schlieder, Christoph and Troi, Alexandra and Huth, Olaf and Jagfeld, Matthias and Hindmarch, John and Henrich, Andreas},
  year = {2019},
  booktitle = {Proceedings of the 1st International and Interdisciplinary Conference on Digital Environments for Education, Arts and Heritage : EARTH 2018},
  pages = {53-63},
  publisher = {Springer},
  address = {Cham},
  series = {Advances in Intelligent Systems and Computing},
  isbn = {978-3-030-12240-9},
  doi = {10.1007/978-3-030-12240-9\_7},
  url = {https://fis.uni-bamberg.de/handle/uniba/45697},
  language = {eng},
  abstract = {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.}
}

@incollection{hess2019_45694,
  title = {Digital Technologies in Heritage Conservation : Methods of Teaching and Learning This M.Sc. Degree, Unique in Germany},
  author = {Hess, Mona and Schlieder, Christoph and Troi, Alexandra and Huth, Olaf and Jagfeld, Matthias and Hindmarch, John and Henrich, Andreas},
  year = {2019},
  publisher = {opus},
  address = {Bamberg},
  doi = {10.20378/irbo-54902},
  urn = {urn:nbn:de:bvb:473-opus4-549026},
  url = {https://fis.uni-bamberg.de/handle/uniba/45694},
  language = {eng},
  abstract = {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.}
}

@inproceedings{gradl2017_107007,
  title = {Nutzung und Kombination von Daten aus strukturierten und unstrukturierten Quellen zur Identifikation transnationaler Lebensläufe},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2017},
  booktitle = {DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016},
  pages = {261-265},
  publisher = {nisaba Verlag},
  address = {Duisburg},
  edition = {2. überarbeitete und erweiterte Ausgabe},
  isbn = {978-3-941379-06-0},
  doi = {10.5281/zenodo.3679331},
  url = {https://fis.uni-bamberg.de/handle/uniba/107007},
  language = {deu},
  abstract = {-},
  keywords = {transnationale Lebensläufe}
}

@inproceedings{gradl2017_107006,
  title = {Judaica recherchieren : Unterstützung bei der Realisierung forschungsspezifischer Suchlösungen durch die generische Suche von DARIAH-DE},
  author = {Gradl, Tobias and Lordick, Harald and Henrich, Andreas},
  year = {2017},
  booktitle = {DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016},
  pages = {230-235},
  publisher = {nisaba Verlag},
  address = {Duisburg},
  edition = {2. überarbeitete und erweiterte Ausgabe},
  isbn = {978-3-941379-06-0},
  doi = {10.5281/zenodo.3679331},
  url = {https://fis.uni-bamberg.de/handle/uniba/107006},
  language = {deu},
  abstract = {-},
  keywords = {Judaica}
}

@inproceedings{blank2017_107005,
  title = {Die computergestützte Erschließung und Visualisierung historischer Itinerare},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2017},
  booktitle = {DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016},
  pages = {367-371},
  publisher = {nisaba Verlag},
  address = {Duisburg},
  edition = {2. überarbeitete und erweiterte Ausgabe},
  isbn = {978-3-941379-06-0},
  doi = {10.5281/zenodo.3679331},
  url = {https://fis.uni-bamberg.de/handle/uniba/107005},
  language = {deu},
  abstract = {-},
  keywords = {Erschließung, historische Itinerare}
}

@inproceedings{gradl2017_43161,
  title = {Explicating knowledge on data models through domain specific languages},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2017},
  booktitle = {Informatik 2017 : 25.- 29. September 2017 Chemnitz, Deutschland, Proceedings},
  pages = {1125-1136},
  address = {Bonn},
  series = {Gesellschaft für Informatik: GI-Edition / Proceedings},
  isbn = {978-3-88579-669-5},
  doi = {10.18420/in2017\_114},
  url = {https://fis.uni-bamberg.de/handle/uniba/43161},
  language = {eng},
  abstract = {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.},
  keywords = {digital humanities, descriptive data modeling, language applications, DARIAH}
}

@inproceedings{blank2017_43012,
  title = {Georeferencing Old Large-Scale Maps from a Research on Historical Routes Perspective},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2017},
  booktitle = {Proceedings of the 2nd International Workshop on Exploring Old Maps},
  pages = {9-11},
  address = {Würzburg},
  url = {https://fis.uni-bamberg.de/handle/uniba/43012},
  language = {eng},
  abstract = {-},
  keywords = {Map}
}

@inproceedings{wolter2017_43007,
  title = {Georeferencing River Networks Using Spatial Reasoning},
  author = {Wolter, Diedrich and Blank, Daniel and Henrich, Andreas},
  year = {2017},
  booktitle = {GIR'17 : Proceedings of the 11th Workshop on Geographic Information Retrieval},
  publisher = {ACM},
  address = {New York, NY, USA},
  isbn = {978-1-4503-5338-0},
  doi = {10.1145/3155902.3155907},
  url = {https://fis.uni-bamberg.de/handle/uniba/43007},
  language = {eng},
  abstract = {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.},
  keywords = {georeferencing river networks, spatial reasoning, GIS}
}

@inproceedings{kufer2017_41922,
  title = {Quadtree-based Resource Description Techniques for Spatial Data in Distributed Databases},
  author = {Kufer, Stefan and Henrich, Andreas},
  year = {2017},
  booktitle = {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},
  pages = {445-464},
  publisher = {Gesellschaft für Informatik e.V.},
  address = {Bonn},
  series = {Lecture notes in informatics},
  isbn = {978-3-88579-659-6},
  url = {https://fis.uni-bamberg.de/handle/uniba/41922},
  language = {eng},
  abstract = {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.},
  keywords = {Spatial Data}
}

@inproceedings{blank2016_106443,
  title = {A depth-first branch-and-bound algorithm for geocoding historic itinerary tables},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2016},
  pages = {1-10},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1064434},
  url = {https://fis.uni-bamberg.de/handle/uniba/106443},
  language = {eng},
  abstract = {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.},
  keywords = {itinerary resolution, historic place name disambiguation, geocoding, depth-first branch-and-bound, gazetteer enrichment}
}

@inproceedings{blank2016_43050,
  title = {Assessing Interestingness and Importance of Information Retrieval Course Topics in a Course for Three Different Target Groups},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2016},
  booktitle = {CERI '16 : Proceedings of the 4th Spanish Conference on Information Retrieval},
  number = {20},
  pages = {1-8},
  publisher = {ACM},
  address = {New York, NY, USA},
  isbn = {978-1-4503-4141-7},
  doi = {10.1145/2934732.2934751},
  url = {https://fis.uni-bamberg.de/handle/uniba/43050},
  language = {eng},
  abstract = {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.},
  keywords = {Teaching Information Retrieval, Evaluation of Course Content, Distance Learning}
}

@inproceedings{blank2016_41653,
  title = {A depth-first branch-and-bound algorithm for geocoding historic itinerary tables},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2016},
  booktitle = {GIR '16 : Proceedings of the 10th Workshop on Geographic Information Retrieval},
  number = {3},
  pages = {1-10},
  publisher = {ACM},
  address = {New York, NY},
  isbn = {978-1-4503-4588-0},
  doi = {10.1145/3003464.3003467},
  url = {https://fis.uni-bamberg.de/handle/uniba/41653},
  language = {eng},
  abstract = {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.},
  keywords = {itinerary resolution, historic place name disambiguation, geocoding, depth-first branch-and-bound, gazetteer enrichment}
}

@inproceedings{gradl2016_40999,
  title = {Extending Data Models by Declaratively Specifying Contextual Knowledge},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2016},
  booktitle = {DocEng '16 : Proceedings of the 2016 ACM Symposium on Document Engineering},
  pages = {123-126},
  publisher = {ACM},
  address = {New York, NY, USA},
  isbn = {978-1-4503-4438-8},
  doi = {10.1145/2960811.2967147},
  url = {https://fis.uni-bamberg.de/handle/uniba/40999},
  language = {eng},
  abstract = {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.},
  keywords = {digital humanities, descriptive data modeling, language applications, DARIAH}
}

@inproceedings{gradl2016_40908,
  title = {Data Integration for the Arts and Humanities : A Language Theoretical Concept},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2016},
  booktitle = {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},
  pages = {281-293},
  publisher = {Springer},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-319-43996-9},
  doi = {10.1007/978-3-319-43997-6\_22},
  url = {https://fis.uni-bamberg.de/handle/uniba/40908},
  language = {eng},
  abstract = {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.},
  keywords = {Data Integration}
}

@inproceedings{blank2016_40767,
  title = {Die computergestützte Erschließung und Visualisierung historischer Itinerare},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2016},
  booktitle = {DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016},
  pages = {272-275},
  publisher = {nisaba Verlag},
  address = {Duisburg},
  isbn = {978-3-941379-05-3},
  url = {https://fis.uni-bamberg.de/handle/uniba/40767},
  language = {deu}
}

@article{gradl2016_40766,
  title = {Die DARIAH-DE-Föderationsarchitektur : Datenintegration im Spannungsfeld forschungsspezifischer und domänenübergreifender Anforderungen},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2016},
  journal = {Bibliothek : Forschung und Praxis},
  volume = {40},
  number = {2},
  pages = {222-228},
  publisher = {de Gruyter Saur},
  address = {Berlin ; New York, NY},
  issn = {1865-7648},
  doi = {10.1515/bfp-2016-0027},
  url = {https://fis.uni-bamberg.de/handle/uniba/40766},
  language = {deu},
  abstract = {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.},
  keywords = {Forschungsdaten, Integration, Föderation, generische Suche, DARIAH-DE, research data, integration, federation, generic search, DARIAH-DE}
}

@inproceedings{gradl2016_40759,
  title = {Judaica recherchieren : Unterstützung bei der Realisierung forschungsspezifischer Suchlösungen durch die generische Suche von DARIAH-DE},
  author = {Gradl, Tobias and Lordick, Harald and Henrich, Andreas},
  year = {2016},
  booktitle = {DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016},
  pages = {132-136},
  publisher = {nisaba Verlag},
  address = {Duisburg},
  isbn = {978-3-941379-05-3},
  url = {https://fis.uni-bamberg.de/handle/uniba/40759},
  language = {deu}
}

@inproceedings{gradl2016_40770,
  title = {Nutzung und Kombination von Daten aus strukturierten und unstrukturierten Quellen zur Identifikation transnationaler Lebensläufe},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2016},
  booktitle = {DHd 2016 : Modellierung, Vernetzung, Visualisierung : die Digital Humanities als fächerübergreifendes Forschungsparadigma : Konferenzabstracts : Universität Leipzig 7. bis 12. März 2016},
  pages = {129-132},
  publisher = {nisaba Verlag},
  address = {Duisburg},
  isbn = {978-3-941379-05-3},
  url = {https://fis.uni-bamberg.de/handle/uniba/40770},
  language = {deu}
}

@article{blank2016_40595,
  title = {Using Summaries to Search and Visualize Distributed Resources Addressing Spatial and Multimedia Features},
  author = {Blank, Daniel and Henrich, Andreas and Kufer, Stefan},
  year = {2016},
  journal = {Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V.},
  volume = {16},
  number = {1},
  pages = {67-76},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {1618-2162},
  doi = {10.1007/s13222-015-0210-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/40595},
  language = {eng},
  abstract = {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.},
  keywords = {Resource description and selection, Distributed metric and spatial access methods, Big data summarization}
}

@inproceedings{blank2016_40573,
  title = {IT Company Atlas Upper Franconia : A Practical Application of Expert Search Techniques},
  author = {Blank, Daniel and Boosz, Sebastian and Henrich, Andreas},
  year = {2016},
  booktitle = {SAC '16 : Proceedings of the 31st Annual ACM Symposium on Applied Computing},
  pages = {1048-1053},
  publisher = {ACM},
  address = {New York, NY, USA},
  isbn = {978-1-4503-3739-7},
  doi = {10.1145/2851613.2851695},
  url = {https://fis.uni-bamberg.de/handle/uniba/40573},
  language = {eng},
  abstract = {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".},
  keywords = {Company search, Expertise retrieval, Expert search, Domain specific search solutions, IR systems}
}

@article{henrich2015_46611,
  title = {Editorial : Schwerpunktthema: Informationsmanagement für Digital Humanities},
  author = {Henrich, Andreas and Heyer, Gerhard and Schlieder, Christoph and Härder, Theo},
  year = {2015},
  journal = {Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V.},
  volume = {15},
  number = {1},
  pages = {1-6},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {1618-2162},
  doi = {10.1007/s13222-015-0181-6},
  url = {https://fis.uni-bamberg.de/handle/uniba/46611},
  language = {deu},
  abstract = {-},
  keywords = {Informationsmanagement, Digital Humanities}
}

@article{henrich2015_40769,
  title = {Erforschung der Weltenwanderer : Über die Nutzung der Wikipedia zur Identifikation grenzüberschreitender Lebensläufe},
  author = {Henrich, Andreas and Gradl, Tobias},
  year = {2015},
  journal = {Uni.vers Forschung : das Magazin der Otto-Friedrich-Universität Bamberg},
  number = {Ein Universum des Wissens für alle - Bamberger Perspektiven auf die Wikipedia},
  pages = {46-49},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  issn = {2195-2558},
  url = {https://fis.uni-bamberg.de/handle/uniba/40769},
  language = {deu},
  abstract = {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.},
  keywords = {Wikipedia}
}

@article{gradl2015_40772,
  title = {Heterogene Daten in den Digital Humanities : Eine Architektur zur forschungsorientierten Föderation von Kollektionen},
  author = {Gradl, Tobias and Henrich, Andreas and Plutte, Christoph},
  year = {2015},
  journal = {Zeitschrift für digitale Geisteswissenschaften},
  number = {Sonderband 1, Grenzen und Möglichkeiten der Digital Humanities},
  publisher = {Wolfenbüttel},
  issn = {2510-1366},
  doi = {10.17175/sb001\_020},
  url = {https://fis.uni-bamberg.de/handle/uniba/40772},
  language = {deu},
  abstract = {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.},
  keywords = {Datenintegration, Digital Humanities, Softwaresystem}
}

@inproceedings{stadelmann2015_40584,
  title = {Implementierung von IR-Modellen auf Basis spaltenorientierter Datenbanken oder invertierter Listen},
  author = {Stadelmann, Thomas and Blank, Daniel and Henrich, Andreas},
  year = {2015},
  booktitle = {Datenbanksysteme für Business, Technologie und Web (BTW 2015)},
  pages = {299-308},
  publisher = {Gesellschaft für Informatik e. V.},
  address = {Bonn},
  series = {GI-Edition / Proceedings},
  isbn = {978-3-88579-635-0},
  url = {https://fis.uni-bamberg.de/handle/uniba/40584},
  language = {deu},
  abstract = {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.},
  keywords = {IR-Modelle}
}

@inproceedings{blank2015_40568,
  title = {Company Search : When Documents are only Second Class Citizens},
  author = {Blank, Daniel and Boosz, Sebastian and Henrich, Andreas},
  year = {2015},
  booktitle = {Proceedings of the LWA 2015 Workshops : KDML, FGWM, IR, and FGDB (LWA 2015) ; Trier, Germany, October 7-9, 2015},
  pages = {361-368},
  publisher = {RWTH},
  address = {Aachen},
  series = {CEUR workshop proceedings},
  issn = {1613-0073},
  url = {https://fis.uni-bamberg.de/handle/uniba/40568},
  language = {eng},
  abstract = {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.},
  keywords = {domain specific search solutions, expertise retrieval}
}

@inproceedings{blank2015_40570,
  title = {Geocoding place names from historic route descriptions},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2015},
  booktitle = {GIR '15 : Proceedings of the 9th Workshop on Geographic Information Retrieval},
  number = {9},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-4503-3937-7},
  doi = {10.1145/2837689.2837698},
  url = {https://fis.uni-bamberg.de/handle/uniba/40570},
  language = {eng},
  abstract = {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.},
  keywords = {itinerary resolution, geocoding, gazetteer enrichment}
}

@inproceedings{kufer2014_41202,
  title = {Hybrid Quantized Resource Descriptions for Geospatial Source Selection},
  author = {Kufer, Stefan and Henrich, Andreas},
  year = {2014},
  booktitle = {LocWeb '14 : Proceedings of the 4th International Workshop on Location and the Web},
  pages = {17-24},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-4503-1459-6},
  doi = {10.1145/2663713.2664428},
  url = {https://fis.uni-bamberg.de/handle/uniba/41202},
  language = {eng},
  abstract = {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.},
  keywords = {Geographic Information Retrieval, Distributed Information Retrieval, Source Selection, Summarization, Quantization}
}

@inproceedings{gradl2014_40756,
  title = {A novel approach for a reusable federation of research data within the arts and humanities},
  author = {Gradl, Tobias and Henrich, Andreas},
  year = {2014},
  booktitle = {Digital humanities 2014 : conference abstracts EPFL-UNIL Lausanne, Switzerland 8-12 July 2014},
  pages = {382-384},
  address = {Lausanne},
  doi = {10.5281/zenodo.58210},
  url = {https://fis.uni-bamberg.de/handle/uniba/40756},
  language = {eng},
  abstract = {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.},
  keywords = {data integration, data federation, digital humanities, research data, DARIAH-DE}
}

@inproceedings{gradl2014_40752,
  title = {Die DARIAH-DE Architektur zur forschungsorientierten Föderation von Kollektionen in den Digital Humanities},
  author = {Gradl, Tobias and Plutte, Christoph and Henrich, Andreas},
  year = {2014},
  pages = {1-8},
  doi = {10.5281/zenodo.57894},
  url = {https://fis.uni-bamberg.de/handle/uniba/40752},
  language = {deu},
  abstract = {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},
  keywords = {DARIAH-DE Architektur, Digital Humanities}
}

@inproceedings{wolf2014_40565,
  title = {Characterization of toponym usages in texts},
  author = {Wolf, Sebastian Johannes and Henrich, Andreas and Blank, Daniel},
  year = {2014},
  booktitle = {GIR '14 : Proceedings of the 8th Workshop on Geographic Information Retrieval},
  number = {7},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-4503-3135-7},
  doi = {10.1145/2675354.2675703},
  url = {https://fis.uni-bamberg.de/handle/uniba/40565},
  language = {eng},
  abstract = {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.},
  keywords = {Computational Linguistics, Linguistic Devices, Geographical Information Retrieval, Geospatial Grounding}
}

@inproceedings{bergner2014_2837,
  title = {LWA 2013 : Lernen, Wissen \& Adaptivität ; Workshop Proceedings Bamberg, 7.-9. October 2013},
  author = {Bergner, Arndt and Schmid, Ute},
  editor = {Henrich, Andreas and Sperker, Hans-Christian},
  year = {2014},
  publisher = {opus},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-opus4-64478},
  url = {https://fis.uni-bamberg.de/handle/uniba/2837},
  language = {other},
  abstract = {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.}
}

@article{henrich2013_40761,
  title = {DARIAH(-DE): Digital Research Infrastructure for the Arts and Humanities : Concepts and Perspectives},
  author = {Henrich, Andreas and Gradl, Tobias},
  year = {2013},
  journal = {International Journal of Humanities and Arts Computing},
  volume = {7},
  number = {Issue supplement: Convergence, Collaboration, and Creativity Essays from the 2012 Taiwan},
  pages = {47-58},
  publisher = {Edinburgh Univ. Press},
  address = {Edinburgh},
  issn = {1753-8548},
  doi = {10.3366/ijhac.2013.0059},
  url = {https://fis.uni-bamberg.de/handle/uniba/40761},
  language = {eng},
  abstract = {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.},
  keywords = {research infrastructure, digital humanities, DARIAH, DARIAH-DE}
}

@inproceedings{sperker2013_40580,
  title = {Feature-based object recognition : A case study for car model detection},
  author = {Sperker, Hans-Christian and Henrich, Andreas},
  year = {2013},
  booktitle = {11th International Workshop on Content-Based Multimedia Indexing (CBMI), 2013 ; Proceedings},
  pages = {127-130},
  publisher = {IEEE},
  address = {New York, NY, USA},
  isbn = {978-1-4799-0955-1},
  doi = {10.1109/CBMI.2013.6576568},
  url = {https://fis.uni-bamberg.de/handle/uniba/40580},
  language = {eng},
  abstract = {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.},
  keywords = {Feature-based object recognition}
}

@inproceedings{blank2013_40557,
  title = {Resource Description and Selection for Range Query Processing in General Metric Spaces},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2013},
  booktitle = {Datenbanksysteme für Business, Technologie und Web (BTW) 2013 : Tagung vom 13. - 15. März 2013 in Magdeburg},
  pages = {93-112},
  publisher = {Ges. für Informatik},
  address = {Bonn},
  series = {GI-Edition : Proceedings},
  isbn = {978-3-88579-608-4},
  url = {https://fis.uni-bamberg.de/handle/uniba/40557},
  language = {eng},
  abstract = {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.},
  keywords = {Range Query Processing}
}

@inproceedings{kufer2013_40559,
  title = {Using Hybrid Techniques for Resource Description and Selection in the Context of Distributed Geographic Information Retrieval},
  author = {Kufer, Stefan and Blank, Daniel and Henrich, Andreas},
  year = {2013},
  booktitle = {Advances in Spatial and Temporal Databases : 13th International Symposium, SSTD 2013, Munich, Germany, August 21-23, 2013 ; Proceedings},
  pages = {330-347},
  publisher = {Springer},
  address = {Berlin, Heidelberg},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-642-40234-0},
  doi = {10.1007/978-3-642-40235-7\_19},
  url = {https://fis.uni-bamberg.de/handle/uniba/40559},
  language = {eng},
  abstract = {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.},
  keywords = {Distributed Geographic Information Retrieval}
}

@inproceedings{stocker2013_2731,
  title = {A machine learning approach to drought stress level classification of tobacco plants},
  author = {Stocker, Christoph and Uhrmann, Franz and Scholz, Oliver and Hügel, C. and Rademacher, T. and Siebers, Michael and Schmid, Ute},
  editor = {Henrich, Andreas and Sperker, Hans-Christian},
  year = {2013},
  booktitle = {LWA 2013: Lernen, Wissen \& Adaptivität Workshop Proceedings, Bamberg, 7.-9.Oktober 2013},
  pages = {174-178},
  publisher = {opus},
  address = {Bamberg},
  url = {https://fis.uni-bamberg.de/handle/uniba/2731},
  language = {eng}
}

@inproceedings{stocker2013_2726,
  title = {Erkennung von Sequenzen mimischer Schmerzausdrücke durch genetische Programmierung},
  author = {Stocker, Christoph and Siebers, Michael and Schmid, Ute},
  editor = {Henrich,  Andreas and Sperker, Hans-Christian},
  year = {2013},
  pages = {117-120},
  publisher = {opus},
  address = {Bamberg},
  url = {https://fis.uni-bamberg.de/handle/uniba/2726},
  language = {deu}
}

@incollection{blank2012_626,
  title = {Describing and selecting collections of georeferenced media items in peer-to-peer information retrieval systems},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2012},
  booktitle = {Discovery of geospatial resources : methodologies, technologies, and emergent applications},
  pages = {1-20},
  publisher = {IGI Global},
  address = {Hershey PA},
  isbn = {978-1-466-60945-7},
  doi = {10.4018/978-1-4666-0945-7.ch001},
  url = {https://fis.uni-bamberg.de/handle/uniba/626},
  language = {eng},
  abstract = {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.},
  keywords = {peer-to-peer information retrieval systems}
}

@article{schlieder2011_106661,
  title = {Spatial grounding with vague place models},
  author = {Schlieder, Christoph and Henrich, Andreas},
  year = {2011},
  pages = {20-23},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1066614},
  url = {https://fis.uni-bamberg.de/handle/uniba/106661},
  language = {eng},
  abstract = {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.},
  keywords = {vague place models}
}

@article{schlieder2011_5447,
  title = {Spatial grounding with vague place models},
  author = {Schlieder, Christoph and Henrich, Andreas},
  year = {2011},
  journal = {SIGSPATIAL special},
  volume = {3},
  number = {2: Special Issue on Geographic Information Retrieval},
  pages = {20-23},
  publisher = {ACM},
  address = {New York, NY},
  issn = {1946-7729},
  doi = {10.1145/2047296.2047301},
  url = {https://fis.uni-bamberg.de/handle/uniba/5447},
  language = {eng},
  abstract = {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.},
  keywords = {vague place models}
}

@inproceedings{henrich2011_5419,
  title = {The Spatial Visibility of Terms and Phrases on the Internet: Approaches, Observations and Perspectives},
  author = {Henrich, Andreas},
  year = {2011},
  booktitle = {Visibility in Information Spaces and in Geographic Environments. Post- Proceedings of the KI'11 Workshop (October 4th, 2011, TU Berlin, Germany)},
  pages = {35 - 37},
  address = {Bamberg},
  url = {https://fis.uni-bamberg.de/handle/uniba/5419},
  language = {eng}
}

@article{henrich2011_4808,
  title = {Forschungsinfrastruktur : Auf dem (langen) Weg zu den e-Humanities},
  author = {Henrich, Andreas},
  year = {2011},
  journal = {Uni.vers Forschung : das Magazin der Otto-Friedrich-Universität Bamberg},
  number = {17: Digital Humanities : Technologien für die Geisteswissenschaften},
  pages = {11 - 15},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  issn = {2195-2558},
  url = {https://fis.uni-bamberg.de/handle/uniba/4808},
  language = {deu},
  abstract = {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.},
  keywords = {Forschungsinfrastruktur}
}

@inproceedings{henrich2011_4813,
  title = {IR-Unterstützung für die Digital Humanities: Problemstellungen und erste Lösungsideen},
  author = {Henrich, Andreas and Gradl, Tobias},
  year = {2011},
  booktitle = {LWA 2011 : Lernen, Wissen, Adaption},
  url = {https://fis.uni-bamberg.de/handle/uniba/4813},
  language = {deu}
}

@inproceedings{henrich2011_4785,
  title = {Hybrid Learning : "Neither Fish Nor Fowl" or "The Golden Mean"},
  author = {Henrich, Andreas and Sieber, Stefanie},
  year = {2011},
  booktitle = {Hybrid Learning : Third International Conference, ICHL 2010, Beijing, China, August 16-18, 2010 ; Proceedings},
  pages = {82-93},
  publisher = {Springer},
  address = {Berlin u.a.},
  series = {Lecture notes in computer science},
  isbn = {978-3-642-14656-5},
  doi = {10.1007/978-3-642-14657-2\_9},
  url = {https://fis.uni-bamberg.de/handle/uniba/4785},
  language = {eng},
  abstract = {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.},
  keywords = {Hybrid Learning}
}

@incollection{blank2011_4783,
  title = {Teaching IR : Curricular Considerations},
  author = {Blank, Daniel and Fuhr, Norbert and Henrich, Andreas and Mandl, Thomas and Rölleke,  Thomas and Schütze, Hinrich and Stein, Benno},
  year = {2011},
  booktitle = {Teaching and Learning in Information Retrieval},
  pages = {31-46},
  publisher = {Springer},
  address = {Berlin u.a.},
  isbn = {978-3-642-22510-9},
  doi = {10.1007/978-3-642-22511-6\_3},
  url = {https://fis.uni-bamberg.de/handle/uniba/4783},
  language = {eng},
  abstract = {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.},
  keywords = {Teaching IR}
}

@inproceedings{henrich2011_4763,
  title = {A Study on the Use of Lecture Recordings in Different Mobile Learning Settings},
  author = {Henrich, Andreas and Hub, Adrian and Sieber, Stefanie},
  year = {2011},
  booktitle = {Proceedings of the 7th IADIS international conference on Mobile Learning 2011},
  pages = {159 - 166},
  publisher = {IADIS},
  address = {Lisbon},
  isbn = {978-972-8939-45-8},
  url = {https://fis.uni-bamberg.de/handle/uniba/4763},
  language = {eng},
  abstract = {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.},
  keywords = {Lecture Recordings, Mobile Learning, User Study, MPEG-4, Ubiquitous Learning}
}

@article{henrich2011_4764,
  title = {Digital Humanities studieren : vielfältige Möglichkeiten vom einzelnen Modul bis zum speziellen Studiengang},
  author = {Henrich, Andreas},
  year = {2011},
  journal = {Uni.vers Forschung : das Magazin der Otto-Friedrich-Universität Bamberg},
  number = {17: Digital Humanities : Technologien für die Geisteswissenschaften},
  pages = {56-59},
  publisher = {Otto-Friedrich Universität},
  address = {Bamberg},
  issn = {2195-2558},
  url = {https://fis.uni-bamberg.de/handle/uniba/4764},
  language = {deu},
  abstract = {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.},
  keywords = {Digital Humanities}
}

@inproceedings{fries2011_4767,
  title = {Hybrid Learning : A Powerful Opportunity to Integrate SMEs in Courses as a Third Party},
  author = {Fries, Tobias and Henrich, Andreas},
  year = {2011},
  booktitle = {Hybrid learning : 4th international conference, ICHL 2011, Hong Kong, China, August 10 - 12, 2011 ; proceedings},
  pages = {176-187},
  publisher = {Springer},
  address = {Berlin u. a.},
  isbn = {978-3-642-22762-2},
  doi = {10.1007/978-3-642-22763-9\_17},
  url = {https://fis.uni-bamberg.de/handle/uniba/4767},
  language = {eng},
  abstract = {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.},
  keywords = {Hybrid Learning}
}

@inproceedings{fries2011_4766,
  title = {Integrating industrial partners into e-teaching efforts - using social networks to support the initiation of co-operations},
  author = {Fries, Tobias and Boosz, Sebastian and Henrich, Andreas},
  year = {2011},
  booktitle = {Information und Wissen : global, sozial und frei? ; Proceedings des 12. Internationalen Symposiums für Informationswissenschaft (ISI 2011) ; Hildesheim, 9. - 11. März 2011},
  pages = {454 - 466},
  publisher = {Verlag Werner Hülsbusch},
  address = {Boizenburg},
  series = {Schriften zur Informationswissenschaft},
  url = {https://fis.uni-bamberg.de/handle/uniba/4766},
  language = {eng}
}

@book{henrich2011_424,
  title = {Digitale Geisteswissenschaften},
  author = {Henrich, Andreas and Deschauer, Bernd},
  editor = {Thaller, Manfred},
  year = {2011},
  publisher = {DARIAH-DE},
  address = {Köln},
  edition = {1},
  url = {https://fis.uni-bamberg.de/handle/uniba/424},
  language = {deu},
  keywords = {Deutschland, Universität, Geisteswissenschaften, Digitalisierung}
}

@inproceedings{henrich2011_321,
  title = {Visibility in Information Spaces and in Geographic Environments : Post-Proceedings of the KI'11 Workshop (October 4th, 2011, TU Berlin, Germany)},
  author = {Henrich, Andreas and Schlieder, Christoph and Schmid, Ute and Seifert, Inessa and Saendig, Bertram and Kremer, Dominik and Grossmann, Peter and Wachter, Markus and Raab, Marius and Carbon, Claus-Christian and Faerber, Stella J.},
  editor = {Henrich, Andreas and Schlieder, Christoph and Schmid, Ute},
  year = {2011},
  publisher = {opus},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik},
  urn = {urn:nbn:de:bvb:473-opus-3923},
  url = {https://fis.uni-bamberg.de/handle/uniba/321},
  language = {eng},
  abstract = {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.},
  keywords = {Raum-zeitliches Verhalten, Mobile Assistenz, Visualisierung , Prototypen, Geo-Information Retrieval, Raum-zeitliches Verhalten, Mobile Assistenz, Visualisierung, Prototypen, Geo-Information Retrieval}
}

@inproceedings{fries2010_4759,
  title = {Integrating Industrial Partners into e-Teaching Efforts : a Portal to Support the Initiation of Co-operations},
  author = {Fries, Tobias and Henrich, Andreas},
  year = {2010},
  booktitle = {Proceedings of the IADIS International Conference e-Learning 2010},
  pages = {89-96},
  publisher = {IADIS},
  address = {Freiburg},
  isbn = {978-972-8939-17-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/4759},
  language = {eng},
  abstract = {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.},
  keywords = {Learning management systems, IT infrastructure, integration of practitioners, practical projects}
}

@inproceedings{fries2010_4756,
  title = {Integrating industrial partners into e-teaching efforts - legal pitfalls and circumventions},
  author = {Fries, Tobias and Henrich, Andreas},
  year = {2010},
  booktitle = {International Conference on Technology Supported Learning \& Training <16, 2010, Berlin>: Proceedings},
  address = {Berlin},
  url = {https://fis.uni-bamberg.de/handle/uniba/4756},
  language = {eng}
}

@inproceedings{eckstein2010_4776,
  title = {LFRP-Search: Multi-Layer Ranked Visual Faceted Search : an Approach to Cope with Complex Search Situations},
  author = {Eckstein, Raiko and Henrich, Andreas and Weber, Nadine},
  year = {2010},
  booktitle = {SAC '10 : Proceedings of the 2010 ACM Symposium on Applied Computing},
  pages = {1713-1717},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-60558-639-7},
  doi = {10.1145/1774088.1774455},
  url = {https://fis.uni-bamberg.de/handle/uniba/4776},
  language = {eng},
  abstract = {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-<u>L</u>ayer <u>F</u>aceted Search with <u>R</u>anking using <u>P</u>arallel <u>C</u>oordinates). The main contribution of this paper is the semi-formal description of the query options.},
  keywords = {Information Retrieval, Retrieval Model, Multi-Criteria, Visualization, Faceted Search, Parallel Coordinates}
}

@inproceedings{sieber2010_4760,
  title = {Metadata for Learning Objects : A Cure for Information Overflow?},
  author = {Sieber, Stefanie and Henrich, Andreas},
  year = {2010},
  booktitle = {Proceedings of the IADIS International Conference e-Learning 2010},
  pages = {251-255},
  publisher = {IADIS},
  address = {Freiburg},
  isbn = {978-972-8939-17-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/4760},
  language = {eng},
  abstract = {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.},
  keywords = {Learning Objects, Learning Context, Learning Reference, Metadata Standards, Dublin Core, Learning Object Metadata}
}

@inproceedings{blank2010_4737,
  title = {Binary Histograms for Resource Selection in Peer-to-Peer Media Retrieval},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2010},
  booktitle = {LWA 2010 : Lernen, Wissen \& Adaptivität ; Workshop Proceedings},
  pages = {183-190},
  address = {Kassel},
  series = {Kasseler Informatikschriften},
  url = {https://fis.uni-bamberg.de/handle/uniba/4737},
  language = {eng},
  abstract = {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.},
  keywords = {Binary Histograms}
}

@inproceedings{henrich2010_4738,
  title = {Description and Selection of Media Archives for Geographic Nearest Neighbor Queries in P2P Networks},
  author = {Henrich, Andreas and Blank, Daniel},
  year = {2010},
  booktitle = {Proceedings of the ECIR2010 workshop on information access for personal media archives : (IAPMA2010), Milton Keynes, UK, 28 March 2010. IAPMA Workshop Proceedings},
  pages = {22 - 29},
  address = {Dublin},
  url = {https://fis.uni-bamberg.de/handle/uniba/4738},
  language = {eng},
  abstract = {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.},
  keywords = {Resource Selection, Peer-to-Peer IR, Multimedia IR, Summarization}
}

@inproceedings{hub2010_4741,
  title = {Image Retrieval on Mobile Devices},
  author = {Hub, Adrian and Henrich, Andreas},
  year = {2010},
  booktitle = {LWA 2010 : Lernen, Wissen \& Adaptivität ; Workshop Proceedings},
  pages = {205-208},
  address = {Kassel},
  series = {Kasseler Informatikschriften},
  url = {https://fis.uni-bamberg.de/handle/uniba/4741},
  language = {eng},
  abstract = {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.},
  keywords = {Image Retrieval}
}

@incollection{sieber2010_3286,
  title = {Knowledge Management for Hybrid Learning},
  author = {Sieber, Stefanie and Henrich, Andreas},
  year = {2010},
  booktitle = {Handbook of Research on Hybrid Learning Models : Advanced Tools, Technologies, and Applications},
  pages = {424-449},
  publisher = {IGI Global},
  address = {Hershey, PA},
  isbn = {978-1-60566-380-7},
  doi = {10.4018/978-1-60566-380-7.ch026},
  url = {https://fis.uni-bamberg.de/handle/uniba/3286},
  language = {eng},
  abstract = {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.},
  keywords = {knowledge management, hybrid learning}
}

@article{henrich2009_20406,
  title = {Multimedia Information Retrieval},
  author = {Henrich, Andreas},
  year = {2009},
  journal = {Information technology : methods and applications of informatics and information technology},
  volume = {51},
  number = {6},
  pages = {336 - 342},
  publisher = {De Gruyter Oldenbourg},
  address = {Berlin},
  issn = {2196-7032},
  doi = {10.1524/itit.2009.0560},
  url = {https://fis.uni-bamberg.de/handle/uniba/20406},
  language = {deu},
  abstract = {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.},
  keywords = {Suche, Multimedia, Suchmaschine, Bildsuche, search, multimedia, search engine, image retrieval}
}

@inproceedings{weber2009_20365,
  title = {Searching Multiple Artifacts : a Comprehensive Framework for Complex Search Situations},
  author = {Weber, Nadine and Eckstein, Raiko and Henrich, Andreas},
  year = {2009},
  booktitle = {Flexible query answering systems : 8th international conference, FQAS 2009, Roskilde, Denmark, October 26 - 28, 2009 ; proceedings},
  pages = {251-262},
  publisher = {Springer},
  address = {Berlin u.a.},
  series = {Lecture notes in computer science},
  isbn = {978-3-642-04956-9},
  doi = {10.1007/978-3-642-04957-6\_22},
  url = {https://fis.uni-bamberg.de/handle/uniba/20365},
  language = {eng},
  abstract = {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.},
  keywords = {Complex Search Situations}
}

@incollection{henrich2009_18790,
  title = {Ad Hoc Determination of Geographic Regions for Concept@Location Queries},
  author = {Henrich, Andreas and Lüdecke, Volker},
  year = {2009},
  booktitle = {Weaving Services and People on the World Wide Web},
  pages = {169-194},
  publisher = {Springer},
  address = {Berlin u.a.},
  edition = {1. Aufl.},
  isbn = {978-3-642-42562-2},
  doi = {10.1007/978-3-642-00570-1\_9},
  url = {https://fis.uni-bamberg.de/handle/uniba/18790},
  language = {eng},
  abstract = {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.},
  keywords = {Concept@Location Queries}
}

@inproceedings{eckstein2009_18794,
  title = {Das LFRP-Framework zur Beherrschung komplexer Suchsituationen},
  author = {Eckstein, Raiko and Henrich, Andreas and Weber, Nadine},
  year = {2009},
  booktitle = {WIR 2009 : Workshop Information Retrieval 2009 ; Lernen Wissen Adaptivität, LWA 2009 Darmstadt 21. - 23. Sept. 2009},
  pages = {84 - 91},
  address = {Darmstadt},
  url = {https://fis.uni-bamberg.de/handle/uniba/18794},
  language = {deu}
}

@inproceedings{gobel2009_18759,
  title = {A Hybrid Index Structure for Geo-Textual Searches},
  author = {Göbel, Richard and Henrich, Andreas and Niemann, Raik and Blank, Daniel},
  year = {2009},
  booktitle = {CIKM '09 : Proceedings of the 18th ACM conference on Information and knowledge management},
  pages = {1625–1628},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-60558-512-3},
  doi = {10.1145/1645953.1646188},
  url = {https://fis.uni-bamberg.de/handle/uniba/18759},
  language = {eng},
  abstract = {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.},
  keywords = {R-Tree, Inverted Index, Geographical IR}
}

@article{eckstein2009_18762,
  title = {Das LFRP-Framework : ein Ansatz zur interaktiven Suche für unternehmensspezifische Informationen},
  author = {Eckstein, Raiko and Henrich, Andreas and Weber, Nadine},
  year = {2009},
  journal = {Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V.},
  volume = {9},
  number = {30},
  pages = {20-29},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {1618-2162},
  url = {https://fis.uni-bamberg.de/handle/uniba/18762},
  language = {deu},
  abstract = {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.},
  keywords = {LFRP-Framework}
}

@inproceedings{sieber2009_18770,
  title = {Effectively Managing and Processing Personal Learning Content},
  author = {Sieber, Stefanie and Henrich, Andreas},
  year = {2009},
  booktitle = {Advances in Web Based Learning : ICWL 2009 ; 8th International Conference, Aachen, Germany, August 19-21, 2009, Proceedings},
  pages = {363-366},
  publisher = {Springer},
  address = {Berlin},
  isbn = {978-3-642-03426-8},
  doi = {10.1007/978-3-642-03426-8\_43},
  url = {https://fis.uni-bamberg.de/handle/uniba/18770},
  language = {eng},
  abstract = {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.},
  keywords = {Personal Learning Content}
}

@inproceedings{hub2009_18766,
  title = {Picadomo : Faceted Image Browsing for Mobile Devices},
  author = {Hub, Adrian and Blank, Daniel and Henrich, Andreas and Müller, Wolfgang},
  year = {2009},
  booktitle = {2009 Seventh International Workshop on Content-Based Multimedia Indexing},
  pages = {249-254},
  publisher = {IEEE},
  address = {Piscataway, NJ},
  doi = {10.1109/CBMI.2009.34},
  url = {https://fis.uni-bamberg.de/handle/uniba/18766},
  language = {eng},
  abstract = {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.},
  keywords = {Picadomo}
}

@inproceedings{blank2009_18761,
  title = {Summarizing Georeferenced Photo Collections for Image Retrieval in P2P Networks},
  author = {Blank, Daniel and Henrich, Andreas},
  year = {2009},
  booktitle = {Proceedings: Workshop on Geographic Information on the Internet, 2009, im Rahmen der 31st European Conference on Information Retrieval) 6. April 2009.},
  url = {https://fis.uni-bamberg.de/handle/uniba/18761},
  language = {eng}
}

@article{henrich2009_18752,
  title = {Blended learning and pure e-learning concepts for information retrieval : experiences and future directions},
  author = {Henrich, Andreas and Sieber, Stefanie},
  year = {2009},
  journal = {Information retrieval journal},
  volume = {12},
  number = {2},
  pages = {117-147},
  publisher = {Springer},
  address = {New York},
  issn = {1386-4564},
  doi = {10.1007/s10791-008-9079-3},
  url = {https://fis.uni-bamberg.de/handle/uniba/18752},
  language = {eng},
  abstract = {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.},
  keywords = {Teaching information retrieval, Blended learning, e-Learning, Interaction}
}

@article{blank2009_18756,
  title = {Information Retrieval : Concepts and Practical Considerations for Teaching a Rising Topic},
  author = {Blank, Daniel and Fuhr, Norbert and Henrich, Andreas and Mandl, Thomas and Rölleke,  Thomas and Schütze, Hinrich and Stein, Benno},
  year = {2009},
  journal = {Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V.},
  volume = {9},
  number = {29},
  pages = {30-41},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {1618-2162},
  url = {https://fis.uni-bamberg.de/handle/uniba/18756},
  language = {eng},
  abstract = {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.},
  keywords = {Information Retrieval}
}

@inproceedings{henrich2009_18753,
  title = {Measuring Similarity of Geographic Regions for Geographic Information Retrieval},
  author = {Henrich, Andreas and Lüdecke, Volker},
  year = {2009},
  booktitle = {Advances in information retrieval : 31th European Conference on IR Research, ECIR 2009, Toulouse, France, April 6-9, 2009, Proceedings},
  pages = {781-785},
  publisher = {Springer},
  address = {Berlin u.a.},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-642-00957-0},
  doi = {10.1007/978-3-642-00958-7\_85},
  url = {https://fis.uni-bamberg.de/handle/uniba/18753},
  language = {eng},
  abstract = {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.},
  keywords = {Geographic Information Retrieval}
}

@inproceedings{eckstein2009_18757,
  title = {Visual Browsing in Product Development Processes},
  author = {Eckstein, Raiko and Henrich, Andreas},
  year = {2009},
  booktitle = {DS 58-8 : Proceedings of ICED 09, the 17th International Conference on Engineering Design},
  pages = {183-194},
  publisher = {The Design Society},
  address = {Glasgow},
  url = {https://fis.uni-bamberg.de/handle/uniba/18757},
  language = {eng}
}

@book{meerkamm2009_18654,
  title = {Flexible Prozessunterstützung in der Produktentwicklung : Prozesse - Daten - Navigation ; Abschlussbericht 01.10.2006 - 30.09. 2009},
  editor = {Meerkamm, Harald and Henrich, Andreas and Jablonski, Stefan and Krcmar, Helmut and Lindemann, U. and Rieg, Frank},
  year = {2009},
  publisher = {Shaker},
  address = {Aachen},
  isbn = {978-3-8322-8640-8},
  url = {https://fis.uni-bamberg.de/handle/uniba/18654},
  language = {deu}
}

@inproceedings{henrich2008_18749,
  title = {Approaches for determining the geographic footprint of arbitrary terms for retrieval and visualization},
  author = {Henrich, Andreas and Lüdecke, Volker and Blank, Daniel},
  year = {2008},
  booktitle = {GIS '08 : Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems},
  number = {43},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-60558-323-5},
  doi = {10.1145/1463434.1463488},
  url = {https://fis.uni-bamberg.de/handle/uniba/18749},
  language = {eng},
  abstract = {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.},
  keywords = {Vague geographic regions, Geographic search engines}
}

@inproceedings{henrich2008_18746,
  title = {Evaluation, Analysis, and Future Issues of a University-wide Learning Management System Concluding a Two-year Initiation Phase},
  author = {Henrich, Andreas and Sieber, Stefanie and Wolf, Sven-Uwe},
  year = {2008},
  booktitle = {e-Learning Baltics 2008 : Proceedings of the 1st International eLBa Science Conference, 17. Juni - 19. Juni 2008, Rostock},
  pages = {103-114},
  publisher = {Fraunhofer IRB Verlag},
  address = {Stuttgart},
  edition = {1},
  isbn = {978-3-8167-7781-6},
  url = {https://fis.uni-bamberg.de/handle/uniba/18746},
  language = {eng},
  abstract = {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.},
  keywords = {Learning Management System}
}

@inproceedings{henrich2008_17573,
  title = {Determining geographic representations for arbitrary concepts at query time},
  author = {Henrich, Andreas and Lüdecke, Volker},
  year = {2008},
  booktitle = {LOCWEB '08 : Proceedings of the first international workshop on Location and the web},
  pages = {17-24},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-60558-160-6},
  doi = {10.1145/1367798.1367802},
  url = {https://fis.uni-bamberg.de/handle/uniba/17573},
  language = {eng},
  abstract = {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.},
  keywords = {Vague geographic regions, Geographic search engines}
}

@book{henrich2008_17569,
  title = {Information Retrieval 1 (Grundlagen, Modelle und Anwendungen)},
  author = {Henrich, Andreas},
  year = {2008},
  publisher = {Lehrstuhl für Medieninformatik},
  address = {Bamberg},
  edition = {Version 1.2 (07.01.2008)},
  url = {https://fis.uni-bamberg.de/handle/uniba/17569},
  language = {deu}
}

@inproceedings{eckstein2008_17577,
  title = {Reaching the Boundaries of Context-Aware IR: Accepting Help from the User},
  author = {Eckstein, Raiko and Henrich, Andreas},
  year = {2008},
  booktitle = {Proceedings of the Second International Workshop on Adaptive Information Retrieval (AIR 2008) ; 18 October 2008 London, UK},
  pages = {1 - 6},
  address = {London},
  url = {https://fis.uni-bamberg.de/handle/uniba/17577},
  language = {eng}
}

@inproceedings{blank2008_17551,
  title = {Designing Benchmarks for the Evaluation of Peer-to- Peer Information Retrieval Systems},
  author = {Blank, Daniel and Müller, Wolfgang and Henrich, Andreas},
  year = {2008},
  booktitle = {LWA 2008 : Workshop-Woche: Lernen, Wissen \& Adaptivität ; Würzburg, 6.-8. Oktober 2008},
  pages = {57 - 64},
  address = {Würzburg},
  series = {University of Würzburg, Germany / Department of Computer Science: Technical Report},
  url = {https://fis.uni-bamberg.de/handle/uniba/17551},
  language = {eng}
}

@inproceedings{elallali2008_17555,
  title = {Image Data Source Selection Using Gaussian Mixture Models},
  author = {El Allali, Soufyane and Blank, Daniel and Müller, Wolfgang and Henrich, Andreas},
  year = {2008},
  booktitle = {Adaptive multimedial retrieval: retrieval, user, and semantics : 5th International Workshop, AMR 2007, Paris, France, July 5 - 6, 2007 ; revised selected papers},
  pages = {170-181},
  publisher = {Springer},
  address = {Berlin u.a.},
  isbn = {978-3-540-79859-0},
  doi = {10.1007/978-3-540-79860-6\_14},
  url = {https://fis.uni-bamberg.de/handle/uniba/17555},
  language = {eng},
  abstract = {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.},
  keywords = {Image Data, Source Selection, Gaussian Mixture Models}
}

@inproceedings{scherp2008_17550,
  title = {Interaction and user experiences with multimedia technologies : challenges and future topics},
  author = {Scherp, Ansgar and Nack, Frank and Nahrstedt, Klara and Inoue, Masashi and Girgensohn, Andreas and Henrich, Andreas and Sandhaus, Philipp and Thieme, Sabine and Zhou,  Michelle},
  year = {2008},
  booktitle = {HCC '08 : Proceedings of the 3rd ACM international workshop on Human-centered computing},
  pages = {1-6},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-60558-320-4},
  doi = {10.1145/1462027.1462028},
  url = {https://fis.uni-bamberg.de/handle/uniba/17550},
  language = {eng},
  abstract = {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.},
  keywords = {Interaction, User Experience, Multimedia, Human-computer Interaction, Information Retrieval, Networked Multimedia, Creative Arts}
}

@inproceedings{muller2008_17554,
  title = {VisualFlamenco : Dependable, Interactive Image Browsing Based on Visual Properties},
  author = {Müller, Wolfgang and Zech, Markus and Henrich, Andreas and Blank, Daniel},
  year = {2008},
  booktitle = {Proceedings: 2008 International Workshop on Content-Based Multimedia Indexing : CBMI 2008 ; London, United Kingdom, 18 - 20 June 2008},
  pages = {568-575},
  publisher = {IEEE},
  address = {Piscataway, NJ},
  doi = {10.1109/CBMI.2008.4564998},
  url = {https://fis.uni-bamberg.de/handle/uniba/17554},
  language = {eng},
  abstract = {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.},
  keywords = {VisualFlamenco}
}

@inproceedings{eckstein2008_17540,
  title = {An integrated context model for the product development domain and its implications on design reuse},
  author = {Eckstein, Raiko and Henrich, Andreas},
  year = {2008},
  booktitle = {Proceedings of the 10th International Design Conference : (DESIGN 2008 Cavtat - Dubrovnik, Croatia May 19 - 22, 2008)},
  pages = {761 - 768},
  address = {Dubrovnik, Croatia},
  url = {https://fis.uni-bamberg.de/handle/uniba/17540},
  language = {eng}
}

@inproceedings{henrich2007_17544,
  title = {Characteristics of geographic information needs},
  author = {Henrich, Andreas and Lüdecke, Volker},
  year = {2007},
  booktitle = {GIR '07 : Proceedings of the 4th ACM workshop on Geographical information retrieval},
  pages = {1-6},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-59593-828-2},
  doi = {10.1145/1316948.1316950},
  url = {https://fis.uni-bamberg.de/handle/uniba/17544},
  language = {eng},
  abstract = {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.},
  keywords = {Experimentation, Human Factors}
}

@inproceedings{henrich2007_17546,
  title = {Concepts of Blended Learning for Different Content Types},
  author = {Henrich, Andreas and Sieber, Stefanie},
  year = {2007},
  booktitle = {Blended Learning : Workshop on Blended Learning 2007 Edinburgh, United Kingdom 15 - 17.08.07},
  pages = {150 - 161},
  address = {Edinburgh},
  url = {https://fis.uni-bamberg.de/handle/uniba/17546},
  language = {eng}
}

@inproceedings{henrich2007_17536,
  title = {Integration eines hochschulweiten LMS in die Systemlandschaft einer Hochschule - ein pragmatischer Ansatz},
  author = {Henrich, Andreas and Sieber, Stefanie and Wolf, Sven-Uwe},
  year = {2007},
  booktitle = {Flexibel integrierbares e-Learning : nahe Zukunft oder Utopie?; proceedings of the Workshop on E-Learning 2007, HTWK Leipzig, 09. - 10. Juli 2007 (WEL '07)},
  address = {Leipzig},
  url = {https://fis.uni-bamberg.de/handle/uniba/17536},
  language = {deu}
}

@book{eisenhardt2007_17547,
  title = {Rechner- und Betriebssysteme, Kommunikationssysteme, Verteilte Systeme},
  author = {Eisenhardt, Martin and Henrich, Andreas and Sieber, Stefanie},
  year = {2007},
  publisher = {Lehrstuhl für Medieninformatik},
  address = {Bamberg},
  edition = {39427},
  url = {https://fis.uni-bamberg.de/handle/uniba/17547},
  language = {deu}
}

@inproceedings{eckstein2007_16403,
  title = {Integration possibilities of a context-based search engine into a project planning portal in the mechanical engineering domain},
  author = {Eckstein, Raiko and Henrich, Andreas},
  year = {2007},
  booktitle = {LWA 2007 : Lernen, Wissen, Adaption, Halle, September 2007 ; Workshop Proceedings},
  pages = {244 - 251},
  address = {Halle},
  url = {https://fis.uni-bamberg.de/handle/uniba/16403},
  language = {eng}
}

@inproceedings{weber2007_16363,
  title = {Retrieval of technical drawings in DXF format - concepts and problems},
  author = {Weber, Nadine and Henrich, Andreas},
  year = {2007},
  booktitle = {LWA 2007 : Lernen, Wissen, Adaption, Halle, September 2007 ; Workshop Proceedings},
  pages = {213 - 220},
  address = {Halle},
  url = {https://fis.uni-bamberg.de/handle/uniba/16363},
  language = {eng}
}

@inproceedings{blank2007_16361,
  title = {Sample-based Creation of Peer Summaries for Efficient Similarity Search in Scalable Peer-to-Peer Networks},
  author = {Blank, Daniel and El Allali, Soufyane and Müller, Wolfgang and Henrich, Andreas},
  year = {2007},
  booktitle = {MIR '07 : Proceedings of the international workshop on Workshop on multimedia information retrieval},
  pages = {143-151},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-59593-778-0},
  doi = {10.1145/1290082.1290104},
  url = {https://fis.uni-bamberg.de/handle/uniba/16361},
  language = {eng},
  abstract = {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.},
  keywords = {P2P, CBIR, Source selection}
}

@inproceedings{elallali2007_16364,
  title = {Untersuchung des Einflusses verschiedener Bild- Features und Distanzmaße im inhaltsbasierten P2P Information Retrieval},
  author = {El Allali, Soufyane and Blank, Daniel and Eisenhardt, Martin and Henrich, Andreas and Müller, Wolfgang},
  year = {2007},
  booktitle = {Datenbanksysteme in Business, Technologie und Web (BTW) : 12. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS) ; 07. - 09.03.2007 in Aachen},
  pages = {382 - 396},
  publisher = {Gesellschaft für Informatik e.V.},
  address = {Bonn},
  isbn = {978-3-88579-197-3},
  url = {https://fis.uni-bamberg.de/handle/uniba/16364},
  language = {deu},
  abstract = {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.},
  keywords = {Information Retrieval}
}

@article{henrich2007_16027,
  title = {VC : Der Virtuelle Campus als Ergänzung zum Hörsaal},
  author = {Henrich, Andreas},
  year = {2007},
  journal = {Uni.vers : das Magazin der Otto-Friedrich-Universität Bamberg},
  volume = {7},
  number = {12 = Studieren in Bamberg},
  pages = {28},
  issn = {1618-9019},
  url = {https://fis.uni-bamberg.de/handle/uniba/16027},
  language = {deu},
  abstract = {-},
  keywords = {Virtueller Campus}
}

@inproceedings{henrich2007_14820,
  title = {Information Retrieval as eLearning Course in German : Lessons Learned after 5 Years of Experience},
  author = {Henrich, Andreas and Morgenroth, Karlheinz},
  year = {2007},
  booktitle = {TLIR'07: Proceedings of the First international conference on Teaching and Learning of Information Retrieval},
  pages = {18 - 23},
  publisher = {BCS Learning \& Development Ltd.},
  address = {Swindon, United Kingdom},
  url = {https://fis.uni-bamberg.de/handle/uniba/14820},
  language = {eng}
}

@inproceedings{muller2007_14573,
  title = {Aspects of Adaptivity in P2P Information Retrieval},
  author = {Müller, Wolfgang and Henrich, Andreas and Eisenhardt, Martin},
  year = {2007},
  booktitle = {Adaptive Multimedia Retrieval:User, Context, and Feedback : 4th International Workshop, AMR 2006, Geneva, Switzerland, July, 27-28, 2006 ; Revised Selected Papers},
  pages = {164-178},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  isbn = {978-3-540-71544-3},
  doi = {10.1007/978-3-540-71545-0\_13},
  url = {https://fis.uni-bamberg.de/handle/uniba/14573},
  language = {eng},
  abstract = {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.},
  keywords = {P2P Information Retrieval}
}

@inproceedings{eisenhardt2006_16359,
  title = {Clustering-Based Source Selection for Efficient Image Retrieval in Peer-to-Peer Networks},
  author = {Eisenhardt, Martin and Müller, Wolfgang and Henrich, Andreas and Blank, Daniel and El Allali, Soufyane},
  year = {2006},
  booktitle = {Proceedings : ISM 2006, Eighth IEEE International Symposium on Multimedia : 11 - 13 December 2006, San Diego, CA},
  pages = {823-830},
  publisher = {IEEE},
  address = {Los Alamitos, Calif.},
  doi = {10.1109/ISM.2006.47},
  url = {https://fis.uni-bamberg.de/handle/uniba/16359},
  language = {deu},
  abstract = {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.},
  keywords = {Efficient Image Retrieval, Peer-to-Peer Networks}
}

@inproceedings{henrich2006_14868,
  title = {Bedeutung des Design for X für die Informationsversorgung von Entwicklern innerhalb des Entwicklungsprozesses},
  author = {Henrich, Andreas and Morgenroth, Karlheinz},
  year = {2006},
  booktitle = {Design for X : Beiträge zum 17. Symposium, Neukirchen, 12. und 13. Oktober 2006},
  pages = {81-102},
  publisher = {Friedrich-Alexander-Universität Erlangen-Nürnberg},
  address = {Erlangen},
  isbn = {978-3-9808539-4-1},
  url = {https://fis.uni-bamberg.de/handle/uniba/14868},
  language = {deu}
}

@inproceedings{eckstein2006_14825,
  title = {Ansätze zur Bestimmung von Locality für deutsche Webseiten},
  author = {Eckstein, Raiko and Henrich, Andreas and Lüdecke, Volker},
  year = {2006},
  booktitle = {LWA 2006 : Lernen – Wissensentdeckung – Adaptivität (9.–11.10.2006 in Hildesheim)},
  pages = {69-76},
  address = {Hildesheim},
  urn = {urn:nbn:de:gbv:hil2-opus-470},
  url = {https://fis.uni-bamberg.de/handle/uniba/14825},
  language = {deu},
  abstract = {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.},
  keywords = {Webseiten}
}

@inproceedings{muller2006_14818,
  title = {Parameters in P2P-IR},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2006},
  booktitle = {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},
  pages = {4-11},
  publisher = {Gesellschaft für Informatik e.V.},
  address = {Bonn},
  series = {GI-Edition : Proceedings},
  isbn = {978-3-88579-187},
  url = {https://fis.uni-bamberg.de/handle/uniba/14818},
  language = {eng},
  abstract = {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.},
  keywords = {Parameter}
}

@article{graf2006_14574,
  title = {Geografisches Information Retrieval},
  author = {Graf, Jens and Henrich, Andreas and Lüdecke, Volker and Schlieder, Christoph},
  year = {2006},
  journal = {Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V.},
  volume = {6},
  number = {18 = Themenschwerpunkt: Multimedia Retrieval},
  pages = {48-56},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {1618-2162},
  url = {https://fis.uni-bamberg.de/handle/uniba/14574},
  language = {deu},
  abstract = {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.},
  keywords = {Geografisches Information Retrieval}
}

@inproceedings{daubner2006_14566,
  title = {Integrierte Softwaremessung durch Verankerung der Softwaremaße an Elementen des Vorgehensmodells},
  author = {Daubner, Bernhard and Henrich, Andreas and Westfechtel, Bernhard},
  year = {2006},
  booktitle = {Software Engineering 2006 : Fachtagung des GI-Fachbereichs Softwaretechnik, 28. - 31. März 2006 in Leipzig},
  pages = {157-162},
  publisher = {Gesellschaft für Informatik e. V.},
  address = {Bonn},
  isbn = {978-3-88579-173-7},
  url = {https://fis.uni-bamberg.de/handle/uniba/14566},
  language = {deu},
  abstract = {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.},
  keywords = {Integrierte Softwaremessung}
}

@inproceedings{daubner2006_14565,
  title = {Towards Anchoring Software Measures on Elements of the Process Model},
  author = {Daubner, Bernhard and Henrich, Andreas and Westfechtel, Bernhard},
  year = {2006},
  booktitle = {Proceedings / VISAPP 2006, First International Conference on Computer Vision Theory and Applications,  Setúbal, Portugal, February 25-28, 2006},
  url = {https://fis.uni-bamberg.de/handle/uniba/14565},
  language = {eng}
}

@inproceedings{henrich2006_14575,
  title = {Virtueller Campus der Uni Bamberg: ein übergreifendes eLearning-System auf Basis von Moodle},
  author = {Henrich, Andreas and Wolf, Sven-Uwe},
  year = {2006},
  booktitle = {E-Learning: Weg von der lokalen Insel zur globalen community : proceedings of the Workshop on E-Learning 2006, HTWK Leipzig, 10. - 11. Juli 2006},
  pages = {18},
  address = {Leipzig},
  url = {https://fis.uni-bamberg.de/handle/uniba/14575},
  language = {deu}
}

@article{henrich2006_14224,
  title = {Exzellente Ideen schneller marktreif : Der Forschungsverbund FORFLOW optimiert IT-Abläufe in der Produktentwicklung},
  author = {Henrich, Andreas and Morgenroth, Karlheinz},
  year = {2006},
  journal = {Uni.vers : das Magazin der Otto-Friedrich-Universität Bamberg},
  volume = {6},
  number = {11 = Wissenstransfer an der Universität Bamberg},
  pages = {10-13},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  issn = {1618-9019},
  url = {https://fis.uni-bamberg.de/handle/uniba/14224},
  language = {deu},
  abstract = {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.},
  keywords = {FORFLOW}
}

@article{eisenhardt2005_14569,
  title = {Inhaltsbasierte Suche in P2P-Systemen},
  author = {Eisenhardt, Martin and Henrich, Andreas and Müller, Wolfgang},
  year = {2005},
  journal = {Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie und Information Retrieval ; Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V.},
  volume = {5},
  number = {12 = Themenschwerpunkt: Web-Suche und Web-Caching},
  pages = {5-15},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {1618-2162},
  url = {https://fis.uni-bamberg.de/handle/uniba/14569},
  language = {deu},
  abstract = {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.},
  keywords = {P2P-Systeme}
}

@inproceedings{muller2005_14571,
  title = {Scalable summary based retrieval in P2P networks},
  author = {Müller, Wolfgang and Eisenhardt, Martin and Henrich, Andreas},
  year = {2005},
  booktitle = {CIKM '05 : Proceedings of the 14th ACM international conference on Information and knowledge management},
  pages = {586-593},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-59593-140-5},
  doi = {10.1145/1099554.1099706},
  url = {https://fis.uni-bamberg.de/handle/uniba/14571},
  language = {deu},
  abstract = {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.},
  keywords = {P2P, Similarity Search, Distributed IR}
}

@incollection{henrich2005_13484,
  title = {Management von Multimediaprojekten},
  author = {Henrich, Andreas},
  year = {2005},
  booktitle = {Taschenbuch der Medieninformatik : mit 39 Tabellen},
  pages = {298-317},
  publisher = {Fachbuchverl. Leipzig im Carl-Hanser-Verl.},
  address = {München u.a.},
  isbn = {978-3-446-40299-7},
  url = {https://fis.uni-bamberg.de/handle/uniba/13484},
  language = {deu},
  abstract = {-},
  keywords = {Multimediaprojekte}
}

@incollection{henrich2005_13438,
  title = {Search Support in Data Management Systems},
  author = {Henrich, Andreas},
  year = {2005},
  booktitle = {Data management in a connected world : essays dedicated to Hartmut Wedekind on the occasion of his 70th birthday},
  pages = {137-157},
  publisher = {Springer},
  address = {Berlin u.a.},
  isbn = {978-3-540-26295-4},
  doi = {10.1007/11499923\_8},
  url = {https://fis.uni-bamberg.de/handle/uniba/13438},
  language = {eng},
  abstract = {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.},
  keywords = {Data Management Systems}
}

@inproceedings{henrich2005_12238,
  title = {Online Kursangebot Information Retrieval - Ein Beispiel für ein Multi- Channel eLearning-Angebot},
  author = {Henrich, Andreas and Morgenroth, Karlheinz},
  year = {2005},
  booktitle = {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},
  pages = {99 - 103},
  publisher = {Czwalina},
  address = {Hamburg},
  series = {Schriften der Deutschen Vereinigung für Sportwissenschaft},
  isbn = {978-3-88020-448-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/12238},
  language = {deu}
}

@book{henrich2004_15106,
  title = {Kontextbasiertes Information Retrieval : Methoden und Anwendungen ; Beiträge des Seminars im Sommersemester 2004 an der Universität Bamberg},
  editor = {Henrich, Andreas and Morgenroth, Karlheinz},
  year = {2004},
  address = {Bamberg},
  isbn = {3-00-015171-0},
  url = {https://fis.uni-bamberg.de/handle/uniba/15106},
  language = {deu},
  abstract = {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.},
  keywords = {Information Retrieval, Data Mining, Suchmaschine, Wissensmanagement}
}

@inproceedings{henrich2004_14824,
  title = {Comparison and Evaluation of Fusion Algorithms and Transfer Semantics for Structured Multimedia Data},
  author = {Henrich, Andreas and Robbert, Günter},
  year = {2004},
  booktitle = {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},
  pages = {181 - 192},
  address = {Wroclaw},
  url = {https://fis.uni-bamberg.de/handle/uniba/14824},
  language = {eng}
}

@inproceedings{muller2004_14663,
  title = {Reducing I/O Cost of Similarity Queries by Processing Several at a Time},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2004},
  booktitle = {Proceedings MDDE '04, 4th International Workshop on Multimedia Data and Document Engineering, Washington, DC, USA, July 2nd 2004. IEEE Computer Society 2004},
  url = {https://fis.uni-bamberg.de/handle/uniba/14663},
  language = {eng}
}

@article{daubner2004_14610,
  title = {Integration of software measurement into the software development environment},
  author = {Daubner, Bernhard and Henrich, Andreas},
  year = {2004},
  journal = {Metrics news : journal of the software metrics community},
  volume = {9},
  number = {1},
  pages = {17-23},
  issn = {1431-8008},
  urn = {urn:nbn:de:gbv:3:2-27404},
  url = {https://fis.uni-bamberg.de/handle/uniba/14610},
  language = {eng}
}

@inproceedings{muller2004_14609,
  title = {Efficient content-based P2P image retrieval using peer content descriptions},
  author = {Müller, Wolfgang and Eisenhardt, Martin and Henrich, Andreas},
  year = {2004},
  booktitle = {Internet Imaging V : Proceedings of Electronic Imaging, Science and Technology 2004},
  pages = {57-68},
  publisher = {SPIE},
  address = {Bellingham, Wash., USA},
  series = {SPIE Proceedings},
  isbn = {0-8194-5207-6},
  issn = {0277-786X},
  doi = {10.1117/12.531184},
  url = {https://fis.uni-bamberg.de/handle/uniba/14609},
  language = {eng},
  abstract = {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.},
  keywords = {P2P}
}

@inproceedings{muller2004_12774,
  title = {Faster exact histogram intersection on large data collections using inverted VA-files},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2004},
  booktitle = {Image and video retrieval : third International Conference, CIVR 2004, Dublin, Ireland, July 21 - 23, 2004 ; proceedings},
  pages = {455-463},
  publisher = {Springer},
  address = {Berlin},
  series = {Lecture notes in computer science},
  isbn = {978-3-540-22539-3},
  doi = {10.1007/978-3-540-27814-6\_54},
  url = {https://fis.uni-bamberg.de/handle/uniba/12774},
  language = {eng},
  abstract = {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.},
  keywords = {histogram intersection, large data collections}
}

@inproceedings{eisenhardt2004_12728,
  title = {Spektrale Bloom-Filter für Peer-to-Peer Information Retrieval},
  author = {Eisenhardt, Martin and Müller, Wolfgang and Henrich, Andreas},
  year = {2004},
  booktitle = {Informatik 2004 : Informatik verbindet ; Beiträge der 34. Jahrestagung der Gesellschaft für Informatik e.V. (GI) ; Ulm, 20. -  24. September 2004},
  pages = {44 - 48},
  publisher = {Gesellschaft für Informatik e.V.},
  address = {Bonn},
  isbn = {3-88579-380-6},
  url = {https://fis.uni-bamberg.de/handle/uniba/12728},
  language = {deu},
  abstract = {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.},
  keywords = {Spektrale Bloom-Filter}
}

@inproceedings{henrich2004_11989,
  title = {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},
  author = {Henrich, Andreas},
  year = {2004},
  booktitle = {Tagungsband zum 16. GI-Workshop über Grundlagen von Datenbanken (16th GI-Workshop on the Foundations of Databases)},
  address = {Monheim},
  url = {https://fis.uni-bamberg.de/handle/uniba/11989},
  language = {deu}
}

@inproceedings{guler2004_11952,
  title = {Proceedings MDDE '04, IEEE Computer Society : 4th International Workshop on Multimedia Data and Document Engineering},
  editor = {Guler, Sadiye and Hauptmann, Alexander G. and Henrich, Andreas},
  year = {2004},
  address = {Washington, DC},
  url = {https://fis.uni-bamberg.de/handle/uniba/11952},
  language = {eng}
}

@book{henrich2004_91,
  title = {Kontextbasiertes Information Retrieval : Methoden und Anwendungen : Beiträge des Seminars im Sommersemester 2004 an der Universität Bamberg},
  editor = {Henrich, Andreas and Morgenroth, Karlheinz},
  year = {2004},
  publisher = {opus},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-opus-892},
  url = {https://fis.uni-bamberg.de/handle/uniba/91},
  language = {deu},
  abstract = {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.},
  keywords = {Information Retrieval, Data Mining, Suchmaschine, Wissensmanagement}
}

@inproceedings{muller2003_14659,
  title = {Fast Retrieval of High-Dimensional Feature Vectors in P2P Networks Using Compact Peer Data Summaries},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2003},
  booktitle = {MIR '03 : Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval},
  pages = {79–86},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-58113-778-1},
  doi = {10.1145/973264.973278},
  url = {https://fis.uni-bamberg.de/handle/uniba/14659},
  language = {deu},
  abstract = {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.},
  keywords = {Algorithms, Performance}
}

@misc{henrich2003_14648,
  title = {An Approach to Transfer Rankings when Searching on Structured Data : Abstract for a talk on the Dagstuhl Seminar No 03112},
  author = {Henrich, Andreas},
  year = {2003},
  booktitle = {Dagstuhl Seminar No 03112, Perspectives Workshop: "Multimedia Retrieval", March 2003 Seminar Nº 03112,10.03.-13.03. 2003},
  url = {https://fis.uni-bamberg.de/handle/uniba/14648},
  language = {eng}
}

@inproceedings{henrich2003_14652,
  title = {Applying the IRStream Retrieval Engine to INEX 2003},
  author = {Henrich, Andreas and Lüdecke, Volker and Robbert, Günter},
  year = {2003},
  booktitle = {INEX 2003 Workshop Proceedings},
  pages = {118 - 125},
  url = {https://fis.uni-bamberg.de/handle/uniba/14652},
  language = {eng}
}

@inproceedings{muller2003_14612,
  title = {Comparing the performance of two CBIRS indexing schemes},
  author = {Müller, Wolfgang and Robbert, Günter and Henrich, Andreas},
  year = {2003},
  booktitle = {Internet Imaging IV : Proceedings of Electronic Imaging, Science and Technology 2003},
  pages = {9-20},
  publisher = {SPIE},
  address = {Bellingham, Wash., USA},
  series = {SPIE Proceedings},
  isbn = {0-8194-4818-4},
  issn = {0277-786X},
  doi = {10.1117/12.473372},
  url = {https://fis.uni-bamberg.de/handle/uniba/14612},
  language = {eng},
  abstract = {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.},
  keywords = {CBIRS indexing schemes}
}

@inproceedings{henrich2003_14617,
  title = {Ein Ansatz zur Übertragung von Rangordnungen bei der Suche auf strukturierten Daten},
  author = {Henrich, Andreas and Robbert, Günter},
  year = {2003},
  booktitle = {Datenbanksysteme für Business, Technologie und Web (BTW) : 10. GI-Fachtagung, Leipzig, 26. - 28. Februar 2003},
  publisher = {Gesellschaft für Informatik e. V.},
  address = {Bonn},
  isbn = {3-88579-355-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/14617},
  language = {deu},
  abstract = {Ä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.},
  keywords = {strukturierte Daten}
}

@inproceedings{daubner2003_14616,
  title = {Ein Plädoyer für Datenflussdiagramme aus der Sicht der Aufwandsschätzung und der agilen Softwareentwicklung},
  author = {Daubner, Bernhard and Henrich, Andreas},
  year = {2003},
  booktitle = {Innovative Informatikanwendungen : 33. Jahrestagung der Gesellschaft für Informatik e.v. (GI) ; 29. September - 2. Oktober in Frankfurt am Main},
  pages = {191-195},
  publisher = {Gesellschaft für Informatik e. V.},
  address = {Bonn},
  isbn = {978-3-88579-363-2},
  url = {https://fis.uni-bamberg.de/handle/uniba/14616},
  language = {deu},
  abstract = {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.},
  keywords = {Datenflussdiagramm}
}

@inproceedings{muller2003_14613,
  title = {Privacy of Ideas in P2P Networks},
  author = {Müller, Wolfgang and Henrich, Andreas},
  year = {2003},
  booktitle = {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)},
  url = {https://fis.uni-bamberg.de/handle/uniba/14613},
  language = {deu}
}

@inproceedings{henrich2003_14621,
  title = {RSV-Transfer: An Algorithm for Similarity Queries on Structured Documents},
  author = {Henrich, Andreas and Robbert, Günter},
  year = {2003},
  booktitle = {MIS 2003 : 9th International Workshop on Multimedia Information Systems, May 26- 28, 2003, Ischia, Italy ; Proceedings},
  pages = {65 - 74},
  url = {https://fis.uni-bamberg.de/handle/uniba/14621},
  language = {eng}
}

@inproceedings{henrich2003_14620,
  title = {Supporting Collaborative Software Development by Context-Aware Information Retrieval Facilities},
  author = {Henrich, Andreas and Morgenroth, Karlheinz},
  year = {2003},
  booktitle = {14th International Workshop on Database and Expert Systems Applications, 2003 : Proceedings},
  pages = {249-253},
  publisher = {IEEE},
  address = {New York},
  isbn = {0-7695-1993-8},
  doi = {10.1109/DEXA.2003.1232031},
  url = {https://fis.uni-bamberg.de/handle/uniba/14620},
  language = {eng},
  abstract = {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.},
  keywords = {Collaborative Software Development}
}

@inproceedings{henrich2003_14601,
  title = {A Graphical User Interface for Complex Similarity Queries on Structured Multimedia Documents},
  author = {Henrich, Andreas and Robbert, Günter},
  year = {2003},
  booktitle = {International Workshop on Multimedia Data and Document Engineering < 3, 2003, Berlin>: Proceedings},
  url = {https://fis.uni-bamberg.de/handle/uniba/14601},
  language = {eng}
}

@book{eisenhardt2003_14605,
  title = {Classifying Documents by Distributed P2P Clustering},
  author = {Eisenhardt, Martin and Müller, Wolfgang and Henrich, Andreas},
  year = {2003},
  address = {Bamberg},
  url = {https://fis.uni-bamberg.de/handle/uniba/14605},
  language = {eng}
}

@article{berthold2002_14643,
  title = {Architektur Multimedialer Informationssysteme},
  author = {Berthold, Henrike and Binkowski, Frank and Henrich, Andreas and Hollfelder, Silvia and Lindner, Wolfgang and Marder, Ulrich and Meyer-Wegener, Klaus and Robbert, Günter},
  year = {2002},
  journal = {Informatik, Forschung und Entwicklung : Organ der Fachbereiche Softwaretechnik, Datenbanken und Informationssysteme sowie Mensch-Computer-Interaktion der Gesellschaft für Informatik e.V.},
  volume = {17},
  number = {2},
  pages = {77-89},
  publisher = {Springer},
  address = {Berlin ; Heidelberg ; New York},
  issn = {0949-2925},
  doi = {10.1007/s00450-002-0101-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/14643},
  language = {deu},
  abstract = {-},
  keywords = {Multimediale Informationssysteme}
}

@inproceedings{henrich2002_14598,
  title = {A Relaxed Algorithm for Similarity Queries Performed with High-Dimensional Access Structures},
  author = {Henrich, Andreas},
  year = {2002},
  booktitle = {XML-Based Data Management and Multimedia Engineering : EDBT 2002 Workshops ; revised papers},
  pages = {376–390},
  publisher = {Springer},
  address = {Berlin u.a.},
  series = {Lecture notes in computer science},
  doi = {10.1007/3-540-36128-6\_22},
  url = {https://fis.uni-bamberg.de/handle/uniba/14598},
  language = {eng},
  abstract = {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.},
  keywords = {Relaxed Algorithm}
}

@inproceedings{henrich2002_14607,
  title = {Applying the IRstream Retrieval Engine for Structured Documents to INEX},
  author = {Henrich, Andreas and Robbert, Günter},
  year = {2002},
  booktitle = {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},
  pages = {105 - 110},
  url = {https://fis.uni-bamberg.de/handle/uniba/14607},
  language = {eng}
}

@inproceedings{henrich2002_14597,
  title = {Integration von kontextunterstütztem Information Retrieval in Portalsysteme},
  author = {Henrich, Andreas and Morgenroth, Karlheinz},
  year = {2002},
  booktitle = {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},
  address = {Aschaffenburg},
  isbn = {978-3-9808791-0-1},
  url = {https://fis.uni-bamberg.de/handle/uniba/14597},
  language = {deu}
}

@inproceedings{eisenhardt2002_14603,
  title = {Probleme und Lösungsansätze für P2P-IR-Systeme},
  author = {Eisenhardt, Martin and Henrich, Andreas},
  year = {2002},
  booktitle = {Informatik bewegt : Informatik 2002 ; 32. Jahrestagung der Gesellschaft für Informatik e.V. (GI) ; 30. Sept. - 3. Okt. 2002 in Dortmund},
  pages = {171 - 175},
  publisher = {Gesellschaft für Informatik e.V.},
  address = {Bonn},
  series = {GI- Edition : Proceedings},
  isbn = {3-88579-348-2},
  url = {https://fis.uni-bamberg.de/handle/uniba/14603},
  language = {deu},
  abstract = {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.},
  keywords = {P2P-IR-Systeme}
}

@inproceedings{henrich2001_14587,
  title = {An End User Retrieval Interface for Structured Multimedia Documents},
  author = {Henrich, Andreas and Robbert, Günter},
  year = {2001},
  booktitle = {Proceedings of 7. workshop Multimedia information systems : MIS ' 01 : 7 - 9 November 2001 Villa Orlandi - Capri - Italy},
  pages = {71-80},
  address = {Napoli},
  url = {https://fis.uni-bamberg.de/handle/uniba/14587},
  language = {eng}
}

@inproceedings{haase2001_14593,
  title = {Exposing the Vagueness of Query Results on Partly Inaccessible Databases},
  author = {Haase, Oliver and Henrich, Andreas},
  year = {2001},
  booktitle = {CIKM '01 : Proceedings of the tenth international conference on Information and knowledge management},
  pages = {49-56},
  publisher = {ACM},
  address = {New York},
  isbn = {978-1-58113-436-0},
  doi = {10.1145/502585.502595},
  url = {https://fis.uni-bamberg.de/handle/uniba/14593},
  language = {eng},
  abstract = {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.},
  keywords = {Query Processing, Inaccessibility, Vagueness}
}

@inproceedings{henrich2001_14599,
  title = {POQLMM : A Query Language for Structured Multimedia Documents},
  author = {Henrich, Andreas and Robbert, Günter},
  year = {2001},
  booktitle = {MDDE'01 : Multimedia Data and Document Engineering ; Proceedings of the First International Workshop on Multimedia Data and Document Engineering, Lyon, France, July 4, 2001},
  address = {Lyon},
  series = {CEUR workshop proceedings},
  url = {https://fis.uni-bamberg.de/handle/uniba/14599},
  language = {eng},
  abstract = {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.},
  keywords = {structured multimedia documents, query language}
}

@inproceedings{henrich2000_14584,
  title = {Combining Multimedia Retrieval and Text Retrieval to Search Structured Documents in Digital Libraries},
  author = {Henrich, Andreas and Robbert, Günter},
  year = {2000},
  booktitle = {ERCIM Workshop Reports:  First DELOS Network of Excellence Workshop: Information Seeking, Searching and Querying in Digital Libraries Zurich, 11-12 December 2000},
  url = {https://fis.uni-bamberg.de/handle/uniba/14584},
  language = {eng}
}

@inproceedings{henrich2000_14586,
  title = {MARS: A Retrieval Service for Multimedia Authoring Environments},
  author = {Henrich, Andreas and Robbert, Günter},
  year = {2000},
  booktitle = {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},
  pages = {88 - 98},
  publisher = {Matfyzpress},
  address = {Prag},
  url = {https://fis.uni-bamberg.de/handle/uniba/14586},
  language = {eng}
}

@article{haase2000_6715,
  title = {A hybrid representation of vague collections for distributed object management systems},
  author = {Haase, Oliver and Henrich, Andreas},
  year = {2000},
  journal = {IEEE transactions on knowledge and data engineering : a publication of the IEEE Computer Society},
  volume = {12},
  number = {3},
  pages = {448-467},
  publisher = {IEEE},
  address = {New York},
  issn = {1041-4347},
  doi = {10.1109/69.846295},
  url = {https://fis.uni-bamberg.de/handle/uniba/6715},
  language = {eng},
  abstract = {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.},
  keywords = {distributed systems, distributed databases, query processing, query languages, vagueness, inaccessibility}
}

@inproceedings{haase1999_36031,
  title = {A closed approach to vague collections in partly inaccessible distributed databases},
  author = {Haase, Oliver and Henrich, Andreas},
  year = {1999},
  booktitle = {Advances in databases and information systems : third East European conference, ADBIS '99, Maribor, Slovenia, September 13 - 16, 1999 ; proceedings},
  pages = {261-274},
  publisher = {Springer},
  address = {Berlin u.a.},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-540-66485-7},
  doi = {10.1007/3-540-48252-0\_20},
  url = {https://fis.uni-bamberg.de/handle/uniba/36031},
  language = {eng},
  abstract = {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.},
  keywords = {distributed databases}
}

@inproceedings{henrich1999_36047,
  title = {On the optimization of queries containing regular path expressions},
  author = {Henrich, Andreas and Jamin, Stefan},
  year = {1999},
  booktitle = {Next generation information technologies and systems :  4th international workshop, NGITS '99, Zikhron-Yaakov, Israel, July 5 - 7, 1999 ; proceedings},
  pages = {58-75},
  publisher = {Springer},
  address = {Berlin u.a.},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-540-66225-9},
  doi = {10.1007/3-540-48521-X\_6},
  url = {https://fis.uni-bamberg.de/handle/uniba/36047},
  language = {eng},
  abstract = {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.},
  keywords = {regular path expressions}
}

@book{henrich1999_35609,
  title = {On the optimization of queries containing regular path expressions},
  author = {Henrich, Andreas and Jamin, Stefan},
  year = {1999},
  publisher = {Otto-Friedrich-Univ.},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik},
  url = {https://fis.uni-bamberg.de/handle/uniba/35609},
  language = {eng}
}

@techreport{haase1999_35585,
  title = {A closed approach to vague collections in partly inaccessible distributed databases},
  author = {Haase, Oliver and Henrich, Andreas},
  year = {1999},
  publisher = {Otto-Friedrich-Univ.},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik},
  url = {https://fis.uni-bamberg.de/handle/uniba/35585},
  language = {deu}
}

@article{henrich1998_36061,
  title = {Reactive environments},
  author = {Henrich, Andreas},
  year = {1998},
  journal = {Wirtschaftsinformatik : WI},
  volume = {40},
  number = {6},
  pages = {538-540},
  publisher = {Springer Gabler},
  address = {Wiesbaden},
  issn = {0937-6429},
  url = {https://fis.uni-bamberg.de/handle/uniba/36061},
  language = {deu},
  abstract = {-},
  keywords = {Reactive environments}
}

@inproceedings{henrich1998_36035,
  title = {The LSDh-Tree : an access structure for feature vectors},
  author = {Henrich, Andreas},
  year = {1998},
  booktitle = {Proceedings 14th International Conference on Data Engineering},
  pages = {362-369},
  publisher = {IEEE},
  address = {Los Alamitos, Calif. u.a.},
  isbn = {0-8186-8289-2},
  doi = {10.1109/ICDE.1998.655799},
  url = {https://fis.uni-bamberg.de/handle/uniba/36035},
  language = {eng},
  abstract = {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.},
  keywords = {LSDh-Tree}
}

@inproceedings{henrich1998_36025,
  title = {Applying document retrieval techniques in software engineering environments},
  author = {Henrich, Andreas},
  year = {1998},
  booktitle = {Database and expert systems applications : 9th international conference, DEXA '98, Vienna, Austria, August 24 - 28,  1998 ; proceedings},
  pages = {240-249},
  publisher = {Springer},
  address = {Berlin u.a.},
  series = {Lecture notes in computer science},
  isbn = {978-3-540-64950-2},
  doi = {10.1007/BFb0054485},
  url = {https://fis.uni-bamberg.de/handle/uniba/36025},
  language = {eng},
  abstract = {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.},
  keywords = {document retrieval techniques}
}

@techreport{henrich1998_35612,
  title = {Applying document retrieval techniques in software engineering environments},
  author = {Henrich, Andreas},
  year = {1998},
  publisher = {Otto-Friedrich-Univ.},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik},
  url = {https://fis.uni-bamberg.de/handle/uniba/35612},
  language = {deu}
}

@book{haase1998_35586,
  title = {A hybrid representation of vague collections for distributed object management systems},
  author = {Haase, Oliver and Henrich, Andreas},
  year = {1998},
  publisher = {Otto-Friedrich-Univ.},
  address = {Bamberg},
  series = {Bamberger Beiträge zur Wirtschaftsinformatik},
  url = {https://fis.uni-bamberg.de/handle/uniba/35586},
  language = {eng}
}

@misc{henrich1998_34997,
  title = {Retrieval-Dienste für Software-Entwicklungsumgebungen},
  author = {Henrich, Andreas},
  year = {1998},
  publisher = {Shaker},
  address = {Aachen},
  series = {Berichte aus der Informatik},
  url = {https://fis.uni-bamberg.de/handle/uniba/34997},
  language = {other}
}

@inproceedings{henrich1997_36054,
  title = {A common access structure for standard attributes and document representations in vector space},
  author = {Henrich, Andreas},
  year = {1997},
  booktitle = {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},
  pages = {154 - 161},
  url = {https://fis.uni-bamberg.de/handle/uniba/36054},
  language = {eng}
}

@inproceedings{henrich1997_36065,
  title = {Retrieval-Dienste für Software-Entwicklungsumgebungen},
  author = {Henrich, Andreas},
  year = {1997},
  booktitle = {Software-Management '97 : Fachtagung der Gesellschaft für Informatik e. V. (GI), Oktober 1997 in München},
  pages = {147-162},
  publisher = {Teubner},
  address = {Stuttgart ; Leipzig},
  isbn = {978-3-8154-2603-6},
  doi = {10.1007/978-3-322-85166-6\_10},
  url = {https://fis.uni-bamberg.de/handle/uniba/36065},
  language = {deu},
  abstract = {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.},
  keywords = {Retrieval-Dienste}
}

@inproceedings{haase1997_36040,
  title = {Query processing techniques for partly inaccessible distributed databases},
  author = {Haase, Oliver and Henrich, Andreas},
  year = {1997},
  booktitle = {Advances in databases : 15th British National Conference on Databases, BNCOD 15, London, United Kingdom, July 7 - 9, 1997 ; proceedings},
  pages = {123-125},
  publisher = {Springer},
  address = {Berlin u.a.},
  series = {Lecture notes in computer science},
  isbn = {978-3-540-63263-4},
  doi = {10.1007/3-540-63263-8\_11},
  url = {https://fis.uni-bamberg.de/handle/uniba/36040},
  language = {eng},
  abstract = {-},
  keywords = {Query processing techniques}
}

@inproceedings{henrich1997_36029,
  title = {Repository based software cost estimation},
  author = {Henrich, Andreas},
  year = {1997},
  booktitle = {Database and expert systems applications : 8th international conference, DEXA '97, Toulouse, France, September 1 - 5, 1997 ; proceedings},
  pages = {653-662},
  publisher = {Springer},
  address = {Berlin u.a.},
  series = {Lecture notes in computer science},
  isbn = {978-3-540-63478-2},
  doi = {10.1007/BFb0022073},
  url = {https://fis.uni-bamberg.de/handle/uniba/36029},
  language = {eng},
  abstract = {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.},
  keywords = {Repository}
}

@inproceedings{henrich1997_36051,
  title = {The update of index structures in object-oriented DBMS},
  author = {Henrich, Andreas},
  year = {1997},
  booktitle = {CIKM '97 : Proceedings of the sixth international conference on Information and knowledge management},
  pages = {136-143},
  publisher = {ACM},
  address = {New York},
  isbn = {978-0-89791-970-8},
  doi = {10.1145/266714.266883},
  url = {https://fis.uni-bamberg.de/handle/uniba/36051},
  language = {eng},
  abstract = {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},
  keywords = {index structures}
}

@inproceedings{henrich1996_36069,
  title = {A hybrid split strategy for k-d-tree based access structures},
  author = {Henrich, Andreas},
  year = {1996},
  booktitle = {GIS '96 : Proceedings of the 4th ACM international workshop on Advances in geographic information systems},
  pages = {1-8},
  publisher = {ACM},
  address = {New York},
  isbn = {978-0-89791-874-9},
  doi = {10.1145/258319.258323},
  url = {https://fis.uni-bamberg.de/handle/uniba/36069},
  language = {eng},
  abstract = {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.},
  keywords = {hybrid split strategy}
}

@inproceedings{henrich1996_36073,
  title = {Document retrieval facilities for repository-based system development environments},
  author = {Henrich, Andreas},
  year = {1996},
  booktitle = {SIGIR '96 : Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval},
  pages = {101-109},
  publisher = {ACM},
  address = {New York},
  isbn = {978-0-89791-792-6},
  doi = {10.1145/243199.243237},
  url = {https://fis.uni-bamberg.de/handle/uniba/36073},
  language = {eng},
  abstract = {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.},
  keywords = {Document retrieval facilities}
}

@inproceedings{henrich1996_36058,
  title = {Using a query language to state consistency constraints for repositories},
  author = {Henrich, Andreas and Däberitz, Dirk},
  year = {1996},
  booktitle = {Database and expert systems applications : 7th international conference, DEXA '96, Zurich, Switzerland, September 9 - 13, 1996 ; proceedings},
  pages = {59-68},
  publisher = {Springer},
  address = {Berlin u. a.},
  series = {Lecture notes in computer science},
  isbn = {978-3-540-61656-6},
  doi = {10.1007/BFb0034670},
  url = {https://fis.uni-bamberg.de/handle/uniba/36058},
  language = {eng},
  abstract = {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.},
  keywords = {query language}
}

@inproceedings{henrich1996_36034,
  title = {Adapting a spatial access structure for document representations in vector space},
  author = {Henrich, Andreas},
  year = {1996},
  booktitle = {CIKM '96 : Proceedings of the fifth international conference on Information and knowledge management},
  pages = {19-26},
  publisher = {ACM},
  address = {New York u.a.},
  isbn = {978-0-89791-873-2},
  doi = {10.1145/238355.238367},
  url = {https://fis.uni-bamberg.de/handle/uniba/36034},
  language = {eng},
  abstract = {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.},
  keywords = {spatial access structure}
}

@inproceedings{henrich1996_36037,
  title = {Improving the performance of multi-dimensional access structures based on k-d-Trees},
  author = {Henrich, Andreas},
  year = {1996},
  booktitle = {Proceedings of the Twelfth International Conference on Data Engineering : February 26 - March 1, 1996, New Orleans, Louisiana (ICDE '96)},
  pages = {68-75},
  publisher = {IEEE},
  address = {Los Alamitos, Calif. u.a.},
  doi = {10.1109/ICDE.1996.492090},
  url = {https://fis.uni-bamberg.de/handle/uniba/36037},
  language = {eng},
  abstract = {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.},
  keywords = {k-d-Trees}
}

@incollection{henrich1996_36044,
  title = {Integration von Zugriffsparadigmen in einem Repository},
  author = {Henrich, Andreas and Kelter, Udo},
  year = {1996},
  booktitle = {Beherrschung von Informationssystemen : Tagungsband der Informatik '96},
  pages = {307-326},
  publisher = {Oldenbourg},
  address = {München},
  isbn = {3-486-23822-1},
  url = {https://fis.uni-bamberg.de/handle/uniba/36044},
  language = {deu}
}

@inproceedings{henrich1990_58918,
  title = {Paging binary trees with external balancing},
  author = {Henrich, Andreas and Six, Hans-Werner and Widmayer, Peter},
  year = {1990},
  booktitle = {Graph-theoretic concepts in computer science : 15th Internat. Workshop WG '89 Castle Rolduc, The Netherlands, June 14 - 16, 1989 ; proceedings},
  pages = {260-276},
  publisher = {Springer},
  address = {Berlin u.a.},
  isbn = {978-3-540-52292-8},
  url = {https://fis.uni-bamberg.de/handle/uniba/58918},
  language = {eng},
  abstract = {-},
  keywords = {Gewichteter Binärbaum}
}

@phdthesis{henrich1990_36021,
  title = {Der LSD-Baum : eine mehrdimensionale Zugriffsstruktur und ihre Einsatzmoglichkeiten in Datenbanksystemen},
  author = {Henrich, Andreas},
  year = {1990},
  url = {https://fis.uni-bamberg.de/handle/uniba/36021},
  language = {deu},
  school = {Otto-Friedrich-Universität Bamberg}
}

@inproceedings{henrich1989_58915,
  title = {The LSD tree : spatial access to multidimensional point and non-point objects},
  author = {Henrich, Andreas and Six, Hans-Werner and Widmayer, Peter},
  year = {1989},
  booktitle = {Proceedings of the fifteenth International Conference on Very Large Data Bases : August 22-25, 1989, Amsterdam, The Netherlands},
  pages = {45-53},
  publisher = {Morgan Kaufmann Publishers},
  address = {San Francisco},
  isbn = {1-55860-101-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/58915},
  language = {eng},
  abstract = {-},
  keywords = {Entscheidungsbaum}
}

