@misc{621,
author = {Sekula, Stephan},
publisher = {Universität Paderborn},
title = {{Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing}},
year = {2012},
}
@inproceedings{626,
abstract = {The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT).},
author = {Kniesburges, Sebastian and Scheideler, Christian},
booktitle = {Proceedings of the 26th International Symposium on Distributed Computing (DISC)},
pages = {435--436},
title = {{Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}},
doi = {10.1007/978-3-642-33651-5_45},
year = {2012},
}
@inproceedings{6288,
author = {Fischer, Holger Gerhard},
booktitle = {Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems - EICS '12},
isbn = {9781450311687},
publisher = {ACM Press},
title = {{Integrating usability engineering in the software development lifecycle based on international standards}},
doi = {10.1145/2305484.2305541},
year = {2012},
}
@inproceedings{6290,
author = {Fischer, Holger Gerhard and Klompmaker, Florian},
booktitle = {Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)},
publisher = {ISCRAM Digital Library},
title = {{Enriching Disaster Control Management based on Human-Computer Design}},
year = {2012},
}
@misc{587,
author = {Plessl, Christian and Platzner, Marco and Agne, Andreas and Happe, Markus and Lübbers, Enno},
publisher = {Awareness Magazine},
title = {{Programming models for reconfigurable heterogeneous multi-cores}},
year = {2012},
}
@article{5494,
author = {Baum, M and Gsell, L and Kabst, Rüdiger},
journal = {Die Betriebswirtschaft (ZfB).},
number = {3},
pages = {235--253},
title = {{Determinanten des Employer Branding in deutschen Unternehmen: Ein neoinstitutionalistischer Erklärungsansatz.}},
volume = {72},
year = {2012},
}
@article{5519,
author = {Steinmetz, Holger and Isidor, R and Bäuerle, N},
journal = {Survey Research Methods},
number = {1},
pages = {61--75},
title = {{Testing the Circular Structure of Human Values: A Meta-Analytical Structural Equation Modelling Approach.}},
volume = {6},
year = {2012},
}
@inproceedings{5615,
author = {Schryen, Guido and Wex, Felix},
booktitle = {45th Hawaii International Conference on System Sciences},
title = {{IS Design Thinking in Disaster Management Research}},
year = {2012},
}
@misc{575,
author = {Bremer, Lars},
publisher = {Universität Paderborn},
title = {{Symbiotic Coupling of Peer-to-Peer and Cloud Systems}},
year = {2012},
}
@misc{582,
author = {Strothmann, Thim Frederik},
publisher = {Universität Paderborn},
title = {{Self-Optimizing Binary Search Trees - A Game Theoretic Approach}},
year = {2012},
}
@misc{607,
author = {Haarhoff, Thomas},
publisher = {Universität Paderborn},
title = {{Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2}},
year = {2012},
}
@misc{614,
author = {Lehrig, Sebastian},
publisher = {Universität Paderborn},
title = {{Empirischer, quantitativer Vergleich von Modelltransformationssprachen}},
year = {2012},
}
@inbook{6149,
author = {Isidor, R and Schwens, C and Kabst, R},
booktitle = {Markteintrittsstrategien - Dynamik und Komplexität},
editor = {Zentes, J},
isbn = {978-3-8349-3503-8},
pages = {193--205},
title = {{Die Messung von Joint-Venture Erfolg}},
year = {2012},
}
@misc{594,
author = {Klerx, Timo},
publisher = {Universität Paderborn},
title = {{Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen}},
year = {2012},
}
@misc{599,
author = {Löwen, Xenia},
publisher = {Universität Paderborn},
title = {{Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium}},
year = {2012},
}
@techreport{602,
abstract = {We study the consequences of dropping the perfect competition assumption in a standard infinite horizon model with infinitely-lived traders and real collateralized assets, together with one additional ingredient: information among players is asymmetric and monitoring is incomplete. The key insight is that trading assets is not only a way to hedge oneself against uncertainty and to smooth consumption across time: It also enables learning information. Conversely, defaulting now becomes strategic: Certain players may manipulate prices so as to provoke a default in order to prevent their opponents from learning. We focus on learning equilibria, at the end of which no player has incorrect beliefs — not because those players with heterogeneous beliefs were eliminated from the market (although default is possible at equilibrium) but because they have taken time to update their prior belief. We prove a partial Folk theorem à la Wiseman (2011) of the following form: For any function that maps each state of the world to a sequence of feasible and strongly individually rational allocations, and for any degree of precision, there is a perfect Bayesian equilibrium in which patient players learn the realized state with this degree of precision and achieve a payoff close to the one specified for each state.},
author = {Brangewitz, Sonja},
publisher = {Universität Paderborn},
title = {{Learning by Trading in Infinite Horizon Strategic Market Games with Default}},
year = {2012},
}
@article{6055,
author = {Mehler, Alexander and Lücking, Andy and Menke, Peter},
issn = {0893-6080},
journal = {Neural Networks},
pages = {159--164},
publisher = {Elsevier BV},
title = {{Assessing cognitive alignment in different types of dialog by means of a network model}},
doi = {10.1016/j.neunet.2012.02.013},
volume = {32},
year = {2012},
}
@misc{633,
author = {Pischel, Daniel},
publisher = {Universität Paderborn},
title = {{Analyse, Konzeption und Implementierung von Aggregationsverfahren für Trinkwasserversorgungsnetze}},
year = {2012},
}
@misc{638,
author = {Eidens, Fabian},
publisher = {Universität Paderborn},
title = {{Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken}},
year = {2012},
}
@inproceedings{640,
abstract = {Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network.},
author = {Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian},
booktitle = {Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
pages = {1261----1271},
title = {{A Self-Stabilization Process for Small-World Networks}},
doi = {10.1109/IPDPS.2012.115},
year = {2012},
}