@article{561,
abstract = {{We present a privacy-friendly architecture for a future cloud computing scenario where software licensing and software payment plays a major role. We show how digital rights management as a technical solution for software licensing can be achieved in a privacy-friendly manner. In our scenario, users who buy software from software providers and execute it at computing centres stay anonymous. At the same time, our approach guarantees that software licenses are bound to users and that their validity is checked before execution. Thus, DRM constitutes an incentive for software providers to take part in such a future cloud computing scenario. We employ a software re-encryption scheme so that computing centres are not able to build profiles of their users – not even under a pseudonym. We make sure that malicious users are unable to relay software to others. }},
author = {{Petrlic, Ronald and Sekula, Stephan and Sorge, Christoph}},
journal = {{International Journal of Grid and Utility Computing}},
number = {{4}},
pages = {{265--277}},
publisher = {{InderScience}},
title = {{{A privacy-friendly Architecture for future Cloud Computing}}},
doi = {{10.1504/IJGUC.2013.057120}},
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}},
}
@article{5637,
author = {{Schryen, Guido}},
journal = {{European Journal of Information Systems (EJIS)}},
number = {{2}},
pages = {{139--169}},
title = {{{Revisiting IS Business Value Research: What we already know, what we still need to know, and how we can get there}}},
volume = {{22}},
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}},
}
@inbook{6456,
author = {{Higham, J. J. S. and Kremer, H.-Hugo and Yeomans, D.}},
booktitle = {{The Architecture of Innovative Apprenticeship}},
editor = {{Deitmer, L. and Hauschildt, U. and Rauner, F. and Zelloth, H.}},
pages = {{39--50}},
title = {{{Exploring Intermediate Vocational Education and Training for 16-19 Year-olds in Germany and England}}},
year = {{2013}},
}
@inbook{6457,
author = {{Kremer, H.-Hugo and Beutner, Marc and Wirth, W.}},
booktitle = {{Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug}},
editor = {{Kremer, H.-H. and Beutner, M. and Wirth, W.}},
title = {{{Lernen im Justizvollzug. Vorstellung und Grundidee des Modellprojektes TANDEM}}},
year = {{2013}},
}
@inbook{6458,
author = {{Kremer, H.-Hugo and Beutner, Marc}},
booktitle = {{Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug}},
title = {{{Berufsorientierung im Jungtätervollzug - Rahmenkonzept und übergreifenden Prinzipien}}},
year = {{2013}},
}
@inbook{6459,
author = {{Gebbe, M. and Kremer, H.-Hugo}},
booktitle = {{Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug}},
editor = {{Kremer, H.-H. and Beutner, M. and Wirth, W.}},
title = {{{myflux.eu - Ein Instrument zur Förderung von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess von Jungtätern}}},
year = {{2013}},
}
@inbook{6461,
author = {{Kremer, H.-Hugo and Knust, S.}},
booktitle = {{Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug}},
editor = {{Kremer, H.-H. and Beutner, M. and Wirth, W.}},
title = {{{Stärkenbasierte Berufsorientierung im Jungtätervollzug }}},
year = {{2013}},
}
@inbook{6462,
author = {{Kremer, H.-Hugo and Beutner, Marc}},
booktitle = {{Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug}},
editor = {{Kremer, H.-H. and Beutner, M. and Wirth, W.}},
title = {{{Mit dem Tandem in die Zukunft - Eine Einschätzung aus berufs- und wirtschaftspädagogischer Perspektive}}},
year = {{2013}},
}
@inproceedings{6573,
author = {{Olfert, Sergei and Claes, Leander and Henning, Bernd}},
booktitle = {{Proceedings of the International Conference on Acoustics}},
pages = {{477--480}},
publisher = {{DEGA}},
title = {{{Influence of angular radiated ultrasound waves on the Schlieren tomogram}}},
year = {{2013}},
}
@article{6729,
author = {{Coumans, Dion and Gehrke, Mai and van Rooijen, Lorijn}},
issn = {{1570-8683}},
journal = {{Journal of Applied Logic}},
number = {{1}},
pages = {{50--66}},
publisher = {{Elsevier BV}},
title = {{{Relational semantics for full linear logic}}},
doi = {{10.1016/j.jal.2013.07.005}},
volume = {{12}},
year = {{2013}},
}
@inproceedings{6730,
author = {{Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}},
booktitle = {{Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS) 2013, December 12-14, 2013, Guwahati, India}},
pages = {{363----375}},
publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}},
title = {{{Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages}}},
doi = {{10.4230/LIPICS.FSTTCS.2013.363}},
volume = {{24}},
year = {{2013}},
}
@inproceedings{6732,
author = {{Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}},
booktitle = {{Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013}},
isbn = {{9783642403125}},
issn = {{0302-9743}},
pages = {{729--740}},
publisher = {{Springer Berlin Heidelberg}},
title = {{{Separating Regular Languages by Piecewise Testable and Unambiguous Languages}}},
doi = {{10.1007/978-3-642-40313-2_64}},
year = {{2013}},
}
@article{6782,
author = {{Tönnies, Merle}},
journal = {{Journal for the Study of British Cultures}},
number = {{2}},
pages = {{115--124}},
title = {{{Northern Landscapes and Anti-Thatcherite Positioning}}},
volume = {{20}},
year = {{2013}},
}
@article{6783,
author = {{Tönnies, Merle}},
journal = {{International Journal of English Studies}},
number = {{1}},
pages = {{51--61}},
title = {{{Feminising a Classical Male Plot Model? Black British Women Writers and the 'Bildungsroman'}}},
volume = {{24}},
year = {{2013}},
}
@inproceedings{6913,
author = {{Weber, T. and Berghold, J. and Heilmann, F. and Roericht, M. and Krauter, Stefan and Grunow, Paul}},
booktitle = {{Proceedings of the 28th European Photovoltaic Solar Energy Conference and Exhibition, Paris (Frankreich}},
title = {{{Test Sequence Development for Evaluation of Potential Induced Degradation on Thin-Film Modules}}},
year = {{2013}},
}
@inproceedings{6914,
author = {{Wendlandt, S. and Berthold, R. and Hanusch, M. and Drobisch, A. and Berghold, J. and Schoppa, M. and Krauter, Stefan and Grunow, Paul}},
booktitle = {{Proceedings of the 28th European Photovoltaic Solar Energy Conference and Exhibition, Paris (Frankreich)}},
title = {{{About the hot spot stability of ages silicon crystalline PV modules and materials}}},
year = {{2013}},
}
@article{6915,
author = {{Krauter, Stefan}},
journal = {{Forschungsforum Paderborn, 16-2013, Februar 2013}},
pages = {{38--45}},
title = {{{Energiewende mit Sonnenstrom}}},
year = {{2013}},
}