@phdthesis{1190, author = {{Isenberg, Tobias}}, publisher = {{Universität Paderborn}}, title = {{{Induction-based Verification of Timed Systems}}}, year = {{2016}}, } @inproceedings{11975, author = {{Blobel, Johannes and Sommer, Christoph and Dressler, Falko}}, booktitle = {{2016 IEEE International Conference on Communications (ICC)}}, isbn = {{9781479966646}}, title = {{{Protocol options for low power sensor network MAC using wake-up receivers with duty cycling}}}, doi = {{10.1109/icc.2016.7511318}}, year = {{2016}}, } @inproceedings{11988, author = {{Campolo, Claudia and Sommer, Christoph and Dressler, Falko and Molinaro, Antonella}}, booktitle = {{2016 IEEE International Conference on Communications (ICC)}}, isbn = {{9781479966646}}, title = {{{On the impact of adjacent channel interference in multi-channel VANETs}}}, doi = {{10.1109/icc.2016.7511085}}, year = {{2016}}, } @inproceedings{12011, author = {{Hagenauer, Florian and Sommer, Christoph and Merschjohann, Simon and Higuchi, Takamasa and Dressler, Falko and Altintas, Onur}}, booktitle = {{2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)}}, isbn = {{9781467399555}}, title = {{{Cars as the base for service discovery and provision in highly dynamic networks}}}, doi = {{10.1109/infcomw.2016.7562101}}, year = {{2016}}, } @inproceedings{12012, author = {{Hagenauer, Florian and Sommer, Christoph and Onishi, Ryokichi and Wilhelm, Matthias and Dressler, Falko and Altintas, Onur}}, booktitle = {{2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)}}, isbn = {{9781467399555}}, title = {{{Interconnecting smart cities by vehicles: How feasible is it?}}}, doi = {{10.1109/infcomw.2016.7562184}}, year = {{2016}}, } @inbook{12013, author = {{Hagenauer, F. and Dressler, F. and Altintas, O. and Sommer, Christoph}}, booktitle = {{Smart Cities and Homes}}, isbn = {{9780128034545}}, title = {{{Cars as a main ICT resource of smart cities}}}, doi = {{10.1016/b978-0-12-803454-5.00007-9}}, year = {{2016}}, } @inproceedings{12029, 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}}, } @inproceedings{12039, author = {{Memedi, Agon and Hagenauer, Florian and Dressler, Falko and Sommer, Christoph}}, booktitle = {{2015 IEEE Vehicular Networking Conference (VNC)}}, isbn = {{9781467394116}}, title = {{{Cluster-based transmit power control in heterogeneous vehicular networks}}}, doi = {{10.1109/vnc.2015.7385547}}, year = {{2016}}, } @book{12972, abstract = {{Taking inspiration from self-awareness in humans, this book introduces the new notion of computational self-awareness as a fundamental concept for designing and operating computing systems. The basic ability of such self-aware computing systems is to collect information about their state and progress, learning and maintaining models containing knowledge that enables them to reason about their behaviour. Self-aware computing systems will have the ability to utilise this knowledge to effectively and autonomously adapt and explain their behaviour, in changing conditions. This book addresses these fundamental concepts from an engineering perspective, aiming at developing primitives for building systems and applications. It will be of value to researchers, professionals and graduate students in computer science and engineering.}}, editor = {{Lewis, Peter R. and Platzner, Marco and Rinner, Bernhard and Tørresen, Jim and Yao, Xin}}, isbn = {{9783319396743}}, issn = {{1619-7127}}, publisher = {{Springer}}, title = {{{Self-aware Computing Systems: An Engineering Approach}}}, doi = {{10.1007/978-3-319-39675-0}}, year = {{2016}}, } @phdthesis{154, author = {{Cord-Landwehr, Andreas}}, isbn = {{978-3-942647-72-4}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Selfish Network Creation - On Variants of Network Creation Games}}}, volume = {{353}}, year = {{2016}}, } @inproceedings{15400, author = {{Labreuche, C. and Hüllermeier, Eyke and Vojtas, P. and Fallah Tehrani, A.}}, booktitle = {{in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}}, editor = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}}, title = {{{On the identifiability of models in multi-criteria preference learning}}}, year = {{2016}}, } @inproceedings{15401, author = {{Schäfer, D. and Hüllermeier, Eyke}}, booktitle = {{in Proceedings DA2PL`2016 Euro Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn, Germany}}, editor = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}}, title = {{{Preference -based reinforcement learning using dyad ranking}}}, year = {{2016}}, } @inproceedings{15402, author = {{Couso, Ines and Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}}, booktitle = {{in Proceedings DA2PL 2016 EURO Mini Conference From Multiple Criteria Decision Aid to Preference Learning, Paderborn Germany}}, editor = {{Busa-Fekete, R. and Hüllermeier, Eyke and Mousseau, V. and Pfannschmidt, Karlson}}, title = {{{Statistical Inference for Incomplete Ranking Data: A Comparison of two likelihood-based estimators}}}, year = {{2016}}, } @inproceedings{15403, author = {{Lu, S. and Hüllermeier, Eyke}}, booktitle = {{in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany}}, editor = {{Hüllermeier, Eyke and Hoffmann, F. and Mikut, R.}}, pages = {{1--8}}, publisher = {{KIT Scientific Publishing}}, title = {{{Support vector classification on noisy data using fuzzy superset losses}}}, year = {{2016}}, } @inproceedings{15404, author = {{Schäfer, D. and Hüllermeier, Eyke}}, booktitle = {{in Workshop LWDA "Lernen, Wissen, Daten, Analysen" Potsdam, Germany}}, title = {{{Plackett-Luce networks for dyad ranking}}}, year = {{2016}}, } @inproceedings{15435, author = {{Domik, Gitta}}, booktitle = {{Pedagogy Data Visualization, IEEE VIS Workshop}}, title = {{{A data visualization course at the university of paderborn}}}, year = {{2016}}, } @inproceedings{155, abstract = {{We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round.}}, author = {{Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}}, booktitle = {{Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, pages = {{248----262}}, title = {{{Self-stabilizing Metric Graphs}}}, doi = {{10.1007/978-3-319-49259-9_20}}, year = {{2016}}, } @inproceedings{157, abstract = {{Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees.}}, author = {{König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}}, booktitle = {{Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}}, pages = {{563----577}}, title = {{{Scheduling with Interjob Communication on Parallel Processors}}}, doi = {{10.1007/978-3-319-48749-6_41}}, year = {{2016}}, } @inproceedings{15873, author = {{Boschmann, Alexander and Agne, Andreas and Witschen, Linus Matthias and Thombansen, Georg and Kraus, Florian and Platzner, Marco}}, booktitle = {{2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)}}, isbn = {{9781467394062}}, keywords = {{Electromyography, Feature extraction, Delays, Hardware Pattern recognition, Prosthetics, High definition video}}, location = {{Mexiko City, Mexiko}}, publisher = {{IEEE}}, title = {{{FPGA-based acceleration of high density myoelectric signal processing}}}, doi = {{10.1109/reconfig.2015.7393312}}, year = {{2016}}, } @article{159, abstract = {{Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived.}}, author = {{Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}}, journal = {{IEEE/ACM Transactions on Networking}}, number = {{4}}, pages = {{2553 -- 2562}}, publisher = {{IEEE}}, title = {{{Routing Games With Progressive Filling}}}, doi = {{10.1109/TNET.2015.2468571}}, year = {{2016}}, }