TY - CHAP AU - Rumlich, Dominik ED - Doff, Sabine ID - 21912 T2 - Fremdsprachenunterricht empirisch erforschen. Grundlagen - Methoden - Anwendung TI - (Sprach-)Tests in der Praxis: Die Studie „Development Of North Rhine-Westphalian CLIL Students“ (DENOCS). ER - TY - CONF AB - Relating to the direct manufacturing of end-use parts the knowledge about the effect of the long-term ageing of Fused Deposition Modeling (FDM) parts is of particular importance. For this, tensile specimens were stored for time periods of up to 52 weeks in two different conditions and the testing was conducted at different temperatures within a temperature range of -60°C to +160°C. Further tests were made after the exposure in multiple media. The parts were built up with the system “Fortus 400mc” from Stratasys with the material Ultem*9085 in two different build directions, the strongest direction X (on its side) and the weakest build direction Z (upright) and with the standard toolpath parameters of the Insight software version 7.0. AU - Bagsik, A. AU - Schöppner, Volker AU - Klemp, E. ID - 22016 T2 - 23rd Annual International Solid Freeform Fabrication Symposium TI - Long-Term ageing effects on Fused Deposition Modeling Parts manufactured with ULTEM*9085 VL - 23 ER - TY - CONF AU - Eggert, A AU - Garnefeld, I AU - Steinhoff, L ID - 7739 T2 - 2012 AMA Summer Marketing Educators' Proceedings TI - The Bright and Dark Side of Endowed Status in Hierarchical Loyalty Programs ER - TY - CONF AU - Garnefeld, I AU - Münkhoff, E AU - Bruns, A ID - 7740 T2 - 2012 AMA Summer Marketing Educators’ Proceedings TI - I thought it was all over and now it is back again – Customer reactions to time extensions of sales promotions ER - TY - CONF AU - Eggert, A AU - Steiner, M AU - Ulaga, W AU - Backhaus, K ID - 7741 T2 - Proceedings of the 2012 ISBM Academic Workshop TI - Capturing the Value of Hybrid Offerings: The Impact of the Price Presentation Format ER - TY - CONF AU - Ritter, T AU - Eggert, A ID - 7742 T2 - Proceedings of the 2012 ISBM Academic Workshop TI - Dispersion of Market Activities: A Configurational Approach ER - TY - CONF AU - Eggert, A AU - Münkhoff, E AU - Thiesbrummel, C ID - 7743 T2 - 2012 AMA Winter Marketing Educators' Proceedings TI - Growing with Industrial Services - A Configurational Approach ER - TY - CONF AU - Eggert, A AU - Garnefeld, I AU - Steinhoff, L ID - 7744 T2 - 2012 AMA Winter Marketing Educators' Proceedings TI - Endowed Status in Hierarchical Loyalty Programs ER - TY - CONF AU - Garnefeld, I AU - Helm, S AU - Eggert, A AU - Tax, S ID - 7745 T2 - 2012 AMA Winter Marketing Educators' Proceedings TI - Growing Existing Customers’ Profitability with Customer Referral Programs ER - TY - GEN ED - Ehrig, Hartmut ED - Engels, Gregor ED - Kreowski, Hans-Jörg ED - Rozenberg, Grzegorz ID - 7763 TI - Graph Transformation - 6th International Conference, ICGT 2012, Bremen, Germany, September 24-29, 2012, Proceedings VL - 7562 ER - TY - JOUR AU - Biermann, Thorsten AU - Scalia, Luca AU - Choi, Changsoon AU - Karl, Holger AU - Kellerer, Wolfgang ID - 782 IS - 5 JF - Pervasive and Mobile Computing TI - CoMP clustering and backhaul limitations in cooperative cellular mobile access networks ER - TY - JOUR AU - Willig, Andreas AU - Karl, Holger AU - Kipnis, Danil ID - 783 IS - 2 JF - Wireless Networks TI - Segment-based packet combining: how to schedule a dense relayer cluster? ER - TY - CONF AU - Herlich, Matthias AU - Karl, Holger ID - 784 T2 - Proceedings of the 3rd International Conference on Energy-Efficient Computing and Networking, e-Energy'12, Madrid, Spain, May 9-11, 2012 TI - Average and competitive analysis of latency and power consumption of a queuing system with a sleep mode ER - TY - CONF AU - Blanckenstein, Johannes AU - Klaue, Jirka AU - Karl, Holger ID - 785 T2 - European Wireless 2012 - 18th European Conference 2012, April 18-20, 2012, Poznan, Poland. TI - Energy Efficient Clustering using a Wake-up Receiver ER - TY - CONF AU - Künsemöller, Jörn AU - Karl, Holger ID - 786 T2 - Economics of Grids, Clouds, Systems, and Services - 9th International Conference, GECON 2012, Berlin, Germany, November 27-28, 2012. Proceedings TI - On Local Separation of Processing and Storage in Infrastructure-as-a-Service ER - TY - CONF AU - Dräxler, Martin AU - Karl, Holger ID - 787 T2 - 2012 IEEE International Conference on Green Computing and Communications, Conference on Internet of Things, and Conference on Cyber, Physical and Social Computing, GreenCom/iThings/CPSCom 2012, Besancon, France, November 20-23, 2012 TI - Efficiency of On-Path and Off-Path Caching Strategies in Information Centric Networks ER - TY - CONF AU - Dannewitz, Christian AU - Herlich, Matthias AU - Karl, Holger ID - 788 T2 - 37th Annual IEEE Conference on Local Computer Networks, Workshop Proceedings, Clearwater Beach, FL, USA, October 22-25, 2012 TI - OpenNetInf - prototyping an information-centric Network Architecture ER - TY - CONF AU - Dräxler, Martin AU - Biermann, Thorsten AU - Karl, Holger AU - Kellerer, Wolfgang ID - 789 T2 - 23rd IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2012, Sydney, Australia, September 9-12, 2012 TI - Cooperating base station set selection and network reconfiguration in limited backhaul networks ER - TY - CONF AU - Dräxler, Martin AU - Beister, Frederic AU - Kruska, Stephan AU - Aelken, J. AU - Karl, Holger ID - 790 T2 - International ICST Conference on Simulation Tools and Techniques, SIMUTOOLS '12, Sirmione-Desenzano, Italy, March 19-23, 2012 TI - Using OMNeT++ for energy optimization simulations in mobile core networks ER - TY - CONF AU - Volkhausen, Tobias AU - Schinköthe, Kai AU - Karl, Holger ID - 791 T2 - 2012 IEEE Wireless Communications and Networking Conference, WCNC 2012, Paris, France, April 1-4, 2012 TI - Quantization techniques for accurate soft message combining ER - TY - CONF AU - Volkhausen, Tobias AU - Dridger, Kornelius AU - S. Lichte, Hermann AU - Karl, Holger ID - 792 T2 - 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012 TI - Efficient cooperative relaying in wireless multi-hop networks with commodity WiFi hardware ER - TY - CONF AU - Becker, Matthias AU - Luckey, Markus AU - Becker, Steffen ID - 8055 T2 - Proceedings of the International Conference on Quality of Software Architecture TI - Model-driven Performance Engineering of Self-Adaptive Systems: A Survey ER - TY - CONF AB - Service-oriented computing (SOC) promises to solve many issues in the area of distributed software development, e.g. the realization of the loose coupling pattern in practice through service discovery and invocation. For this purpose, service descriptions must comprise structural as well as behavioral information of the services otherwise an accurate service discovery is not possible. We addressed this issue in our previous paper and proposed a UML-based rich service description language (RSDL) providing comprehensive notations to specify service requests and offers. However, the automatic matching of service requests and offers specified in a RSDL for the purpose of service discovery is a complex task, due to multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different underlying ontologies or different levels of granularity in the specification itself resulting in complex mappings between service requests and offers. In this paper, we present an automatic matching mechanism for service requests and offers specified in a RSDL that overcomes the underlying heterogeneity of the service partners. AU - Huma, Zille AU - Gerth, Christian AU - Engels, Gregor AU - Juwig, Oliver ID - 8056 T2 - Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MODELS'12) TI - Towards an Automatic Service Discovery for UML-based Rich Service Descriptions VL - 7590 ER - TY - BOOK AU - Kremer, Marion AU - Engels, Gregor AU - Hofmann, Alexander AU - Hohwiller, Jörg AU - E. Nandico, Oliver AU - Nötzold, Thomas AU - Prott, Karl AU - Schlegel, Diethelm AU - Seidl, Andreas AU - Wolf, Thomas ID - 8226 TI - Quasar 3.0 - A Situational Approach to Software Engineering ER - TY - CONF AB - A major goal of the On-The-Fly Computing project is the automated composition of individual services based on services that are available in dynamic markets. Dependent on the granularity of a market, different alternatives that satisfy the requested functional requirements may emerge. In order to select the best solution, services are usually selected with respect to their quality in terms of inherent non-functional properties. In this paper, we describe our idea of how to model this service selection process as a Markov Decision Process, which we in turn intend to solve by means of Reinforcement Learning techniques in order to control the underlying service composition process. In addition, some initial issues with respect to our approach are addressed. AU - Jungmann, Alexander AU - Kleinjohann, Bernd ID - 568 T2 - Proceedings of the 9th IEEE International Conference on Service Computing (SCC) TI - Towards the Application of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated Service Composition ER - TY - CONF AU - Püschel, Tim AU - Schryen, Guido AU - Hristova, Diana AU - Neumann, Dirk ID - 5680 T2 - European Conference on Information Systems TI - Cloud Service Revenue Management ER - TY - CONF AU - Lang, Fabian AU - Schryen, Guido AU - Fink, Andreas ID - 5683 T2 - International Conference on Information Systems TI - Elicitating, modeling, and processing uncertain human preferences for software agents in electronic negotiations: An empirical study ER - TY - JOUR AU - Bodenstein, Christian AU - Schryen, Guido AU - Neumann, Dirk ID - 5688 IS - 1 JF - European Journal of Operational Research : EJOR TI - Energy-Aware Workload Management Models for Operating Cost Reduction in Data Centers VL - 222 ER - TY - CONF AB - Today's real-time embedded systems operate in frequently changing environments on which they react by self-adaptations. Such an approach needs adequate modeling support of these reconfigurations to enable verification of safety properties, e.g., by timed model checking. Component-based development of such systems realizes these self-adaptations by structural reconfigurations of components and their connectors. However, component models proposed in literature do not support reconfigurable components in real-time embedded context but focus on other domains like business information systems. In this paper, we present an extension of our modeling language MechatronicUML to support structural reconfigurations taking the specific requirements of our domain into account. Based on the proposed extension we outline our research roadmap to achieve verification and realization of systems modeled in MechatronicUML. AU - Becker, Steffen AU - Heinzemann, Christian AU - Priesterjahn, Claudia ID - 569 T2 - Proceedings of the 15th ACM SigSoft International Symposium on Component-Based Software Engineering (CBSE) TI - Towards Modeling Reconfiguration in Hierarchical Component Architectures ER - TY - JOUR AB - This article studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identiers, we explore a natural and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm DStab which is based on the concept of \local Delaunay graphs" and which forwards temporary edges in greedy fashion reminiscent of compass routing. DStab constructs a Delaunay graph from any initial connected topology and in a distributed manner in time O(n3) in the worst-case; if the initial network contains the Delaunay graph, the convergence time is only O(n) rounds. DStab also ensures that individual node joins and leaves aect a small part of the network only. Such self-stabilizing Delaunay networks have interesting applications and our construction gives insights into the necessary geometric reasoning that is required for higherdimensional linearization problems.Keywords: Distributed Algorithms, Topology Control, Social Networks AU - Jacob, Riko AU - Ritscher, Stephan AU - Scheideler, Christian AU - Schmid, Stefan ID - 570 JF - Theoretical Computer Science TI - Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs ER - TY - CONF AB - The paradigm shift from purchasing monolithic software solutions to a dynamic composition of individual solutions entails many new possibilities yet great challenges, too. In order to satisfy user requirements, complex services have to be automatically composed of elementary services. Multiple possibilities of composing a complex service inevitably emerge. The problem of selecting the most appropriate services has to be solved by comparing the different service candidates with respect to their quality in terms of inherent non-functional properties while simultaneously taking the user requirements into account. We are aiming for an integrated service rating and ranking methodology in order to support the automation of the underlying decision-making process. The main contribution of this paper is a first decomposition of the quality-based service selection process, while emphasizing major issues and challenges, which we are addressing in the On-The-Fly Computing project. AU - Jungmann, Alexander AU - Kleinjohann, Bernd ID - 571 T2 - Proceedings of the 4th International Conferences on Advanced Service Computing (SERVICE COMPUTATION) TI - Towards an Integrated Service Rating and Ranking Methodology for Quality Based Service Selection in Automatic Service Composition ER - TY - JOUR AB - The tendency of managers to focus on short-term results rather than on sustained company success is of particular importance to retail marketing managers, because marketing activities involve expenditures which may only pay off in the longer term. To address the issue of myopic management, our study shows how the complexity of the service profit chain (SPC) can cause managers to make suboptimal decisions. Hence, our paper departs from past research by recognizing that understanding the temporal interplay between operational investments, employee satisfaction, customer satisfaction, and operating profit is essential to achieving sustained success. In particular, we intend to improve understanding of the functioning of the SPC with respect to time lags and feedback loops. Results of our large-scale longitudinal study set in a multi-outlet retail chain reveal time-lag effects between operational investments and employee satisfaction, as well as between customer satisfaction and performance. These findings, along with evidence of a negative interaction effect of employee satisfaction on the relationship between current performance and future investments, show the substantial risk of mismanaging the SPC. We identify specific situations in which the dynamic approach leads to superior marketing investment decisions, when compared to the conventional static view of the SCP. These insights provide valuable managerial guidance for effectively managing the SPC over time. AU - Evanschitzky, Heiner AU - Wangenheim, Florian v AU - Wünderlich, Nancy ID - 5716 IS - 3 JF - Journal of Retailing KW - Employee satisfaction KW - Customer satisfaction KW - Performance KW - Service profit chain KW - Feedback loops KW - Time lags KW - Myopic marketing management TI - Perils of Managing the Service Profit Chain: The Role of Time Lags and Feedback Loops. VL - 88 ER - TY - JOUR AB - Although professional service providers increasingly deliver their services globally, little is known about cross-cultural differences in customers’ motivation to participate in service production. To address this lacuna, we survey a total of 2,284 banking customers in 11 countries on their motivation to provide personal information to, and follow the advice of, their service providers. We find differences in both aspects, but only the differences in providing personal information can be explained by the cultural values of uncertainty avoidance, individualism/collectivism, and masculinity/femininity. To perform certain tasks in the service process, global professional service providers should acknowledge cultural differences in customers’ motivations. AU - Schumann, Jan H AU - Wünderlich, Nancy AU - Zimmer, Marcus S ID - 5717 IS - 2 JF - Schmalenbach Business Review KW - Co-Production KW - Culture KW - Customer Participation KW - Professional Services TI - Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments. VL - 64 ER - TY - JOUR AB - The role of information and communication technology for economic growth has been emphasized repeatedly. Technological breakthroughs have generated new forms of services, such as self-services or remote services. Although these encounters are qualitatively different from traditional service provision, prior service management literature thus far had paid little attention to theory development and the systematization of technology-based service encounters. To fill this research gap, the present study outlines how new types of technology-based services fit into existing service typologies and provides an extension of existing frameworks to capture their unique characteristics. These insights in turn offer managerial implications and highlight open research questions. AU - Schumann, Jan H AU - Wünderlich, Nancy AU - Wangenheim, Florian ID - 5718 IS - 2 JF - Technovation KW - Services KW - Remote services KW - Self-services KW - Technology mediation TI - Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics. VL - 32 ER - TY - CONF AB - Service-oriented computing (SOC) promises to solve many issues in the area of distributed software development, e.g. the realization of the loose coupling pattern in practice through service discovery and invocation. For this purpose, service descriptions must comprise structural as well as behavioral information of the services otherwise an accurate service discovery is not possible. We addressed this issue in our previous paper and proposed a UML-based rich service description language (RSDL) providing comprehensive notations to specify service requests and offers.However, the automatic matching of service requests and offers specified in a RSDL for the purpose of service discovery is a complex task, due to multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different underlying ontologies or different levels of granularity in the specification itself resulting in complex mappings between service requests and offers. In this paper, we present an automatic matching mechanism for service requests and offers specified in a RSDL that overcomes the underlying heterogeneity of the service partners. AU - Huma, Zille AU - Gerth, Christian AU - Engels, Gregor AU - Juwig, Oliver ID - 572 T2 - Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS) TI - Towards an Automatic Service Discovery for UML-based Rich Service Descriptions ER - TY - CONF AB - In software markets of the future, customer-specific software will be developed on demand from distributed software and hardware services available on world-wide markets. Having a request, services have to be automatically discovered and composed. For that purpose, services have to be matched based on their specifications. For the accurate matching, services have to be described comprehensively that requires the integration of different domain-specific languages (DSLs) used for functional, non-functional, and infrastructural properties. Since different service providers use plenty of language dialects to model the same service property, their integration is needed for the matching. In this paper, we propose a framework for integration of DSLs. It is based on a parameterized abstract core language that integrates key concepts needed to describe a service. Parts of the core language can be substituted with concrete DSLs. Thus, the framework serves as a basis for the comprehensive specification and automatic matching of services. AU - Arifulina, Svetlana ED - W. Eisenecker, Ulrich ED - Bucholdt, Christian ID - 573 T2 - Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)) TI - Towards a Framework for the Integration of Modeling Languages ER - TY - JOUR AB - We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization. AU - Clouser, Thomas AU - Nesterenko, Mikhail AU - Scheideler, Christian ID - 574 JF - Theoretical Computer Science TI - Tiara: A self-stabilizing deterministic skip list and skip graph ER - TY - GEN AU - Bremer, Lars ID - 575 TI - Symbiotic Coupling of Peer-to-Peer and Cloud Systems ER - TY - CONF AU - Nagel, Benjamin AU - Gerth, Christian AU - Yigitbas, Enes AU - Christ, Fabian AU - Engels, Gregor ID - 5753 T2 - Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012 TI - Model-driven specification of adaptive cloud-based systems ER - TY - GEN AU - Schmitz, Henning ID - 576 TI - Stereo Matching on a Convey HC-1 Hybrid Core Computer ER - TY - GEN AU - Yigitbas, Enes ID - 5760 TI - Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen ER - TY - GEN AB - SSS is an international forum for researchers and practitioners in the design and development of distributed systems with self-properties: (classical) self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. Research in distributed systems is now at a crucialpoint in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. The theory of self-stabilization has been enriched in the last 30 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-properties in fault-tolerant distributed systems. ED - Richa, Andrea W. ED - Scheideler, Christian ID - 577 TI - Stabilization, Safety, and Security of Distributed Systems ER - TY - GEN AB - This paper analyzes the stability of capital tax harmonization agreements in a stylized model where countries have formed coalitions which set a common tax rate in order to avoid the inefficient fully non-cooperative Nash equilibrium. In particular, for a given coalition structure we study to what extend the stability of tax agreements is affected by the coalitions that have formed. In our set-up, countries are symmetric, but coalitions can be of arbitrary size. We analyze stability by means of a repeated game setting employing simple trigger strategies and we allow a sub-coalition to deviate from the coalitional equilibrium. For a given form of punishment we are able to rank the stability of different coalition structures as long as the size of the largest coalition does not change. Our main results are: (1) singleton regions have the largest incentives to deviate, (2) the stability of cooperation depends on the degree of cooperative behavior ex-ante. AU - Brangewitz, Sonja AU - Brockhoff, Sarah ID - 578 TI - Stability of Coalitional Equilibria within Repeated Tax Competition ER - TY - JOUR AB - A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space. AU - Damerow, Valentina AU - Manthey, Bodo AU - Meyer auf der Heide, Friedhelm AU - Räcke, Harald AU - Scheideler, Christian AU - Sohler, Christian AU - Tantau, Till ID - 579 IS - 3 JF - Transactions on Algorithms TI - Smoothed analysis of left-to-right maxima with applications ER - TY - CONF AB - We present and study a new model for energy-aware and profit-oriented scheduling on a single processor.The processor features dynamic speed scaling as well as suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different sizes, values, and deadlines.On the arrival of a new job, the scheduler may either accept or reject the job.Accepted jobs need a certain energy investment to be finished in time, while rejected jobs cause costs equal to their values.Here, power consumption at speed $s$ is given by $P(s)=s^{\alpha}+\beta$ and the energy investment is power integrated over time.Additionally, the scheduler may decide to suspend the processor to a sleep mode in which no energy is consumed, though awaking entails fixed transition costs $\gamma$.The objective is to minimize the total value of rejected jobs plus the total energy.Our model combines aspects from advanced energy conservation techniques (namely speed scaling and sleep states) and profit-oriented scheduling models.We show that \emph{rejection-oblivious} schedulers (whose rejection decisions are not based on former decisions) have – in contrast to the model without sleep states – an unbounded competitive ratio.It turns out that the jobs' value densities (the ratio between a job's value and its work) are crucial for the performance of such schedulers.We give an algorithm whose competitiveness nearly matches the lower bound w.r.t\text{.} the maximum value density.If the maximum value density is not too large, the competitiveness becomes $\alpha^{\alpha}+2e\alpha$.Also, we show that it suffices to restrict the value density of low-value jobs only.Using a technique from \cite{Chan:2010} we transfer our results to processors with a fixed maximum speed. AU - Cord-Landwehr, Andreas AU - Kling, Peter AU - Mallmann Trenn, Fredrik ED - Even, Guy ED - Rawitz, Dror ID - 580 T2 - Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg) TI - Slow Down & Sleep for Profit in Online Deadline Scheduling ER - TY - CONF AB - Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots. AU - Drees, Maximilian AU - Hüllmann (married name: Eikel), Martina AU - Koutsopoulos, Andreas AU - Scheideler, Christian ID - 581 T2 - Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) TI - Self-Organizing Particle Systems ER - TY - GEN AU - Strothmann, Thim Frederik ID - 582 TI - Self-Optimizing Binary Search Trees - A Game Theoretic Approach ER - TY - GEN AU - Drücker, Julian ID - 583 TI - Revenue-maximizing Order of Sale in Sequential Auctions ER - TY - GEN AU - Hohenberger, Till ID - 584 TI - Queuing Latency at Cooperative Base Stations ER - TY - CONF AB - In a cloud-computing scenario where users buy software from software providers and execute it at computing centers, a digital rights management (DRM) system has to be in place to check the software licenses during each software execution. However, the exposure of users to privacy invasion in the presence of DRM systems is problematic.We come up with a concept that unites software providers' and users' demands for a secure and privacy-preserving DRM system for cloud computing. The employment of proxy re-encryption allows for a prevention of profile building (under pseudonym) of users by any party. AU - Petrlic, Ronald ID - 585 T2 - Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS) TI - Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme ER -