@article{PfitznerMayNuechter2018,
  author    = {Pfitzner, Christian and May, Stefan and N{\"u}chter, Andreas},
  title     = {Body weight estimation for dose-finding and health monitoring of lying, standing and walking patients based on RGB-D data},
  series = {Sensors},
  volume    = {18},
  journal   = {Sensors},
  number    = {5},
  doi       = {10.3390/s18051311},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-176642},
  pages     = {1311},
  year      = {2018},
  abstract  = {This paper describes the estimation of the body weight of a person in front of an RGB-D camera. A survey of different methods for body weight estimation based on depth sensors is given. First, an estimation of people standing in front of a camera is presented. Second, an approach based on a stream of depth images is used to obtain the body weight of a person walking towards a sensor. The algorithm first extracts features from a point cloud and forwards them to an artificial neural network (ANN) to obtain an estimation of body weight. Besides the algorithm for the estimation, this paper further presents an open-access dataset based on measurements from a trauma room in a hospital as well as data from visitors of a public event. In total, the dataset contains 439 measurements. The article illustrates the efficiency of the approach with experiments with persons lying down in a hospital, standing persons, and walking persons. Applicable scenarios for the presented algorithm are body weight-related dosing of emergency patients.},
  language  = {en}
}
@phdthesis{Muehlberger2018,
  author    = {M{\"u}hlberger, Clemens},
  title     = {Design of a Self-Organizing MAC Protocol for Dynamic Multi-Hop Topologies},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-158788},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2018},
  abstract  = {Biologically inspired self-organization methods can help to manage the access control to the shared communication medium of Wireless Sensor Networks. One lightweight approach is the primitive of desynchronization, which relies on the periodic transmission of short control messages - similar to the periodical pulses of oscillators. This primitive of desynchronization has already been successfully implemented as MAC protocol for single-hop topologies. Moreover, there are also some concepts of such a protocol formulti-hop topologies available. However, the existing implementations may handle just a certain class of multi-hop topologies or are not robust against topology dynamics. In addition to the sophisticated access control of the sensor nodes of a Wireless Sensor Network in arbitrary multi-hop topologies, the communication protocol has to be lightweight, applicable, and scalable. These characteristics are of particular interest for distributed and randomly deployed networks (e.g., by dropping nodes off an airplane). In this work we present the development of a self-organizing MAC protocol for dynamic multi-hop topologies. This implies the evaluation of related work, the conception of our new communication protocol based on the primitive of desynchronization as well as its implementation for sensor nodes. As a matter of course, we also analyze our realization with regard to our specific requirements. This analysis is based on several (simulative as well as real-world) scenarios. Since we are mainly interested in the convergence behavior of our protocol, we do not focus on the "classical" network issues, like routing behavior or data rate, within this work. Nevertheless, for this purpose we make use of several real-world testbeds, but also of our self-developed simulation framework. According to the results of our evaluation phase, our self-organizing MAC protocol for WSNs, which is based on the primitive of desynchronization, meets all our demands. In fact, our communication protocol operates in arbitrary multi-hop topologies and copes well with topology dynamics. In this regard, our protocol is the first and only MAC protocol to the best of our knowledge. Moreover, due to its periodic transmission scheme, it may be an appropriate starting base for additional network services, like time synchronization or routing.},
  language  = {en}
}
@article{RingLandesHotho2018,
  author    = {Ring, Markus and Landes, Dieter and Hotho, Andreas},
  title     = {Detection of slow port scans in flow-based network traffic},
  series = {PLoS ONE},
  volume    = {13},
  journal   = {PLoS ONE},
  number    = {9},
  doi       = {10.1371/journal.pone.0204507},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-226305},
  pages     = {e0204507, 1-18},
  year      = {2018},
  abstract  = {Frequently, port scans are early indicators of more serious attacks. Unfortunately, the detection of slow port scans in company networks is challenging due to the massive amount of network data. This paper proposes an innovative approach for preprocessing flow-based data which is specifically tailored to the detection of slow port scans. The preprocessing chain generates new objects based on flow-based data aggregated over time windows while taking domain knowledge as well as additional knowledge about the network structure into account. The computed objects are used as input for the further analysis. Based on these objects, we propose two different approaches for detection of slow port scans. One approach is unsupervised and uses sequential hypothesis testing whereas the other approach is supervised and uses classification algorithms. We compare both approaches with existing port scan detection algorithms on the flow-based CIDDS-001 data set. Experiments indicate that the proposed approaches achieve better detection rates and exhibit less false alarms than similar algorithms.},
  language  = {en}
}
@phdthesis{Budig2018,
  author    = {Budig, Benedikt},
  title     = {Extracting Spatial Information from Historical Maps: Algorithms and Interaction},
  edition   = {1. Auflage},
  publisher = {W{\"u}rzburg University Press},
  address   = {W{\"u}rzburg},
  isbn      = {978-3-95826-092-4},
  doi       = {10.25972/WUP-978-3-95826-093-1},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-160955},
  school      = {W{\"u}rzburg University Press},
  pages     = {viii, 160},
  year      = {2018},
  abstract  = {Historical maps are fascinating documents and a valuable source of information for scientists of various disciplines. Many of these maps are available as scanned bitmap images, but in order to make them searchable in useful ways, a structured representation of the contained information is desirable. This book deals with the extraction of spatial information from historical maps. This cannot be expected to be solved fully automatically (since it involves difficult semantics), but is also too tedious to be done manually at scale. The methodology used in this book combines the strengths of both computers and humans: it describes efficient algorithms to largely automate information extraction tasks and pairs these algorithms with smart user interactions to handle what is not understood by the algorithm. The effectiveness of this approach is shown for various kinds of spatial documents from the 16th to the early 20th century.},
  subject      = {Karte},
  language  = {en}
}
@phdthesis{Furth2018,
  author    = {Furth, Sebastian},
  title     = {Linkable Technical Documentation},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-174185},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2018},
  abstract  = {The success of semantic systems has been proven over the last years. Nowadays, Linked Data is the driver for the rapid development of ever new intelligent systems. Especially in enterprise environments semantic systems successfully support more and more business processes. This is especially true for after sales service in the mechanical engineering domain. Here, service technicians need effective access to relevant technical documentation in order to diagnose and solve problems and defects. Therefore, the usage of semantic information retrieval systems has become the new system metaphor. Unlike classical retrieval software Linked Enterprise Data graphs are exploited to grant targeted and problem-oriented access to relevant documents. However, huge parts of legacy technical documents have not yet been integrated into Linked Enterprise Data graphs. Additionally, a plethora of information models for the semantic representation of technical information exists. The semantic maturity of these information models can hardly be measured. This thesis motivates that there is an inherent need for a self-contained semantification approach for technical documents. This work introduces a maturity model that allows to quickly assess existing documentation. Additionally, the approach comprises an abstracting semantic representation for technical documents that is aligned to all major standard information models. The semantic representation combines structural and rhetorical aspects to provide access to so called Core Documentation Entities. A novel and holistic semantification process describes how technical documents in different legacy formats can be transformed to a semantic and linked representation. The practical significance of the semantification approach depends on tools supporting its application. This work presents an accompanying tool chain of semantification applications, especially the semantification framework CAPLAN that is a highly integrated development and runtime environment for semantification processes. The complete semantification approach is evaluated in four real-life projects: in a spare part augmentation project, semantification projects for earth moving technology and harvesting technology, as well as an ontology population project for special purpose vehicles. Three additional case studies underline the broad applicability of the presented ideas.},
  subject      = {Linked Data},
  language  = {en}
}
@phdthesis{Herbst2018,
  author    = {Herbst, Nikolas Roman},
  title     = {Methods and Benchmarks for Auto-Scaling Mechanisms in Elastic Cloud Environments},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-164314},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2018},
  abstract  = {A key functionality of cloud systems are automated resource management mechanisms at the infrastructure level. As part of this, elastic scaling of allocated resources is realized by so-called auto-scalers that are supposed to match the current demand in a way that the performance remains stable while resources are efficiently used. The process of rating cloud infrastructure offerings in terms of the quality of their achieved elastic scaling remains undefined. Clear guidance for the selection and configuration of an auto-scaler for a given context is not available. Thus, existing operating solutions are optimized in a highly application specific way and usually kept undisclosed. The common state of practice is the use of simplistic threshold-based approaches. Due to their reactive nature they incur performance degradation during the minutes of provisioning delays. In the literature, a high-number of auto-scalers has been proposed trying to overcome the limitations of reactive mechanisms by employing proactive prediction methods. In this thesis, we identify potentials in automated cloud system resource management and its evaluation methodology. Specifically, we make the following contributions: We propose a descriptive load profile modeling framework together with automated model extraction from recorded traces to enable reproducible workload generation with realistic load intensity variations. The proposed Descartes Load Intensity Model (DLIM) with its Limbo framework provides key functionality to stress and benchmark resource management approaches in a representative and fair manner. We propose a set of intuitive metrics for quantifying timing, stability and accuracy aspects of elasticity. Based on these metrics, we propose a novel approach for benchmarking the elasticity of Infrastructure-as-a-Service (IaaS) cloud platforms independent of the performance exhibited by the provisioned underlying resources. We tackle the challenge of reducing the risk of relying on a single proactive auto-scaler by proposing a new self-aware auto-scaling mechanism, called Chameleon, combining multiple different proactive methods coupled with a reactive fallback mechanism. Chameleon employs on-demand, automated time series-based forecasting methods to predict the arriving load intensity in combination with run-time service demand estimation techniques to calculate the required resource consumption per work unit without the need for a detailed application instrumentation. It can also leverage application knowledge by solving product-form queueing networks used to derive optimized scaling actions. The Chameleon approach is first in resolving conflicts between reactive and proactive scaling decisions in an intelligent way. We are confident that the contributions of this thesis will have a long-term impact on the way cloud resource management approaches are assessed. While this could result in an improved quality of autonomic management algorithms, we see and discuss arising challenges for future research in cloud resource management and its assessment methods: The adoption of containerization on top of virtual machine instances introduces another level of indirection. As a result, the nesting of virtual resources increases resource fragmentation and causes unreliable provisioning delays. Furthermore, virtualized compute resources tend to become more and more inhomogeneous associated with various priorities and trade-offs. Due to DevOps practices, cloud hosted service updates are released with a higher frequency which impacts the dynamics in user behavior.},
  subject      = {Cloud Computing},
  language  = {en}
}
@phdthesis{Borrmann2018,
  author    = {Borrmann, Dorit},
  title     = {Multi-modal 3D mapping - Combining 3D point clouds with thermal and color information},
  isbn      = {978-3-945459-20-1},
  issn      = {1868-7474},
  doi       = {10.25972/OPUS-15708},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-157085},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2018},
  abstract  = {Imagine a technology that automatically creates a full 3D thermal model of an environment and detects temperature peaks in it. For better orientation in the model it is enhanced with color information. The current state of the art for analyzing temperature related issues is thermal imaging. It is relevant for energy efficiency but also for securing important infrastructure such as power supplies and temperature regulation systems. Monitoring and analysis of the data for a large building is tedious as stable conditions need to be guaranteed for several hours and detailed notes about the pose and the environment conditions for each image must be taken. For some applications repeated measurements are necessary to monitor changes over time. The analysis of the scene is only possible through expertise and experience. This thesis proposes a robotic system that creates a full 3D model of the environment with color and thermal information by combining thermal imaging with the technology of terrestrial laser scanning. The addition of a color camera facilitates the interpretation of the data and allows for other application areas. The data from all sensors collected at different positions is joined in one common reference frame using calibration and scan matching. The first part of the thesis deals with 3D point cloud processing with the emphasis on accessing point cloud data efficiently, detecting planar structures in the data and registering multiple point clouds into one common coordinate system. The second part covers the autonomous exploration and data acquisition with a mobile robot with the objective to minimize the unseen area in 3D space. Furthermore, the combination of different modalities, color images, thermal images and point cloud data through calibration is elaborated. The last part presents applications for the the collected data. Among these are methods to detect the structure of building interiors for reconstruction purposes and subsequent detection and classification of windows. A system to project the gathered thermal information back into the scene is presented as well as methods to improve the color information and to join separately acquired point clouds and photo series. A full multi-modal 3D model contains all the relevant geometric information about the recorded scene and enables an expert to fully analyze it off-site. The technology clears the path for automatically detecting points of interest thereby helping the expert to analyze the heat flow as well as localize and identify heat leaks. The concept is modular and neither limited to achieving energy efficiency nor restricted to the use in combination with a mobile platform. It also finds its application in fields such as archaeology and geology and can be extended by further sensors.},
  subject      = {Punktwolke},
  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{NguyenNgoc2018,
  author    = {Nguyen-Ngoc, Anh},
  title     = {On Performance Assessment of Control Mechanisms and Virtual Components in SDN-based Networks},
  issn      = {1432-8801},
  doi       = {10.25972/OPUS-16932},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-169328},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2018},
  abstract  = {This dissertation focuses on the performance evaluation of all components of Software Defined Networking (SDN) networks and covers whole their architecture. First, the isolation between virtual networks sharing the same physical resources is investigated with SDN switches of several vendors. Then, influence factors on the isolation are identified and evaluated. Second, the impact of control mechanisms on the performance of the data plane is examined through the flow rule installation time of SDN switches with different controllers. It is shown that both hardware-specific and controller instance have a specific influence on the installation time. Finally, several traffic flow monitoring methods of an SDN controller are investigated and a new monitoring approach is developed and evaluated. It is confirmed that the proposed method allows monitoring of particular flows as well as consumes fewer resources than the standard approach. Based on findings in this thesis, on the one hand, controller developers can refer to the work related to the control plane, such as flow monitoring or flow rule installation, to improve the performance of their applications. On the other hand, network administrators can apply the presented methods to select a suitable combination of controller and switches in their SDN networks, based on their performance requirements},
  subject      = {Leistungsbewertung},
  language  = {en}
}
@phdthesis{DinhXuan2018,
  author    = {Dinh-Xuan, Lam},
  title     = {Quality of Experience Assessment of Cloud Applications and Performance Evaluation of VNF-Based QoE Monitoring},
  issn      = {1432-8801},
  doi       = {10.25972/OPUS-16918},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-169182},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2018},
  abstract  = {In this thesis various aspects of Quality of Experience (QoE) research are examined. The work is divided into three major blocks: QoE Assessment, QoE Monitoring, and VNF Performance Evaluation. First, prominent cloud applications such as Google Docs and a cloud-based photo album are explored. The QoE is characterized and the influence of packet loss and delay is studied. Afterwards, objective QoE monitoring for HTTP Adaptive Video Streaming (HAS) in the cloud is investigated. Additionally, by using a Virtual Network Function (VNF) for QoE monitoring in the cloud, the feasibility of an interworking of Network Function Virtualization (NFV) and cloud paradigm is evaluated. To this end, a VNF that exploits deep packet inspection technique was used to parse the video traffic. An algorithm is then designed accordingly to estimate video quality and QoE based on network and application layer parameters. To assess the accuracy of the estimation, the VNF is measured in different scenarios under different network QoS and the virtual environment of the cloud architecture. The insights show that the different geographical deployments of the VNF influence the accuracy of the video quality and QoE estimation. Various Service Function Chain (SFC) placement algorithms have been proposed and compared in the context of edge cloud networks. On the one hand, this research is aimed at cloud service providers by providing methods for evaluating QoE for cloud applications. On the other hand, network operators can learn the pitfalls and disadvantages of using the NFV paradigm for such a QoE monitoring mechanism.},
  subject      = {Quality of Experience},
  language  = {en}
}