@inproceedings{548,
  abstract     = {{Peer-to-peer systems scale to millions of nodes and provide routing and storage functions with best effort quality. In order to provide a guaranteed quality of the overlay functions, even under strong dynamics in the network with regard to peer capacities, online participation and usage patterns, we propose to calibrate the peer-to-peer overlay and to autonomously learn which qualities can be reached. For that, we simulate the peer-to-peer overlay systematically under a wide range of parameter configurations and use neural networks to learn the effects of the configurations on the quality metrics. Thus, by choosing a specific quality setting by the overlay operator, the network can tune itself to the learned parameter configurations that lead to the desired quality. Evaluation shows that the presented self-calibration succeeds in learning the configuration-quality interdependencies and that peer-to-peer systems can learn and adapt their behavior according to desired quality goals.}},
  author       = {{Graffi, Kalman and Klerx, Timo}},
  booktitle    = {{Proceedings of the International Conference on Peer-to-Peer Computing (P2P'13)}},
  pages        = {{1--5}},
  title        = {{{Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks}}},
  doi          = {{10.1109/P2P.2013.6688720}},
  year         = {{2013}},
}

@misc{555,
  author       = {{Setzer, Alexander}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs}}},
  year         = {{2013}},
}

@proceedings{558,
  editor       = {{Flocchini, Paola and Gao, Jie and Kranakis, Evangelos and Meyer auf der Heide, Friedhelm}},
  location     = {{Sophia Antipolis, France}},
  publisher    = {{Springer}},
  title        = {{{Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics}}},
  doi          = {{10.1007/978-3-642-45346-5}},
  volume       = {{8243}},
  year         = {{2013}},
}

@inproceedings{559,
  abstract     = {{Distributed hash tables are very versatile to use, as distributed storage is a desirable feature for various applications. Typical structured overlays like Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality. In a practical use case, nodes might get overloaded by storing popular data. In this paper, we present a general approach to enable capacity awareness and load-balancing capability of homogeneous structured overlays. We introduce a hierarchical second structured overlay aside, which allows efficient capacity-based access on the nodes in the system as hosting mirrors. Simulation results show that the structured overlay is able to store various contents, such as of a social network, with only a negligible number of overloaded peers. Content, even if very popular, is hosted by easily findable capable peers. Thus, long-existing and well-evaluated overlays like Chord or Pastry can be used to create attractive DHT-based applications.}},
  author       = {{Wette, Philip and Graffi, Kalman}},
  booktitle    = {{Proceedings of the Conference on Networked Systems (NetSys)}},
  pages        = {{35--42}},
  title        = {{{Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables}}},
  doi          = {{10.1109/NetSys.2013.9}},
  year         = {{2013}},
}

@inproceedings{562,
  abstract     = {{In Distributed Cloud Computing, applications are deployed across many data centres at topologically diverse locations to improved network-related quality of service (QoS). As we focus on interactive applications, we minimize the latency between users and an application by allocating Cloud resources nearby the customers. Allocating resources at all locations will result in the best latency but also in the highest expenses. So we need to find an optimal subset of locations which reduces the latency but also the expenses – the facility location problem (FLP). In addition, we consider resource capacity restrictions, as a resource can only serve a limited amount of users. An FLP can be globally solved. Additionally, we propose a local, distributed heuristic. This heuristic is running within the network and does not depend on a global component. No distributed, local approximations for the capacitated FLP have been proposed so far due to the complexity of the problem. We compared the heuristic with an optimal solution obtained from a mixed integer program for different network topologies. We investigated the influence of different parameters like overall resource utilization or different latency weights.}},
  author       = {{Keller, Matthias and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}},
  booktitle    = {{Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing}},
  pages        = {{429--434}},
  title        = {{{A Local Heuristic for Latency-Optimized Distributed Cloud Deployment}}},
  doi          = {{10.1109/UCC.2013.85}},
  year         = {{2013}},
}

@inproceedings{563,
  abstract     = {{Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc networks. Such backbones receive and transmit messages from/to every node in the network. Existing distributed algorithms only consider undirected graphs, which model symmetric networks with uniform transmission ranges. We are particularly interested in the well-established disk graphs, which model asymmetric networks with non-uniform transmission ranges. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it. We introduce the first distributed algorithm for this problem in disk graphs. The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of O(Diam) where Diam is the diameter of the graph and k denotes the transmission ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission range, respectively. Moreover, we apply our algorithm on the subgraph of disk graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k) -approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k , is an optimal approximation for the problem, following Lenzen and Wattenhofer’s Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk graphs.}},
  author       = {{Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}},
  booktitle    = {{Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)}},
  pages        = {{217--227}},
  title        = {{{A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks}}},
  doi          = {{10.1007/978-3-642-45346-5_16}},
  year         = {{2013}},
}

@inproceedings{564,
  abstract     = {{We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the add ress of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)) or bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while ensuring only a linearruntime (O(n)) on the number of rounds.}},
  author       = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}},
  booktitle    = {{Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)}},
  pages        = {{165--176}},
  title        = {{{A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery}}},
  doi          = {{10.1007/978-3-319-03578-9_14}},
  year         = {{2013}},
}

@article{32104,
  author       = {{Kiefer, Björn and Niederhaus, Constanze and Balzani, Daniel and Bobisch, Christian A. and Gerharz, Eva and Kruggel-Emden, Harald and Schwarz, Alexander and Thielbörger, Pierre and Weiss, Gregor N. F.}},
  journal      = {{Journal Hochschuldidaktik (24, 1-2)}},
  pages        = {{7--10}},
  title        = {{{Anreizsysteme – Eine Möglichkeit zur Verbesserung der universitären Lehre?}}},
  year         = {{2013}},
}

@inbook{32109,
  author       = {{Niederhaus, Constanze}},
  booktitle    = {{Beruf – Bildung – Migration. Beiträge zur Qualifizierung des Beruflichen Bildungspersonals aus der Perspektive Migration}},
  editor       = {{Rangosch-Schneck, Elisabeth}},
  pages        = {{73--88}},
  publisher    = {{Schneider Verlag Hohengehren}},
  title        = {{{Mehrsprachigkeit und Deutsch als Zweitsprache in der Lehrerbildung für die beruflichen Schulen. Ein Modulkonzept und dessen kritische Reflexion}}},
  year         = {{2013}},
}

@inbook{32110,
  author       = {{Niederhaus, Constanze}},
  booktitle    = {{Ausbildungsvorbereitung im Deutschunterricht der Sekundarstufe I. Die sprachlich-kommunikativen Facetten von „Ausbildungsfähigkeit“}},
  editor       = {{Efing, Christian}},
  pages        = {{257--273}},
  publisher    = {{Peter Lang}},
  title        = {{{Zur ausbildungsvorbereitenden Förderung der Lesekompetenz in der Sekundarstufe I}}},
  year         = {{2013}},
}

@article{32107,
  author       = {{Niederhaus, Constanze}},
  journal      = {{Info DaF (40, 6)}},
  pages        = {{553--583}},
  title        = {{{„Die Schüler verstehen es nicht und wenn sie es nicht verstehen, dann nutzt auch die fachliche Richtigkeit nix.“ Zum Einsatz und zur Nutzung von Fachtexten und Fachkundebüchern in mehrsprachigen Lernergruppen der beruflichen Bildung - die Perspektive der Lehrerinnen und Lehrer}}},
  year         = {{2013}},
}

@article{32111,
  author       = {{Niederhaus, Constanze and Schäfer, Andrea}},
  journal      = {{Hamburger eLearning-Magazin (10)}},
  pages        = {{36--38}},
  title        = {{{DaZ macht Schule! Ein Blended-Learning-Szenario für die Lehrerausbildung im Bereich Deutsch als Zweitsprache}}},
  year         = {{2013}},
}

@misc{32134,
  author       = {{Günther, Katrin and Laxczkowiak, Jana and Niederhaus, Constanze and Wittwer, Franziska}},
  publisher    = {{Cornelsen Verlag}},
  title        = {{{Sprachförderung im Fachunterricht an beruflichen Schulen}}},
  year         = {{2013}},
}

@inbook{32209,
  author       = {{Ptashnyk, Stefaniya}},
  booktitle    = {{Kulturgrenzen in postimperialen Räumen}},
  editor       = {{Kratochvil, Alexander and Makarska, Renata and Schwittin, Kathatina}},
  pages        = {{117–140}},
  publisher    = {{Transcript-Verlag}},
  title        = {{{Sprachvariation, Diglossie und Sprachenkonflikte im Diskurs: Zur linguistische Erforschung der Galizischen Mehrsprachigkeit in der 2. Hälfte des 19. Jahrhunderts}}},
  year         = {{2013}},
}

@inbook{32208,
  author       = {{Ptashnyk, Stefaniya}},
  booktitle    = {{Stadtsprache(n) - Variation und Wandel}},
  editor       = {{Kolbeck, Christoph  and Krapp, Reinhard  and Rössler , Paul }},
  pages        = {{95–110}},
  publisher    = {{ Universitätsverlag Winter}},
  title        = {{{Stadtsprachen historisch betrachtet: Zur Beschreibung der Mehrsprachigkeit in Lemberg 1848-1900}}},
  year         = {{2013}},
}

@misc{32427,
  author       = {{Tönsing, Johanna}},
  booktitle    = {{Tierstudien 04 (2013)}},
  pages        = {{144--145}},
  title        = {{{Sebastian Vehlken. Zootechnologien. Eine Mediengeschichte der Schwarmforschung, 2012}}},
  year         = {{2013}},
}

@misc{32347,
  author       = {{Ptashnyk, Stefaniya}},
  booktitle    = {{GERMANISTIK, Heft 1-2, 2014}},
  pages        = {{60--61}},
  publisher    = {{de Gruyter}},
  title        = {{{Meier, Simon: Gesprächsideale. Normative Gesprächsreflexion im 20. Jahrhundert}}},
  volume       = {{55}},
  year         = {{2013}},
}

@misc{34035,
  author       = {{Somogyi, Peter}},
  booktitle    = {{literaturkritik.de Nr. 12, Dezember 2013}},
  title        = {{{Sabine Buttinger u. Jan Keupp: Die Ritter}}},
  year         = {{2013}},
}

@misc{34034,
  author       = {{Somogyi, Peter}},
  booktitle    = {{ZfdA 142}},
  pages        = {{537--541}},
  title        = {{{Stephanie Seidl: Blendendes Erzählen. Narrative Entwürfe von Ritterheiligkeit in deutschsprachigen Georgslegenden des Hoch- und Spätmittelalters}}},
  year         = {{2013}},
}

@book{34260,
  editor       = {{Kruse, Iris and Sabisch,  Andrea }},
  publisher    = {{Kopaed}},
  title        = {{{Fragwürdiges Bilderbuch. Blickwechsel - Denkspiele - Bildungspotenziale}}},
  year         = {{2013}},
}