[{"author":[{"id":"47700","full_name":"Görzen, Thomas","last_name":"Görzen","first_name":"Thomas"},{"full_name":"Laux, Florian","last_name":"Laux","first_name":"Florian"}],"date_created":"2018-05-07T14:48:07Z","date_updated":"2022-01-06T06:57:28Z","conference":{"name":"Multikonferenz Wirtschaftsinformatik 2018 (MKWI)","location":"Lüneburg"},"title":"Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence","has_accepted_license":"1","publication_status":"published","citation":{"ama":"Görzen T, Laux F. Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence. In: <i>Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)</i>. Lüneburg; 2018.","chicago":"Görzen, Thomas, and Florian Laux. “Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence.” In <i>Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)</i>. Lüneburg, 2018.","ieee":"T. Görzen and F. Laux, “Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence,” in <i>Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)</i>, Lüneburg, 2018.","apa":"Görzen, T., &#38; Laux, F. (2018). Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence. In <i>Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)</i>. Lüneburg.","bibtex":"@inproceedings{Görzen_Laux_2018, place={Lüneburg}, title={Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence}, booktitle={Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)}, author={Görzen, Thomas and Laux, Florian}, year={2018} }","short":"T. Görzen, F. Laux, in: Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI), Lüneburg, 2018.","mla":"Görzen, Thomas, and Florian Laux. “Extracting the Wisdom from the Crowd: A Comparison of Approaches to Aggregating Collective Intelligence.” <i>Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)</i>, 2018."},"place":"Lüneburg","year":"2018","department":[{"_id":"276"}],"user_id":"477","_id":"2681","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-12-03T15:20:56Z","ddc":["040"],"publication":"Tagungsband Multikonferenz Wirtschaftsinformatik 2018 (MKWI)","type":"conference","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-12-03T15:20:56Z","creator":"abursig","date_created":"2018-12-03T15:20:56Z","file_size":278279,"access_level":"closed","file_name":"MKWI_113.pdf","file_id":"5989"}]},{"status":"public","type":"journal_article","file_date_updated":"2018-11-02T15:22:55Z","project":[{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"2685","user_id":"477","department":[{"_id":"7"},{"_id":"64"}],"citation":{"ieee":"J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary Norms,” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, pp. 314–338, 2018.","chicago":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i> 2, no. 2 (2018): 314–38. <a href=\"https://doi.org/10.1137/17M1132045\">https://doi.org/10.1137/17M1132045</a>.","ama":"Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry</i>. 2018;2(2):314-338. doi:<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>","bibtex":"@article{Blömer_Kohn_2018, title={Voronoi Cells of Lattices with Respect to Arbitrary Norms}, volume={2}, DOI={<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>}, number={2}, journal={SIAM Journal on Applied Algebra and Geometry.}, author={Blömer, Johannes and Kohn, Kathlén}, year={2018}, pages={314–338} }","mla":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, 2018, pp. 314–38, doi:<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>.","short":"J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018) 314–338.","apa":"Blömer, J., &#38; Kohn, K. (2018). Voronoi Cells of Lattices with Respect to Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry.</i>, <i>2</i>(2), 314–338. <a href=\"https://doi.org/10.1137/17M1132045\">https://doi.org/10.1137/17M1132045</a>"},"intvolume":"         2","page":"314-338","publication_status":"epub_ahead","publication_identifier":{"eissn":["2470-6566"]},"has_accepted_license":"1","doi":"10.1137/17M1132045","date_updated":"2022-01-06T06:57:29Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"full_name":"Kohn, Kathlén","last_name":"Kohn","first_name":"Kathlén"}],"volume":2,"file":[{"file_size":1131048,"access_level":"closed","file_name":"17m1132045.pdf","file_id":"5300","date_updated":"2018-11-02T15:22:55Z","creator":"ups","date_created":"2018-11-02T15:22:55Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"SIAM Journal on Applied Algebra and Geometry.","ddc":["000"],"language":[{"iso":"eng"}],"year":"2018","issue":"2","title":"Voronoi Cells of Lattices with Respect to Arbitrary Norms","date_created":"2018-05-08T09:18:54Z"},{"year":"2018","quality_controlled":"1","title":"Fully-Featured Anonymous Credentials with Reputation System","date_created":"2018-06-14T11:19:29Z","publisher":"ACM","file":[{"date_updated":"2018-11-08T10:17:39Z","date_created":"2018-11-08T10:17:39Z","creator":"feidens","file_size":920843,"file_name":"react_acs.pdf","file_id":"5428","access_level":"closed","content_type":"application/pdf","relation":"main_file"}],"abstract":[{"text":"We present CLARC (Cryptographic Library for Anonymous Reputation and Credentials), an anonymous credentials system (ACS) combined with an anonymous reputation system.\r\n\r\nUsing CLARC, users can receive attribute-based credentials from issuers. They can efficiently prove that their credentials satisfy complex (access) policies in a privacy-preserving way. This implements anonymous access control with complex policies.\r\n\r\nFurthermore, CLARC is the first ACS that is combined with an anonymous reputation system where users can anonymously rate services. A user who gets access to a service via a credential, also anonymously receives a review token to rate the service. If a user creates more than a single rating, this can be detected by anyone, preventing users from spamming ratings to sway public opinion.\r\n\r\nTo evaluate feasibility of our construction, we present an open-source prototype implementation.","lang":"eng"}],"publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES '18","language":[{"iso":"eng"}],"ddc":["000"],"citation":{"chicago":"Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials with Reputation System.” In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM, n.d. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>.","ieee":"K. Bemmann <i>et al.</i>, “Fully-Featured Anonymous Credentials with Reputation System,” in <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, Hamburg, Germany.","ama":"Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials with Reputation System. In: <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>","apa":"Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens, F., … Stienemeier, M. (n.d.). Fully-Featured Anonymous Credentials with Reputation System. In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>","bibtex":"@inproceedings{Bemmann_Blömer_Bobolz_Bröcher_Diemert_Eidens_Eilers_Haltermann_Juhnke_Otour_et al., place={New York, NY, USA}, title={Fully-Featured Anonymous Credentials with Reputation System}, DOI={<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18}, publisher={ACM}, author={Bemmann, Kai and Blömer, Johannes and Bobolz, Jan and Bröcher, Henrik and Diemert, Denis Pascal and Eidens, Fabian and Eilers, Lukas and Haltermann, Jan Frederik and Juhnke, Jakob and Otour, Burhan and et al.} }","mla":"Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.” <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, ACM, doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>.","short":"K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L. Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling, M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA, n.d."},"place":"New York, NY, USA","related_material":{"link":[{"relation":"software","url":"https://github.com/upbcuk"}]},"has_accepted_license":"1","publication_identifier":{"isbn":["978-1-4503-6448-5"]},"publication_status":"accepted","doi":"10.1145/3230833.3234517","conference":{"location":"Hamburg, Germany","end_date":"2018-08-30","start_date":"2018-08-27","name":"ARES 2018 - SECPID"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/835"}],"author":[{"first_name":"Kai","last_name":"Bemmann","full_name":"Bemmann, Kai"},{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"first_name":"Jan","full_name":"Bobolz, Jan","id":"27207","last_name":"Bobolz"},{"first_name":"Henrik","full_name":"Bröcher, Henrik","id":"41047","last_name":"Bröcher"},{"first_name":"Denis Pascal","last_name":"Diemert","full_name":"Diemert, Denis Pascal","id":"44071"},{"first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078"},{"first_name":"Lukas","full_name":"Eilers, Lukas","last_name":"Eilers"},{"id":"44413","full_name":"Haltermann, Jan Frederik","last_name":"Haltermann","first_name":"Jan Frederik"},{"first_name":"Jakob","full_name":"Juhnke, Jakob","id":"48090","last_name":"Juhnke"},{"first_name":"Burhan","last_name":"Otour","full_name":"Otour, Burhan"},{"first_name":"Laurens Alexander","last_name":"Porzenheim","id":"47434","full_name":"Porzenheim, Laurens Alexander"},{"first_name":"Simon","full_name":"Pukrop, Simon","last_name":"Pukrop"},{"first_name":"Erik","last_name":"Schilling","full_name":"Schilling, Erik"},{"first_name":"Michael","last_name":"Schlichtig","id":"32312","full_name":"Schlichtig, Michael"},{"first_name":"Marcel","full_name":"Stienemeier, Marcel","last_name":"Stienemeier"}],"date_updated":"2022-01-06T06:59:07Z","oa":"1","status":"public","type":"conference","file_date_updated":"2018-11-08T10:17:39Z","department":[{"_id":"64"}],"user_id":"25078","_id":"3265","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"44","name":"KogniHome - die mitdenkende Wohnung"}]},{"language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"3313","user_id":"477","department":[{"_id":"183"}],"status":"public","type":"mastersthesis","title":"Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:10Z","date_created":"2018-06-22T12:19:02Z","supervisor":[{"first_name":"Bernd","full_name":"Frick, Bernd","last_name":"Frick"}],"author":[{"first_name":"Alexandra","last_name":"Maurer","full_name":"Maurer, Alexandra"}],"year":"2018","citation":{"ama":"Maurer A. <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>. Universität Paderborn; 2018.","chicago":"Maurer, Alexandra. <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>. Universität Paderborn, 2018.","ieee":"A. Maurer, <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>. Universität Paderborn, 2018.","apa":"Maurer, A. (2018). <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>. Universität Paderborn.","mla":"Maurer, Alexandra. <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>. Universität Paderborn, 2018.","short":"A. Maurer, Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse, Universität Paderborn, 2018.","bibtex":"@book{Maurer_2018, title={Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse}, publisher={Universität Paderborn}, author={Maurer, Alexandra}, year={2018} }"}},{"title":"The Segmentation of Video-On-Demand Consumers","author":[{"first_name":"Luisa Juliane","last_name":"Michels","full_name":"Michels, Luisa Juliane"}],"supervisor":[{"last_name":"Frick","full_name":"Frick, Bernd","first_name":"Bernd"},{"first_name":"Daniel","last_name":"Kaimann","id":"18949","full_name":"Kaimann, Daniel"}],"date_created":"2018-06-22T12:20:47Z","date_updated":"2022-01-06T06:59:10Z","publisher":"Universität Paderborn","citation":{"chicago":"Michels, Luisa Juliane. <i>The Segmentation of Video-On-Demand Consumers</i>. Universität Paderborn, 2018.","ieee":"L. J. Michels, <i>The Segmentation of Video-On-Demand Consumers</i>. Universität Paderborn, 2018.","ama":"Michels LJ. <i>The Segmentation of Video-On-Demand Consumers</i>. Universität Paderborn; 2018.","apa":"Michels, L. J. (2018). <i>The Segmentation of Video-On-Demand Consumers</i>. Universität Paderborn.","mla":"Michels, Luisa Juliane. <i>The Segmentation of Video-On-Demand Consumers</i>. Universität Paderborn, 2018.","bibtex":"@book{Michels_2018, title={The Segmentation of Video-On-Demand Consumers}, publisher={Universität Paderborn}, author={Michels, Luisa Juliane}, year={2018} }","short":"L.J. Michels, The Segmentation of Video-On-Demand Consumers, Universität Paderborn, 2018."},"year":"2018","user_id":"477","department":[{"_id":"183"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"3314","status":"public","type":"mastersthesis"},{"department":[{"_id":"183"}],"user_id":"477","_id":"3315","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"status":"public","type":"mastersthesis","title":"Sentiment Analysis of User-generated Ratings in the Sharing Economy ","author":[{"first_name":"Miriam","full_name":"Walter, Miriam","last_name":"Walter"}],"supervisor":[{"full_name":"Frick, Bernd","last_name":"Frick","first_name":"Bernd"},{"last_name":"Kaimann","full_name":"Kaimann, Daniel","first_name":"Daniel"}],"date_created":"2018-06-22T12:22:31Z","date_updated":"2022-01-06T06:59:10Z","publisher":"Universität Paderborn","citation":{"ama":"Walter M. <i>Sentiment Analysis of User-Generated Ratings in the Sharing Economy </i>. Universität Paderborn; 2018.","ieee":"M. Walter, <i>Sentiment Analysis of User-generated Ratings in the Sharing Economy </i>. Universität Paderborn, 2018.","chicago":"Walter, Miriam. <i>Sentiment Analysis of User-Generated Ratings in the Sharing Economy </i>. Universität Paderborn, 2018.","apa":"Walter, M. (2018). <i>Sentiment Analysis of User-generated Ratings in the Sharing Economy </i>. Universität Paderborn.","mla":"Walter, Miriam. <i>Sentiment Analysis of User-Generated Ratings in the Sharing Economy </i>. Universität Paderborn, 2018.","short":"M. Walter, Sentiment Analysis of User-Generated Ratings in the Sharing Economy , Universität Paderborn, 2018.","bibtex":"@book{Walter_2018, title={Sentiment Analysis of User-generated Ratings in the Sharing Economy }, publisher={Universität Paderborn}, author={Walter, Miriam}, year={2018} }"},"year":"2018"},{"status":"public","type":"mastersthesis","_id":"3316","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"department":[{"_id":"183"}],"user_id":"477","year":"2018","citation":{"apa":"Korn, H. (2018). <i>Restaurant reputation and meal prices: empricial evidence from the German restaurant industry</i>. Universität Paderborn.","mla":"Korn, Hanna. <i>Restaurant Reputation and Meal Prices: Empricial Evidence from the German Restaurant Industry</i>. Universität Paderborn, 2018.","short":"H. Korn, Restaurant Reputation and Meal Prices: Empricial Evidence from the German Restaurant Industry, Universität Paderborn, 2018.","bibtex":"@book{Korn_2018, title={Restaurant reputation and meal prices: empricial evidence from the German restaurant industry}, publisher={Universität Paderborn}, author={Korn, Hanna}, year={2018} }","ama":"Korn H. <i>Restaurant Reputation and Meal Prices: Empricial Evidence from the German Restaurant Industry</i>. Universität Paderborn; 2018.","ieee":"H. Korn, <i>Restaurant reputation and meal prices: empricial evidence from the German restaurant industry</i>. Universität Paderborn, 2018.","chicago":"Korn, Hanna. <i>Restaurant Reputation and Meal Prices: Empricial Evidence from the German Restaurant Industry</i>. Universität Paderborn, 2018."},"title":"Restaurant reputation and meal prices: empricial evidence from the German restaurant industry","date_updated":"2022-01-06T06:59:10Z","publisher":"Universität Paderborn","author":[{"full_name":"Korn, Hanna","last_name":"Korn","first_name":"Hanna"}],"date_created":"2018-06-22T12:24:16Z","supervisor":[{"full_name":"Frick, Bernd","last_name":"Frick","first_name":"Bernd"}]},{"language":[{"iso":"ger"}],"_id":"3320","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"department":[{"_id":"7"},{"_id":"77"}],"user_id":"477","status":"public","type":"bachelorsthesis","title":"Korrektheitsbeweise für Muster von Servicekompositionen","date_updated":"2022-01-06T06:59:10Z","publisher":"Universität Paderborn","author":[{"last_name":"Rautenberg","full_name":"Rautenberg, Kai","first_name":"Kai"}],"date_created":"2018-06-25T07:53:32Z","supervisor":[{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"year":"2018","citation":{"apa":"Rautenberg, K. (2018). <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn.","bibtex":"@book{Rautenberg_2018, title={Korrektheitsbeweise für Muster von Servicekompositionen}, publisher={Universität Paderborn}, author={Rautenberg, Kai}, year={2018} }","mla":"Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","short":"K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen, Universität Paderborn, 2018.","ieee":"K. Rautenberg, <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","chicago":"Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","ama":"Rautenberg K. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn; 2018."}},{"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8460007/"}],"doi":"10.1109/NETSOFT.2018.8460007","conference":{"end_date":"2018-06-29","location":"Montreal","name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","start_date":"2018-06-25"},"author":[{"first_name":"Manuel","last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel"},{"first_name":"Hannes","last_name":"Küttner","full_name":"Küttner, Hannes"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"date_updated":"2022-01-06T06:59:11Z","oa":"1","citation":{"mla":"Peuster, Manuel, et al. “ Let the State Follow Its Flows: An SDN-Based Flow Handover Protocol to Support State Migration.” <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">10.1109/NETSOFT.2018.8460007</a>.","short":"M. Peuster, H. Küttner, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal, n.d.","bibtex":"@inproceedings{Peuster_Küttner_Karl, place={Montreal}, title={ Let the state follow its flows: An SDN-based flow handover protocol to support state migration}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">10.1109/NETSOFT.2018.8460007</a>}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, author={Peuster, Manuel and Küttner, Hannes and Karl, Holger} }","apa":"Peuster, M., Küttner, H., &#38; Karl, H. (n.d.).  Let the state follow its flows: An SDN-based flow handover protocol to support state migration. In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">https://doi.org/10.1109/NETSOFT.2018.8460007</a>","ama":"Peuster M, Küttner H, Karl H.  Let the state follow its flows: An SDN-based flow handover protocol to support state migration. In: <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">10.1109/NETSOFT.2018.8460007</a>","ieee":"M. Peuster, H. Küttner, and H. Karl, “ Let the state follow its flows: An SDN-based flow handover protocol to support state migration,” in <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, Montreal.","chicago":"Peuster, Manuel, Hannes Küttner, and Holger Karl. “ Let the State Follow Its Flows: An SDN-Based Flow Handover Protocol to Support State Migration.” In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal, n.d. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">https://doi.org/10.1109/NETSOFT.2018.8460007</a>."},"place":"Montreal","publication_status":"accepted","has_accepted_license":"1","file_date_updated":"2018-07-05T11:12:29Z","user_id":"13271","department":[{"_id":"75"}],"project":[{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"3345","status":"public","urn":"33458","type":"conference","title":" Let the state follow its flows: An SDN-based flow handover protocol to support state migration","date_created":"2018-06-25T12:21:49Z","year":"2018","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"date_updated":"2018-07-05T11:12:29Z","creator":"peuster","date_created":"2018-07-05T11:11:37Z","file_size":901561,"file_id":"3428","access_level":"open_access","file_name":"main_ris.pdf","content_type":"application/pdf","relation":"main_file"}],"abstract":[{"text":"Dynamically steering flows through virtualized net- work function instances is a key enabler for elastic, on-demand deployments of virtualized network functions. This becomes par- ticular challenging when stateful functions are involved, necessi- tating state management. The problem with existing solutions is that they typically embrace state migration and flow rerouting jointly, imposing a huge set of requirements on the on-boarded VNFs, e.g., solution-specific state management interfaces.\r\nIn this paper, we introduce the seamless handover proto- col (SHarP). It provides an easy-to-use, loss-less, and order- preserving flow rerouting mechanism that is not fixed to a single state management approach. This allows VNF vendors to implement or use the state management solution of their choice. SHarP supports these solutions with additional information when flows are migrated. Further, we show how SHarP significantly reduces the buffer usage at a central (SDN) controller, which is a typical bottleneck in existing solutions. Our experiments show that SHarP uses a constant amount of controller buffer, irrespective of the time taken to migrate the VNF state.","lang":"eng"}],"publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)"},{"publication_status":"accepted","has_accepted_license":"1","place":"Montreal","citation":{"short":"M. Peuster, J. Kampmeyer, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal, n.d.","bibtex":"@inproceedings{Peuster_Kampmeyer_Karl, place={Montreal}, title={Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">10.1109/NETSOFT.2018.8459905</a>}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, author={Peuster, Manuel and Kampmeyer, Johannes  and Karl, Holger} }","mla":"Peuster, Manuel, et al. “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains.” <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">10.1109/NETSOFT.2018.8459905</a>.","apa":"Peuster, M., Kampmeyer, J., &#38; Karl, H. (n.d.). Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains. In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">https://doi.org/10.1109/NETSOFT.2018.8459905</a>","ieee":"M. Peuster, J. Kampmeyer, and H. Karl, “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains,” in <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, Montreal.","chicago":"Peuster, Manuel, Johannes  Kampmeyer, and Holger Karl. “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains.” In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal, n.d. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">https://doi.org/10.1109/NETSOFT.2018.8459905</a>.","ama":"Peuster M, Kampmeyer J, Karl H. Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains. In: <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">10.1109/NETSOFT.2018.8459905</a>"},"oa":"1","date_updated":"2022-01-06T06:59:11Z","author":[{"id":"13271","full_name":"Peuster, Manuel","last_name":"Peuster","first_name":"Manuel"},{"last_name":"Kampmeyer","full_name":"Kampmeyer, Johannes ","first_name":"Johannes "},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8459905/"}],"doi":"10.1109/NETSOFT.2018.8459905","conference":{"name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","start_date":"2018-06-25","end_date":"2018-06-29","location":"Montreal"},"type":"conference","urn":"33467","status":"public","project":[{"_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps","grant_number":"761493"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"3346","user_id":"13271","department":[{"_id":"75"}],"file_date_updated":"2018-07-05T11:12:55Z","year":"2018","date_created":"2018-06-25T12:24:19Z","title":"Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains","publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","abstract":[{"lang":"eng","text":"Developing a virtualized network service does not only involve the\r\n  implementation and configuration of the network functions it is\r\n  composed of but also its integration and test with management\r\n  solutions that will control the service in its production\r\n  environment. These integration tasks require testbeds that offer the\r\n  needed network function virtualization infrastructure~(NFVI), like OpenStack, introducing a\r\n  lot of management and maintenance overheads. Such testbed setups\r\n  become even more complicated when the multi\r\n  point-of-presence~(PoP) case, with multiple infrastructure\r\n  installations, is considered.\r\n\r\n  In this demo, we showcase an emulation platform that executes\r\n  containerized network services in user-defined multi-PoP\r\n  topologies. The platform does not only allow network service developers to\r\n  locally test their services but also to connect real-world\r\n  management and orchestration solutions to the emulated PoPs. During our\r\n  interactive demonstration we focus on the integration between\r\n  the emulated infrastructure and state-of-the-art orchestration\r\n  solutions like SONATA or OSM."}],"file":[{"creator":"peuster","date_created":"2018-07-05T11:12:55Z","date_updated":"2018-07-05T11:12:55Z","file_id":"3429","access_level":"open_access","file_name":"main_ris.pdf","file_size":449513,"content_type":"application/pdf","relation":"main_file"}],"ddc":["000"],"language":[{"iso":"eng"}]},{"year":"2018","title":"Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments","date_created":"2018-06-25T12:27:59Z","file":[{"relation":"main_file","content_type":"application/pdf","file_name":"main_ris.pdf","access_level":"open_access","file_id":"3430","file_size":713495,"date_created":"2018-07-05T11:13:29Z","creator":"peuster","date_updated":"2018-07-05T11:13:29Z"}],"abstract":[{"lang":"eng","text":"Management and orchestration~(MANO) systems are the key components of future large-scale NFV environments. They will manage resources of hundreds or even thousands of NFV infrastructure installations, so called points of presence~(PoP). Such scenarios need to be automatically tested during the development phase of a MANO system. This task becomes very challenging because large-scale NFV testbeds are hard to maintain, too expensive, or simply not available.\r\n\r\nIn this paper, we present a multi-PoP NFV infrastructure emulation platform that enables automated, large-scale testing of MANO stacks. We show that our platform can easily emulate hundreds of PoPs on a single physical machine and reduces the setup time of a test PoP by a factor of 232x compared to a DevStack-based test PoP installation. Further, we present a case study in which we test ETSI's Open Source MANO~(OSM) against our proposed system  to gain insights about OSM's behaviour in large-scale NFV deployments."}],"publication":"European Conference on Networks and Communications (EuCNC)","language":[{"iso":"eng"}],"ddc":["000"],"citation":{"ieee":"M. Peuster, M. Marchetti, G. Garcia de Blas, and H. Karl, “Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments,” in <i>European Conference on Networks and Communications (EuCNC)</i>, Ljubljana.","chicago":"Peuster, Manuel, Michael Marchetti, Gerado Garcia de Blas, and Holger Karl. “Emulation-Based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments.” In <i>European Conference on Networks and Communications (EuCNC)</i>. Ljubljana, n.d. <a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">https://doi.org/10.1109/EuCNC.2018.8442701</a>.","ama":"Peuster M, Marchetti M, Garcia de Blas G, Karl H. Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments. In: <i>European Conference on Networks and Communications (EuCNC)</i>. Ljubljana. doi:<a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">10.1109/EuCNC.2018.8442701</a>","apa":"Peuster, M., Marchetti, M., Garcia de Blas, G., &#38; Karl, H. (n.d.). Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments. In <i>European Conference on Networks and Communications (EuCNC)</i>. Ljubljana. <a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">https://doi.org/10.1109/EuCNC.2018.8442701</a>","bibtex":"@inproceedings{Peuster_Marchetti_Garcia de Blas_Karl, place={Ljubljana}, title={Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments}, DOI={<a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">10.1109/EuCNC.2018.8442701</a>}, booktitle={European Conference on Networks and Communications (EuCNC)}, author={Peuster, Manuel and Marchetti, Michael and Garcia de Blas, Gerado and Karl, Holger} }","mla":"Peuster, Manuel, et al. “Emulation-Based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments.” <i>European Conference on Networks and Communications (EuCNC)</i>, doi:<a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">10.1109/EuCNC.2018.8442701</a>.","short":"M. Peuster, M. Marchetti, G. Garcia de Blas, H. Karl, in: European Conference on Networks and Communications (EuCNC), Ljubljana, n.d."},"place":"Ljubljana","has_accepted_license":"1","publication_status":"accepted","conference":{"location":"Ljubljana","name":"European Conference on Networks and Communications (EuCNC)"},"doi":"10.1109/EuCNC.2018.8442701","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8442701/"}],"author":[{"first_name":"Manuel","last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel"},{"full_name":"Marchetti, Michael","last_name":"Marchetti","first_name":"Michael"},{"first_name":"Gerado","full_name":"Garcia de Blas, Gerado","last_name":"Garcia de Blas"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"oa":"1","date_updated":"2022-01-06T06:59:12Z","status":"public","urn":"33477","type":"conference","file_date_updated":"2018-07-05T11:13:29Z","department":[{"_id":"75"}],"user_id":"13271","_id":"3347","project":[{"grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}]},{"file_date_updated":"2018-06-26T13:58:28Z","project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901","_id":"1"}],"_id":"3362","series_title":"Lecture Notes in Computer Science","user_id":"477","department":[{"_id":"78"}],"status":"public","type":"conference","doi":"10.1007/978-3-319-77610-1_6","date_updated":"2022-01-06T06:59:13Z","author":[{"full_name":"Lösch, Achim","id":"43646","last_name":"Lösch","first_name":"Achim"},{"full_name":"Wiens, Alex","last_name":"Wiens","first_name":"Alex"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"volume":10793,"place":"Cham","citation":{"ieee":"A. Lösch, A. Wiens, and M. Platzner, “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes,” in <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, 2018, vol. 10793, pp. 73–84.","chicago":"Lösch, Achim, Alex Wiens, and Marco Platzner. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” In <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, 10793:73–84. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">https://doi.org/10.1007/978-3-319-77610-1_6</a>.","ama":"Lösch A, Wiens A, Platzner M. Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In: <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>. Vol 10793. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2018:73-84. doi:<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>","apa":"Lösch, A., Wiens, A., &#38; Platzner, M. (2018). Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes. In <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i> (Vol. 10793, pp. 73–84). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">https://doi.org/10.1007/978-3-319-77610-1_6</a>","mla":"Lösch, Achim, et al. “Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes.” <i>Proceedings of the International Conference on Architecture of Computing Systems (ARCS)</i>, vol. 10793, Springer International Publishing, 2018, pp. 73–84, doi:<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>.","bibtex":"@inproceedings{Lösch_Wiens_Platzner_2018, place={Cham}, series={Lecture Notes in Computer Science}, title={Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes}, volume={10793}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-77610-1_6\">10.1007/978-3-319-77610-1_6</a>}, booktitle={Proceedings of the International Conference on Architecture of Computing Systems (ARCS)}, publisher={Springer International Publishing}, author={Lösch, Achim and Wiens, Alex and Platzner, Marco}, year={2018}, pages={73–84}, collection={Lecture Notes in Computer Science} }","short":"A. Lösch, A. Wiens, M. Platzner, in: Proceedings of the International Conference on Architecture of Computing Systems (ARCS), Springer International Publishing, Cham, 2018, pp. 73–84."},"page":"73-84","intvolume":"     10793","publication_status":"published","publication_identifier":{"isbn":["9783319776095","9783319776101"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","ddc":["040"],"abstract":[{"text":"Profiling applications on a heterogeneous compute node is challenging since the way to retrieve data from the resources and interpret them varies between resource types and manufacturers. This holds especially true for measuring the energy consumption. In this paper we present Ampehre, a novel open source measurement framework that allows developers to gather comparable measurements from heterogeneous compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture of Ampehre and detail the measurement process on the example of energy measurements on CPU and GPU. To characterize the probing effect, we quantitatively analyze the trade-off between the accuracy of measurements and the CPU load imposed by Ampehre. Based on this analysis, we are able to specify reasonable combinations of sampling periods for the different resource types of a compute node.","lang":"eng"}],"file":[{"file_name":"loesch2017_arcs.pdf","access_level":"closed","file_id":"3363","file_size":1114026,"creator":"aloesch","date_created":"2018-06-26T13:58:28Z","date_updated":"2018-06-26T13:58:28Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Proceedings of the International Conference on Architecture of Computing Systems (ARCS)","title":"Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes","publisher":"Springer International Publishing","date_created":"2018-06-26T13:47:52Z","year":"2018"},{"citation":{"ama":"Schnuer J-P. <i>Static Scheduling Algorithms for Heterogeneous Compute Nodes</i>. Universität Paderborn; 2018.","ieee":"J.-P. Schnuer, <i>Static Scheduling Algorithms for Heterogeneous Compute Nodes</i>. Universität Paderborn, 2018.","chicago":"Schnuer, Jan-Philip. <i>Static Scheduling Algorithms for Heterogeneous Compute Nodes</i>. Universität Paderborn, 2018.","apa":"Schnuer, J.-P. (2018). <i>Static Scheduling Algorithms for Heterogeneous Compute Nodes</i>. Universität Paderborn.","mla":"Schnuer, Jan-Philip. <i>Static Scheduling Algorithms for Heterogeneous Compute Nodes</i>. Universität Paderborn, 2018.","bibtex":"@book{Schnuer_2018, title={Static Scheduling Algorithms for Heterogeneous Compute Nodes}, publisher={Universität Paderborn}, author={Schnuer, Jan-Philip}, year={2018} }","short":"J.-P. Schnuer, Static Scheduling Algorithms for Heterogeneous Compute Nodes, Universität Paderborn, 2018."},"year":"2018","title":"Static Scheduling Algorithms for Heterogeneous Compute Nodes","date_created":"2018-06-26T14:10:18Z","supervisor":[{"last_name":"Lösch","full_name":"Lösch, Achim","id":"43646","first_name":"Achim"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"author":[{"first_name":"Jan-Philip","full_name":"Schnuer, Jan-Philip","last_name":"Schnuer"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:13Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"477","_id":"3365","project":[{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"year":"2018","citation":{"chicago":"Croce, Marcel. <i>Evaluation of OpenCL-Based Compilation for FPGAs</i>. Universität Paderborn, 2018.","ieee":"M. Croce, <i>Evaluation of OpenCL-based Compilation for FPGAs</i>. Universität Paderborn, 2018.","ama":"Croce M. <i>Evaluation of OpenCL-Based Compilation for FPGAs</i>. Universität Paderborn; 2018.","apa":"Croce, M. (2018). <i>Evaluation of OpenCL-based Compilation for FPGAs</i>. Universität Paderborn.","bibtex":"@book{Croce_2018, title={Evaluation of OpenCL-based Compilation for FPGAs}, publisher={Universität Paderborn}, author={Croce, Marcel}, year={2018} }","short":"M. Croce, Evaluation of OpenCL-Based Compilation for FPGAs, Universität Paderborn, 2018.","mla":"Croce, Marcel. <i>Evaluation of OpenCL-Based Compilation for FPGAs</i>. Universität Paderborn, 2018."},"title":"Evaluation of OpenCL-based Compilation for FPGAs","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:13Z","date_created":"2018-06-26T14:12:00Z","supervisor":[{"last_name":"Lösch","id":"43646","full_name":"Lösch, Achim","first_name":"Achim"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"author":[{"last_name":"Croce","full_name":"Croce, Marcel","first_name":"Marcel"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"3366","project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"78"}],"user_id":"477"},{"abstract":[{"lang":"eng","text":"Modern Boolean satisfiability solvers can emit proofs of unsatisfiability. There is substantial interest in being able to verify such proofs and also in using them for further computations. In this paper, we present an FPGA accelerator for checking resolution proofs, a popular proof format. Our accelerator exploits parallelism at the low level by implementing the basic resolution step in hardware, and at the high level by instantiating a number of parallel modules for proof checking. Since proof checking involves highly irregular memory accesses, we employ Hybrid Memory Cube technology for accelerator memory. The results show that while the accelerator is scalable and achieves speedups for all benchmark proofs, performance improvements are currently limited by the overhead of transitioning the proof into the accelerator memory."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5257","file_name":"AnFPGAHMC-BasedAcceleratorForR.pdf","access_level":"closed","file_size":612367,"creator":"ups","date_created":"2018-11-02T13:55:07Z","date_updated":"2018-11-02T13:55:07Z"}],"publication":"ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications","ddc":["000"],"language":[{"iso":"eng"}],"year":"2018","title":"An FPGA/HMC-Based Accelerator for Resolution Proof Checking","publisher":"Springer International Publishing","date_created":"2018-06-27T09:30:24Z","status":"public","type":"conference","file_date_updated":"2018-11-02T13:55:07Z","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"3373","user_id":"3118","series_title":"Lecture Notes in Computer Science","department":[{"_id":"78"}],"citation":{"chicago":"Hansmeier, Tim, Marco Platzner, and David Andrews. “An FPGA/HMC-Based Accelerator for Resolution Proof Checking.” In <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, 10824:153–65. Lecture Notes in Computer Science. Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">https://doi.org/10.1007/978-3-319-78890-6_13</a>.","ieee":"T. Hansmeier, M. Platzner, and D. Andrews, “An FPGA/HMC-Based Accelerator for Resolution Proof Checking,” in <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, Santorini, Greece, 2018, vol. 10824, pp. 153–165.","ama":"Hansmeier T, Platzner M, Andrews D. An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In: <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>. Vol 10824. Lecture Notes in Computer Science. Springer International Publishing; 2018:153-165. doi:<a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">10.1007/978-3-319-78890-6_13</a>","bibtex":"@inproceedings{Hansmeier_Platzner_Andrews_2018, series={Lecture Notes in Computer Science}, title={An FPGA/HMC-Based Accelerator for Resolution Proof Checking}, volume={10824}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">10.1007/978-3-319-78890-6_13</a>}, booktitle={ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications}, publisher={Springer International Publishing}, author={Hansmeier, Tim and Platzner, Marco and Andrews, David}, year={2018}, pages={153–165}, collection={Lecture Notes in Computer Science} }","mla":"Hansmeier, Tim, et al. “An FPGA/HMC-Based Accelerator for Resolution Proof Checking.” <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, vol. 10824, Springer International Publishing, 2018, pp. 153–65, doi:<a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">10.1007/978-3-319-78890-6_13</a>.","short":"T. Hansmeier, M. Platzner, D. Andrews, in: ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications, Springer International Publishing, 2018, pp. 153–165.","apa":"Hansmeier, T., Platzner, M., &#38; Andrews, D. (2018). An FPGA/HMC-Based Accelerator for Resolution Proof Checking. In <i>ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications</i> (Vol. 10824, pp. 153–165). Santorini, Greece: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-78890-6_13\">https://doi.org/10.1007/978-3-319-78890-6_13</a>"},"intvolume":"     10824","page":"153-165","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319788890","9783319788906"]},"has_accepted_license":"1","conference":{"end_date":"2018-05-04","location":"Santorini, Greece","name":"ARC: International Symposium on Applied Reconfigurable Computing","start_date":"2018-05-02"},"doi":"10.1007/978-3-319-78890-6_13","date_updated":"2022-01-06T06:59:13Z","author":[{"full_name":"Hansmeier, Tim","id":"49992","orcid":"0000-0003-1377-3339","last_name":"Hansmeier","first_name":"Tim"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"},{"first_name":"David","last_name":"Andrews","full_name":"Andrews, David"}],"volume":10824},{"doi":"10.1007/s10994-018-5733-1","title":"On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis","author":[{"full_name":"Melnikov, Vitalik","last_name":"Melnikov","first_name":"Vitalik"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"}],"date_created":"2018-06-29T07:44:26Z","date_updated":"2022-01-06T06:59:14Z","citation":{"bibtex":"@article{Melnikov_Hüllermeier_2018, title={On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis}, DOI={<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>}, journal={Machine Learning}, author={Melnikov, Vitalik and Hüllermeier, Eyke}, year={2018} }","mla":"Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” <i>Machine Learning</i>, 2018, doi:<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>.","short":"V. Melnikov, E. Hüllermeier, Machine Learning (2018).","apa":"Melnikov, V., &#38; Hüllermeier, E. (2018). On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. <i>Machine Learning</i>. <a href=\"https://doi.org/10.1007/s10994-018-5733-1\">https://doi.org/10.1007/s10994-018-5733-1</a>","chicago":"Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” <i>Machine Learning</i>, 2018. <a href=\"https://doi.org/10.1007/s10994-018-5733-1\">https://doi.org/10.1007/s10994-018-5733-1</a>.","ieee":"V. Melnikov and E. Hüllermeier, “On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis,” <i>Machine Learning</i>, 2018.","ama":"Melnikov V, Hüllermeier E. On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. <i>Machine Learning</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>"},"year":"2018","has_accepted_license":"1","publication_identifier":{"issn":["1573-0565"]},"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:30:57Z","ddc":["000"],"department":[{"_id":"355"}],"user_id":"15504","_id":"3402","project":[{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901","_id":"1"}],"status":"public","file":[{"file_size":1482882,"access_level":"closed","file_id":"5305","file_name":"OnTheEffectivenessOfHeuristics.pdf","date_updated":"2018-11-02T15:30:57Z","date_created":"2018-11-02T15:30:57Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"In machine learning, so-called nested dichotomies are utilized as a reduction technique, i.e., to decompose a multi-class classification problem into a set of binary problems, which are solved using a simple binary classifier as a base learner. The performance of the (multi-class) classifier thus produced strongly depends on the structure of the decomposition. In this paper, we conduct an empirical study, in which we compare existing heuristics for selecting a suitable structure in the form of a nested dichotomy. Moreover, we propose two additional heuristics as natural completions. One of them is the Best-of-K heuristic, which picks the (presumably) best among K randomly generated nested dichotomies. Surprisingly, and in spite of its simplicity, it turns out to outperform the state of the art.","lang":"eng"}],"publication":"Machine Learning","type":"journal_article"},{"type":"conference","status":"public","_id":"3414","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"department":[{"_id":"7"},{"_id":"77"}],"series_title":"Lecture Notes in Computer Science","user_id":"29719","file_date_updated":"2018-11-21T09:35:35Z","has_accepted_license":"1","publication_status":"published","page":"39--55","intvolume":"     11146","citation":{"apa":"Börding, P., Haltermann, J. F., Jakobs, M.-C., &#38; Wehrheim, H. (2018). JMCTest: Automatically Testing Inter-Method Contracts in Java. In <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i> (Vol. 11146, pp. 39--55). Cádiz, Spain: Springer.","bibtex":"@inproceedings{Börding_Haltermann_Jakobs_Wehrheim_2018, series={Lecture Notes in Computer Science}, title={JMCTest: Automatically Testing Inter-Method Contracts in Java}, volume={11146}, booktitle={Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)}, publisher={Springer}, author={Börding, Paul and Haltermann, Jan Frederik and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2018}, pages={39--55}, collection={Lecture Notes in Computer Science} }","short":"P. Börding, J.F. Haltermann, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), Springer, 2018, pp. 39--55.","mla":"Börding, Paul, et al. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, vol. 11146, Springer, 2018, pp. 39--55.","ama":"Börding P, Haltermann JF, Jakobs M-C, Wehrheim H. JMCTest: Automatically Testing Inter-Method Contracts in Java. In: <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>. Vol 11146. Lecture Notes in Computer Science. Springer; 2018:39--55.","ieee":"P. Börding, J. F. Haltermann, M.-C. Jakobs, and H. Wehrheim, “JMCTest: Automatically Testing Inter-Method Contracts in Java,” in <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, Cádiz, Spain, 2018, vol. 11146, pp. 39--55.","chicago":"Börding, Paul, Jan Frederik Haltermann, Marie-Christine Jakobs, and Heike Wehrheim. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” In <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, 11146:39--55. Lecture Notes in Computer Science. Springer, 2018."},"date_updated":"2022-01-06T06:59:15Z","volume":11146,"author":[{"full_name":"Börding, Paul","last_name":"Börding","first_name":"Paul"},{"first_name":"Jan Frederik","id":"44413","full_name":"Haltermann, Jan Frederik","last_name":"Haltermann"},{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"conference":{"location":"Cádiz, Spain","end_date":"2018-10-03","start_date":"2018-10-01","name":"IFIP International Conference on Testing Software and Systems"},"publication":"Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)","abstract":[{"text":"Over the years, Design by Contract (DbC) has evolved as a\r\npowerful concept for program documentation, testing, and verification.\r\nContracts formally specify assertions on (mostly) object-oriented programs:\r\npre- and postconditions of methods, class invariants, allowed call\r\norders, etc. Missing in the long list of properties specifiable by contracts\r\nare, however, method correlations: DbC languages fall short on stating\r\nassertions relating methods.\r\nIn this paper, we propose the novel concept of inter-method contract,\r\nallowing precisely for expressing method correlations.We present JMC as\r\na language for specifying and JMCTest as a tool for dynamically checking\r\ninter-method contracts on Java programs. JMCTest fully automatically\r\ngenerates objects on which the contracted methods are called and\r\nthe validity of the contract is checked. Using JMCTest, we detected\r\nthat large Java code bases (e.g. JBoss, Java RT) frequently violate standard\r\ninter-method contracts. In comparison to other verification tools\r\ninspecting (some) inter-method contracts, JMCTest can find bugs that\r\nremain undetected by those tools.","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":574386,"file_name":"Börding2018_Chapter_JMCTestAutomaticallyTestingInt.pdf","access_level":"closed","file_id":"5770","date_updated":"2018-11-21T09:35:35Z","creator":"schlatt","date_created":"2018-11-21T09:35:35Z"}],"ddc":["006"],"language":[{"iso":"eng"}],"year":"2018","publisher":"Springer","date_created":"2018-07-02T09:06:56Z","title":"JMCTest: Automatically Testing Inter-Method Contracts in Java"},{"status":"public","type":"conference","file_date_updated":"2018-10-31T13:30:40Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"3422","user_id":"11108","department":[{"_id":"79"},{"_id":"34"},{"_id":"7"}],"citation":{"apa":"Robinson, P., Scheideler, C., &#38; Setzer, A. (n.d.). Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien. <a href=\"https://doi.org/10.1145/3210377.3210399\">https://doi.org/10.1145/3210377.3210399</a>","bibtex":"@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and Setzer, Alexander} }","mla":"Robinson, Peter, et al. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, doi:<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>.","short":"P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d.","ieee":"P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary,” in <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien.","chicago":"Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, n.d. <a href=\"https://doi.org/10.1145/3210377.3210399\">https://doi.org/10.1145/3210377.3210399</a>.","ama":"Robinson P, Scheideler C, Setzer A. Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In: <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. doi:<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>"},"publication_status":"accepted","publication_identifier":{"isbn":["978-1-4503-5799-9/18/07"]},"has_accepted_license":"1","conference":{"end_date":"2018-07-18","location":"Wien","name":"30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","start_date":"2018-07-16"},"doi":"10.1145/3210377.3210399","date_updated":"2022-01-06T06:59:16Z","author":[{"last_name":"Robinson","full_name":"Robinson, Peter","first_name":"Peter"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Alexander","id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer"}],"abstract":[{"text":"We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing that any consensus algorithm that is resilient against a linear number of crash faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against an adaptive adversary, we consider a late adaptive adversary, who has full knowledge of the network state at the beginning of the previous round and unlimited computational power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions are randomized distributed algorithms that achieve consensus with high probability among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'') against a late adaptive adversary who can block up to ε n$ nodes in each round, for a small constant ε >0$. Our first protocol achieves binary almost-everywhere consensus and also guarantees a decision on the majority input value, thus ensuring plurality consensus. We also present an algorithm that achieves the same time complexity for multi-value consensus. Both of our algorithms succeed in $O(log n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries, which can be strengthened to $\\Omega(n)$ when allowing the adversary to block nodes instead of permanently crashing them. Our algorithms are scalable to large systems as each node contacts only an (amortized) constant number of peers in each communication round. We show that our algorithms are optimal up to constant (resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper bound on the number of communication requests initiated per node in each round. We complement our theoretical results with an experimental evaluation of the binary almost-everywhere consensus protocol revealing a short convergence time even against an adversary blocking a large fraction of nodes.","lang":"eng"}],"file":[{"creator":"asetzer","date_created":"2018-10-31T13:30:40Z","date_updated":"2018-10-31T13:30:40Z","access_level":"closed","file_name":"p173-robinson.pdf","file_id":"5215","file_size":1675407,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","ddc":["040"],"keyword":["distributed consensus","randomized algorithm","adaptive adversary","complexity lower bound"],"language":[{"iso":"eng"}],"year":"2018","title":"Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary","date_created":"2018-07-04T08:55:45Z"},{"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1070937,"file_name":"ML-PlanAutomatedMachineLearnin.pdf","access_level":"closed","file_id":"5306","date_updated":"2018-11-02T15:32:16Z","date_created":"2018-11-02T15:32:16Z","creator":"ups"}],"abstract":[{"lang":"eng","text":"Automated machine learning (AutoML) seeks to automatically select, compose, and parametrize machine learning algorithms, so as to achieve optimal performance on a given task (dataset). Although current approaches to AutoML have already produced impressive results, the field is still far from mature, and new techniques are still being developed. In this paper, we present ML-Plan, a new approach to AutoML based on hierarchical planning. To highlight the potential of this approach, we compare ML-Plan to the state-of-the-art frameworks Auto-WEKA, auto-sklearn, and TPOT. In an extensive series of experiments, we show that ML-Plan is highly competitive and often outperforms existing approaches."}],"publication":"Machine Learning","language":[{"iso":"eng"}],"ddc":["000"],"keyword":["AutoML","Hierarchical Planning","HTN planning","ML-Plan"],"year":"2018","title":"ML-Plan: Automated Machine Learning via Hierarchical Planning","date_created":"2018-07-08T14:06:14Z","publisher":"Springer","status":"public","type":"journal_article","file_date_updated":"2018-11-02T15:32:16Z","article_type":"original","user_id":"5786","department":[{"_id":"355"},{"_id":"34"},{"_id":"7"},{"_id":"26"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"3510","citation":{"ama":"Mohr F, Wever MD, Hüllermeier E. ML-Plan: Automated Machine Learning via Hierarchical Planning. <i>Machine Learning</i>. Published online 2018:1495-1515. doi:<a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “ML-Plan: Automated Machine Learning via Hierarchical Planning.” <i>Machine Learning</i>, 2018, 1495–1515. <a href=\"https://doi.org/10.1007/s10994-018-5735-z\">https://doi.org/10.1007/s10994-018-5735-z</a>.","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “ML-Plan: Automated Machine Learning via Hierarchical Planning,” <i>Machine Learning</i>, pp. 1495–1515, 2018, doi: <a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>.","apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (2018). ML-Plan: Automated Machine Learning via Hierarchical Planning. <i>Machine Learning</i>, 1495–1515. <a href=\"https://doi.org/10.1007/s10994-018-5735-z\">https://doi.org/10.1007/s10994-018-5735-z</a>","short":"F. Mohr, M.D. Wever, E. Hüllermeier, Machine Learning (2018) 1495–1515.","bibtex":"@article{Mohr_Wever_Hüllermeier_2018, title={ML-Plan: Automated Machine Learning via Hierarchical Planning}, DOI={<a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>}, journal={Machine Learning}, publisher={Springer}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018}, pages={1495–1515} }","mla":"Mohr, Felix, et al. “ML-Plan: Automated Machine Learning via Hierarchical Planning.” <i>Machine Learning</i>, Springer, 2018, pp. 1495–515, doi:<a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>."},"page":"1495-1515","publication_status":"epub_ahead","publication_identifier":{"issn":["0885-6125"],"eissn":["1573-0565"]},"has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"https://rdcu.be/3Nc2"}],"doi":"10.1007/s10994-018-5735-z","conference":{"location":"Dublin, Ireland","end_date":"2018-09-14","start_date":"2018-09-10","name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases"},"author":[{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","id":"33176","full_name":"Wever, Marcel Dominik"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"}],"oa":"1","date_updated":"2022-01-06T06:59:21Z"},{"type":"conference","status":"public","_id":"3550","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"department":[{"_id":"66"},{"_id":"276"}],"user_id":"16205","series_title":"Lecture Notes in Business Information Processing (LNBIP)","file_date_updated":"2018-11-12T19:01:06Z","publication_identifier":{"isbn":["9783319942131","9783319942148"],"issn":["1865-1348","1865-1356"]},"has_accepted_license":"1","publication_status":"published","place":"Wien, Austria","page":"390-400","intvolume":"       319","citation":{"chicago":"Jazayeri, Bahar, Olaf Zimmermann, Gregor Engels, Jochen Küster, Dennis Kundisch, and Daniel Szopinski. “Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions.” In <i>Proceeding of International Symposium on Business Modeling and Software Design</i>, 319:390–400. Lecture Notes in Business Information Processing (LNBIP). Wien, Austria: Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-94214-8_30\">https://doi.org/10.1007/978-3-319-94214-8_30</a>.","ieee":"B. Jazayeri, O. Zimmermann, G. Engels, J. Küster, D. Kundisch, and D. Szopinski, “Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions,” in <i>Proceeding of International Symposium on Business Modeling and Software Design</i>, 2018, vol. 319, pp. 390–400.","ama":"Jazayeri B, Zimmermann O, Engels G, Küster J, Kundisch D, Szopinski D. Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions. In: <i>Proceeding of International Symposium on Business Modeling and Software Design</i>. Vol 319. Lecture Notes in Business Information Processing (LNBIP). Wien, Austria: Springer; 2018:390-400. doi:<a href=\"https://doi.org/10.1007/978-3-319-94214-8_30\">10.1007/978-3-319-94214-8_30</a>","apa":"Jazayeri, B., Zimmermann, O., Engels, G., Küster, J., Kundisch, D., &#38; Szopinski, D. (2018). Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions. In <i>Proceeding of International Symposium on Business Modeling and Software Design</i> (Vol. 319, pp. 390–400). Wien, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-94214-8_30\">https://doi.org/10.1007/978-3-319-94214-8_30</a>","bibtex":"@inproceedings{Jazayeri_Zimmermann_Engels_Küster_Kundisch_Szopinski_2018, place={Wien, Austria}, series={Lecture Notes in Business Information Processing (LNBIP)}, title={Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions}, volume={319}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-94214-8_30\">10.1007/978-3-319-94214-8_30</a>}, booktitle={Proceeding of International Symposium on Business Modeling and Software Design}, publisher={Springer}, author={Jazayeri, Bahar and Zimmermann, Olaf and Engels, Gregor and Küster, Jochen and Kundisch, Dennis and Szopinski, Daniel}, year={2018}, pages={390–400}, collection={Lecture Notes in Business Information Processing (LNBIP)} }","mla":"Jazayeri, Bahar, et al. “Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions.” <i>Proceeding of International Symposium on Business Modeling and Software Design</i>, vol. 319, Springer, 2018, pp. 390–400, doi:<a href=\"https://doi.org/10.1007/978-3-319-94214-8_30\">10.1007/978-3-319-94214-8_30</a>.","short":"B. Jazayeri, O. Zimmermann, G. Engels, J. Küster, D. Kundisch, D. Szopinski, in: Proceeding of International Symposium on Business Modeling and Software Design, Springer, Wien, Austria, 2018, pp. 390–400."},"date_updated":"2022-01-06T06:59:24Z","volume":319,"author":[{"first_name":"Bahar","full_name":"Jazayeri, Bahar","id":"36399","last_name":"Jazayeri"},{"full_name":"Zimmermann, Olaf","last_name":"Zimmermann","first_name":"Olaf"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"},{"last_name":"Küster","full_name":"Küster, Jochen","first_name":"Jochen"},{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"},{"full_name":"Szopinski, Daniel","id":"36372","last_name":"Szopinski","first_name":"Daniel"}],"doi":"10.1007/978-3-319-94214-8_30","publication":"Proceeding of International Symposium on Business Modeling and Software Design","abstract":[{"lang":"eng","text":"Nowadays companies like Apple create ecosystems of third- party providers and users around their software platforms. Often online stores like Apple App Store are created to directly market third-party solutions. We call such ecosystems store-oriented software ecosystems. While the architecture of these ecosystems is mainly derived from busi- ness decisions of their owners, ecosystems with greatly different archi- tectural designs have been created. This diversity makes it challenging for future ecosystem providers to understand which architectural design is suitable to fulfill certain business decisions. In turn, opening a plat- form becomes risky while endangering intellectual property or scarifying quality of services. In this paper, we identify three main design options of store-oriented software ecosystems by classifying existing ecosystems based on similarities in their business decisions. We elaborate on the design options, discuss their main contributions, and provide exemplary ecosystems. Our work provides aspiring ecosystem providers with the reusable knowledge of existing ecosystems and helps them to take more informed architectural decisions and reduce risks in future."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-12T19:01:06Z","creator":"bahareh","date_updated":"2018-11-12T19:01:06Z","file_id":"5533","file_name":"Jazayeri_BMSD2018.pdf","access_level":"closed","file_size":408509}],"ddc":["040"],"language":[{"iso":"eng"}],"year":"2018","publisher":"Springer","date_created":"2018-07-12T10:59:16Z","title":"Design Options of Store-Oriented Software Ecosystems: An Investigation of Business Decisions"}]