@inproceedings{3177, author = {{Travkin, Oleg and Mütze, Annika and Wehrheim, Heike}}, booktitle = {{Hardware and Software: Verification and Testing - 9th International Haifa Verification Conference, {HVC} 2013, Haifa, Israel, November 5-7, 2013, Proceedings}}, editor = {{Bertacco, Valeria and Legay, Axel}}, pages = {{311----326}}, title = {{{{SPIN} as a Linearizability Checker under Weak Memory Models}}}, doi = {{10.1007/978-3-319-03077-7_21}}, year = {{2013}}, } @article{21042, author = {{Christ, Andreas and Brecht, Benjamin and Mauerer, Wolfgang and Silberhorn, Christine}}, issn = {{1367-2630}}, journal = {{New Journal of Physics}}, title = {{{Theory of quantum frequency conversion and type-II parametric down-conversion in the high-gain regime}}}, doi = {{10.1088/1367-2630/15/5/053038}}, volume = {{15}}, year = {{2013}}, } @book{19071, editor = {{Eke, Norbert Otto}}, pages = {{51}}, title = {{{Ehrenpromotion der Fakultät für Kulturwissenschaften der Universität Paderborn an Herta Müller. Paderborn, 29.10.2012. Dokumentation}}}, year = {{2013}}, } @book{19072, editor = {{Eke, Norbert Otto}}, pages = {{362}}, publisher = {{Rodopi}}, title = {{{„Nach der Mauer der Abgrund“? (Wieder-)Annäherungen an die DDR-Literatur}}}, year = {{2013}}, } @inbook{19254, author = {{Eke, Norbert Otto}}, booktitle = {{Poetiken der Gegenwart. Deutschsprachige Romane nach 2000}}, editor = {{Horstkotte, Silke and Herrmann, Leonhard}}, pages = {{267--283}}, publisher = {{de Gruyter}}, title = {{{„Wenn ihr zufrieden seid, so ist’s vollkommen“. Vom Hof in Ferrara zur Villa Massimo in Rom oder: Der Autor im Betrieb}}}, year = {{2013}}, } @inbook{19255, author = {{Eke, Norbert Otto}}, booktitle = {{Jahrbuch zur Liberalismus-Forschung 25}}, editor = {{Conze, Eckart and Scholtyseck, Joachim and Weede, Erich}}, pages = {{27--49}}, publisher = {{Nomos}}, title = {{{Zu „sagen […], ich unterschreibe Alles, Hunde sind wir ja doch!‘ halte ich des Mannes, des Christen unwürdig“ – Zivilcourage im Vormärz}}}, year = {{2013}}, } @inbook{19256, author = {{Eke, Norbert Otto}}, booktitle = {{Benn Forum Band 3 2012/13. Beiträge zur literarischen Moderne [Jahrbuch]}}, editor = {{Dyck, Joachim and Korte, Hermann and Schmidt, Nadine Jessica}}, pages = {{3--15}}, publisher = {{de Gruyter}}, title = {{{„Südliches Meer“. Rausch und Ekstase in Gottfried Benns Werk}}}, year = {{2013}}, } @inbook{19257, author = {{Eke, Norbert Otto}}, booktitle = {{Herta Müller}}, editor = {{Haines, Brigid and Marven, Lyn}}, pages = {{99--116}}, publisher = {{Oxford University Press}}, title = {{{‚Macht nichts, macht nichts, sagte ich mir, macht nichts‘: Herta Müller’s Romanian Novels}}}, year = {{2013}}, } @inbook{19258, author = {{Eke, Norbert Otto}}, booktitle = {{Ehrenpromotion der Fakultät für Kulturwissenschaften der Universität Paderborn an Herta Müller. Paderborn, 29.10.2012. Dokumentation}}, editor = {{Eke, Norbert Otto}}, pages = {{14--27}}, title = {{{Widerstehen und Widersprechen [Laudatio auf Herta Müller]}}}, year = {{2013}}, } @inbook{19259, author = {{Eke, Norbert Otto}}, booktitle = {{„Nach der Mauer der Abgrund“? (Wieder-)Annäherungen an die DDR-Literatur}}, editor = {{Eke, Norbert Otto}}, pages = {{7--25}}, publisher = {{Rodopi}}, title = {{{„Nach der Mauer der Abgrund“? (Wieder-)Annäherungen an die DDR-Literatur}}}, year = {{2013}}, } @inbook{2036, author = {{Krimphove, Dieter}}, booktitle = {{Kommentar: MaComp Mindestanforderungen an die Compliance-Funktion und die weiteren Verhaltens-, Organisations- und Transparenzpflichten nach §§ 31 ff. WpHG für Wertpapierdienstleistungsunternehmen }}, editor = {{Krimphove, Dieter and Kruse, Oliver}}, pages = {{44 – 48}}, publisher = {{C.H. Beck}}, title = {{{AT 5 der MaComp: Zusammenarbeit mehrere Wertpapierdienstleistungsunternehmen}}}, year = {{2013}}, } @misc{18000, author = {{Blumentritt, Fritz}}, publisher = {{Universität Paderborn}}, title = {{{Cliquenbildung in verteilten Systemen}}}, year = {{2013}}, } @inproceedings{23135, author = {{Schmuedderich, Tanja and Lochbichler, Matthias and Trächtler, Ansgar}}, booktitle = {{Tagungsband Mechatronik 2013 (ISBN 3-86130-958-0)}}, pages = {{43--48}}, title = {{{Methodik zur anforderungsgerechten Wahl der Modellierungstiefe von Verhaltensmodellen fuer die virtuelle Inbetriebnahme}}}, year = {{2013}}, } @inproceedings{23136, author = {{Schmuedderich, Tanja and Trächtler, Ansgar and Brökelmann, Jan and Gausemeier, Jürgen}}, booktitle = {{Smart Product Engineering - Proceedings of the 23rd CIRP Design Conference (ISBN 978-3-642-30816, Springer-Verlag)}}, pages = {{23--32}}, title = {{{Procedural Model for the Virtual Commissioining on the Basis of Model-based Design}}}, year = {{2013}}, } @inproceedings{774, author = {{Cicconetti, Claudio and Morelli, Arianna and Dräxler, Martin and Karl, Holger and Mancuso, Vincenzo and Sciancalepore, Vincenzo and Gupta, Rohit and de la Oliva, Antonio and Isabel Sanchez, M. and Serrano, Pablo and Roullet, Laurent}}, booktitle = {{2013 Future Network & Mobile Summit, Lisboa, Portugal, July 3-5, 2013}}, pages = {{1----4}}, title = {{{The playground of Wireless Dense networks of the future}}}, year = {{2013}}, } @inproceedings{777, author = {{Dräxler, Martin and Karl, Holger}}, booktitle = {{2013 9th International Wireless Communications and Mobile Computing Conference, IWCMC 2013, Sardinia, Italy, July 1-5, 2013}}, pages = {{1181----1186}}, title = {{{Cross-layer scheduling for multi-quality video streaming in cellular wireless networks}}}, doi = {{10.1109/IWCMC.2013.6583724}}, year = {{2013}}, } @inproceedings{6054, author = {{Menke, Peter and McCrae, John and Cimiano, Philipp}}, booktitle = {{Proceedings of the 2nd Workshop on Linked Data in Linguistics (LDL-2013): Representing and linking lexicons, terminologies and other language data}}, pages = {{44--52}}, publisher = {{ACL}}, title = {{{Releasing multimodal data as Linguistic Linked Open Data: An experience report}}}, year = {{2013}}, } @article{476, abstract = {{An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint paths between a source and a sink, each path carrying a unit of ow, and an h-route ow is a non-negative linear combination of elementary h-routeows. An h-route cut is a set of edges whose removal decreases the maximum h-route ow between a given source-sink pair (or between every source-sink pair in the multicommodity setting) to zero. The main result of this paper is an approximate duality theorem for multicommodity h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h and at most O(log4 k f) where f is the size of the maximum h-routeow and k is the number of commodities. The main step towards the proof of this duality is the design and analysis of a polynomial-time approximation algorithm for the minimum h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously, polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient of our algorithm is a novel rounding technique that we call multilevel ball-growing. Though the proof of the duality relies on this algorithm, it is not a straightforward corollary of it as in the case of classical multicommodity ows and cuts. Similar results are shown also for the sparsest multiroute cut problem.}}, author = {{Kolman, Petr and Scheideler, Christian}}, journal = {{Theory of Computing Systems}}, number = {{2}}, pages = {{341--363}}, publisher = {{Springer}}, title = {{{Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}}}, doi = {{10.1007/s00224-013-9454-3}}, year = {{2013}}, } @inproceedings{477, abstract = {{We consider the k-token dissemination problem, where k initially arbitrarily distributed tokens have to be disseminated to all nodes in a dynamic network (as introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks, our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean plane and two nodes are connected if and only if their distance is at most R. Our worst-case adversary is allowed to move the nodes on the plane, but the maximum velocity v_max of each node is limited and the graph must be connected in each round. For this model, we provide almost tight lower and upper bounds for k-token dissemination if nodes are restricted to send only one token per round. It turns out that the maximum velocity v_max is a meaningful parameter to characterize dynamics in our model.}}, author = {{Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers}}, pages = {{22--34}}, title = {{{Token Dissemination in Geometric Dynamic Networks}}}, doi = {{10.1007/978-3-642-45346-5_3}}, year = {{2013}}, } @inproceedings{481, abstract = {{Cloud computing offers high availability, dynamic scalability, and elasticity requiring only very little administration. However, this service comes with financial costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot match the quality of service of the cloud. This paper focuses on the case study of Wikipedia and presents an approach to reduce the operational costs of hosting similar websites in the cloud by using a practical peer-to-peer approach. The visitors of the site are joining a Chord overlay, which acts as first cache for article lookups. Simulation results show, that up to 72% of the article lookups in Wikipedia could be answered by other visitors instead of using the cloud.}}, author = {{Graffi, Kalman and Bremer, Lars}}, booktitle = {{Proceedings of the International Conference on Communications (ICC'13)}}, pages = {{3444 -- 3449 }}, title = {{{Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case}}}, doi = {{10.1109/ICC.2013.6655082}}, year = {{2013}}, }