@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}}, } @phdthesis{514, abstract = {{Diese Arbeit besch{\"a}ftigt sich mit dem Facility Location Problem. Dies ist ein Optimierungsproblem, bei dem festgelegt werden muss an welchen Positionen Ressourcen zur Verf{\"u}gung gestellt werden, so dass diese von Nutzern gut erreicht werden k{\"o}nnen. Es sollen dabei Kosten minimiert werden, die zum einen durch Bereitstellung von Ressourcen und zum anderen durch Verbindungskosten zwischen Nutzern und Ressourcen entstehen. Die Schwierigkeit des Problems liegt darin, dass man einerseits m{\"o}glichst wenige Ressourcen zur Verf{\"u}gung stellen m{\"o}chte, andererseits daf{\"u}r sorgen muss, dass sich Nutzer nicht all zu weit weg von Ressourcen befinden. Dies w{\"u}rde n{\"a}mlich hohe Verbindungskosten nach sich ziehen. Das Facility Location Problem wurde bereits sehr intensiv in vielen unterschiedlichen Varianten untersucht. In dieser Arbeit werden drei Varianten des Problems modelliert und neue Algorithmen f{\"u}r sie entwickelt und bez{\"u}glich ihres Approximationsfaktors und ihrer Laufzeit analysiert. Jede dieser drei untersuchten Varianten hat einen besonderen Schwerpunkt. Bei der ersten Varianten handelt es sich um ein Online Problem, da hier die Eingabe nicht von Anfang an bekannt ist, sondern Schritt f{\"u}r Schritt enth{\"u}llt wird. Die Schwierigkeit hierbei besteht darin unwiderrufliche Entscheidungen treffen zu m{\"u}ssen ohne dabei die Zukunft zu kennen und trotzdem eine zu jeder Zeit gute L{\"o}sung angeben zu k{\"o}nnen. Der Schwerpunkt der zweiten Variante liegt auf Lokalit{\"a}t, die z.B. in Sensornetzwerken von großer Bedeutung ist. Hier soll eine L{\"o}sung verteilt und nur mit Hilfe von lokalen Information berechnet werden. Schließlich besch{\"a}ftigt sich die dritte Variante mit einer verteilten Berechnung, bei welcher nur eine stark beschr{\"a}nkte Datenmenge verschickt werden darf und dabei trotzdem ein sehr guter Approximationsfaktor erreicht werden muss. Die bei der Analyse der Approximationsfaktoren bzw. der Kompetitivit{\"a}t verwendeten Techniken basieren zum großen Teil auf Absch{\"a}tzung der primalen L{\"o}sung mit Hilfe einer L{\"o}sung des zugeh{\"o}rigen dualen Problems. F{\"u}r die Modellierung von Lokalit{\"a}t wird das weitverbreitete LOCAL Modell verwendet. In diesem Modell werden f{\"u}r die Algorithmen subpolynomielle obere Laufzeitschranken gezeigt.}}, author = {{Pietrzyk, Peter}}, publisher = {{Universität Paderborn}}, title = {{{Local and Online Algorithms for Facility Location}}}, year = {{2013}}, } @article{5144, author = {{Seiler, Volker and Rudolf, Markus and Krume, Tim}}, journal = {{International Journal of Bank Marketing}}, number = {{4}}, pages = {{235--258}}, publisher = {{Emerald Group Publishing Limited}}, title = {{{The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry}}}, volume = {{31}}, year = {{2013}}, } @techreport{5146, abstract = {{In this paper, we analyze a model in which two divisions negotiate over an intrafirm transfer price for an intermediate product. Formally, we consider bargaining problems under incomplete information, since the upstream division’s (seller's) costs and downstream division's (buyer's) revenues are supposed to be private information. Assuming two possible types for buyer and seller each, we first establish that the bargaining problem is regular, regardless whether incentive and/or efficiency constraints are imposed. This allows us to apply the generalized Nash bargaining solution to determine transfer payments and transfer probabilities. Furthermore, we derive general properties of this solution for the transfer pricing problem and compare the model developed here with the existing literature for negotiated transfer pricing under incomplete information. In particular, we focus on the models presented in Wagenhofer (1994).}}, author = {{Brangewitz, Sonja and Haake, Claus-Jochen}}, keywords = {{Transfer Pricing, Negotiation, Generalized Nash Bargaining Solution, Incomplete Information}}, publisher = {{CIE Working Paper Series, Paderborn University}}, title = {{{Cooperative Transfer Price Negotiations under Incomplete Information}}}, volume = {{64}}, year = {{2013}}, } @article{515, abstract = {{The as a service paradigm reflects the fundamental idea of providing basic coherent functionality in terms of components that can be utilised on demand. These so-called services may also be interconnected in order to provide more complex functionality. Automation of this service composition process is indeed a formidable challenge. In our work, we are addressing this challenge by decomposing service composition into sequential decision making steps. Each step is supported by a recommendation mechanism. If composition requests recur over time and if evaluations of composition results are fed back, a proper recommendation strategy can evolve over time through learning from experience. In this paper, we describe our approach of modelling this service composition and recommendation process as Markov decision process and of solving it by means of reinforcement learning. A case study serves as proof of concept.}}, author = {{Jungmann, Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth}}, journal = {{International Journal of Business Process Integration and Management}}, number = {{4}}, pages = {{284--297}}, publisher = {{InderScience}}, title = {{{Learning Service Recommendations}}}, doi = {{10.1504/IJBPIM.2013.059135}}, year = {{2013}}, } @inproceedings{516, abstract = {{The as a Service paradigm reflects the fundamental idea of providing basic coherent functionality in terms of components that can be utilized on demand. These so-called services may also be interconnected in order to provide more complex functionality. Automation of this service composition process is indeed a formidable challenge. In our work, we are addressing this challenge by decomposing service composition into sequential decision making steps. Each step is supported by a recommendation mechanism. If composition requests recur over time and if evaluations of composition results are fed back, a proper recommendation strategy can evolve over time through learning from experience. In this paper, we describe our general idea of modeling this service composition and recommendation process as Markov Decision Process and of solving it by means of Reinforcement Learning. A case study serves as proof of concept. }}, author = {{Jungmann, Alexander and Kleinjohann, Bernd}}, booktitle = {{Proceedings of the 10th IEEE International Conference on Services Computing (SCC)}}, pages = {{97--104}}, title = {{{Learning Recommendation System for Automated Service Composition}}}, doi = {{10.1109/SCC.2013.66}}, year = {{2013}}, } @inproceedings{517, abstract = {{In the Semantic (Web) Services area, services are considered black boxes with a semantic description of their interfaces as to allow for precise service selection and configuration. The semantic description is usually grounded on domain-specific concepts as modeled in ontologies. This accounts for types used in service signatures, but also predicates occurring in preconditions and effects of services. Ontologies, in particular those enhanced with rules, capture the knowledge of domain experts on properties of and relations between domain concepts. In this paper, we present a verification technique for service compositions which makes use of this domain knowledge. We consider a service composition to be an assembly of services of which we just know signatures, preconditions, and effects. We aim at proving that a composition satisfies a (user-defined) requirement, specified in terms of guaranteed preconditions and required postconditions. As an underlying verification engine we use an SMT solver. To take advantage of the domain knowledge (and often, to enable verification at all), the knowledge is fed into the solver in the form of sorts, uninterpreted functions and in particular assertions as to enhance the solver’s reasoning capabilities. Thereby, we allow for deductions within a domain previously unknown to the solver. We exemplify our technique on a case study from the area of water network optimization software.}}, author = {{Walther, Sven and Wehrheim, Heike}}, booktitle = {{Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)}}, pages = {{24 -- 32 }}, title = {{{Knowledge-Based Verification of Service Compositions - An SMT approach}}}, doi = {{10.1109/ICECCS.2013.14}}, year = {{2013}}, } @book{5172, author = {{Sievers, Sönke}}, isbn = {{978-3-86582-925-2}}, keywords = {{Unternehmensbewertung, Unternehmenswachstum, Return on Investment Unternehmensbewertung, Investition, Steuervergünstigung}}, publisher = {{Verlag-Haus Monsenstein und Vannerdat}}, title = {{{Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues}}}, year = {{2013}}, } @misc{518, author = {{Petrausch, Vanessa}}, publisher = {{Universität Paderborn}}, title = {{{Klassifizierung unterschiedlicher Ansätze zum Matching von Services}}}, year = {{2013}}, } @inproceedings{519, abstract = {{In this work we present the first scalable distributed information system,i.e., a system with low storage overhead, that is provably robust againstDenial-of-Service (DoS) attacks by a current insider. We allow acurrent insider to have complete knowledge about the information systemand to have the power to block any \epsilon-fraction of its serversby a DoS-attack, where \epsilon can be chosen up to a constant. The taskof the system is to serve any collection of lookup requests with at most oneper non-blocked server in an efficient way despite this attack. Previously,scalable solutions were only known for DoS-attacks of past insiders, where apast insider only has complete knowledge about some past time pointt_0 of the information system. Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible to design an information system so that anyinformation that was inserted or last updated after t_0 is safe against a DoS-attack. But their constructions would not work at all for a current insider. The key idea behindour IRIS system is to make extensive use of coding. More precisely, we presenttwo alternative distributed coding strategies with an at most logarithmicstorage overhead that can handle up to a constant fraction of blocked servers.}}, author = {{Eikel, Martina and Scheideler, Christian}}, booktitle = {{Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{119--129}}, title = {{{IRIS: A Robust Information System Against Insider DoS-Attacks}}}, doi = {{10.1145/2486159.2486186}}, year = {{2013}}, } @inproceedings{520, abstract = {{Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known to the RWA algorithm.Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parametersknown only at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason an RWA algorithm is needed which incorporates feedback from the application layer in the preemption decisions.This work proposes a simple interface along with an algorithm for computing and selecting preemption candidates in case a lightpath cannot be established. We reason about the necessity of using information from the application layer in the RWA and present two example applications which benefit from this idea.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}}, pages = {{51--52}}, title = {{{Incorporating feedback from application layer into routing and wavelength assignment algorithms}}}, doi = {{10.1109/INFCOMW.2013.6970733}}, year = {{2013}}, }