@misc{503, author = {{Blix, Andreas}}, publisher = {{Universität Paderborn}}, title = {{{Optimale und adaptive binäre Bäume in Netzwerken}}}, year = {{2013}}, } @inbook{5031, author = {{Becker, Jörg and Bernhold, Torben and Beverungen, Daniel and Kaling, Nina and Knackstedt, Ralf and Vanessa, Lellek and Peter Rauer, Hans}}, booktitle = {{Dienstleistungsmodellierung 2012: Product-Service Systems und Produktivität}}, editor = {{Thomas, Oliver and Nüttgens, Markus}}, pages = {{208----226}}, title = {{{Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management}}}, doi = {{10.1007/978-3-658-00863-5}}, year = {{2013}}, } @misc{504, author = {{Schwichtenberg, Simon}}, publisher = {{Universität Paderborn}}, title = {{{Ontology-based Normalization and Matching of Rich Service Descriptions}}}, year = {{2013}}, } @book{5042, author = {{König, Rolf and Sureth-Sloane, Caren}}, publisher = {{Verlag Neue Wirtschafts-Briefe}}, title = {{{Besteuerung und Rechtsformwahl}}}, year = {{2013}}, } @misc{5043, author = {{Maiterth, Ralf and Sureth-Sloane, Caren}}, booktitle = {{Frankfurter Allgemeine Zeitung}}, number = {{125}}, pages = {{18}}, title = {{{Vermögensteuer vernichtet Eigenkapital}}}, year = {{2013}}, } @techreport{5044, author = {{Meißner, Fabian and Sureth-Sloane, Caren}}, title = {{{The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation}}}, volume = {{141}}, year = {{2013}}, } @misc{5046, author = {{Sureth-Sloane, Caren}}, booktitle = {{Cicero Online}}, title = {{{ Die Reichensteuer gefährdet Arbeitsplätze}}}, year = {{2013}}, } @inproceedings{506, abstract = {{Alle Dom{\"a}nen und Branchen der heutigen Wirtschaft sind auf eine effiziente und effektive Entwicklung von ben{\"o}tigten Softwaresystemen angewiesen. Das 40 Jahre alte Prinzip der Beschaffung von Softwaresystemen durch den Einkauf von teuren, relativ unflexiblen Standardl{\"o}sungen beziehungsweise der noch teureren Erstellung durch Softwareh{\"a}user oder eigene Softwareabteilungen muss deshalb in Frage gestellt werden. Mit dem Einsatz von Cloud Computing-Techniken wird es m{\"o}glich, Softwaresysteme und die f{\"u}r den Betrieb ben{\"o}tigten Ressourcen nur bei Bedarf und nur in der ben{\"o}tigten Form einzukaufen. Mit dem Ansatz der service-orientierten Architekturen stehen Methoden zur Verf{\"u}gung, Software zumindest unternehmensintern flexibel zusammenzustellen. Diese ersten Ans{\"a}tze f{\"u}r eine neue Art der Entwicklung und des Betriebs von Softwaresystemen bilden den Ausgangspunkt f{\"u}r die Forschungen in dem seit 2011 laufenden DFG Sonderforschungsbereich (SFB) 901 „On-The-Fly Computing“ an der Universit{\"a}t Paderborn. Die Vision des On-The-Fly Computing ist, dass die Softwaresysteme der Zukunft aus individuell und automatisch konfigurierten und zur Ausf{\"u}hrung gebrachten Softwarebausteinen bestehen, die auf M{\"a}rkten frei gehandelt werden und flexibel kombinierbar sind. Um zu erforschen, in wie weit diese Vision realisierbar ist, werden Konzepte, Methoden und Techniken entwickelt, die eine weitestgehend automatische Konfiguration, Ausf{\"u}hrung und Adaption von Softwaresystemen aus auf weltweiten M{\"a}rkten verf{\"u}gbaren Services erm{\"o}glichen. Um diese Ziele zu erreichen, arbeiten an der Universit{\"a}t Paderborn Informatiker aus unterschiedlichen Disziplinen wie Softwaretechnik, Algorithmik, Rechnernetze, Systementwurf, Sicherheit und Kryptographie mit Wirtschaftswissenschaftlern zusammen, die ihre spezifische Expertise einbringen, mit der die Organisation und Weiterentwicklung des Marktes vorangetrieben werden kann.}}, author = {{Engels, Gregor}}, booktitle = {{Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)}}, pages = {{17--18}}, title = {{{On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft}}}, year = {{2013}}, } @inproceedings{507, abstract = {{We study two-party communication in the context of directed dynamic networks that are controlled by an adaptive adversary. This adversary is able to change all edges as long as the networks stay strongly-connected in each round. In this work, we establish a relation between counting the total number of nodes in the network and the problem of exchanging tokens between two communication partners which communicate through a dynamic network. We show that the communication problem for a constant fraction of n tokens in a dynamic network with n nodes is at most as hard as counting the number of nodes in a dynamic network with at most 4n+3 nodes. For the proof, we construct a family of directed dynamic networks and apply a lower bound from two-party communication complexity.}}, author = {{Abshoff, Sebastian and Benter, Markus and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)}}, pages = {{11--22}}, title = {{{On Two-Party Communication Through Dynamic Networks}}}, doi = {{10.1007/978-3-319-03850-6_2}}, year = {{2013}}, } @inproceedings{508, abstract = {{The process of planning a virtual topology for a Wavelength Devision Multiplexing (WDM) network is called Virtual Topology Design (VTD). The goal of VTD is to find a virtual topology that supports forwarding the expected traffic without congestion. In networks with fluctuating, high traffic demands, it can happen that no single topology fits all changing traffic demands occurring over a longer time. Thus, during operation, the virtual topology has to be reconfigured. Since modern networks tend to be large, VTD algorithms have to scale well with increasing network size, requiring distributed algorithms. Existing distributed VTD algorithms, however, react too slowly on congestion for the real-time reconfiguration of large networks. We propose Selfish Virtual Topology Reconfiguration (SVTR) as a new algorithm for distributed VTD. It combines reconfiguring the virtual topology and routing through a Software Defined Network (SDN). SVTR is used for online, on-the-fly network reconfiguration. Its integrated routing and WDM reconfiguration keeps connection disruption due to network reconfiguration to a minimum and is able to react very quickly to traffic pattern changes. SVTR works by iteratively adapting the virtual topology to the observed traffic patterns without global traffic information and without future traffic estimations. We evaluated SVTR by simulation and found that it significantly lowers congestion in realistic networks and high load scenarios.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)}}, pages = {{1 -- 6 }}, title = {{{On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks}}}, doi = {{10.1109/LANMAN.2013.6528271}}, year = {{2013}}, } @inproceedings{509, abstract = {{In this paper we will introduce a new d-dimensional graph for constructing geometric application layer overlay net-works. Our approach will use internet coordinates, embedded using the L∞ -metric. After describing the graph structure, we will show how it limits maintenance overhead by bounding each node’s out-degree and how it supports greedy routing using one-hop neighbourhood information in each routing step. We will further show that greedy routing can always compute a path in our graph and we will also prove that in each forwarding step the next hop is closer to the destination than the current node.}}, author = {{Autenrieth, Marcus and Frey, Hannes}}, booktitle = {{Proceedings of the Conference on Networked Systems (NetSys)}}, pages = {{126--131}}, title = {{{On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings}}}, doi = {{10.1109/NetSys.2013.10}}, year = {{2013}}, } @misc{510, author = {{Jayesh Parekh, Chintan}}, publisher = {{Universität Paderborn}}, title = {{{Meta-data based Search in Structured Peer-to-Peer Networks}}}, year = {{2013}}, } @misc{511, author = {{Splietker, Malte}}, publisher = {{Universität Paderborn}}, title = {{{MapReduce in Software Defined Networks}}}, year = {{2013}}, } @article{5111, author = {{Gilroy, Bernard Michael and Schreckenberg, Heike and Seiler, Volker}}, journal = {{Federal Governance}}, number = {{2}}, pages = {{3--18}}, publisher = {{MISC}}, title = {{{Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration?}}}, volume = {{10}}, year = {{2013}}, } @article{5112, author = {{Gilroy, Bernard Michael and Lukas, Elmar and Heimann, Christian}}, journal = {{Jahrbücher für Nationalokonomie 6 Statistik}}, title = {{{Technologiestandort Deutschland und internationale Wissensspillover.}}}, volume = {{233}}, year = {{2013}}, } @article{5114, author = {{Gilroy, Bernard Michael and Heimann, Anastasia and Schopf, Mark}}, journal = {{Basic Income Studies}}, number = {{1}}, pages = {{43--70}}, publisher = {{De Gruyter}}, title = {{{Basic income and labour supply: The German case}}}, volume = {{8}}, year = {{2013}}, } @article{5115, author = {{Gilroy, Bernard Michael and Nguyen, Birke Thuy Duong}}, journal = {{WiSt-Wirtschaftswissenschaftliches Studium}}, number = {{3}}, pages = {{134--140}}, publisher = {{Verlag Franz Vahlen GmbH}}, title = {{{Ist Fairer Handel Wirklich Fair?}}}, volume = {{42}}, year = {{2013}}, } @techreport{5117, author = {{Gilroy, Bernard Michael and Schreckenberg, Heike and Seiler, Volker}}, title = {{{Water as an alternative asset}}}, year = {{2013}}, } @misc{512, author = {{Herzog, Elvira}}, publisher = {{Universität Paderborn}}, title = {{{Lösungsverfahren für das many-to-one Matching Problem}}}, year = {{2013}}, } @inproceedings{513, abstract = {{This paper initiates the study of self-adjusting networks (or distributed data structures) whose topologies dynamically adapt to a communication pattern $\sigma$. We present a fully decentralized self-adjusting solution called SplayNet. A SplayNet is a distributed generalization of the classic splay tree concept. It ensures short paths (which can be found using local-greedy routing) between communication partners while minimizing topological rearrangements. We derive an upper bound for the amortized communication cost of a SplayNet based on empirical entropies of $\sigma$, and show that SplayNets have several interesting convergence properties. For instance, SplayNets features a provable online optimality under special requests scenarios. We also investigate the optimal static network and prove different lower bounds for the average communication cost based on graph cuts and on the empirical entropy of the communication pattern $\sigma$. From these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where the requests follow a product distribution as well. Finally, this paper shows that in contrast to the Minimum Linear Arrangement problem which is generally NP-hard, the optimal static tree network can be computed in polynomial time for any guest graph, despite the exponentially large graph family. We complement our formal analysis with a small simulation study on a Facebook graph.}}, author = {{Avin, Chen and Häupler, Bernhard and Lotker, Zvi and Scheideler, Christian and Schmid, Stefan}}, booktitle = {{Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}}, pages = {{395--406}}, title = {{{Locally Self-Adjusting Tree Networks}}}, doi = {{10.1109/IPDPS.2013.40}}, year = {{2013}}, }