@article{FischerHarteltPuppe2023,
  author    = {Fischer, Norbert and Hartelt, Alexander and Puppe, Frank},
  title     = {Line-level layout recognition of historical documents with background knowledge},
  series = {Algorithms},
  volume    = {16},
  journal   = {Algorithms},
  number    = {3},
  issn      = {1999-4893},
  doi       = {10.3390/a16030136},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-310938},
  year      = {2023},
  abstract  = {Digitization and transcription of historic documents offer new research opportunities for humanists and are the topics of many edition projects. However, manual work is still required for the main phases of layout recognition and the subsequent optical character recognition (OCR) of early printed documents. This paper describes and evaluates how deep learning approaches recognize text lines and can be extended to layout recognition using background knowledge. The evaluation was performed on five corpora of early prints from the 15th and 16th Centuries, representing a variety of layout features. While the main text with standard layouts could be recognized in the correct reading order with a precision and recall of up to 99.9\%, also complex layouts were recognized at a rate as high as 90\% by using background knowledge, the full potential of which was revealed if many pages of the same source were transcribed.},
  language  = {en}
}
@article{FisselerMuellerWeichert2017,
  author    = {Fisseler, Denis and M{\"u}ller, Gerfrid G. W. and Weichert, Frank},
  title     = {Web-Based scientific exploration and analysis of 3D scanned cuneiform datasets for collaborative research},
  series = {Informatics},
  volume    = {4},
  journal   = {Informatics},
  number    = {4},
  issn      = {2227-9709},
  doi       = {10.3390/informatics4040044},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-197958},
  pages     = {44},
  year      = {2017},
  abstract  = {The three-dimensional cuneiform script is one of the oldest known writing systems and a central object of research in Ancient Near Eastern Studies and Hittitology. An important step towards the understanding of the cuneiform script is the provision of opportunities and tools for joint analysis. This paper presents an approach that contributes to this challenge: a collaborative compatible web-based scientific exploration and analysis of 3D scanned cuneiform fragments. The WebGL -based concept incorporates methods for compressed web-based content delivery of large 3D datasets and high quality visualization. To maximize accessibility and to promote acceptance of 3D techniques in the field of Hittitology, the introduced concept is integrated into the Hethitologie-Portal Mainz, an established leading online research resource in the field of Hittitology, which until now exclusively included 2D content. The paper shows that increasing the availability of 3D scanned archaeological data through a web-based interface can provide significant scientific value while at the same time finding a trade-off between copyright induced restrictions and scientific usability.},
  language  = {en}
}
@phdthesis{Fleszar2018,
  author    = {Fleszar, Krzysztof},
  title     = {Network-Design Problems in Graphs and on the Plane},
  edition   = {1. Auflage},
  publisher = {W{\"u}rzburg University Press},
  address   = {W{\"u}rzburg},
  isbn      = {978-3-95826-076-4 (Print)},
  doi       = {10.25972/WUP-978-3-95826-077-1},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-154904},
  school      = {W{\"u}rzburg University Press},
  pages     = {xi, 204},
  year      = {2018},
  abstract  = {A network design problem defines an infinite set whose elements, called instances, describe relationships and network constraints. It asks for an algorithm that, given an instance of this set, designs a network that respects the given constraints and at the same time optimizes some given criterion. In my thesis, I develop algorithms whose solutions are optimum or close to an optimum value within some guaranteed bound. I also examine the computational complexity of these problems. Problems from two vast areas are considered: graphs and the Euclidean plane. In the Maximum Edge Disjoint Paths problem, we are given a graph and a subset of vertex pairs that are called terminal pairs. We are asked for a set of paths where the endpoints of each path form a terminal pair. The constraint is that any two paths share at most one inner vertex. The optimization criterion is to maximize the cardinality of the set. In the hard-capacitated k-Facility Location problem, we are given an integer k and a complete graph where the distances obey a given metric and where each node has two numerical values: a capacity and an opening cost. We are asked for a subset of k nodes, called facilities, and an assignment of all the nodes, called clients, to the facilities. The constraint is that the number of clients assigned to a facility cannot exceed the facility's capacity value. The optimization criterion is to minimize the total cost which consists of the total opening cost of the facilities and the total distance between the clients and the facilities they are assigned to. In the Stabbing problem, we are given a set of axis-aligned rectangles in the plane. We are asked for a set of horizontal line segments such that, for every rectangle, there is a line segment crossing its left and right edge. The optimization criterion is to minimize the total length of the line segments. In the k-Colored Non-Crossing Euclidean Steiner Forest problem, we are given an integer k and a finite set of points in the plane where each point has one of k colors. For every color, we are asked for a drawing that connects all the points of the same color. The constraint is that drawings of different colors are not allowed to cross each other. The optimization criterion is to minimize the total length of the drawings. In the Minimum Rectilinear Polygon for Given Angle Sequence problem, we are given an angle sequence of left (+90°) turns and right (-90°) turns. We are asked for an axis-parallel simple polygon where the angles of the vertices yield the given sequence when walking around the polygon in counter-clockwise manner. The optimization criteria considered are to minimize the perimeter, the area, and the size of the axis-parallel bounding box of the polygon.},
  subject      = {Euklidische Ebene},
  language  = {en}
}
@phdthesis{Freiberg2015,
  author    = {Freiberg, Martina},
  title     = {UI-, User-, \& Usability-Oriented Engineering of Participative Knowledge-Based Systems},
  publisher = {W{\"u}rzburg University Press},
  isbn      = {978-3-95826-012-2 (print)},
  doi       = {10.25972/WUP-978-3-95826-013-9},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-106072},
  school      = {W{\"u}rzburg University Press},
  pages     = {232},
  year      = {2015},
  abstract  = {Knowledge-based systems (KBS) face an ever-increasing interest in various disciplines and contexts. Yet, the former aim to construct the 'perfect intelligent software' continuously shifts to user-centered, participative solutions. Such systems enable users to contribute their personal knowledge to the problem solving process for increased efficiency and an ameliorated user experience. More precisely, we define non-functional key requirements of participative KBS as: Transparency (encompassing KBS status mediation), configurability (user adaptability, degree of user control/exploration), quality of the KB and UI, and evolvability (enabling the KBS to grow mature with their users). Many of those requirements depend on the respective target users, thus calling for a more user-centered development. Often, also highly expertise domains are targeted — inducing highly complex KBs — which requires a more careful and considerate UI/interaction design. Still, current KBS engineering (KBSE) approaches mostly focus on knowledge acquisition (KA) This often leads to non-optimal, little reusable, and non/little evaluated KBS front-end solutions. In this thesis we propose a more encompassing KBSE approach. Due to the strong mutual influences between KB and UI, we suggest a novel form of intertwined UI and KB development. We base the approach on three core components for encompassing KBSE: (1) Extensible prototyping, a tailored form of evolutionary prototyping; this builds on mature UI prototypes and offers two extension steps for the anytime creation of core KBS prototypes (KB + core UI) and fully productive KBS (core KBS prototype + common framing functionality). (2) KBS UI patterns, that define reusable solutions for the core KBS UI/interaction; we provide a basic collection of such patterns in this work. (3) Suitable usability instruments for the assessment of the KBS artifacts. Therewith, we do not strive for 'yet another' self-contained KBS engineering methodology. Rather, we motivate to extend existing approaches by the proposed key components. We demonstrate this based on an agile KBSE model. For practical support, we introduce the tailored KBSE tool ProKEt. ProKEt offers a basic selection of KBS core UI patterns and corresponding configuration options out of the box; their further adaption/extension is possible on various levels of expertise. For practical usability support, ProKEt offers facilities for quantitative and qualitative data collection. ProKEt explicitly fosters the suggested, intertwined development of UI and KB. For seamlessly integrating KA activities, it provides extension points for two selected external KA tools: For KnowOF, a standard office based KA environment. And for KnowWE, a semantic wiki for collaborative KA. Therewith, ProKEt offers powerful support for encompassing, user-centered KBSE. Finally, based on the approach and the tool, we also developed a novel KBS type: Clarification KBS as a mashup of consultation and justification KBS modules. Those denote a specifically suitable realization for participative KBS in highly expertise contexts and consequently require a specific design. In this thesis, apart from more common UI solutions, we particularly also introduce KBS UI patterns especially tailored towards Clarification KBS.},
  subject      = {Wissensbasiertes System},
  language  = {en}
}
@techreport{FundaKonheiserGermanetal.2023,
  type      = {Working Paper},
  author    = {Funda, Christoph and Konheiser, Tobias and German, Reinhard and Hielscher, Kai-Steffen},
  title     = {How to Model and Predict the Scalability of a Hardware-In-The-Loop Test Bench for Data Re-Injection?},
  series = {KuVS Fachgespr{\"a}ch - W{\"u}rzburg Workshop on Modeling, Analysis and Simulation of Next-Generation Communication Networks 2023 (WueWoWAS'23)},
  journal   = {KuVS Fachgespr{\"a}ch - W{\"u}rzburg Workshop on Modeling, Analysis and Simulation of Next-Generation Communication Networks 2023 (WueWoWAS'23)},
  doi       = {10.25972/OPUS-32215},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-322150},
  pages     = {4},
  year      = {2023},
  abstract  = {This paper describes a novel application of an empirical network calculus model based on measurements of a hardware-in-the-loop (HIL) test system. The aim is to predict the performance of a HIL test bench for open-loop re-injection in the context of scalability. HIL test benches are distributed computer systems including software, hardware, and networking devices. They are used to validate complex technical systems, but have not yet been system under study themselves. Our approach is to use measurements from the HIL system to create an empirical model for arrival and service curves. We predict the performance and design the previously unknown parameters of the HIL simulator with network calculus (NC), namely the buffer sizes and the minimum needed pre-buffer time for the playback buffer. We furthermore show, that it is possible to estimate the CPU load from arrival and service-curves based on the utilization theorem, and hence estimate the scalability of the HIL system in the context of the number of sensor streams.},
  language  = {en}
}
@techreport{FundaMarinGarciaGermanetal.2023,
  type      = {Working Paper},
  author    = {Funda, Christoph and Mar{\´i}n Garc{\´i}a, Pablo and German, Reinhard and Hielscher, Kai-Steffen},
  title     = {Online Algorithm for Arrival \& Service Curve Estimation},
  series = {KuVS Fachgespr{\"a}ch - W{\"u}rzburg Workshop on Modeling, Analysis and Simulation of Next-Generation Communication Networks 2023 (WueWoWAS'23)},
  journal   = {KuVS Fachgespr{\"a}ch - W{\"u}rzburg Workshop on Modeling, Analysis and Simulation of Next-Generation Communication Networks 2023 (WueWoWAS'23)},
  doi       = {10.25972/OPUS-32211},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-322112},
  pages     = {5},
  year      = {2023},
  abstract  = {This paper presents a novel concept to extend state-of-the-art buffer monitoring with additional measures to estimate service-curves. The online algorithm for service-curve estimation replaces the state-of-the-art timestamp logging, as we expect it to overcome the main disadvantages of generating a huge amount of data and using a lot of CPU resources to store the data to a file during operation. We prove the accuracy of the online-algorithm offline with timestamp data and compare the derived bounds to the measured delay and backlog. We also do a proof-of- concept of the online-algorithm, implement it in LabVIEW and compare its performance to the timestamp logging by CPU load and data-size of the log-file. However, the implementation is still work-in-progress.},
  language  = {en}
}
@misc{FunkenTscherner2019,
  author    = {Funken, Matthias and Tscherner, Michael},
  title     = {Jahresbericht 2018 des Rechenzentrums der Universit{\"a}t W{\"u}rzburg},
  edition   = {1. Auflage},
  organization    = {Rechenzentrum (Universit{\"a}t W{\"u}rzburg)},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-188265},
  pages     = {76},
  year      = {2019},
  abstract  = {Eine {\"U}bersicht {\"u}ber die Aktivit{\"a}ten des Rechenzentrums im Jahr 2018.},
  subject      = {Julius-Maximilians-Universit{\"a}t W{\"u}rzburg},
  language  = {de}
}
@misc{FunkenTscherner2018,
  author    = {Funken, Matthias and Tscherner, Michael},
  title     = {Jahresbericht 2017 des Rechenzentrums der Universit{\"a}t W{\"u}rzburg},
  edition   = {1. Auflage},
  organization    = {Rechenzentrum (Universit{\"a}t W{\"u}rzburg)},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-168537},
  pages     = {68},
  year      = {2018},
  abstract  = {Eine {\"U}bersicht {\"u}ber die Aktivit{\"a}ten des Rechenzentrums im Jahr 2017.},
  subject      = {Julius-Maximilians-Universit{\"a}t W{\"u}rzburg},
  language  = {de}
}
@article{GageikStrohmeierMontenegro2013,
  author    = {Gageik, Nils and Strohmeier, Michael and Montenegro, Sergio},
  title     = {Waypoint flight parameter comparison of an autonomous UAV},
  series = {International Journal of Artificial Intelligence \& Applications (IJAIA)},
  journal   = {International Journal of Artificial Intelligence \& Applications (IJAIA)},
  doi       = {10.5121/ijaia.2013.4304},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-96833},
  year      = {2013},
  abstract  = {The present paper compares the effect of different waypoint parameters on the flight performance of a special autonomous indoor UAV (unmanned aerial vehicle) fusing ultrasonic, inertial, pressure and optical sensors for 3D positioning and controlling. The investigated parameters are the acceptance threshold for reaching a waypoint as well as the maximal waypoint step size or block size. The effect of these parameters on the flight time and accuracy of the flight path is investigated. Therefore the paper addresses how the acceptance threshold and step size influence the speed and accuracy of the autonomous flight and thus influence the performance of the presented autonomous quadrocopter under real indoor navigation circumstances. Furthermore the paper demonstrates a drawback of the standard potential field method for navigation of such autonomous quadrocopters and points to an improvement.},
  language  = {en}
}
@article{GageikStrohmeierMontenegro2013,
  author    = {Gageik, Nils and Strohmeier, Michael and Montenegro, Sergio},
  title     = {An Autonomous UAV with an Optical Flow Sensor for Positioning and Navigation},
  series = {International Journal of Advanced Robotic Systems},
  journal   = {International Journal of Advanced Robotic Systems},
  doi       = {10.5772/56813},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-96368},
  year      = {2013},
  abstract  = {A procedure to control all six DOF (degrees of freedom) of a UAV (unmanned aerial vehicle) without an external reference system and to enable fully autonomous flight is presented here. For 2D positioning the principle of optical flow is used. Together with the output of height estimation, fusing ultrasonic, infrared and inertial and pressure sensor data, the 3D position of the UAV can be computed, controlled and steered. All data processing is done on the UAV. An external computer with a pathway planning interface is for commanding purposes only. The presented system is part of the AQopterI8 project, which aims to develop an autonomous flying quadrocopter for indoor application. The focus of this paper is 2D positioning using an optical flow sensor. As a result of the performed evaluation, it can be concluded that for position hold, the standard deviation of the position error is 10cm and after landing the position error is about 30cm.},
  language  = {en}
}