[{"type":"conference","publication":"Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)","abstract":[{"lang":"eng","text":"Multi-rooted trees are becoming the norm for modern data-center networks. In these networks, scalable flow routing is challenging owing to vast number of flows. Current approaches either employ a central controller that can have scalability issues or a scalable decentralized algorithm only considering local information. In this paper we present a new decentralized approach to least-congested path routing in software-defined data center networks that has neither of these issues: By duplicating the initial (or SYN) packet of a flow and estimating the data rate of multiple flows in parallel, we exploit TCP’s habit to fill buffers to find the least congested path. We show that our algorithm significantly improves flow completion time without the need for a central controller or specialized hardware."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-21T09:46:21Z","creator":"florida","date_updated":"2018-03-21T09:46:21Z","access_level":"closed","file_name":"247-07313613.pdf","file_id":"1491","file_size":277574}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"247","user_id":"15504","department":[{"_id":"75"}],"ddc":["040"],"file_date_updated":"2018-03-21T09:46:21Z","has_accepted_license":"1","year":"2015","citation":{"ieee":"A. Schwabe and H. Karl, “SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics,” in <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42.","chicago":"Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.” In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 37–42, 2015. <a href=\"https://doi.org/10.1109/EWSDN.2015.58\">https://doi.org/10.1109/EWSDN.2015.58</a>.","ama":"Schwabe A, Karl H. SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics. In: <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>. ; 2015:37-42. doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>","apa":"Schwabe, A., &#38; Karl, H. (2015). SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics. In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i> (pp. 37–42). <a href=\"https://doi.org/10.1109/EWSDN.2015.58\">https://doi.org/10.1109/EWSDN.2015.58</a>","short":"A. Schwabe, H. Karl, in: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42.","mla":"Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.” <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42, doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>.","bibtex":"@inproceedings{Schwabe_Karl_2015, title={SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics}, DOI={<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>}, booktitle={Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}, author={Schwabe, Arne and Karl, Holger}, year={2015}, pages={37–42} }"},"page":"37-42","date_updated":"2022-01-06T06:56:32Z","author":[{"full_name":"Schwabe, Arne","last_name":"Schwabe","first_name":"Arne"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_created":"2017-10-17T12:41:40Z","title":"SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics","doi":"10.1109/EWSDN.2015.58"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"department":[{"_id":"64"}],"user_id":"477","_id":"261","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"apa":"Eisenhofer, T. (2015). <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn.","bibtex":"@book{Eisenhofer_2015, title={Protokolle zur authentifizierten Schüsselvereinbarung}, publisher={Universität Paderborn}, author={Eisenhofer, Thorsten}, year={2015} }","short":"T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung, Universität Paderborn, 2015.","mla":"Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","ama":"Eisenhofer T. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn; 2015.","ieee":"T. Eisenhofer, <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","chicago":"Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015."},"year":"2015","title":"Protokolle zur authentifizierten Schüsselvereinbarung","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"last_name":"Eisenhofer","full_name":"Eisenhofer, Thorsten","first_name":"Thorsten"}],"date_created":"2017-10-17T12:41:43Z","date_updated":"2022-01-06T06:57:16Z","publisher":"Universität Paderborn"},{"has_accepted_license":"1","page":"1729-1736","citation":{"chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated Dataflow Analyses.” In <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>, 1729–36. SAC ’15, 2015. <a href=\"https://doi.org/10.1145/2695664.2695690\">https://doi.org/10.1145/2695664.2695690</a>.","ieee":"M.-C. Jakobs and H. Wehrheim, “Programs from Proofs of Predicated Dataflow Analyses,” in <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>, 2015, pp. 1729–1736.","ama":"Jakobs M-C, Wehrheim H. Programs from Proofs of Predicated Dataflow Analyses. In: <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>. SAC ’15. ; 2015:1729-1736. doi:<a href=\"https://doi.org/10.1145/2695664.2695690\">10.1145/2695664.2695690</a>","apa":"Jakobs, M.-C., &#38; Wehrheim, H. (2015). Programs from Proofs of Predicated Dataflow Analyses. In <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i> (pp. 1729–1736). <a href=\"https://doi.org/10.1145/2695664.2695690\">https://doi.org/10.1145/2695664.2695690</a>","mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated Dataflow Analyses.” <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>, 2015, pp. 1729–36, doi:<a href=\"https://doi.org/10.1145/2695664.2695690\">10.1145/2695664.2695690</a>.","bibtex":"@inproceedings{Jakobs_Wehrheim_2015, series={SAC ’15}, title={Programs from Proofs of Predicated Dataflow Analyses}, DOI={<a href=\"https://doi.org/10.1145/2695664.2695690\">10.1145/2695664.2695690</a>}, booktitle={Proceedings of the 30th Annual ACM Symposium on Applied Computing}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2015}, pages={1729–1736}, collection={SAC ’15} }","short":"M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015, pp. 1729–1736."},"year":"2015","date_created":"2017-10-17T12:41:43Z","author":[{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_updated":"2022-01-06T06:57:18Z","doi":"10.1145/2695664.2695690","title":"Programs from Proofs of Predicated Dataflow Analyses","publication":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","type":"conference","status":"public","file":[{"date_updated":"2018-03-21T09:35:34Z","date_created":"2018-03-21T09:35:34Z","creator":"florida","file_size":554583,"file_id":"1483","access_level":"closed","file_name":"262-mainSACfinal.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"Programs from Proofs\" is a generic method which generates new programs out of correctness proofs of given programs. The technique ensures that the new and given program are behaviorally equivalent and that the new program is easily verifiable, thus serving as an alternative to proof-carrying code concepts. So far, this generic method has one instantiation that verifies type-state properties of programs. In this paper, we present a whole range of new instantiations, all based on data ow analyses. More precisely, we show how an imprecise but fast data ow analysis can be enhanced with a predicate analysis as to yield a precise but expensive analysis. Out of the safety proofs of this analysis, we generate new programs, again behaviorally equivalent to the given ones, which are easily verifiable\" in the sense that now the data ow analysis alone can yield precise results. An experimental evaluation practically supports our claim of easy verification."}],"department":[{"_id":"77"}],"series_title":"SAC '15","user_id":"477","_id":"262","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-21T09:35:34Z","language":[{"iso":"eng"}],"ddc":["040"]},{"type":"dissertation","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":8031107,"file_id":"1481","access_level":"closed","file_name":"264-Dissertation_-_Wette.pdf","date_updated":"2018-03-21T09:34:36Z","date_created":"2018-03-21T09:34:36Z","creator":"florida"}],"_id":"264","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"75"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-21T09:34:36Z","has_accepted_license":"1","year":"2015","citation":{"apa":"Wette, P. (2015). <i>Optimizing Software-Defined Networks using Application-Layer Knowledge</i>. Universität Paderborn.","bibtex":"@book{Wette_2015, title={Optimizing Software-Defined Networks using Application-Layer Knowledge}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2015} }","mla":"Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","short":"P. Wette, Optimizing Software-Defined Networks Using Application-Layer Knowledge, Universität Paderborn, 2015.","ieee":"P. Wette, <i>Optimizing Software-Defined Networks using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","chicago":"Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","ama":"Wette P. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn; 2015."},"date_updated":"2022-01-06T06:57:20Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_created":"2017-10-17T12:41:43Z","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"}],"title":"Optimizing Software-Defined Networks using Application-Layer Knowledge"},{"department":[{"_id":"71"}],"series_title":"GI-Edition Lecture Notes in Informatics (LNI)","user_id":"71124","_id":"26446","language":[{"iso":"eng"}],"type":"book","status":"public","date_created":"2021-10-18T20:52:45Z","author":[{"first_name":"Hans","last_name":"Pongratz","full_name":"Pongratz, Hans"},{"full_name":"Keil, Reinhard","last_name":"Keil","first_name":"Reinhard"}],"date_updated":"2022-01-06T06:57:21Z","publisher":"Koellen Druck + Verlag GmbH","title":"DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV","publication_status":"published","citation":{"ieee":"H. Pongratz and R. Keil, <i>DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV</i>. Koellen Druck + Verlag GmbH, 2015.","chicago":"Pongratz, Hans, and Reinhard Keil. <i>DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV</i>. GI-Edition Lecture Notes in Informatics (LNI). Koellen Druck + Verlag GmbH, 2015.","ama":"Pongratz H, Keil R. <i>DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV</i>. Koellen Druck + Verlag GmbH; 2015.","apa":"Pongratz, H., &#38; Keil, R. (2015). <i>DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV</i>. Koellen Druck + Verlag GmbH.","bibtex":"@book{Pongratz_Keil_2015, series={GI-Edition Lecture Notes in Informatics (LNI)}, title={DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science eV}, publisher={Koellen Druck + Verlag GmbH}, author={Pongratz, Hans and Keil, Reinhard}, year={2015}, collection={GI-Edition Lecture Notes in Informatics (LNI)} }","short":"H. Pongratz, R. Keil, DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV, Koellen Druck + Verlag GmbH, 2015.","mla":"Pongratz, Hans, and Reinhard Keil. <i>DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning Section of the Society for Computer Science EV</i>. Koellen Druck + Verlag GmbH, 2015."},"year":"2015"},{"publication_status":"published","year":"2015","page":"103-117","intvolume":"       330","citation":{"ama":"Winkelnkemper F, Oberhoff A. WebArena - R {\\ “a} spacious structures for {\\” u} r the learning locations of the future. In: wedge R, Selke H, eds. Vol 330. Publication series of the Heinz Nixdorf Institute, Paderborn; 2015:103-117.","ieee":"F. Winkelnkemper and A. Oberhoff, “WebArena - R {\\ ‘a} spacious structures for {\\’ u} r the learning locations of the future,” 2015, vol. 330, pp. 103–117.","chicago":"Winkelnkemper, Felix, and Andreas Oberhoff. “WebArena - R {\\ ‘A} Spacious Structures for {\\’ U} r the Learning Locations of the Future.” edited by Reinhard  wedge and Harald Selke, 330:103–17. Publication series of the Heinz Nixdorf Institute, Paderborn, 2015.","bibtex":"@inproceedings{Winkelnkemper_Oberhoff_2015, title={WebArena - R {\\ “a} spacious structures for {\\” u} r the learning locations of the future}, volume={330}, publisher={Publication series of the Heinz Nixdorf Institute, Paderborn}, author={Winkelnkemper, Felix and Oberhoff, Andreas}, editor={wedge, Reinhard  and Selke, Harald}, year={2015}, pages={103–117} }","mla":"Winkelnkemper, Felix, and Andreas Oberhoff. <i>WebArena - R {\\ “A} Spacious Structures for {\\” U} r the Learning Locations of the Future</i>. Edited by Reinhard  wedge and Harald Selke, vol. 330, Publication series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 103–17.","short":"F. Winkelnkemper, A. Oberhoff, in: R. wedge, H. Selke (Eds.), Publication series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 103–117.","apa":"Winkelnkemper, F., &#38; Oberhoff, A. (2015). <i>WebArena - R {\\ “a} spacious structures for {\\” u} r the learning locations of the future</i> (R. wedge &#38; H. Selke, Eds.; Vol. 330, pp. 103–117). Publication series of the Heinz Nixdorf Institute, Paderborn."},"date_updated":"2022-01-06T06:57:21Z","publisher":"Publication series of the Heinz Nixdorf Institute, Paderborn","volume":330,"author":[{"first_name":"Felix","last_name":"Winkelnkemper","full_name":"Winkelnkemper, Felix","id":"3117"},{"first_name":"Andreas","full_name":"Oberhoff, Andreas","last_name":"Oberhoff"}],"date_created":"2021-10-18T20:56:42Z","title":"WebArena - R {\\ \"a} spacious structures for {\\\" u} r the learning locations of the future","type":"conference","editor":[{"first_name":"Reinhard ","last_name":"wedge","full_name":"wedge, Reinhard "},{"last_name":"Selke","full_name":"Selke, Harald","first_name":"Harald"}],"status":"public","_id":"26449","department":[{"_id":"71"}],"user_id":"71124","language":[{"iso":"eng"}],"alternative_title":["20 years of learning with the World Wide Web - technology and education in dialogue"]},{"publication_status":"published","citation":{"apa":"Keil, R., &#38; Selke, H. (Eds.). (2015). <i>20 years of learning with the World Wide Web - technology and education in dialogue</i> (Vol. 330). publishing series of the Heinz Nixdorf Institute, Paderborn.","mla":"Keil, Reinhard, and Harald Selke, editors. <i>20 Years of Learning with the World Wide Web - Technology and Education in Dialogue</i>. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","bibtex":"@book{Keil_Selke_2015, series={Heinz publishing house series Nixdorf Institute, Paderborn}, title={20 years of learning with the World Wide Web - technology and education in dialogue}, volume={330}, publisher={publishing series of the Heinz Nixdorf Institute, Paderborn}, year={2015}, collection={Heinz publishing house series Nixdorf Institute, Paderborn} }","short":"R. Keil, H. Selke, eds., 20 Years of Learning with the World Wide Web - Technology and Education in Dialogue, publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","ieee":"R. Keil and H. Selke, Eds., <i>20 years of learning with the World Wide Web - technology and education in dialogue</i>, vol. 330. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","chicago":"Keil, Reinhard, and Harald Selke, eds. <i>20 Years of Learning with the World Wide Web - Technology and Education in Dialogue</i>. Vol. 330. Heinz Publishing House Series Nixdorf Institute, Paderborn. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","ama":"Keil R, Selke H, eds. <i>20 Years of Learning with the World Wide Web - Technology and Education in Dialogue</i>. Vol 330. publishing series of the Heinz Nixdorf Institute, Paderborn; 2015."},"intvolume":"       330","year":"2015","date_created":"2021-10-19T14:09:39Z","volume":330,"date_updated":"2022-01-06T06:57:22Z","publisher":"publishing series of the Heinz Nixdorf Institute, Paderborn","title":"20 years of learning with the World Wide Web - technology and education in dialogue","type":"book_editor","status":"public","editor":[{"last_name":"Keil","full_name":"Keil, Reinhard","first_name":"Reinhard"},{"full_name":"Selke, Harald","id":"497","last_name":"Selke","first_name":"Harald"}],"user_id":"71124","series_title":"Heinz publishing house series Nixdorf Institute, Paderborn","department":[{"_id":"71"}],"_id":"26531","language":[{"iso":"eng"}]},{"page":"1-7","intvolume":"       330","citation":{"bibtex":"@inproceedings{Keil_Selke_2015, title={Learn with, through and {\\ \"about the WWW}, volume={330}, publisher={Publishing series of the Heinz Nixdorf Institute, Paderborn}, author={Keil, Reinhard  and Selke, Harald}, editor={Keil, Reinhard and  Selke, Harald}, year={2015}, pages={1–7} }","mla":"Keil, Reinhard, and Harald Selke. <i>Learn with, through and {\\ \"about the WWW</i>. Edited by Reinhard Keil and Harald  Selke, vol. 330, Publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 1–7.","short":"R. Keil, H. Selke, in: R. Keil, H.  Selke (Eds.), Publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 1–7.","apa":"Keil, R., &#38; Selke, H. (2015). <i>Learn with, through and {\\ \"about the WWW</i> (R. Keil &#38; H.  Selke, Eds.; Vol. 330, pp. 1–7). Publishing series of the Heinz Nixdorf Institute, Paderborn.","ama":"Keil R, Selke H. Learn with, through and {\\ \"about the WWW. In: Keil R,  Selke H, eds. Vol 330. Publishing series of the Heinz Nixdorf Institute, Paderborn; 2015:1-7.","chicago":"Keil, Reinhard , and Harald Selke. “Learn with, through and {\\ \"about the WWW.” edited by Reinhard Keil and Harald  Selke, 330:1–7. Publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","ieee":"R. Keil and H. Selke, “Learn with, through and {\\ \"about the WWW,” 2015, vol. 330, pp. 1–7."},"year":"2015","publication_status":"published","title":"Learn with, through and {\\ \"about the WWW","volume":330,"author":[{"first_name":"Reinhard ","last_name":"Keil","full_name":"Keil, Reinhard "},{"first_name":"Harald","last_name":"Selke","full_name":"Selke, Harald","id":"497"}],"date_created":"2021-10-19T14:13:08Z","publisher":"Publishing series of the Heinz Nixdorf Institute, Paderborn","date_updated":"2022-01-06T06:57:22Z","status":"public","editor":[{"full_name":"Keil, Reinhard","last_name":"Keil","first_name":"Reinhard"},{"first_name":"Harald","last_name":" Selke","full_name":" Selke, Harald"}],"type":"conference","language":[{"iso":"eng"}],"alternative_title":["20 years of learning with the World Wide Web - technology and education in dialogue"],"department":[{"_id":"71"}],"user_id":"71124","_id":"26532"},{"title":"Virtual knowledge {\\ \"a} ume - From the presentation of content to virtual learning {\\\" a} tten","date_created":"2021-10-19T14:19:23Z","author":[{"last_name":"Keil","full_name":"Keil, Reinhard ","first_name":"Reinhard "},{"last_name":"Selke","full_name":"Selke, Harald","id":"497","first_name":"Harald"}],"volume":330,"date_updated":"2022-01-06T06:57:22Z","publisher":"publishing series of the Heinz Nixdorf Institute, Paderborn","citation":{"ama":"Keil R, Selke H. Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten. In: Keil R, Selke H, eds. Vol 330. publishing series of the Heinz Nixdorf Institute, Paderborn; 2015:39-53.","ieee":"R. Keil and H. Selke, “Virtual knowledge {\\ ‘a} ume - From the presentation of content to virtual learning {\\’ a} tten,” 2015, vol. 330, pp. 39–53.","chicago":"Keil, Reinhard , and Harald Selke. “Virtual Knowledge {\\ ‘A} Ume - From the Presentation of Content to Virtual Learning {\\’ A} Tten.” edited by Reinhard Keil and Harald Selke, 330:39–53. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","apa":"Keil, R., &#38; Selke, H. (2015). <i>Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten</i> (R. Keil &#38; H. Selke, Eds.; Vol. 330, pp. 39–53). publishing series of the Heinz Nixdorf Institute, Paderborn.","short":"R. Keil, H. Selke, in: R. Keil, H. Selke (Eds.), publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.","mla":"Keil, Reinhard, and Harald Selke. <i>Virtual Knowledge {\\ “A} Ume - From the Presentation of Content to Virtual Learning {\\” A} Tten</i>. Edited by Reinhard Keil and Harald Selke, vol. 330, publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.","bibtex":"@inproceedings{Keil_Selke_2015, title={Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten}, volume={330}, publisher={publishing series of the Heinz Nixdorf Institute, Paderborn}, author={Keil, Reinhard  and Selke, Harald}, editor={Keil, Reinhard and Selke, Harald}, year={2015}, pages={39–53} }"},"intvolume":"       330","page":"39-53","year":"2015","publication_status":"published","alternative_title":["20 years of learning with the World Wide Web - technology and education in dialogue"],"language":[{"iso":"eng"}],"user_id":"71124","department":[{"_id":"71"}],"_id":"26533","status":"public","editor":[{"last_name":"Keil","full_name":"Keil, Reinhard","first_name":"Reinhard"},{"full_name":"Selke, Harald","last_name":"Selke","first_name":"Harald"}],"type":"conference"},{"date_updated":"2022-01-06T06:57:22Z","publisher":"Universitaetsbibliothek Paderborn","date_created":"2021-10-19T14:22:28Z","author":[{"first_name":"Florian","last_name":"Klompmaker","full_name":"Klompmaker, Florian"}],"title":"Development of a structured process of interaction design for {\\ \"u} r nat {\\\" u} local user interfaces","publication_status":"published","place":"Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science","year":"2015","citation":{"ama":"Klompmaker F. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universitaetsbibliothek Paderborn; 2015.","ieee":"F. Klompmaker, <i>Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces</i>. Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek Paderborn, 2015.","chicago":"Klompmaker, Florian. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek Paderborn, 2015.","bibtex":"@book{Klompmaker_2015, place={Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science}, title={Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces}, publisher={Universitaetsbibliothek Paderborn}, author={Klompmaker, Florian}, year={2015} }","short":"F. Klompmaker, Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces, Universitaetsbibliothek Paderborn, Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science, 2015.","mla":"Klompmaker, Florian. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universitaetsbibliothek Paderborn, 2015.","apa":"Klompmaker, F. (2015). <i>Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces</i>. Universitaetsbibliothek Paderborn."},"_id":"26534","department":[{"_id":"71"}],"user_id":"71124","language":[{"iso":"eng"}],"type":"dissertation","status":"public"},{"publication_status":"published","citation":{"short":"C. Schild, V. Petrausch, in: Human and Computer 2015 - Proceedings, De Gruyter Oldenbourg, Berlin, 2015, pp. 173–182.","mla":"Schild, Christian, and Vanessa Petrausch. “Empirical Validation of Design Patterns.” <i>Human and Computer 2015 - Proceedings</i>, De Gruyter Oldenbourg, 2015, pp. 173–82.","bibtex":"@inproceedings{Schild_Petrausch_2015, place={Berlin}, title={Empirical validation of design patterns}, booktitle={Human and Computer 2015 - Proceedings}, publisher={De Gruyter Oldenbourg}, author={Schild, Christian and Petrausch, Vanessa}, year={2015}, pages={173–182} }","apa":"Schild, C., &#38; Petrausch, V. (2015). Empirical validation of design patterns. <i>Human and Computer 2015 - Proceedings</i>, 173–182.","ama":"Schild C, Petrausch V. Empirical validation of design patterns. In: <i>Human and Computer 2015 - Proceedings</i>. De Gruyter Oldenbourg; 2015:173-182.","chicago":"Schild, Christian, and Vanessa Petrausch. “Empirical Validation of Design Patterns.” In <i>Human and Computer 2015 - Proceedings</i>, 173–82. Berlin: De Gruyter Oldenbourg, 2015.","ieee":"C. Schild and V. Petrausch, “Empirical validation of design patterns,” in <i>Human and Computer 2015 - Proceedings</i>, 2015, pp. 173–182."},"page":"173-182","place":"Berlin","year":"2015","date_created":"2021-10-19T14:28:44Z","author":[{"full_name":"Schild, Christian","last_name":"Schild","first_name":"Christian"},{"last_name":"Petrausch","full_name":"Petrausch, Vanessa","first_name":"Vanessa"}],"date_updated":"2022-01-06T06:57:22Z","publisher":"De Gruyter Oldenbourg","title":"Empirical validation of design patterns","type":"conference","publication":"Human and Computer 2015 - Proceedings","status":"public","abstract":[{"lang":"eng","text":"Patterns serve to codify design knowledge. By embedding them in a hypothesis-driven design, it is possible to develop them further into sample languages. For this it is necessary to resolve the underlying conflicts in the form of design hypotheses and to validate them empirically in order to enable further use and generalization. In this article, an experiment is presented that describes this procedure and demonstrates the interplay between theory formation and codification of design knowledge using two examples.\r\n"}],"user_id":"71124","department":[{"_id":"71"}],"_id":"26536","language":[{"iso":"eng"}]},{"file_date_updated":"2018-03-21T09:33:11Z","ddc":["040"],"department":[{"_id":"63"}],"user_id":"15504","_id":"266","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1478","file_name":"266-p343-markarian.pdf","file_size":679580,"date_created":"2018-03-21T09:33:11Z","creator":"florida","date_updated":"2018-03-21T09:33:11Z"}],"abstract":[{"lang":"eng","text":"Many markets have seen a shift from the idea of buying and moved to leasing instead. Arguably, the latter has been the major catalyst for their success. Ten years ago, research realized this shift and initiated the study of \"online leasing problems\" by introducing leasing to online optimization problems. Resources required to provide a service in an \"online leasing problem\" are no more bought but leased for different durations. In this paper, we provide an overview of results that contribute to the understanding of \"online resource leasing problems\". "}],"publication":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)","type":"conference","doi":"10.1145/2767386.2767454","title":"Online Resource Leasing","author":[{"first_name":"Christine","id":"37612","full_name":"Markarian, Christine","last_name":"Markarian"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2017-10-17T12:41:44Z","date_updated":"2022-01-06T06:57:22Z","page":"343-344","citation":{"ama":"Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>. ; 2015:343-344. doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>","chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 343–44, 2015. <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>.","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–344.","apa":"Markarian, C., &#38; Meyer auf der Heide, F. (2015). Online Resource Leasing. In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i> (pp. 343–344). <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource Leasing}, DOI={<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2015}, pages={343–344} }","mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–44, doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>.","short":"C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344."},"year":"2015","has_accepted_license":"1"},{"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-21T09:33:41Z","date_updated":"2018-03-21T09:33:41Z","file_id":"1479","access_level":"closed","file_name":"267-Dissertation_-_Markarian.pdf","file_size":1328685}],"type":"dissertation","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T09:33:41Z","ddc":["040"],"department":[{"_id":"63"}],"user_id":"15415","_id":"267","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"short":"C. Markarian, Online Resource Leasing, Universität Paderborn, 2015.","bibtex":"@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität Paderborn}, author={Markarian, Christine}, year={2015} }","mla":"Markarian, Christine. <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","apa":"Markarian, C. (2015). <i>Online Resource Leasing</i>. Universität Paderborn.","chicago":"Markarian, Christine. <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","ieee":"C. Markarian, <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","ama":"Markarian C. <i>Online Resource Leasing</i>. Universität Paderborn; 2015."},"year":"2015","related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656"}]},"has_accepted_license":"1","title":"Online Resource Leasing","supervisor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"author":[{"first_name":"Christine","id":"37612","full_name":"Markarian, Christine","last_name":"Markarian"}],"date_created":"2017-10-17T12:41:44Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:26Z"},{"title":"On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach","date_created":"2017-10-17T12:41:44Z","year":"2015","ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"text":"Proof-carrying hardware is an approach that has recently been proposed for the efficient verification of reconfigurable modules. We present an application of proof-carrying hardware to guarantee the correct functionality of dynamically reconfigured image processing modules. Our prototype comprises a reconfigurable-system-on-chip with an embedded virtual FPGA fabric. This setup allows us to leverage open source FPGA synthesis and backend tools to produce FPGA configuration bitstreams with an open format and, thus, to demonstrate and experimentally evaluate proof-carrying hardware at the bitstream level.","lang":"eng"}],"file":[{"file_id":"1477","access_level":"closed","file_name":"269-paper_53.pdf","file_size":344309,"date_created":"2018-03-21T09:32:42Z","creator":"florida","date_updated":"2018-03-21T09:32:42Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Proceedings of the International Symposium in Reconfigurable Computing (ARC)","doi":"10.1007/978-3-319-16214-0_32","date_updated":"2022-01-06T06:57:30Z","author":[{"first_name":"Tobias","last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118"},{"full_name":"Wu, Sen","last_name":"Wu","first_name":"Sen"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"page":"365--372","citation":{"chicago":"Wiersema, Tobias, Sen Wu, and Marco Platzner. “On-The-Fly Verification of Reconfigurable Image Processing Modules Based on a Proof-Carrying Hardware Approach.” In <i>Proceedings of the International Symposium in Reconfigurable Computing (ARC)</i>, 365--372. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-16214-0_32\">https://doi.org/10.1007/978-3-319-16214-0_32</a>.","ieee":"T. Wiersema, S. Wu, and M. Platzner, “On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach,” in <i>Proceedings of the International Symposium in Reconfigurable Computing (ARC)</i>, 2015, pp. 365--372.","ama":"Wiersema T, Wu S, Platzner M. On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach. In: <i>Proceedings of the International Symposium in Reconfigurable Computing (ARC)</i>. LNCS. ; 2015:365--372. doi:<a href=\"https://doi.org/10.1007/978-3-319-16214-0_32\">10.1007/978-3-319-16214-0_32</a>","mla":"Wiersema, Tobias, et al. “On-The-Fly Verification of Reconfigurable Image Processing Modules Based on a Proof-Carrying Hardware Approach.” <i>Proceedings of the International Symposium in Reconfigurable Computing (ARC)</i>, 2015, pp. 365--372, doi:<a href=\"https://doi.org/10.1007/978-3-319-16214-0_32\">10.1007/978-3-319-16214-0_32</a>.","bibtex":"@inproceedings{Wiersema_Wu_Platzner_2015, series={LNCS}, title={On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-16214-0_32\">10.1007/978-3-319-16214-0_32</a>}, booktitle={Proceedings of the International Symposium in Reconfigurable Computing (ARC)}, author={Wiersema, Tobias and Wu, Sen and Platzner, Marco}, year={2015}, pages={365--372}, collection={LNCS} }","short":"T. Wiersema, S. Wu, M. Platzner, in: Proceedings of the International Symposium in Reconfigurable Computing (ARC), 2015, pp. 365--372.","apa":"Wiersema, T., Wu, S., &#38; Platzner, M. (2015). On-The-Fly Verification of Reconfigurable Image Processing Modules based on a Proof-Carrying Hardware Approach. In <i>Proceedings of the International Symposium in Reconfigurable Computing (ARC)</i> (pp. 365--372). <a href=\"https://doi.org/10.1007/978-3-319-16214-0_32\">https://doi.org/10.1007/978-3-319-16214-0_32</a>"},"has_accepted_license":"1","file_date_updated":"2018-03-21T09:32:42Z","_id":"269","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"78"}],"series_title":"LNCS","user_id":"477","status":"public","type":"conference"},{"doi":"10.1145/2614687","date_updated":"2022-01-06T06:59:04Z","author":[{"last_name":"Caragiannis","full_name":"Caragiannis, Ioannis","first_name":"Ioannis"},{"last_name":"Fanelli","full_name":"Fanelli, Angelo","first_name":"Angelo"},{"first_name":"Nick","full_name":"Gravin, Nick","last_name":"Gravin"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"volume":3,"citation":{"apa":"Caragiannis, I., Fanelli, A., Gravin, N., &#38; Skopalik, A. (2015). Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. <i>Transactions on Economics and Computation</i>, <i>3</i>(1). <a href=\"https://doi.org/10.1145/2614687\">https://doi.org/10.1145/2614687</a>","bibtex":"@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure}, volume={3}, DOI={<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>}, number={12}, journal={Transactions on Economics and Computation}, publisher={ACM}, author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik, Alexander}, year={2015} }","short":"I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics and Computation 3 (2015).","mla":"Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” <i>Transactions on Economics and Computation</i>, vol. 3, no. 1, 2, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>.","chicago":"Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” <i>Transactions on Economics and Computation</i> 3, no. 1 (2015). <a href=\"https://doi.org/10.1145/2614687\">https://doi.org/10.1145/2614687</a>.","ieee":"I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure,” <i>Transactions on Economics and Computation</i>, vol. 3, no. 1, 2015.","ama":"Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. <i>Transactions on Economics and Computation</i>. 2015;3(1). doi:<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>"},"intvolume":"         3","has_accepted_license":"1","article_number":"2","file_date_updated":"2018-03-20T07:40:55Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"320","user_id":"477","department":[{"_id":"63"},{"_id":"541"}],"status":"public","type":"journal_article","title":"Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure","publisher":"ACM","date_created":"2017-10-17T12:41:54Z","year":"2015","issue":"1","ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by a potential function argument. Unfortunately, this proof of existence is inefficient and computing pure Nash equilibria in such games is a PLS-hard problem even when all players have unit weights. The situation gets worse when superlinear (e.g., quadratic) latency functions come into play; in this case, the Nash dynamics of the game may contain cycles and pure Nash equilibria may not even exist. Given these obstacles, we consider approximate pure Nash equilibria as alternative solution concepts. A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game from which no player has any incentive to deviate in order to improve her cost by a multiplicative factor higher than ρ. Do such equilibria exist for small values of ρ? And if so, can we compute them efficiently?We provide positive answers to both questions for weighted congestion games with polynomial latency functions by exploiting an “approximation” of such games by a new class of potential games that we call Ψ-games. This allows us to show that these games have d!-approximate pure Nash equilibria, where d is the maximum degree of the latency functions. Our main technical contribution is an efficient algorithm for computing O(1)-approximate pure Nash equilibria when d is a constant. For games with linear latency functions, the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial in the number of bits in the representation of the game and 1/γ. As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is a constant.To the best of our knowledge, these are the first positive algorithmic results for approximate pure Nash equilibria in weighted congestion games. Our techniques significantly extend our recent work on unweighted congestion games through the use of Ψ-games. The concept of approximating nonpotential games by potential ones is interesting in itself and might have further applications."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-20T07:40:55Z","date_updated":"2018-03-20T07:40:55Z","file_name":"320-a2-caragiannis.pdf","access_level":"closed","file_id":"1433","file_size":260503}],"publication":"Transactions on Economics and Computation"},{"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":879285,"file_name":"321-eidens_masterthesis_01.pdf","file_id":"1432","access_level":"closed","date_updated":"2018-03-20T07:40:22Z","creator":"florida","date_created":"2018-03-20T07:40:22Z"}],"status":"public","type":"mastersthesis","ddc":["040"],"file_date_updated":"2018-03-20T07:40:22Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"321","user_id":"477","department":[{"_id":"64"}],"year":"2015","citation":{"apa":"Eidens, F. (2015). <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn.","short":"F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption, Universität Paderborn, 2015.","bibtex":"@book{Eidens_2015, title={Anonymous credential system based on q-Strong Diffie-Hellman Assumption}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2015} }","mla":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","ieee":"F. Eidens, <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","chicago":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","ama":"Eidens F. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn; 2015."},"has_accepted_license":"1","title":"Anonymous credential system based on q-Strong Diffie-Hellman Assumption","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:05Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"first_name":"Fabian","full_name":"Eidens, Fabian","id":"25078","last_name":"Eidens"}],"date_created":"2017-10-17T12:41:54Z"},{"year":"2015","date_created":"2017-10-17T12:41:54Z","title":"Anonymous and Publicly Linkable Reputation Systems","publication":"Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)","abstract":[{"text":"Reputation systems are used to compute and publish reputation scores for services or products. We consider reputation systems where users are allowed to rate products that they purchased previously. To obtain trustworthy reputations, they are allowed to rate these products only once. As long as users rate products once, they stay anonymous. Everybody is able to detect users deviating from the rate-products-only-once policy and the anonymity of such dishonest users can be revoked by a system manager. In this paper we present formal models for such reputation systems and their security. Based on group signatures presented by Boneh, Boyen, and Shacham we design an efficient reputation system that meets all our requirements.","lang":"eng"}],"file":[{"file_id":"1431","access_level":"closed","file_name":"322-546_01.pdf","file_size":499568,"creator":"florida","date_created":"2018-03-20T07:39:54Z","date_updated":"2018-03-20T07:39:54Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"ddc":["040"],"has_accepted_license":"1","page":"478--488","citation":{"chicago":"Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly Linkable Reputation Systems.” In <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 478--488. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">https://doi.org/10.1007/978-3-662-47854-7_29</a>.","ieee":"J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation Systems,” in <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 2015, pp. 478--488.","ama":"Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems. In: <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>. LNCS. ; 2015:478--488. doi:<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>","mla":"Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.” <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 2015, pp. 478--488, doi:<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>.","bibtex":"@inproceedings{Blömer_Juhnke_Kolb_2015, series={LNCS}, title={Anonymous and Publicly Linkable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>}, booktitle={Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)}, author={Blömer, Johannes and Juhnke, Jakob and Kolb, Christina}, year={2015}, pages={478--488}, collection={LNCS} }","short":"J. Blömer, J. Juhnke, C. Kolb, in: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.","apa":"Blömer, J., Juhnke, J., &#38; Kolb, C. (2015). Anonymous and Publicly Linkable Reputation Systems. In <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i> (pp. 478--488). <a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">https://doi.org/10.1007/978-3-662-47854-7_29</a>"},"oa":"1","date_updated":"2022-01-06T06:59:05Z","author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Juhnke","full_name":"Juhnke, Jakob","id":"48090","first_name":"Jakob"},{"first_name":"Christina","id":"43647","full_name":"Kolb, Christina","last_name":"Kolb"}],"doi":"10.1007/978-3-662-47854-7_29","main_file_link":[{"url":"https://eprint.iacr.org/2014/546","open_access":"1"}],"type":"conference","status":"public","_id":"322","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"series_title":"LNCS","user_id":"48090","file_date_updated":"2018-03-20T07:39:54Z"},{"issue":"1","year":"2015","publisher":"Springer","date_created":"2017-10-17T12:41:55Z","title":"An approach towards adaptive service composition in markets of composed services","publication":"Journal of Internet Services and Applications","abstract":[{"lang":"eng","text":"On-the-fly composition of service-based software solutions is still a challenging task. Even more challenges emerge when facing automatic service composition in markets of composed services for end users. In this paper, we focus on the functional discrepancy between “what a user wants” specified in terms of a request and “what a user gets” when executing a composed service. To meet the challenge of functional discrepancy, we propose the combination of existing symbolic composition approaches with machine learning techniques. We developed a learning recommendation system that expands the capabilities of existing composition algorithms to facilitate adaptivity and consequently reduces functional discrepancy. As a representative of symbolic techniques, an Artificial Intelligence planning based approach produces solutions that are correct with respect to formal specifications. Our learning recommendation system supports the symbolic approach in decision-making. Reinforcement Learning techniques enable the recommendation system to adjust its recommendation strategy over time based on user ratings. We implemented the proposed functionality in terms of a prototypical composition framework. Preliminary results from experiments conducted in the image processing domain illustrate the benefit of combining both complementary techniques."}],"file":[{"date_created":"2018-03-20T07:39:17Z","creator":"florida","date_updated":"2018-03-20T07:39:17Z","file_id":"1429","file_name":"323-An_approach_towards_adaptive_service_composition_in_markets_of_composed_services.pdf","access_level":"closed","file_size":2842281,"content_type":"application/pdf","relation":"main_file","success":1}],"ddc":["040"],"language":[{"iso":"eng"}],"has_accepted_license":"1","page":"1-18","citation":{"chicago":"Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service Composition in Markets of Composed Services.” <i>Journal of Internet Services and Applications</i>, no. 1 (2015): 1–18. <a href=\"https://doi.org/10.1186/s13174-015-0022-8\">https://doi.org/10.1186/s13174-015-0022-8</a>.","ieee":"A. Jungmann and F. Mohr, “An approach towards adaptive service composition in markets of composed services,” <i>Journal of Internet Services and Applications</i>, no. 1, pp. 1–18, 2015.","ama":"Jungmann A, Mohr F. An approach towards adaptive service composition in markets of composed services. <i>Journal of Internet Services and Applications</i>. 2015;(1):1-18. doi:<a href=\"https://doi.org/10.1186/s13174-015-0022-8\">10.1186/s13174-015-0022-8</a>","short":"A. Jungmann, F. Mohr, Journal of Internet Services and Applications (2015) 1–18.","bibtex":"@article{Jungmann_Mohr_2015, title={An approach towards adaptive service composition in markets of composed services}, DOI={<a href=\"https://doi.org/10.1186/s13174-015-0022-8\">10.1186/s13174-015-0022-8</a>}, number={1}, journal={Journal of Internet Services and Applications}, publisher={Springer}, author={Jungmann, Alexander and Mohr, Felix}, year={2015}, pages={1–18} }","mla":"Jungmann, Alexander, and Felix Mohr. “An Approach towards Adaptive Service Composition in Markets of Composed Services.” <i>Journal of Internet Services and Applications</i>, no. 1, Springer, 2015, pp. 1–18, doi:<a href=\"https://doi.org/10.1186/s13174-015-0022-8\">10.1186/s13174-015-0022-8</a>.","apa":"Jungmann, A., &#38; Mohr, F. (2015). An approach towards adaptive service composition in markets of composed services. <i>Journal of Internet Services and Applications</i>, (1), 1–18. <a href=\"https://doi.org/10.1186/s13174-015-0022-8\">https://doi.org/10.1186/s13174-015-0022-8</a>"},"date_updated":"2022-01-06T06:59:06Z","author":[{"first_name":"Alexander","last_name":"Jungmann","full_name":"Jungmann, Alexander"},{"first_name":"Felix","full_name":"Mohr, Felix","last_name":"Mohr"}],"doi":"10.1186/s13174-015-0022-8","type":"journal_article","status":"public","_id":"323","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"355"}],"user_id":"477","file_date_updated":"2018-03-20T07:39:17Z"},{"abstract":[{"text":"Services are self-contained software components that can beused platform independent and that aim at maximizing software reuse. Abasic concern in service oriented architectures is to measure the reusabilityof services. One of the most important qualities is the functionalreusability, which indicates how relevant the task is that a service solves.Current metrics for functional reusability of software, however, have verylittle explanatory power and do not accomplish this goal.This paper presents a new approach to estimate the functional reusabilityof services based on their relevance. To this end, it denes the degreeto which a service enables the execution of other services as its contri-bution. Based on the contribution, relevance of services is dened as anestimation for their functional reusability. Explanatory power is obtainedby normalizing relevance values with a reference service. The applicationof the metric to a service test set conrms its supposed capabilities.","lang":"eng"}],"file":[{"file_size":569475,"file_name":"324-ICSR-Mohr-15.pdf","access_level":"closed","file_id":"1428","date_updated":"2018-03-20T07:38:44Z","creator":"florida","date_created":"2018-03-20T07:38:44Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Proceedings of the 14th International Conference on Software Reuse (ICSR)","ddc":["040"],"language":[{"iso":"eng"}],"year":"2015","title":"A Metric for Functional Reusability of Services","date_created":"2017-10-17T12:41:55Z","status":"public","type":"conference","file_date_updated":"2018-03-20T07:38:44Z","_id":"324","project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"355"}],"user_id":"477","series_title":"LNCS","page":"298--313","citation":{"ieee":"F. Mohr, “A Metric for Functional Reusability of Services,” in <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>, 2015, pp. 298--313.","chicago":"Mohr, Felix. “A Metric for Functional Reusability of Services.” In <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>, 298--313. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-14130-5_21\">https://doi.org/10.1007/978-3-319-14130-5_21</a>.","ama":"Mohr F. A Metric for Functional Reusability of Services. In: <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>. LNCS. ; 2015:298--313. doi:<a href=\"https://doi.org/10.1007/978-3-319-14130-5_21\">10.1007/978-3-319-14130-5_21</a>","short":"F. Mohr, in: Proceedings of the 14th International Conference on Software Reuse (ICSR), 2015, pp. 298--313.","bibtex":"@inproceedings{Mohr_2015, series={LNCS}, title={A Metric for Functional Reusability of Services}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14130-5_21\">10.1007/978-3-319-14130-5_21</a>}, booktitle={Proceedings of the 14th International Conference on Software Reuse (ICSR)}, author={Mohr, Felix}, year={2015}, pages={298--313}, collection={LNCS} }","mla":"Mohr, Felix. “A Metric for Functional Reusability of Services.” <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>, 2015, pp. 298--313, doi:<a href=\"https://doi.org/10.1007/978-3-319-14130-5_21\">10.1007/978-3-319-14130-5_21</a>.","apa":"Mohr, F. (2015). A Metric for Functional Reusability of Services. In <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i> (pp. 298--313). <a href=\"https://doi.org/10.1007/978-3-319-14130-5_21\">https://doi.org/10.1007/978-3-319-14130-5_21</a>"},"has_accepted_license":"1","doi":"10.1007/978-3-319-14130-5_21","date_updated":"2022-01-06T06:59:07Z","author":[{"first_name":"Felix","full_name":"Mohr, Felix","last_name":"Mohr"}]},{"user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"325","type":"mastersthesis","status":"public","date_created":"2017-10-17T12:41:55Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"author":[{"first_name":"Nils","id":"13703","full_name":"Löken, Nils","last_name":"Löken"}],"date_updated":"2022-01-06T06:59:07Z","publisher":"Universität Paderborn","title":"A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption","related_material":{"record":[{"status":"public","id":"253","relation":"other"}]},"citation":{"mla":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","short":"N. Löken, A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption, Universität Paderborn, 2015.","bibtex":"@book{Löken_2015, title={A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2015} }","apa":"Löken, N. (2015). <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn.","ieee":"N. Löken, <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","chicago":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","ama":"Löken N. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn; 2015."},"year":"2015"}]