@phdthesis{385,
author = {Petrlic, Ronald},
publisher = {Universität Paderborn},
title = {{Privacy-Preserving Multiparty Digital Rights Management}},
year = {2014},
}
@article{3905,
author = {Abu Quba Rana, Chamsi and Hassas, Salima and Usama, Fayyad and Alshomary, Milad and Gertosio, Christine},
journal = {2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA)},
pages = {169--175},
title = {{iSoNTRE: The Social Network Transformer into Recommendation Engine}},
year = {2014},
}
@misc{392,
author = {Brummel, NinaMadeleine},
publisher = {Universität Paderborn},
title = {{On the Relation between Innovation and Competion: The Case of Energy Industry}},
year = {2014},
}
@inproceedings{397,
abstract = {We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach allows for an effective parallelization. Note that a suitable decomposition can also be computed in time $O(|E|\log{|E|})$ (or even $O(\log{|E|}\log^*{|E|})$ on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation ratio, we use a sophisticated charging method that uses techniques similar to amortized analysis in advanced data structures. On general graphs, the minimum linear arrangement problem is known to be NP-hard. To the best of our knowledge, the minimum linear arrangement problem on series-parallel graphs has not been studied before.},
author = {Scheideler, Christian and Eikel, Martina and Setzer, Alexander},
booktitle = {Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)},
pages = {168----180},
title = {{Minimum Linear Arrangement of Series-Parallel Graphs}},
year = {2014},
}
@misc{373,
author = {Pahl, David},
publisher = {Universität Paderborn},
title = {{Reputationssysteme für zusammengesetzte Dienstleistungen}},
year = {2014},
}
@article{378,
abstract = {The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and many variants of Chord have been presented that optimize various criteria. Also, several implementations of Chord are available on various platforms. Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network can be recovered from any initial state in which the network is still weakly connected. This is not too surprising since it is known that the Chord network is not locally checkable for its current topology. We present a slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present a self-stabilizing distributed protocol for it that can recover the Re-Chord network from any initial state, in which the n peers are weakly connected, in O(nlogn) communication rounds. We also show that our protocol allows a new peer to join or an old peer to leave an already stable Re-Chord network so that within O(logn)^2) communication rounds the Re-Chord network is stable again.},
author = {Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian},
journal = {Theory of Computing Systems},
number = {3},
pages = {591--612},
publisher = {Springer},
title = {{Re-Chord: A Self-stabilizing Chord Overlay Network}},
doi = {10.1007/s00224-012-9431-2},
year = {2014},
}
@inproceedings{380,
abstract = {Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances from v to all other nodes plus the prices of the bought edges. The above papers show the existence of Nash equilibria as well as upper and lower bounds for the prices of anarchy and stability. In several subsequent papers, these bounds were improved for a wide range of prices α. In this paper, we extend these models by incorporating quality-of-service aspects: Each edge cannot only be bought at a fixed quality (edge length one) for a fixed price α. Instead, we assume that quality levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series = {LNCS}},
author = {Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 10th International Conference on Web and Internet Economics (WINE)},
pages = {423--428},
title = {{Quality of Service in Network Creation Games}},
doi = {10.1007/978-3-319-13129-0_34},
year = {2014},
}
@misc{342,
author = {Klauke, Christoph},
publisher = {Universität Paderborn},
title = {{Transformation graphischer Protokollspezifikationen in Model-Checker-Anfragen}},
year = {2014},
}
@inproceedings{347,
abstract = {Dynamic thread duplication is a known redundancy technique for multi-cores. The approach duplicates a thread under observation for some time period and compares the signatures of the two threads to detect errors. Hybrid multi-cores, typically implemented on platform FPGAs, enable the unique option of running the thread under observation and its copy in different modalities, i.e., software and hardware. We denote our dynamic redundancy technique on hybrid multi-cores as thread shadowing. In this paper we present the concept of thread shadowing and an implementation on a multi-threaded hybrid multi-core architecture. We report on experiments with a block-processing application and demonstrate the overheads, detection latencies and coverage for a range of thread shadowing modes. The results show that trans-modal thread shadowing, although bearing long detection latencies, offers attractive coverage at a low overhead.},
author = {Meisner, Sebastian and Platzner, Marco},
booktitle = {Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)},
editor = {Goehringer, Diana and Santambrogio, MarcoDomenico and Cardoso, JoãoM.P. and Bertels, Koen},
pages = {283--290},
publisher = {Springer},
title = {{Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection}},
doi = {10.1007/978-3-319-05960-0_30},
year = {2014},
}
@article{3493,
author = {Beverungen, Daniel},
journal = {WIRTSCHAFTSINFORMATIK},
number = {4},
pages = {209----222},
title = {{Über das Zusammenwirken der Gestaltung und Emergenz von Geschäftsprozessen als Organisationsroutinen}},
doi = {10.1007/s11576-014-0425-3},
year = {2014},
}