[{"year":"2014","page":"111-116","citation":{"bibtex":"@inproceedings{Senft_Fischer_Sudbrock_2014, title={IT-Unterstützung im praktischen Ausbildungsbetrieb der Feuerwehr}, booktitle={Mensch &#38; Computer 2014 - Workshopband}, publisher={De Gruyter Oldenbourg}, author={Senft, Björn and Fischer, Holger Gerhard and Sudbrock, Christian}, year={2014}, pages={111–116} }","mla":"Senft, Björn, et al. “IT-Unterstützung im praktischen Ausbildungsbetrieb der Feuerwehr.” <i>Mensch &#38; Computer 2014 - Workshopband</i>, De Gruyter Oldenbourg, 2014, pp. 111–16.","short":"B. Senft, H.G. Fischer, C. Sudbrock, in: Mensch &#38; Computer 2014 - Workshopband, De Gruyter Oldenbourg, 2014, pp. 111–116.","apa":"Senft, B., Fischer, H. G., &#38; Sudbrock, C. (2014). IT-Unterstützung im praktischen Ausbildungsbetrieb der Feuerwehr. In <i>Mensch &#38; Computer 2014 - Workshopband</i> (pp. 111–116). De Gruyter Oldenbourg.","ama":"Senft B, Fischer HG, Sudbrock C. IT-Unterstützung im praktischen Ausbildungsbetrieb der Feuerwehr. In: <i>Mensch &#38; Computer 2014 - Workshopband</i>. De Gruyter Oldenbourg; 2014:111-116.","ieee":"B. Senft, H. G. Fischer, and C. Sudbrock, “IT-Unterstützung im praktischen Ausbildungsbetrieb der Feuerwehr,” in <i>Mensch &#38; Computer 2014 - Workshopband</i>, 2014, pp. 111–116.","chicago":"Senft, Björn, Holger Gerhard Fischer, and Christian Sudbrock. “IT-Unterstützung im praktischen Ausbildungsbetrieb der Feuerwehr.” In <i>Mensch &#38; Computer 2014 - Workshopband</i>, 111–16. De Gruyter Oldenbourg, 2014."},"title":"IT-Unterstützung im praktischen Ausbildungsbetrieb der Feuerwehr","date_updated":"2022-01-06T07:03:00Z","publisher":"De Gruyter Oldenbourg","date_created":"2018-12-18T13:09:24Z","author":[{"first_name":"Björn","last_name":"Senft","id":"9109","full_name":"Senft, Björn"},{"first_name":"Holger Gerhard","last_name":"Fischer","id":"30457","full_name":"Fischer, Holger Gerhard"},{"full_name":"Sudbrock, Christian","last_name":"Sudbrock","first_name":"Christian"}],"status":"public","publication":"Mensch & Computer 2014 - Workshopband","type":"conference","language":[{"iso":"ger"}],"_id":"6303","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"user_id":"30457"},{"department":[{"_id":"273"},{"_id":"7"}],"user_id":"49154","_id":"6428","language":[{"iso":"eng"}],"type":"book","status":"public","abstract":[{"text":"The intensive use of networked embedded systems is one of the key success factors in the automotive industry also triggering a massive shortening of innovation cycles. Hundreds of so called Electronic Control Units (ECUs), connected by kilometers of electrical wiring, operate in today's modern car enabling a huge variety of new functionalities ranging from safety to comfort applications. All this functionality can only be realized if the ECUs are able to communicate and to cooperate using a real-time enabled communication network in the car. Today we are at the verge of another leap forward: This in-car network is being ex- tended to not only connect local ECUs but to connect the whole car to other cars and its environment using Inter-Vehicle Communications (IVCs). Relying on existing wireless Internet access using cellular networks of the third (3G) or fourth generation (4G), or novel networking technologies that are being designed specifically for the use in the vehicular context such as IEEE WAVE, ETSI ITS-G5, and the IEEE 802.11p protocol, it becomes possible to use spontaneous connections between vehicles to exchange information, promising to enable novel and sometimes futuristic applications. Using such IVC, safety relevant information can be exchanged that could not have been obtained using local sensors, enabling a driver to virtually see traffic through large trucks or buildings. This new idea of networked vehicles creates opportunities to not only increase road traffic safety but also to improve our driving experience. Traffic jams can be prevented altogether (or at least we would be informed of jams well in advance) - and we might even be able to enable the driver to enjoying fully automated rides in a train-like convoy of cooperating of vehicles on the road. Vehicular networking, the fusion of vehicles' networks to exchange information, is the common basis on which all of these visions build upon. Being fascinated with all the opportunities and challenges related to vehicular networking, we have been a part of this research community for close to ten years. In this time, many new and sometimes crazy ideas have been formulated how to connect cars of the future. Many of these ideas have been found not suitable after thorough investigation - yet, several survived and paved the road for what are now close to market-ready solutions. From a research perspective, we are able to identify many open challenges, both in the in-car and inter-vehicle communication systems. To investigate these further, we co-organized two Dagstuhl seminars inviting leading experts from all over the world and bringing together practitioners from industry and scientists from research institutes and universities. In this scope, we were able to formulate directions guiding the ongoing research activities at least in the medium term. We also established a complementary seminar series for newcomers to the field, which is being organized in the context of the international FG-IVC series of seminars and organized by the German computer science and electrical engineering societies GI and ITG. This textbook is based on a tutorial series on the same topic presented at all the major IEEE conferences including IEEE CCNC, IEEE ICC, IEEE GLOBECOM, and IEEE VTC, as well as in the scope of Falko Dressler's IEEE Distinguished Lecturer Tours in Europe, the U.S., South America, and Asia-Pacific. We also designed a new graduate level university class, which is being held at different universities in Europe. This has inspired us to collect our experiences in the form of a textbook, collecting in one place the common concepts of past and future vehicular networking topics for a broad range of readers - from students that want to enter this exciting new field to practitioners looking for a comprehensive overview. This book would not have been possible without the many people that have inspired and supported us over the last decade in our research activites on vehicular networking - first and foremost the community centering around the IEEE Vehicular Networking Conference, the premier conference in the field. In particular we'd like to name Prof. Ozan K. Tonguz (CMU) and Prof. Mario Gerla (UCLA) who collaborated with us investigating some of the mentioned crazy ideas, and finally identifying valuable and lasting solutions. The aforementioned tutorial lectues have been prepared together with Dr. Onur Altintas (Toyota ITC) and Prof. Claudio Casetti (Politechnico di Torino). We also wish to express our appreciation for the support we received from the most helpful staff at Cambridge during the preparation of this book. Finally, we would like to sincerely thank our families, friends, and colleagues for their enduring help and support. We hope you will enjoy reading this textbook as much as we enjoyed preparing its contents for you. We gladly welcome any feedback and invite you to leave us a note or peruse supplementary material we are offering on this book's companion website http://book.car2x.org/.\r\n","lang":"eng"}],"date_created":"2018-12-30T11:06:33Z","author":[{"first_name":"Christoph","full_name":"Sommer, Christoph","id":"49154","orcid":"0000-0002-4336-7350","last_name":"Sommer"},{"orcid":"0000-0002-1989-1750","last_name":"Dressler","full_name":"Dressler, Falko","id":"48097","first_name":"Falko"}],"publisher":"Cambridge University Press","date_updated":"2022-01-06T07:03:04Z","doi":"10.1017/CBO9781107110649","title":"Vehicular Networking","publication_identifier":{"isbn":["978-1-107-04671-9"]},"citation":{"ama":"Sommer C, Dressler F. <i>Vehicular Networking</i>. Cambridge University Press; 2014. doi:<a href=\"https://doi.org/10.1017/CBO9781107110649\">10.1017/CBO9781107110649</a>","ieee":"C. Sommer and F. Dressler, <i>Vehicular Networking</i>. Cambridge University Press, 2014.","chicago":"Sommer, Christoph, and Falko Dressler. <i>Vehicular Networking</i>. Cambridge University Press, 2014. <a href=\"https://doi.org/10.1017/CBO9781107110649\">https://doi.org/10.1017/CBO9781107110649</a>.","mla":"Sommer, Christoph, and Falko Dressler. <i>Vehicular Networking</i>. Cambridge University Press, 2014, doi:<a href=\"https://doi.org/10.1017/CBO9781107110649\">10.1017/CBO9781107110649</a>.","short":"C. Sommer, F. Dressler, Vehicular Networking, Cambridge University Press, 2014.","bibtex":"@book{Sommer_Dressler_2014, title={Vehicular Networking}, DOI={<a href=\"https://doi.org/10.1017/CBO9781107110649\">10.1017/CBO9781107110649</a>}, publisher={Cambridge University Press}, author={Sommer, Christoph and Dressler, Falko}, year={2014} }","apa":"Sommer, C., &#38; Dressler, F. (2014). <i>Vehicular Networking</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/CBO9781107110649\">https://doi.org/10.1017/CBO9781107110649</a>"},"year":"2014"},{"_id":"442","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"department":[{"_id":"64"}],"user_id":"25078","ddc":["000"],"file_date_updated":"2018-03-16T11:28:34Z","type":"preprint","abstract":[{"lang":"eng","text":"We present a new transformation of chosen-plaintext secure predicate encryption schemes with public index into chosen-ciphertext secure schemes. Our construction requires only a universal one-way hash function and is selectively secure in the standard model. The transformation is not generic but can be applied to various existing schemes constructed from bilinear groups. Using common structural properties of these schemes we provide an efficient and simple transformation without overhead in form of one-time signatures or message authentication codes as required in the known generic transformations."}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-16T11:28:34Z","date_updated":"2018-03-16T11:28:34Z","access_level":"closed","file_name":"442-P-KEM.pdf","file_id":"1351","file_size":377945}],"date_updated":"2022-01-06T07:01:03Z","publisher":"Universität Paderborn","oa":"1","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Gennadij","last_name":"Liske","full_name":"Liske, Gennadij"}],"date_created":"2017-10-17T12:42:18Z","title":"Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions","main_file_link":[{"url":"https://eprint.iacr.org/2014/511.pdf","open_access":"1"}],"has_accepted_license":"1","year":"2014","citation":{"ama":"Blömer J, Liske G. Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. 2014.","ieee":"J. Blömer and G. Liske, “Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions.” Universität Paderborn, 2014.","chicago":"Blömer, Johannes, and Gennadij Liske. “Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions.” Universität Paderborn, 2014.","bibtex":"@article{Blömer_Liske_2014, title={Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions}, publisher={Universität Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2014} }","mla":"Blömer, Johannes, and Gennadij Liske. <i>Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions</i>. Universität Paderborn, 2014.","short":"J. Blömer, G. Liske, (2014).","apa":"Blömer, J., &#38; Liske, G. (2014). Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. Universität Paderborn."}},{"doi":"10.1109/INFOCOM.2014.6848224","title":"Competitive MAC under adversarial SINR","author":[{"full_name":"Ogierman, Adrian","last_name":"Ogierman","first_name":"Adrian"},{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"first_name":"Jin","last_name":"Zhang","full_name":"Zhang, Jin"}],"date_created":"2017-10-17T12:42:18Z","date_updated":"2022-01-06T07:01:05Z","page":"2751--2759","citation":{"mla":"Ogierman, Adrian, et al. “Competitive MAC under Adversarial SINR.” <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)</i>, 2014, pp. 2751--2759, doi:<a href=\"https://doi.org/10.1109/INFOCOM.2014.6848224\">10.1109/INFOCOM.2014.6848224</a>.","bibtex":"@inproceedings{Ogierman_Richa_Scheideler_Schmid_Zhang_2014, title={Competitive MAC under adversarial SINR}, DOI={<a href=\"https://doi.org/10.1109/INFOCOM.2014.6848224\">10.1109/INFOCOM.2014.6848224</a>}, booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)}, author={Ogierman, Adrian and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2014}, pages={2751--2759} }","short":"A. Ogierman, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759.","apa":"Ogierman, A., Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2014). Competitive MAC under adversarial SINR. In <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)</i> (pp. 2751--2759). <a href=\"https://doi.org/10.1109/INFOCOM.2014.6848224\">https://doi.org/10.1109/INFOCOM.2014.6848224</a>","chicago":"Ogierman, Adrian, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive MAC under Adversarial SINR.” In <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)</i>, 2751--2759, 2014. <a href=\"https://doi.org/10.1109/INFOCOM.2014.6848224\">https://doi.org/10.1109/INFOCOM.2014.6848224</a>.","ieee":"A. Ogierman, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive MAC under adversarial SINR,” in <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)</i>, 2014, pp. 2751--2759.","ama":"Ogierman A, Richa AW, Scheideler C, Schmid S, Zhang J. Competitive MAC under adversarial SINR. In: <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)</i>. ; 2014:2751--2759. doi:<a href=\"https://doi.org/10.1109/INFOCOM.2014.6848224\">10.1109/INFOCOM.2014.6848224</a>"},"year":"2014","has_accepted_license":"1","file_date_updated":"2018-03-16T11:27:04Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"446","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-16T11:27:04Z","date_updated":"2018-03-16T11:27:04Z","access_level":"closed","file_id":"1348","file_name":"446-infocom14_01.pdf","file_size":378095}],"abstract":[{"text":"This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. While this problem has already been studied intensively for simplistic single-hop or unit disk graph models, we make a leap forward and study MAC protocols for the SINR interference model (a.k.a. the physical model). We make two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. The second contribution of this paper is a distributed MAC protocol which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.","lang":"eng"}],"publication":"Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM)","type":"conference"},{"_id":"447","project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"355"}],"user_id":"477","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:26:36Z","publication":"Proceedings of the 10th World Congress on Services (SERVICES)","type":"conference","abstract":[{"lang":"eng","text":"Automatic service composition is still a challengingtask. It is even more challenging when dealing witha dynamic market of services for end users. New servicesmay enter the market while other services are completelyremoved. Furthermore, end users are typically no experts in thedomain in which they formulate a request. As a consequence,ambiguous user requests will inevitably emerge and have tobe taken into account. To meet these challenges, we proposea new approach that combines automatic service compositionwith adaptive service recommendation. A best first backwardsearch algorithm produces solutions that are functional correctwith respect to user requests. An adaptive recommendationsystem supports the search algorithm in decision-making.Reinforcement Learning techniques enable the system to adjustits recommendation strategy over time based on user ratings.The integrated approach is described on a conceptional leveland demonstrated by means of an illustrative example fromthe image processing domain."}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":429462,"file_id":"1347","access_level":"closed","file_name":"447-_FINAL__Combining_Automatic_Service_Composition_with_Adaptive_Service_Recommendation_for_Dynamic_Markets_of_Services.pdf","date_updated":"2018-03-16T11:26:36Z","date_created":"2018-03-16T11:26:36Z","creator":"florida"}],"date_updated":"2022-01-06T07:01:06Z","date_created":"2017-10-17T12:42:19Z","author":[{"first_name":"Alexander","last_name":"Jungmann","full_name":"Jungmann, Alexander"},{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"first_name":"Bernd","full_name":"Kleinjohann, Bernd","last_name":"Kleinjohann"}],"title":"Combining Automatic Service Composition with Adaptive Service Recommendation for Dynamic Markets of Services","doi":"10.1109/SERVICES.2014.68","has_accepted_license":"1","year":"2014","page":"346-353","citation":{"ieee":"A. Jungmann, F. Mohr, and B. Kleinjohann, “Combining Automatic Service Composition with Adaptive Service Recommendation for Dynamic Markets of Services,” in <i>Proceedings of the 10th World Congress on Services (SERVICES)</i>, 2014, pp. 346–353.","chicago":"Jungmann, Alexander, Felix Mohr, and Bernd Kleinjohann. “Combining Automatic Service Composition with Adaptive Service Recommendation for Dynamic Markets of Services.” In <i>Proceedings of the 10th World Congress on Services (SERVICES)</i>, 346–53, 2014. <a href=\"https://doi.org/10.1109/SERVICES.2014.68\">https://doi.org/10.1109/SERVICES.2014.68</a>.","ama":"Jungmann A, Mohr F, Kleinjohann B. Combining Automatic Service Composition with Adaptive Service Recommendation for Dynamic Markets of Services. In: <i>Proceedings of the 10th World Congress on Services (SERVICES)</i>. ; 2014:346-353. doi:<a href=\"https://doi.org/10.1109/SERVICES.2014.68\">10.1109/SERVICES.2014.68</a>","apa":"Jungmann, A., Mohr, F., &#38; Kleinjohann, B. (2014). Combining Automatic Service Composition with Adaptive Service Recommendation for Dynamic Markets of Services. In <i>Proceedings of the 10th World Congress on Services (SERVICES)</i> (pp. 346–353). <a href=\"https://doi.org/10.1109/SERVICES.2014.68\">https://doi.org/10.1109/SERVICES.2014.68</a>","bibtex":"@inproceedings{Jungmann_Mohr_Kleinjohann_2014, title={Combining Automatic Service Composition with Adaptive Service Recommendation for Dynamic Markets of Services}, DOI={<a href=\"https://doi.org/10.1109/SERVICES.2014.68\">10.1109/SERVICES.2014.68</a>}, booktitle={Proceedings of the 10th World Congress on Services (SERVICES)}, author={Jungmann, Alexander and Mohr, Felix and Kleinjohann, Bernd}, year={2014}, pages={346–353} }","short":"A. Jungmann, F. Mohr, B. Kleinjohann, in: Proceedings of the 10th World Congress on Services (SERVICES), 2014, pp. 346–353.","mla":"Jungmann, Alexander, et al. “Combining Automatic Service Composition with Adaptive Service Recommendation for Dynamic Markets of Services.” <i>Proceedings of the 10th World Congress on Services (SERVICES)</i>, 2014, pp. 346–53, doi:<a href=\"https://doi.org/10.1109/SERVICES.2014.68\">10.1109/SERVICES.2014.68</a>."}},{"year":"2014","citation":{"ama":"Becker M, Platenius MC, Becker S. Cloud Computing Reduces Uncertainties in Quality-of-Service Matching! In: <i>Proceedings of the 2nd International Workshop on Cloud Service Brokerage (CSB)</i>. Communications in Computer and Information Science. ; 2014:153-159. doi:<a href=\"https://doi.org/10.1007/978-3-319-14886-1_15\">10.1007/978-3-319-14886-1_15</a>","chicago":"Becker, Matthias, Marie Christin Platenius, and Steffen Becker. “Cloud Computing Reduces Uncertainties in Quality-of-Service Matching!” In <i>Proceedings of the 2nd International Workshop on Cloud Service Brokerage (CSB)</i>, 153–59. Communications in Computer and Information Science, 2014. <a href=\"https://doi.org/10.1007/978-3-319-14886-1_15\">https://doi.org/10.1007/978-3-319-14886-1_15</a>.","ieee":"M. Becker, M. C. Platenius, and S. Becker, “Cloud Computing Reduces Uncertainties in Quality-of-Service Matching!,” in <i>Proceedings of the 2nd International Workshop on Cloud Service Brokerage (CSB)</i>, 2014, pp. 153–159.","apa":"Becker, M., Platenius, M. C., &#38; Becker, S. (2014). Cloud Computing Reduces Uncertainties in Quality-of-Service Matching! In <i>Proceedings of the 2nd International Workshop on Cloud Service Brokerage (CSB)</i> (pp. 153–159). <a href=\"https://doi.org/10.1007/978-3-319-14886-1_15\">https://doi.org/10.1007/978-3-319-14886-1_15</a>","bibtex":"@inproceedings{Becker_Platenius_Becker_2014, series={Communications in Computer and Information Science}, title={Cloud Computing Reduces Uncertainties in Quality-of-Service Matching!}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14886-1_15\">10.1007/978-3-319-14886-1_15</a>}, booktitle={Proceedings of the 2nd International Workshop on Cloud Service Brokerage (CSB)}, author={Becker, Matthias and Platenius, Marie Christin and Becker, Steffen}, year={2014}, pages={153–159}, collection={Communications in Computer and Information Science} }","short":"M. Becker, M.C. Platenius, S. Becker, in: Proceedings of the 2nd International Workshop on Cloud Service Brokerage (CSB), 2014, pp. 153–159.","mla":"Becker, Matthias, et al. “Cloud Computing Reduces Uncertainties in Quality-of-Service Matching!” <i>Proceedings of the 2nd International Workshop on Cloud Service Brokerage (CSB)</i>, 2014, pp. 153–59, doi:<a href=\"https://doi.org/10.1007/978-3-319-14886-1_15\">10.1007/978-3-319-14886-1_15</a>."},"page":"153-159","has_accepted_license":"1","title":"Cloud Computing Reduces Uncertainties in Quality-of-Service Matching!","doi":"10.1007/978-3-319-14886-1_15","date_updated":"2022-01-06T07:01:06Z","author":[{"last_name":"Becker","full_name":"Becker, Matthias","first_name":"Matthias"},{"full_name":"Platenius, Marie Christin","last_name":"Platenius","first_name":"Marie Christin"},{"first_name":"Steffen","last_name":"Becker","full_name":"Becker, Steffen"}],"date_created":"2017-10-17T12:42:19Z","abstract":[{"text":"Cloud computing resulted in a continuously growing number of provided software services to be used by consumers. Brokers discover services that fit best to consumers' requirements by matching Qualityof-Service (QoS) properties. In order to negotiate Service-Level Agreements (SLAs), a provider has to determine the provided QoS based on QoS analyses. However, the risk for the provider to violate the SLA is high as the service's actual quality can deviate from the specified QoS due to uncertainties that occur during the provider's quality analysis. In this paper, we discuss current software engineering paradigms like cloud computing and service-oriented computing with respect to the amount of uncertainty they induce into service matching and SLA negotiations. As a result, we explain, why cloud computing reduces such uncertainties.","lang":"eng"}],"file":[{"file_id":"1346","file_name":"449-CSB2014_01.pdf","access_level":"closed","file_size":362248,"date_created":"2018-03-16T11:26:04Z","creator":"florida","date_updated":"2018-03-16T11:26:04Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 2nd International Workshop on Cloud Service Brokerage (CSB)","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:26:04Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"9","name":"SFB 901 - Subproject B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"449","user_id":"477","series_title":"Communications in Computer and Information Science","department":[{"_id":"76"}]},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"450","series_title":"SPIN 2014","user_id":"477","department":[{"_id":"77"}],"ddc":["040"],"file_date_updated":"2018-03-16T11:25:35Z","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)","abstract":[{"text":"Configurable program analysis (CPA) is a generic concept for the formalization of different software analysis techniques in a single framework. With the tool CPAchecker, this framework allows for an easy configuration and subsequent automatic execution of analysis procedures ranging from data-flow analysis to model checking. The focus of the tool CPAchecker is thus on analysis. In this paper, we study configurability from the point of view of software certification. Certification aims at providing (via a prior analysis) a certificate of correctness for a program which is (a) tamper-proof and (b) more efficient to check for validity than a full analysis. Here, we will show how, given an analysis instance of a CPA, to construct a corresponding sound certification instance, thereby arriving at configurable program certification. We report on experiments with certification based on different analysis techniques, and in particular explain which characteristics of an underlying analysis allow us to design an efficient (in the above (b) sense) certification procedure. ","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-16T11:25:35Z","creator":"florida","date_created":"2018-03-16T11:25:35Z","file_size":487366,"file_id":"1345","file_name":"450-p30-jakobs.pdf","access_level":"closed"}],"status":"public","date_updated":"2022-01-06T07:01:07Z","author":[{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2017-10-17T12:42:19Z","title":"Certification for Configurable Program Analysis","doi":"10.1145/2632362.2632372","has_accepted_license":"1","year":"2014","citation":{"short":"M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 21st International Symposium on Model Checking of Software (SPIN), 2014, pp. 30–39.","bibtex":"@inproceedings{Jakobs_Wehrheim_2014, series={SPIN 2014}, title={Certification for Configurable Program Analysis}, DOI={<a href=\"https://doi.org/10.1145/2632362.2632372\">10.1145/2632362.2632372</a>}, booktitle={Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2014}, pages={30–39}, collection={SPIN 2014} }","mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Certification for Configurable Program Analysis.” <i>Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)</i>, 2014, pp. 30–39, doi:<a href=\"https://doi.org/10.1145/2632362.2632372\">10.1145/2632362.2632372</a>.","apa":"Jakobs, M.-C., &#38; Wehrheim, H. (2014). Certification for Configurable Program Analysis. In <i>Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)</i> (pp. 30–39). <a href=\"https://doi.org/10.1145/2632362.2632372\">https://doi.org/10.1145/2632362.2632372</a>","ieee":"M.-C. Jakobs and H. Wehrheim, “Certification for Configurable Program Analysis,” in <i>Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)</i>, 2014, pp. 30–39.","chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Certification for Configurable Program Analysis.” In <i>Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)</i>, 30–39. SPIN 2014, 2014. <a href=\"https://doi.org/10.1145/2632362.2632372\">https://doi.org/10.1145/2632362.2632372</a>.","ama":"Jakobs M-C, Wehrheim H. Certification for Configurable Program Analysis. In: <i>Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)</i>. SPIN 2014. ; 2014:30-39. doi:<a href=\"https://doi.org/10.1145/2632362.2632372\">10.1145/2632362.2632372</a>"},"page":"30-39"},{"author":[{"full_name":"Drees, Maximilian","last_name":"Drees","first_name":"Maximilian"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"date_created":"2017-10-17T12:42:20Z","date_updated":"2022-01-06T07:01:07Z","doi":"10.1007/978-3-662-44803-8_10","title":"Budget-restricted utility games with ordered strategic decisions","has_accepted_license":"1","citation":{"ama":"Drees M, Riechers S, Skopalik A. Budget-restricted utility games with ordered strategic decisions. In: Lavi R, ed. <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>. Lecture Notes in Computer Science. ; 2014:110-121. doi:<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>","ieee":"M. Drees, S. Riechers, and A. Skopalik, “Budget-restricted utility games with ordered strategic decisions,” in <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2014, pp. 110–121.","chicago":"Drees, Maximilian, Sören Riechers, and Alexander Skopalik. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” In <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 110–21. Lecture Notes in Computer Science, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">https://doi.org/10.1007/978-3-662-44803-8_10</a>.","short":"M. Drees, S. Riechers, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.","bibtex":"@inproceedings{Drees_Riechers_Skopalik_2014, series={Lecture Notes in Computer Science}, title={Budget-restricted utility games with ordered strategic decisions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>}, booktitle={Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Drees, Maximilian and Riechers, Sören and Skopalik, Alexander}, editor={Lavi, RonEditor}, year={2014}, pages={110–121}, collection={Lecture Notes in Computer Science} }","mla":"Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 2014, pp. 110–21, doi:<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>.","apa":"Drees, M., Riechers, S., &#38; Skopalik, A. (2014). Budget-restricted utility games with ordered strategic decisions. In R. Lavi (Ed.), <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 110–121). <a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">https://doi.org/10.1007/978-3-662-44803-8_10</a>"},"page":"110-121","year":"2014","series_title":"Lecture Notes in Computer Science","user_id":"477","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"451","language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:25:10Z","ddc":["040"],"type":"conference","publication":"Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)","file":[{"date_created":"2018-03-16T11:25:10Z","creator":"florida","date_updated":"2018-03-16T11:25:10Z","file_id":"1344","access_level":"closed","file_name":"451-DRS14.pdf","file_size":283266,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","editor":[{"last_name":"Lavi","full_name":"Lavi, Ron","first_name":"Ron"}],"abstract":[{"lang":"eng","text":"We introduce the concept of budget games. Players choose a set of tasks and each task has a certain demand on every resource in the game. Each resource has a budget. If the budget is not enough to satisfy the sum of all demands, it has to be shared between the tasks. We study strategic budget games, where the budget is shared proportionally. We also consider a variant in which the order of the strategic decisions influences the distribution of the budgets. The complexity of the optimal solution as well as existence, complexity and quality of equilibria are analysed. Finally, we show that the time an ordered budget game needs to convergence towards an equilibrium may be exponential."}]},{"has_accepted_license":"1","citation":{"chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 294. LNCS, 2014.","ieee":"S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement: A Model for Multilevel Network Games,” in <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2014, p. 294.","ama":"Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model for Multilevel Network Games. In: Lavi R, ed. <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2014:294.","apa":"Abshoff, S., Cord-Landwehr, A., Jung, D., &#38; Skopalik, A. (2014). Brief Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i> (p. 294).","short":"S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS}, title={Brief Announcement: A Model for Multilevel Network Games}, booktitle={Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}, editor={Lavi, RonEditor}, year={2014}, pages={294}, collection={LNCS} }","mla":"Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network Games.” <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 2014, p. 294."},"page":"294","date_updated":"2022-01-06T07:01:08Z","author":[{"first_name":"Sebastian","full_name":"Abshoff, Sebastian","last_name":"Abshoff"},{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"full_name":"Jung, Daniel","id":"37827","last_name":"Jung","first_name":"Daniel"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"type":"conference","editor":[{"last_name":"Lavi","full_name":"Lavi, Ron","first_name":"Ron"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"452","series_title":"LNCS","user_id":"15415","department":[{"_id":"63"},{"_id":"541"}],"file_date_updated":"2018-03-16T11:24:40Z","year":"2014","date_created":"2017-10-17T12:42:20Z","title":"Brief Announcement: A Model for Multilevel Network Games","publication":"Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)","abstract":[{"lang":"eng","text":"Today's networks, like the Internet, do not consist of one but a mixture of several interconnected networks. Each has individual qualities and hence the performance of a network node results from the networks' interplay.We introduce a new game theoretic model capturing the interplay between a high-speed backbone network and a low-speed general purpose network. In our model, n nodes are connected by a static network and each node can decide individually to become a gateway node. A gateway node pays a fixed price for its connection to the high-speed network, but can utilize the high-speed network to gain communication distance 0 to all other gateways. Communication distances in the low-speed network are given by the hop distances. The effective communication distance between any two nodes then is given by the shortest path, which is possibly improved by using gateways as shortcuts.Every node v has the objective to minimize its communication costs, given by the sum (SUM-game) or maximum (MAX-game) of the effective communication distances from v to all other nodes plus a fixed price \\alpha > 0, if it decides to be a gateway. For both games and different ranges of \\alpha, we study the existence of equilibria, the price of anarchy, and convergence properties of best-response dynamics."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-16T11:24:40Z","creator":"florida","date_updated":"2018-03-16T11:24:40Z","file_name":"452-title_multilevel-sagt.pdf","access_level":"closed","file_id":"1343","file_size":84783}],"ddc":["040"],"language":[{"iso":"eng"}]},{"has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Feldotto_Gairing_Skopalik_2014, series={LNCS}, title={Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Skopalik, Alexander}, year={2014}, pages={30–43}, collection={LNCS} }","mla":"Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 30–43, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>.","short":"M. Feldotto, M. Gairing, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.","apa":"Feldotto, M., Gairing, M., &#38; Skopalik, A. (2014). Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 30–43). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">https://doi.org/10.1007/978-3-319-13129-0_3</a>","chicago":"Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 30–43. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">https://doi.org/10.1007/978-3-319-13129-0_3</a>.","ieee":"M. Feldotto, M. Gairing, and A. Skopalik, “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 30–43.","ama":"Feldotto M, Gairing M, Skopalik A. Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:30-43. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>"},"page":"30-43","year":"2014","author":[{"full_name":"Feldotto, Matthias","id":"14052","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias"},{"first_name":"Martin","full_name":"Gairing, Martin","last_name":"Gairing"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"date_created":"2017-10-17T12:42:20Z","date_updated":"2022-01-06T07:01:09Z","doi":"10.1007/978-3-319-13129-0_3","title":"Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria","type":"conference","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","file":[{"file_id":"1342","file_name":"453-WINE14FGS.pdf","access_level":"closed","file_size":324307,"creator":"florida","date_created":"2018-03-16T11:24:11Z","date_updated":"2018-03-16T11:24:11Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"text":"In this paper we study the potential function in congestion games. We consider both games with non-decreasing cost functions as well as games with non-increasing utility functions. We show that the value of the potential function $\\Phi(\\sf s)$ of any outcome $\\sf s$ of a congestion game approximates the optimum potential value $\\Phi(\\sf s^*)$ by a factor $\\Psi_{\\mathcal{F}}$ which only depends on the set of cost/utility functions $\\mathcal{F}$, and an additive term which is bounded by the sum of the total possible improvements of the players in the outcome $\\sf s$. The significance of this result is twofold. On the one hand it provides \\emph{Price-of-Anarchy}-like results with respect to the potential function. On the other hand, we show that these approximations can be used to compute $(1+\\varepsilon)\\cdot\\Psi_{\\mathcal{F}}$-approximate pure Nash equilibria for congestion games with non-decreasing cost functions. For the special case of polynomial cost functions, this significantly improves the guarantees from Caragiannis et al. [FOCS 2011]. Moreover, our machinery provides the first guarantees for general latency functions.","lang":"eng"}],"user_id":"14052","series_title":"LNCS","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"_id":"7","name":"SFB 901 - Subprojekt A3"}],"_id":"453","file_date_updated":"2018-03-16T11:24:11Z","ddc":["040"]},{"abstract":[{"lang":"eng","text":"We study the existence of approximate pure Nash equilibria in weighted congestion games and develop techniques to obtain approximate potential functions that prove the existence of alpha-approximate pure Nash equilibria and the convergence of alpha-improvement steps. Specifically, we show how to obtain upper bounds for approximation factor alpha for a given class of cost functions. For example for concave cost functions the factor is at most 3/2, for quadratic cost functions it is at most 4/3, and for polynomial cost functions of maximal degree d it is at at most d + 1. For games with two players we obtain tight bounds which are as small as for example 1.054 in the case of quadratic cost functions."}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1341","access_level":"closed","file_name":"455-HKS14.pdf","file_size":512712,"date_created":"2018-03-16T11:23:40Z","creator":"florida","date_updated":"2018-03-16T11:23:40Z"}],"publication":"Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)","type":"conference","ddc":["040"],"file_date_updated":"2018-03-16T11:23:40Z","language":[{"iso":"eng"}],"_id":"455","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"541"},{"_id":"63"}],"user_id":"477","series_title":"LIPIcs","year":"2014","page":"242 - 257","citation":{"bibtex":"@inproceedings{Hansknecht_Klimm_Skopalik_2014, series={LIPIcs}, title={Approximate pure Nash equilibria in weighted congestion games}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>}, booktitle={Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)}, author={Hansknecht, Christoph and Klimm, Max and Skopalik, Alexander}, year={2014}, pages={242–257}, collection={LIPIcs} }","mla":"Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 2014, pp. 242–57, doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>.","short":"C. Hansknecht, M. Klimm, A. Skopalik, in: Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–257.","apa":"Hansknecht, C., Klimm, M., &#38; Skopalik, A. (2014). Approximate pure Nash equilibria in weighted congestion games. In <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i> (pp. 242–257). <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>","ieee":"C. Hansknecht, M. Klimm, and A. Skopalik, “Approximate pure Nash equilibria in weighted congestion games,” in <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 2014, pp. 242–257.","chicago":"Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” In <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 242–57. LIPIcs, 2014. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>.","ama":"Hansknecht C, Klimm M, Skopalik A. Approximate pure Nash equilibria in weighted congestion games. In: <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>. LIPIcs. ; 2014:242-257. doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>"},"has_accepted_license":"1","title":"Approximate pure Nash equilibria in weighted congestion games","doi":"10.4230/LIPIcs.APPROX-RANDOM.2014.242","date_updated":"2022-01-06T07:01:09Z","date_created":"2017-10-17T12:42:20Z","author":[{"full_name":"Hansknecht, Christoph","last_name":"Hansknecht","first_name":"Christoph"},{"last_name":"Klimm","full_name":"Klimm, Max","first_name":"Max"},{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}]},{"publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","file":[{"file_id":"1340","file_name":"456-WINE14final.pdf","access_level":"closed","file_size":377378,"creator":"florida","date_created":"2018-03-16T11:22:57Z","date_updated":"2018-03-16T11:22:57Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We study the existence of approximate pure Nash equilibriain social context congestion games. For any given set of allowed costfunctions F, we provide a threshold value μ(F), and show that for theclass of social context congestion games with cost functions from F, α-Nash dynamics are guaranteed to converge to α-approximate pure Nashequilibrium if and only if α > μ(F).Interestingly, μ(F) is related and always upper bounded by Roughgarden’sanarchy value [19]."}],"language":[{"iso":"eng"}],"ddc":["040"],"year":"2014","date_created":"2017-10-17T12:42:21Z","title":"Approximate pure Nash equilibria in Social Context Congestion Games","type":"conference","status":"public","department":[{"_id":"541"},{"_id":"63"}],"user_id":"477","series_title":"LNCS","_id":"456","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-16T11:22:57Z","has_accepted_license":"1","page":"480 - 485","citation":{"ama":"Gairing M, Kotsialou G, Skopalik A. Approximate pure Nash equilibria in Social Context Congestion Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:480-485. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>","chicago":"Gairing, Martin, Grammateia Kotsialou, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 480–85. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">https://doi.org/10.1007/978-3-319-13129-0_43</a>.","ieee":"M. Gairing, G. Kotsialou, and A. Skopalik, “Approximate pure Nash equilibria in Social Context Congestion Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 480–485.","apa":"Gairing, M., Kotsialou, G., &#38; Skopalik, A. (2014). Approximate pure Nash equilibria in Social Context Congestion Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 480–485). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">https://doi.org/10.1007/978-3-319-13129-0_43</a>","mla":"Gairing, Martin, et al. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 480–85, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>.","short":"M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.","bibtex":"@inproceedings{Gairing_Kotsialou_Skopalik_2014, series={LNCS}, title={Approximate pure Nash equilibria in Social Context Congestion Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}, year={2014}, pages={480–485}, collection={LNCS} }"},"author":[{"first_name":"Martin","full_name":"Gairing, Martin","last_name":"Gairing"},{"first_name":"Grammateia","full_name":"Kotsialou, Grammateia","last_name":"Kotsialou"},{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"date_updated":"2022-01-06T07:01:10Z","doi":"10.1007/978-3-319-13129-0_43"},{"ddc":["040"],"file_date_updated":"2018-03-16T11:22:26Z","language":[{"iso":"eng"}],"_id":"457","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"355"}],"user_id":"477","abstract":[{"lang":"eng","text":"Automatically composing service-based software solutionsis still a challenging task. Functional as well as nonfunctionalproperties have to be considered in order to satisfyindividual user requests. Regarding non-functional properties,the composition process can be modeled as optimization problemand solved accordingly. Functional properties, in turn, can bedescribed by means of a formal specification language. Statespacebased planning approaches can then be applied to solvethe underlying composition problem. However, depending on theexpressiveness of the applied formalism and the completenessof the functional descriptions, formally equivalent services maystill differ with respect to their implemented functionality. As aconsequence, the most appropriate solution for a desired functionalitycan hardly be determined without considering additionalinformation. In this paper, we demonstrate how to overcome thislack of information by means of Reinforcement Learning. Inorder to resolve ambiguity, we expand state-space based servicecomposition by a recommendation mechanism that supportsdecision-making beyond formal specifications. The recommendationmechanism adjusts its recommendation strategy basedon feedback from previous composition runs. Image processingserves as case study. Experimental results show the benefit of ourproposed solution."}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1324374,"file_id":"1339","access_level":"closed","file_name":"457-SOCA2014-Jungmann-Mohr.pdf","date_updated":"2018-03-16T11:22:26Z","creator":"florida","date_created":"2018-03-16T11:22:26Z"}],"publication":"Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)","type":"conference","title":"Applying Reinforcement Learning for Resolving Ambiguity in Service Composition","doi":"10.1109/SOCA.2014.48","date_updated":"2022-01-06T07:01:12Z","date_created":"2017-10-17T12:42:21Z","author":[{"last_name":"Jungmann","full_name":"Jungmann, Alexander","first_name":"Alexander"},{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"first_name":"Bernd ","full_name":"Kleinjohann, Bernd ","last_name":"Kleinjohann"}],"year":"2014","page":"105-112","citation":{"apa":"Jungmann, A., Mohr, F., &#38; Kleinjohann, B. (2014). Applying Reinforcement Learning for Resolving Ambiguity in Service Composition. In <i>Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)</i> (pp. 105–112). <a href=\"https://doi.org/10.1109/SOCA.2014.48\">https://doi.org/10.1109/SOCA.2014.48</a>","bibtex":"@inproceedings{Jungmann_Mohr_Kleinjohann_2014, title={Applying Reinforcement Learning for Resolving Ambiguity in Service Composition}, DOI={<a href=\"https://doi.org/10.1109/SOCA.2014.48\">10.1109/SOCA.2014.48</a>}, booktitle={Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)}, author={Jungmann, Alexander and Mohr, Felix and Kleinjohann, Bernd }, year={2014}, pages={105–112} }","mla":"Jungmann, Alexander, et al. “Applying Reinforcement Learning for Resolving Ambiguity in Service Composition.” <i>Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)</i>, 2014, pp. 105–12, doi:<a href=\"https://doi.org/10.1109/SOCA.2014.48\">10.1109/SOCA.2014.48</a>.","short":"A. Jungmann, F. Mohr, B. Kleinjohann, in: Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA), 2014, pp. 105–112.","ieee":"A. Jungmann, F. Mohr, and B. Kleinjohann, “Applying Reinforcement Learning for Resolving Ambiguity in Service Composition,” in <i>Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)</i>, 2014, pp. 105–112.","chicago":"Jungmann, Alexander, Felix Mohr, and Bernd  Kleinjohann. “Applying Reinforcement Learning for Resolving Ambiguity in Service Composition.” In <i>Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)</i>, 105–12, 2014. <a href=\"https://doi.org/10.1109/SOCA.2014.48\">https://doi.org/10.1109/SOCA.2014.48</a>.","ama":"Jungmann A, Mohr F, Kleinjohann B. Applying Reinforcement Learning for Resolving Ambiguity in Service Composition. In: <i>Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)</i>. ; 2014:105-112. doi:<a href=\"https://doi.org/10.1109/SOCA.2014.48\">10.1109/SOCA.2014.48</a>"},"has_accepted_license":"1"},{"type":"mastersthesis","status":"public","_id":"458","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"}],"user_id":"15504","year":"2014","citation":{"ama":"Dreimann P. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn; 2014.","chicago":"Dreimann, Philipp. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","ieee":"P. Dreimann, <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","short":"P. Dreimann, Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic, Universität Paderborn, 2014.","mla":"Dreimann, Philipp. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","bibtex":"@book{Dreimann_2014, title={Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic}, publisher={Universität Paderborn}, author={Dreimann, Philipp}, year={2014} }","apa":"Dreimann, P. (2014). <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn."},"date_updated":"2022-01-06T07:01:13Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:21Z","author":[{"last_name":"Dreimann","full_name":"Dreimann, Philipp","first_name":"Philipp"}],"title":"Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic"},{"ddc":["040"],"file_date_updated":"2018-03-16T11:21:54Z","_id":"459","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"},{"_id":"63"}],"series_title":"LNCS","user_id":"477","abstract":[{"text":"In this survey article, we discuss two algorithmic research areas that emerge from problems that arise when resources are offered in the cloud. The first area, online leasing, captures problems arising from the fact that resources in the cloud are not bought, but leased by cloud vendors. The second area, Distributed Storage Systems, deals with problems arising from so-called cloud federations, i.e., when several cloud providers are needed to fulfill a given task.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-16T11:21:54Z","creator":"florida","date_updated":"2018-03-16T11:21:54Z","access_level":"closed","file_name":"459-SIROCCO2014.pdf","file_id":"1338","file_size":274496}],"publication":"Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)","type":"conference","title":"Algorithmic Aspects of Resource Management in the Cloud","doi":"10.1007/978-3-319-09620-9_1","date_updated":"2022-01-06T07:01:14Z","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"id":"37612","full_name":"Markarian, Christine","last_name":"Markarian","first_name":"Christine"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2017-10-17T12:42:21Z","year":"2014","page":"1-13","citation":{"short":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13.","bibtex":"@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014, series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>}, booktitle={Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014}, pages={1–13}, collection={LNCS} }","mla":"Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2014, pp. 1–13, doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>.","apa":"Kniesburges, S., Markarian, C., Meyer auf der Heide, F., &#38; Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 1–13). <a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">https://doi.org/10.1007/978-3-319-09620-9_1</a>","ama":"Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic Aspects of Resource Management in the Cloud. In: <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>. LNCS. ; 2014:1-13. doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>","ieee":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic Aspects of Resource Management in the Cloud,” in <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2014, pp. 1–13.","chicago":"Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.” In <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 1–13. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">https://doi.org/10.1007/978-3-319-09620-9_1</a>."},"has_accepted_license":"1"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"461","user_id":"477","department":[{"_id":"75"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:14Z","date_created":"2017-10-17T12:42:21Z","author":[{"last_name":"Dräxler","id":"31764","full_name":"Dräxler, Sevil","first_name":"Sevil"}],"title":"Adaptive Placement of Programmable Virtual Network Function Chains","year":"2014","citation":{"apa":"Dräxler, S. (2014). <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn.","bibtex":"@book{Dräxler_2014, title={Adaptive Placement of Programmable Virtual Network Function Chains}, publisher={Universität Paderborn}, author={Dräxler, Sevil}, year={2014} }","mla":"Dräxler, Sevil. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","short":"S. Dräxler, Adaptive Placement of Programmable Virtual Network Function Chains, Universität Paderborn, 2014.","chicago":"Dräxler, Sevil. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","ieee":"S. Dräxler, <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","ama":"Dräxler S. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn; 2014."}},{"title":"A Simulation Framework for Analyzing Complex Infinitely Repeated Games","doi":"10.5220/0005110406250630","date_updated":"2022-01-06T07:01:15Z","author":[{"first_name":"Matthias","full_name":"Feldotto, Matthias","id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"date_created":"2017-10-17T12:42:22Z","year":"2014","citation":{"apa":"Feldotto, M., &#38; Skopalik, A. (2014). A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i> (pp. 625–630). <a href=\"https://doi.org/10.5220/0005110406250630\">https://doi.org/10.5220/0005110406250630</a>","short":"M. Feldotto, A. Skopalik, in: Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–630.","bibtex":"@inproceedings{Feldotto_Skopalik_2014, title={A Simulation Framework for Analyzing Complex Infinitely Repeated Games}, DOI={<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>}, booktitle={Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)}, author={Feldotto, Matthias and Skopalik, Alexander}, year={2014}, pages={625–630} }","mla":"Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 2014, pp. 625–30, doi:<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>.","chicago":"Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” In <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 625–30, 2014. <a href=\"https://doi.org/10.5220/0005110406250630\">https://doi.org/10.5220/0005110406250630</a>.","ieee":"M. Feldotto and A. Skopalik, “A Simulation Framework for Analyzing Complex Infinitely Repeated Games,” in <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 2014, pp. 625–630.","ama":"Feldotto M, Skopalik A. A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In: <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>. ; 2014:625-630. doi:<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>"},"page":"625-630","has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-16T11:21:24Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"name":"SFB 901 - Subprojekt A3","_id":"7"}],"_id":"462","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"abstract":[{"text":"We discuss a technique to analyze complex infinitely repeated games using techniques from the fields of game theory and simulations. Our research is motivated by the analysis of electronic markets with thousands of participants and possibly complex strategic behavior. We consider an example of a global market of composed IT services to demonstrate the use of our simulation technique. We present our current work in this area and we want to discuss further approaches for the future.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-16T11:21:24Z","date_updated":"2018-03-16T11:21:24Z","access_level":"closed","file_name":"462-FS2014SIMULTECH.pdf","file_id":"1337","file_size":993721}],"status":"public","type":"conference","publication":"Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)"},{"type":"conference","publication":"Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-16T11:20:54Z","date_created":"2018-03-16T11:20:54Z","creator":"florida","file_size":437518,"file_id":"1336","access_level":"closed","file_name":"463-FDTC14.pdf"}],"status":"public","abstract":[{"text":"Several fault attacks against pairing-based cryptography have been described theoretically in recent years. Interestingly, none of these have been practically evaluated. We accomplished this task and prove that fault attacks against pairing-based cryptography are indeed possible and are even practical — thus posing a serious threat. Moreover, we successfully conducted a second-order fault attack against an open source implementation of the eta pairing on an AVR XMEGA A1. We injected the first fault into the computation of the Miller Algorithm and applied the second fault to skip the final exponentiation completely. We introduce a low-cost setup that allowed us to generate multiple independent faults in one computation. The setup implements these faults by clock glitches which induce instruction skips. With this setup we conducted the first practical fault attack against a complete pairing computation.","lang":"eng"}],"user_id":"25078","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"_id":"463","file_date_updated":"2018-03-16T11:20:54Z","ddc":["040"],"has_accepted_license":"1","citation":{"mla":"Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.” <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 123--136, doi:<a href=\"https://doi.org/10.1109/FDTC.2014.22\">10.1109/FDTC.2014.22</a>.","bibtex":"@inproceedings{Blömer_Gomes da Silva_Günther_Krämer_Seifert_2014, title={A Practical Second-Order Fault Attack against a Real-World Pairing Implementation}, DOI={<a href=\"https://doi.org/10.1109/FDTC.2014.22\">10.1109/FDTC.2014.22</a>}, booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}, author={Blömer, Johannes and Gomes da Silva, Ricardo and Günther, Peter and Krämer, Juliane and Seifert, Jean-Pierre}, year={2014}, pages={123--136} }","short":"J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, J.-P. Seifert, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136.","apa":"Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., &#38; Seifert, J.-P. (2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i> (pp. 123--136). <a href=\"https://doi.org/10.1109/FDTC.2014.22\">https://doi.org/10.1109/FDTC.2014.22</a>","ama":"Blömer J, Gomes da Silva R, Günther P, Krämer J, Seifert J-P. A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In: <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>. ; 2014:123--136. doi:<a href=\"https://doi.org/10.1109/FDTC.2014.22\">10.1109/FDTC.2014.22</a>","chicago":"Blömer, Johannes, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer, and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.” In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 123--136, 2014. <a href=\"https://doi.org/10.1109/FDTC.2014.22\">https://doi.org/10.1109/FDTC.2014.22</a>.","ieee":"J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, and J.-P. Seifert, “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation,” in <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 123--136."},"page":"123--136","year":"2014","date_created":"2017-10-17T12:42:22Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"full_name":"Gomes da Silva, Ricardo","last_name":"Gomes da Silva","first_name":"Ricardo"},{"first_name":"Peter","full_name":"Günther, Peter","last_name":"Günther"},{"full_name":"Krämer, Juliane","last_name":"Krämer","first_name":"Juliane"},{"last_name":"Seifert","full_name":"Seifert, Jean-Pierre","first_name":"Jean-Pierre"}],"date_updated":"2022-01-06T07:01:16Z","doi":"10.1109/FDTC.2014.22","title":"A Practical Second-Order Fault Attack against a Real-World Pairing Implementation"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"464","user_id":"477","department":[{"_id":"79"}],"file_date_updated":"2018-03-16T11:19:45Z","type":"journal_article","status":"public","date_updated":"2022-01-06T07:01:16Z","author":[{"last_name":"Gall","full_name":"Gall, Dominik","first_name":"Dominik"},{"full_name":"Jacob, Riko","last_name":"Jacob","first_name":"Riko"},{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"last_name":"Täubig","full_name":"Täubig, Hanjo ","first_name":"Hanjo "}],"doi":"10.1007/s00224-013-9504-x","has_accepted_license":"1","citation":{"apa":"Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., &#38; Täubig, H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. <i>Theory of Computing Systems</i>, (1), 110–135. <a href=\"https://doi.org/10.1007/s00224-013-9504-x\">https://doi.org/10.1007/s00224-013-9504-x</a>","short":"D. Gall, R. Jacob, A.W. Richa, C. Scheideler, S. Schmid, H. Täubig, Theory of Computing Systems (2014) 110–135.","mla":"Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” <i>Theory of Computing Systems</i>, no. 1, Springer, 2014, pp. 110–35, doi:<a href=\"https://doi.org/10.1007/s00224-013-9504-x\">10.1007/s00224-013-9504-x</a>.","bibtex":"@article{Gall_Jacob_Richa_Scheideler_Schmid_Täubig_2014, title={A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization}, DOI={<a href=\"https://doi.org/10.1007/s00224-013-9504-x\">10.1007/s00224-013-9504-x</a>}, number={1}, journal={Theory of Computing Systems}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo }, year={2014}, pages={110–135} }","ama":"Gall D, Jacob R, Richa AW, Scheideler C, Schmid S, Täubig H. A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. <i>Theory of Computing Systems</i>. 2014;(1):110-135. doi:<a href=\"https://doi.org/10.1007/s00224-013-9504-x\">10.1007/s00224-013-9504-x</a>","chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo  Täubig. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” <i>Theory of Computing Systems</i>, no. 1 (2014): 110–35. <a href=\"https://doi.org/10.1007/s00224-013-9504-x\">https://doi.org/10.1007/s00224-013-9504-x</a>.","ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization,” <i>Theory of Computing Systems</i>, no. 1, pp. 110–135, 2014."},"page":"110-135","ddc":["040"],"publication":"Theory of Computing Systems","abstract":[{"text":"Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms where nodes forward, insert, and delete links to neighboring nodes, and that converge quickly to such a desirable topology, independently of the initial network configuration. This article proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearization—i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. In order to study the main structure and properties of our model, we propose two variants of a most simple local linearization algorithm. For each of these variants, we present analyses of the worst-case and bestcase parallel time complexities, as well as the performance under a greedy selection of the actions to be executed. It turns out that the analysis is non-trivial despite the simple setting, and to complement our formal insights we report on our experiments which indicate that the runtimes may be better in the average case.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"464-GJRSST2014.pdf","file_id":"1334","access_level":"closed","file_size":947484,"date_created":"2018-03-16T11:19:45Z","creator":"florida","date_updated":"2018-03-16T11:19:45Z"}],"publisher":"Springer","date_created":"2017-10-17T12:42:22Z","title":"A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization","issue":"1","year":"2014"},{"title":"A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service","date_created":"2017-10-17T12:42:23Z","publisher":"Elsevier","year":"2014","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"file_size":698992,"file_id":"5312","file_name":"KünsemöllerKarl.pdf","access_level":"closed","date_updated":"2018-11-02T15:46:17Z","creator":"ups","date_created":"2018-11-02T15:46:17Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Financial benefits are an important factor when cloud infrastructure is considered to meet processing demand. The dynamics of on-demand pricing and service usage are investigated in a two-stage game model for a monopoly Infrastructure-as-a-Service (IaaS) market. The possibility of hybrid clouds (public clouds plus own infrastructure) turns out to be essential in order that not only the provider but also the clients have significant benefits from on-demand services. Even if the client meets all demand in the public cloud, the threat of building a hybrid cloud keeps the instance price low. This is not the case when reserved instances are offered as well. Parameters like load profiles and economies of scale have a huge effect on likely future pricing and on a cost-optimal split-up of client demand between either a client’s own data center and a public cloud service or between reserved and on-demand cloud instances.","lang":"eng"}],"publication":"Future Generation Computer Systems","doi":"10.1016/j.future.2014.03.005","author":[{"first_name":"Jörn","full_name":"Künsemöller, Jörn","last_name":"Künsemöller"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_updated":"2022-01-06T07:01:17Z","page":"44--52","citation":{"mla":"Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service.” <i>Future Generation Computer Systems</i>, Elsevier, 2014, pp. 44--52, doi:<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>.","short":"J. Künsemöller, H. Karl, Future Generation Computer Systems (2014) 44--52.","bibtex":"@article{Künsemöller_Karl_2014, title={A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service}, DOI={<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>}, journal={Future Generation Computer Systems}, publisher={Elsevier}, author={Künsemöller, Jörn and Karl, Holger}, year={2014}, pages={44--52} }","apa":"Künsemöller, J., &#38; Karl, H. (2014). A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service. <i>Future Generation Computer Systems</i>, 44--52. <a href=\"https://doi.org/10.1016/j.future.2014.03.005\">https://doi.org/10.1016/j.future.2014.03.005</a>","ieee":"J. Künsemöller and H. Karl, “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service,” <i>Future Generation Computer Systems</i>, pp. 44--52, 2014.","chicago":"Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service.” <i>Future Generation Computer Systems</i>, 2014, 44--52. <a href=\"https://doi.org/10.1016/j.future.2014.03.005\">https://doi.org/10.1016/j.future.2014.03.005</a>.","ama":"Künsemöller J, Karl H. A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service. <i>Future Generation Computer Systems</i>. 2014:44--52. doi:<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>"},"has_accepted_license":"1","file_date_updated":"2018-11-02T15:46:17Z","department":[{"_id":"75"}],"user_id":"477","_id":"467","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","type":"journal_article"}]