@misc{5201,
  author       = {{Sievers, Sönke and Schlüter, Tobias and Hartmann-Wendels, Thomas}},
  booktitle    = {{Börsen-Zeitung}},
  title        = {{{Die erfolgreiche Bindung des Sparers an die Bank}}},
  year         = {{2013}},
}

@misc{5202,
  author       = {{Sievers, Sönke and Hartmann-Wendels, Thomas and Busch, Ramona and Schlüter, Tobias}},
  booktitle    = {{Börsen-Zeitung}},
  pages        = {{6}},
  title        = {{{Wie Banken Kostenvorteile weitergeben}}},
  volume       = {{6}},
  year         = {{2013}},
}

@misc{521,
  author       = {{Riebler, Heinrich}},
  keywords     = {{coldboot}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs}}},
  year         = {{2013}},
}

@misc{522,
  author       = {{Feldotto, Matthias}},
  publisher    = {{Universität Paderborn}},
  title        = {{{HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}}},
  year         = {{2013}},
}

@article{523,
  abstract     = {{In a distributed system with attacks and defenses, both attackers and defenders are self-interested entities. We assume a reward-sharing scheme among interdependent defenders; each defender wishes to (locally) maximize her own total fair share to the attackers extinguished due to her involvement (and possibly due to those of others). What is the maximum amount of protection achievable by a number of such defenders against a number of attackers while the system is in a Nash equilibrium? As a measure of system protection, we adopt the Defense-Ratio (Mavronicolas et al., 2008)[20], which provides the expected (inverse) proportion of attackers caught by the defenders. In a Defense-Optimal Nash equilibrium, the Defense-Ratio matches a simple lower bound.We discover that the existence of Defense-Optimal Nash equilibria depends in a subtle way on how the number of defenders compares to two natural graph-theoretic thresholds we identify. In this vein, we obtain, through a combinatorial analysis of Nash equilibria, a collection of trade-off results:• When the number of defenders is either sufficiently small or sufficiently large, Defense-Optimal Nash equilibria may exist. The corresponding decision problem is computationally tractable for a large number of defenders; the problem becomes NPNP-complete for a small number of defenders and the intractability is inherited from a previously unconsidered combinatorial problem in Fractional Graph Theory.• Perhaps paradoxically, there is a middle range of values for the number of defenders where Defense-Optimal Nash equilibria do not exist.}},
  author       = {{Mavronicolas, Marios and Monien, Burkhard and Papadopoulou Lesta, Vicky}},
  journal      = {{Discrete Applied Mathematics}},
  number       = {{16-17}},
  pages        = {{2563--2586}},
  publisher    = {{Elsevier}},
  title        = {{{How many attackers can selfish defenders catch?}}},
  doi          = {{10.1016/j.dam.2013.05.022}},
  volume       = {{161}},
  year         = {{2013}},
}

@unpublished{524,
  abstract     = {{We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages which can be verified by a nondeterministic algorithm with a constant number of communication rounds. In order to define the nondeterministic classes, they have transferred the notation of nondeterminism into the distributed setting by the use of certificates and verifiers. The class NLD^#n consists of all languages which can be verified by a nondeterministic algorithm where each node has access to an oracle for the number of nodes. They have shown the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies within the classes defined by Korman, Peleg and Fraigniaud. We define additional complexity classes: the class LD(t) consists of all languages which can be decided with at most t communication rounds. The class NLD-O(f) consists of all languages which can be verified by a local verifier such that the size of the certificates that are needed to verify the language are bounded by a function from O(f). Our main results are refined strict hierarchies within these nondeterministic classes.}},
  author       = {{Meyer auf der Heide, Friedhelm and Swirkot, Kamil}},
  publisher    = {{arXiv}},
  title        = {{{Hierarchies in Local Distributed Decision}}},
  year         = {{2013}},
}

@misc{525,
  author       = {{Niklas Vinkemeier, Tim}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Haptics - Hadoop performance testing in concurrent job scenarios}}},
  year         = {{2013}},
}

@misc{526,
  author       = {{Mäcker, Alexander}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Greedy Network Creation With Heavy And Light Edges}}},
  year         = {{2013}},
}

@inproceedings{527,
  abstract     = {{In the future vision of software engineering, services from world-wide markets are composed automated in order to build custom-made systems.Supporting such scenarios requires an adequate service matching approach.Many existing approaches do not fulfill two key requirements of emerging concepts like On-The-Fly-Computing, namely (1) comprehensiveness, i.e., the consideration of different service aspects that cover not only functional properties, but also non-functional properties and (2) fuzzy matching, i.e., the ability to deliver gradual results in order to cope with a certain extent of uncertainty, incompleteness, and tolerance ranges.In this paper, I present a fuzzy matching process that distinguishes between different fuzziness sources and leverages fuzziness in different matching steps which consider different service aspects, e.g., behavior and quality properties. }},
  author       = {{Christin Platenius, Marie}},
  booktitle    = {{Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)}},
  pages        = {{ 715--718 }},
  title        = {{{Fuzzy Service Matching in On-The-Fly Computing}}},
  doi          = {{10.1145/2491411.2492405}},
  year         = {{2013}},
}

@inproceedings{529,
  abstract     = {{Mechatronic systems reconfigure the structure of their software architecture, e.g., to avoid hazardous situations or to optimize operational conditions like minimizing their energy consumption. As software architectures are typically build on components, reconfiguration actions need to respect the component structure. This structure should be hierarchical to enable encapsulated components. While many reconfiguration approaches for embedded real-time systems allow the use of hierarchically embedded components, i.e., horizontal composition, none of them offers a modeling and verification solution to take hierarchical composition, i.e., encapsulation, into account. In this paper, we present an extension to our existing modeling language, MechatronicUML, to enable safe hierarchical reconfigurations. The two main extensions are (a) an adapted variant of the two-phase commit protocol to initiate reconfigurations which maintain component encapsulation and (b) a timed model checking verification approach for instances of our model. We illustrate our approach on a case study in the area of smart railway systems by showing two different use cases of our approach and the verification of their safety properties.}},
  author       = {{Heinzemann, Christian and Becker, Steffen}},
  booktitle    = {{Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)}},
  pages        = {{3--12}},
  title        = {{{Executing Reconfigurations in Hierarchical Component Architectures}}},
  doi          = {{10.1145/2465449.2465452}},
  year         = {{2013}},
}

@misc{530,
  author       = {{Buse, Dominik}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Entwurf kooperativer Verhaltensweisen heterogener Roboter}}},
  year         = {{2013}},
}

@misc{531,
  author       = {{Lutters, Sascha}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Entwurf eines datenschutzgerechten Reputationssystems}}},
  year         = {{2013}},
}

@misc{532,
  author       = {{Hilleckes, Hendrik}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme}}},
  year         = {{2013}},
}

@misc{533,
  author       = {{Borkowski, Richard}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung}}},
  year         = {{2013}},
}

@misc{534,
  author       = {{Satya, Suhas}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Emulating Wavelength Division Multiplexing using Openflow}}},
  year         = {{2013}},
}

@misc{535,
  author       = {{Reineke, Max}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Effizienzsteigerung durch gewichtete Produktbewertungen}}},
  year         = {{2013}},
}

@misc{536,
  author       = {{Stroh-Maraun, Nadja}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Dynamic One-to-One Matching: Theory and a Job Market Application}}},
  year         = {{2013}},
}

@misc{537,
  author       = {{Heindorf, Stefan}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Dispersion of Multi-Robot Teams}}},
  year         = {{2013}},
}

@unpublished{538,
  abstract     = {{We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes: a key-policy attribute-based KEM that is based on Goyal's key-policy ABE and a ciphertext-policy attribute-based KEM that is based on Waters' ciphertext-policy ABE. To achieve our goals, we use an appropriate hash function and need to extend the public parameters and the ciphertexts of the underlying CPA-secure encryption schemes only by a single group element. Moreover, we use the same hardness assumptions as the underlying CPA-secure encryption schemes.}},
  author       = {{Blömer, Johannes and Liske, Gennadij}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles}}},
  year         = {{2013}},
}

@misc{539,
  author       = {{Kornhoff, Tobias}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen}}},
  year         = {{2013}},
}