@phdthesis{140, author = {{Jungmann, Alexander}}, publisher = {{Universität Paderborn}}, title = {{{Towards On-The-Fly Image Processing}}}, year = {{2016}}, } @phdthesis{141, author = {{Mohr, Felix}}, publisher = {{Universität Paderborn}}, title = {{{Towards Automated Service Composition Under Quality Constraints}}}, doi = {{10.17619/UNIPB/1-171}}, year = {{2016}}, } @inproceedings{142, abstract = {{For overlay networks, the ability to recover from a variety of problems like membership changes or faults is a key element to preserve their functionality. In recent years, various self-stabilizing overlay networks have been proposed that have the advantage of being able to recover from any illegal state. However, the vast majority of these networks cannot give any guarantees on its functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific identifier are answered successfully if a node with that identifier exists in the network. We investigate overlay networks that are not only self-stabilizing but that also ensure that monotonic searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. Monotonic searchability was recently introduced in OPODIS 2015, in which the authors provide a solution for a simple line topology.We present the first universal approach to maintain monotonic searchability that is applicable to a wide range of topologies. As the base for our approach, we introduce a set of primitives for manipulating overlay networks that allows us to maintain searchability and show how existing protocols can be transformed to use theses primitives.We complement this result with a generic search protocol that together with the use of our primitives guarantees monotonic searchability.As an additional feature, searching existing nodes with the generic search protocol is as fast as searching a node with any other fixed routing protocol once the topology has stabilized.}}, author = {{Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}}, booktitle = {{Proceedings of the 30th International Symposium on Distributed Computing (DISC)}}, pages = {{71----84}}, title = {{{Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks}}}, doi = {{10.1007/978-3-662-53426-7_6}}, year = {{2016}}, } @inproceedings{143, abstract = {{We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6].}}, author = {{Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}}, booktitle = {{Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)}}, pages = {{92--102}}, title = {{{The Monotone Circuit Value Problem with Bounded Genus Is in NC}}}, doi = {{10.1007/978-3-319-42634-1_8}}, year = {{2016}}, } @article{145, abstract = {{Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. }}, author = {{Feldotto, Matthias and Graffi, Kalman}}, journal = {{Concurrency and Computation: Practice and Experience}}, number = {{5}}, pages = {{1655--1677}}, publisher = {{Wiley Online Library}}, title = {{{Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM}}}, doi = {{10.1002/cpe.3716}}, volume = {{28}}, year = {{2016}}, } @inproceedings{13151, author = {{Graf, Tobias and Platzner, Marco}}, booktitle = {{Computer and Games}}, title = {{{Using Deep Convolutional Neural Networks in Monte Carlo Tree Search}}}, year = {{2016}}, } @inproceedings{13152, author = {{Graf, Tobias and Platzner, Marco}}, booktitle = {{IEEE Computational Intelligence and Games}}, title = {{{Monte-Carlo Simulation Balancing Revisited}}}, year = {{2016}}, } @inproceedings{132, abstract = {{Runtime reconfiguration can be used to replace hardware modules in the field and even to continuously improve them during operation. Runtime reconfiguration poses new challenges for validation, since the required properties of newly arriving modules may be difficult to check fast enough to sustain the intended system dynamics. In this paper we present a method for just-in-time verification of the worst-case completion time of a reconfigurable hardware module. We assume so-called run-to-completion modules that exhibit start and done signals indicating the start and end of execution, respectively. We present a formal verification approach that exploits the concept of proof-carrying hardware. The approach tasks the creator of a hardware module with constructing a proof of the worst-case completion time, which can then easily be checked by the user of the module, just prior to reconfiguration. After explaining the verification approach and a corresponding tool flow, we present results from two case studies, a short term synthesis filter and a multihead weigher. The resultsclearly show that cost of verifying the completion time of the module is paid by the creator instead of the user of the module.}}, author = {{Wiersema, Tobias and Platzner, Marco}}, booktitle = {{Proceedings of the 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC 2016)}}, pages = {{1----8}}, title = {{{Verifying Worst-Case Completion Times for Reconfigurable Hardware Modules using Proof-Carrying Hardware}}}, doi = {{10.1109/ReCoSoC.2016.7533910}}, year = {{2016}}, } @inproceedings{13215, author = {{Moritzer, Elmar and Hüttner, Matthias and Henning, Bernd and Webersen, Manuel}}, location = {{Lyon}}, title = {{{An Approach to Non-Destructive Testing of Aged Polymers}}}, year = {{2016}}, } @article{13216, author = {{Moritzer, Elmar and Hüttner, Matthias and Henning, Bernd and Webersen, Manuel}}, journal = {{Kunststoffe}}, number = {{4}}, pages = {{94--96}}, title = {{{Molekularen Schäden auf der Spur}}}, year = {{2016}}, } @article{13217, author = {{Moritzer, Elmar and Hüttner, Matthias and Henning, Bernd and Webersen, Manuel}}, journal = {{Kunststoffe International}}, number = {{4}}, pages = {{43--45}}, title = {{{Detecting Molecular Damage}}}, year = {{2016}}, } @inproceedings{13218, author = {{Moritzer, Elmar and Hüttner, Matthias and Henning, Bernd and Webersen, Manuel}}, isbn = {{978-0-692-71961-9}}, location = {{Indianapolis}}, title = {{{Non-destructive characterization of hygrothermally aged polymers}}}, year = {{2016}}, } @inbook{13219, author = {{Moritzer, Elmar and Hüttner, Matthias and Henning, Bernd and Webersen, Manuel}}, booktitle = {{Jahresmagazin Kunststofftechnik 2016}}, pages = {{2--7}}, title = {{{Ultraschallbasierte Charakterisierung von gealterten Polymeren}}}, year = {{2016}}, } @inproceedings{13223, abstract = {{In der zerstörungsfreien Werkstoffprüfung sind bereits zahlreiche Verfahren etabliert, deren Ziel die Detektion makroskopischer Defekt- und Fehlstellen (z.B. Risse, Poren, Fremdeinschlüsse) ist. Insbesondere bei Polymerwerkstoffen muss jedoch auch die Materialalterung auf molekularer Ebene berücksichtigt werden, die sich (zumeist negativ) auf die Materialkenngrößen auswirkt. Gängige Verfahren zur Bestimmung dieser Kenngrößen arbeiten jedoch üblicherweise zerstörend und sind somit beispielsweise für die vorbeugende Instandhaltung oder die Online-Komponentenüberwachung nur eingeschränkt geeignet. In diesem Beitrag wird ein Verfahren zur zerstörungsfreien Charakterisierung des Alterungszustandes von Polymeren vorgestellt. Dazu wird der Zusammenhang zwischen akustisch (zerstörungsfrei, mittels Ultraschall-Transmissionsmessung) bestimmten Kenngrößen und klassisch (zerstörend, z.B. mittels Zugprüfung) bestimmten hydrothermischer Alterung auf das Material Polyamid 6 (PA6) untersucht. Die Ergebnisse Kenngrößen betrachtet. Exemplarisch werden die Auswirkungen zeigen einen engen Zusammenhang zwischen der zerstörend bestimmten Viskositätszahl, die ein Maß für die mittlere Molekülkettenlänge darstellt, und der akustischen Longitudinalwellengeschwindigkeit. Das Molekülkettenabbau (Depolymerisation) bestimmt ist, kann somit auch akustisch und zerstörungsfrei charakterisiert werden. Auf dieser Basis können neuartige, zerstörungsfrei arbeitende Messsysteme entwickelt werden.}}, author = {{Webersen, Manuel and Hüttner, Matthias and Bause, Fabian and Moritzer, Elmar and Henning, Bernd}}, isbn = {{978-3-9816876-0-6}}, location = {{Nürnberg}}, pages = {{683--688}}, title = {{{Zerstörungsfreie Charakterisierung des hydrothermischen Alterungsverhaltens von Polymeren}}}, doi = {{10.5162/sensoren2016/P6.4}}, year = {{2016}}, } @misc{133, abstract = {{.}}, author = {{Dewender, Markus}}, publisher = {{Universität Paderborn}}, title = {{{Verifikation von Service Kompositionen mit Spin}}}, year = {{2016}}, } @misc{134, abstract = {{.}}, author = {{Heinisch, Philipp}}, publisher = {{Universität Paderborn}}, title = {{{Verifikation von Service Kompositionen mit Prolog}}}, year = {{2016}}, } @phdthesis{10136, author = {{Eikel, Martina}}, publisher = {{Universität Paderborn}}, title = {{{Insider-resistent Distributed Storage Systems}}}, year = {{2016}}, } @inbook{10214, author = {{Fürnkranz, J. and Hüllermeier, Eyke}}, booktitle = {{Encyclopedia of Machine Learning and Data Mining}}, editor = {{Sammut, C. and Webb, G.I.}}, publisher = {{Springer}}, title = {{{Preference Learning}}}, year = {{2016}}, } @proceedings{10221, editor = {{Hoffmann, F. and Hüllermeier, Eyke and Mikut, R.}}, title = {{{ Proceedings 26. Workshop Computational Intelligence KIT Scientific Publishing, Karlsruhe, Germany}}}, year = {{2016}}, } @inproceedings{10222, author = {{Jasinska, K. and Dembczynski, K. and Busa-Fekete, Robert and Klerx, Timo and Hüllermeier, Eyke}}, booktitle = {{Proceedings ICML-2016, 33th International Conference on Machine Learning, New York, USA}}, editor = {{Balcan, M.F. and Weinberger, K.Q.}}, title = {{{Extreme F-measure maximization using sparse probability estimates }}}, year = {{2016}}, }