@inproceedings{792, author = {{Volkhausen, Tobias and Dridger, Kornelius and S. Lichte, Hermann and Karl, Holger}}, booktitle = {{10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Paderborn, Germany, May 14-18, 2012}}, pages = {{299----304}}, title = {{{Efficient cooperative relaying in wireless multi-hop networks with commodity WiFi hardware}}}, year = {{2012}}, } @inproceedings{8055, author = {{Becker, Matthias and Luckey, Markus and Becker, Steffen}}, booktitle = {{Proceedings of the International Conference on Quality of Software Architecture}}, publisher = {{ACM}}, title = {{{Model-driven Performance Engineering of Self-Adaptive Systems: A Survey}}}, year = {{2012}}, } @inproceedings{8056, abstract = {{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.}}, author = {{Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}}, booktitle = {{Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MODELS'12)}}, pages = {{709--725}}, publisher = {{Springer-Verlag}}, title = {{{Towards an Automatic Service Discovery for UML-based Rich Service Descriptions}}}, doi = {{http://dx.doi.org/10.1007/978-3-642-33666-9_45}}, volume = {{7590}}, year = {{2012}}, } @book{8226, author = {{Kremer, Marion and Engels, Gregor and Hofmann, Alexander and Hohwiller, Jörg and E. Nandico, Oliver and Nötzold, Thomas and Prott, Karl and Schlegel, Diethelm and Seidl, Andreas and Wolf, Thomas}}, publisher = {{Capgemini CSD Research, Offenbach 2012}}, title = {{{Quasar 3.0 - A Situational Approach to Software Engineering}}}, year = {{2012}}, } @inproceedings{568, abstract = {{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.}}, author = {{Jungmann, Alexander and Kleinjohann, Bernd}}, booktitle = {{Proceedings of the 9th IEEE International Conference on Service Computing (SCC)}}, pages = {{701--702}}, title = {{{Towards the Application of Reinforcement Learning Techniques for Quality-Based Service Selection in Automated Service Composition}}}, doi = {{10.1109/SCC.2012.76}}, year = {{2012}}, } @inproceedings{5680, author = {{Püschel, Tim and Schryen, Guido and Hristova, Diana and Neumann, Dirk}}, booktitle = {{European Conference on Information Systems}}, title = {{{Cloud Service Revenue Management}}}, year = {{2012}}, } @inproceedings{5683, author = {{Lang, Fabian and Schryen, Guido and Fink, Andreas}}, booktitle = {{International Conference on Information Systems}}, title = {{{Elicitating, modeling, and processing uncertain human preferences for software agents in electronic negotiations: An empirical study}}}, year = {{2012}}, } @article{5688, author = {{Bodenstein, Christian and Schryen, Guido and Neumann, Dirk}}, journal = {{European Journal of Operational Research : EJOR}}, number = {{1}}, pages = {{157--167}}, publisher = {{Elsevier}}, title = {{{Energy-Aware Workload Management Models for Operating Cost Reduction in Data Centers}}}, volume = {{222}}, year = {{2012}}, } @inproceedings{569, abstract = {{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.}}, author = {{Becker, Steffen and Heinzemann, Christian and Priesterjahn, Claudia }}, booktitle = {{Proceedings of the 15th ACM SigSoft International Symposium on Component-Based Software Engineering (CBSE)}}, pages = {{23----28}}, title = {{{Towards Modeling Reconfiguration in Hierarchical Component Architectures}}}, doi = {{10.1145/2304736.2304742}}, year = {{2012}}, } @article{570, abstract = {{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}}, author = {{Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}}, journal = {{Theoretical Computer Science}}, pages = {{137--148}}, publisher = {{Elsevier}}, title = {{{Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs}}}, doi = {{10.1016/j.tcs.2012.07.029}}, year = {{2012}}, }