@inproceedings{16364, author = {{Macker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}}, isbn = {{9781509021406}}, title = {{{On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams}}}, doi = {{10.1109/ipdps.2016.91}}, year = {{2016}}, } @inproceedings{16386, author = {{Klingler, Florian and Dressler, Falko and Sommer, Christoph}}, booktitle = {{2015 IEEE Vehicular Networking Conference (VNC)}}, isbn = {{9781467394116}}, title = {{{IEEE 802.11p unicast considered harmful}}}, doi = {{10.1109/vnc.2015.7385550}}, year = {{2016}}, } @unpublished{16396, abstract = {{We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of $\beta$ if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at least $\beta$. While for $\beta < s$ no finite competitiveness is possible, our main result is an $O(\frac{c}{\varepsilon} + \frac{1}{\varepsilon^3})$-competitive online algorithm for $\beta = (1+\varepsilon)s$ with $\frac{1}{s} \leq \varepsilon \leq 1$, where $s$ and $c$ denotes the largest setup time and the cost ratio of the machine-types, respectively. It is complemented by a lower bound of $\Omega(\frac{c}{\varepsilon})$.}}, author = {{Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}}, booktitle = {{arXiv:1609.01184}}, title = {{{Cost-efficient Scheduling on Machines from the Cloud}}}, year = {{2016}}, } @misc{164, author = {{Czech, Mike}}, publisher = {{Universität Paderborn}}, title = {{{Predicting Rankings of Software Verification Tools Using Kernels for Structured Data}}}, year = {{2016}}, } @phdthesis{13860, author = {{Bause, Fabian}}, publisher = {{Universität Paderborn}}, title = {{{Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren}}}, year = {{2016}}, } @inproceedings{13864, author = {{Bause, F. and Henning, Bernd}}, publisher = {{LibreCat University}}, title = {{{5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren}}}, doi = {{10.5162/SENSOREN2016/5.3.1}}, year = {{2016}}, } @inproceedings{13865, author = {{Ester, S. and Struschka, M. and Henning, Bernd}}, publisher = {{LibreCat University}}, title = {{{3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung}}}, doi = {{10.5162/SENSOREN2016/3.2.3}}, year = {{2016}}, } @article{139, abstract = {{We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying goods. Instead, leasing is often a more flexible and lucrative business model. Research has realized this shift and recently initiated the theoretical study of leasing models (Anthony and Gupta in Proceedings of the integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27, 2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work and suggest a more systematic study of leasing aspects for a class of online optimization problems. We provide two major technical results. We introduce the leasing variant of online set multicover and give an O(log(mK)logn)-competitive algorithm (with n, m, and K being the number of elements, sets, and leases, respectively). Our results also imply improvements for the non-leasing variant of online set cover. Moreover, we extend results for the leasing variant of online facility location. Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive algorithm for this problem (with n and K being the number of clients and leases, respectively). We remove the dependency on n (and, thereby, on time). In general, this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax). For many natural problem instances, the bound improves to O(K2).}}, author = {{Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter }}, journal = {{Journal of Combinatorial Optimization}}, number = {{4}}, pages = {{ 1197----1216}}, publisher = {{Springer}}, title = {{{Towards the price of leasing online}}}, doi = {{10.1007/s10878-015-9915-5}}, year = {{2016}}, } @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{144, abstract = {{Following the direction pioneered by Fiat and Papadimitriou in their 2010 paper [12], we study the complexity of deciding the existence of mixed equilibria for minimization games where players use valuations other than expectation to evaluate their costs. We consider risk-averse players seeking to minimize the sum V=E+R of expectationE and a risk valuationR of their costs; R is non-negative and vanishes exactly when the cost incurred to a player is constant over all choices of strategies by the other players. In a V-equilibrium, no player could unilaterally reduce her cost.Say that V has the Weak-Equilibrium-for-Expectation property if all strategies supported in a player's best-response mixed strategy incur the same conditional expectation of her cost. We introduce E-strict concavity and observe that every E-strictly concave valuation has the Weak-Equilibrium-for-Expectation property. We focus on a broad class of valuations shown to have the Weak-Equilibrium-for-Expectation property, which we exploit to prove two main complexity results, the first of their kind, for the two simplest cases of the problem:• Two strategies: Deciding the existence of a V-equilibrium is strongly NP-hard for the restricted class of player-specific scheduling games on two ordered links [22], when choosing R as (1)Var (variance), or (2)SD (standard deviation), or (3) a concave linear sum of even moments of small order.• Two players: Deciding the existence of a V-equilibrium is strongly NP-hard when choosing R as (1)γ⋅Var, or (2)γ⋅SD, where γ>0 is the risk-coefficient, or choosing V as (3) a convex combination of E+γ⋅Var and the concave ν-valuationν−1(E(ν(⋅))), where ν(x)=xr, with r≥2. This is a concrete consequence of a general strong NP-hardness result that only needs the Weak-Equilibrium-for-Expectation property and a few additional properties for V; its proof involves a reduction with a single parameter, which can be chosen efficiently so that each valuation satisfies the additional properties.}}, author = {{Monien, Burkhard and Mavronicolas, Marios}}, journal = {{Theoretical Computer Science}}, pages = {{67--96}}, publisher = {{Elsevier}}, title = {{{The complexity of equilibria for risk-modeling valuations}}}, doi = {{10.1016/j.tcs.2016.04.013}}, volume = {{634}}, 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}}, } @article{1450, author = {{Pelster, Matthias and Hagemann, Vera and Laporte Uribe, Franziska}}, issn = {{1175-5652}}, journal = {{Applied Health Economics and Health Policy}}, number = {{3}}, pages = {{293--312}}, publisher = {{Springer Nature}}, title = {{{Key Aspects of a Sustainable Health Insurance System in Germany}}}, doi = {{10.1007/s40258-016-0223-8}}, volume = {{14}}, year = {{2016}}, } @article{1455, author = {{Zentgraf, Thomas}}, issn = {{0031-9252}}, journal = {{Physik in unserer Zeit}}, number = {{4}}, pages = {{163--164}}, publisher = {{Wiley-Blackwell}}, title = {{{Doppler-Effekt für rotierende Objekte}}}, doi = {{10.1002/piuz.201690063}}, volume = {{47}}, year = {{2016}}, } @misc{131, author = {{Holzmann, Annabel}}, publisher = {{Universität Paderborn}}, title = {{{Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren}}}, 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}}, } @article{13164, author = {{Dubberke, Frithjof H. and Riepold, Markus and Baumhögger, Elmar and Vrabec, Jadran}}, issn = {{0021-9568}}, journal = {{Journal of Chemical & Engineering Data}}, pages = {{1632--1636}}, title = {{{Speed of Sound of Oxygen in Supercritical States up to 500 K and 100 MPa}}}, doi = {{10.1021/acs.jced.5b01007}}, year = {{2016}}, }