[{"author":[{"last_name":"Schlesiger","first_name":"Laura","full_name":"Schlesiger, Laura"}],"status":"public","title":"Determinants of Loyalty in Online Communities: A Systematic  Literature Review","year":"2021","date_updated":"2022-07-14T13:08:05Z","language":[{"iso":"eng"}],"_id":"21203","user_id":"16205","supervisor":[{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"}],"citation":{"bibtex":"@book{Schlesiger_2021, place={Universität Paderborn}, title={Determinants of Loyalty in Online Communities: A Systematic  Literature Review}, author={Schlesiger, Laura}, year={2021} }","chicago":"Schlesiger, Laura. <i>Determinants of Loyalty in Online Communities: A Systematic  Literature Review</i>. Universität Paderborn, 2021.","short":"L. Schlesiger, Determinants of Loyalty in Online Communities: A Systematic  Literature Review, Universität Paderborn, 2021.","ama":"Schlesiger L. <i>Determinants of Loyalty in Online Communities: A Systematic  Literature Review</i>.; 2021.","ieee":"L. Schlesiger, <i>Determinants of Loyalty in Online Communities: A Systematic  Literature Review</i>. Universität Paderborn, 2021.","apa":"Schlesiger, L. (2021). <i>Determinants of Loyalty in Online Communities: A Systematic  Literature Review</i>.","mla":"Schlesiger, Laura. <i>Determinants of Loyalty in Online Communities: A Systematic  Literature Review</i>. 2021."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"place":"Universität Paderborn","date_created":"2021-02-10T09:27:56Z","type":"bachelorsthesis"},{"user_id":"16205","language":[{"iso":"ger"}],"_id":"23381","date_updated":"2022-07-14T13:12:02Z","year":"2021","title":"Konkurrent oder Komplementär? Eine empirische Analyse über das  Nutzerverhalten in Online-Communities in Folge einer Smart Product  Innovation","status":"public","author":[{"full_name":"Dierkes, Johannes","first_name":"Johannes","last_name":"Dierkes"}],"type":"mastersthesis","place":"Universität Paderborn","date_created":"2021-08-10T11:13:09Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"supervisor":[{"id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis","last_name":"Kundisch"}],"citation":{"chicago":"Dierkes, Johannes. <i>Konkurrent oder Komplementär? Eine empirische Analyse über das  Nutzerverhalten in Online-Communities in Folge einer Smart Product  Innovation</i>. Universität Paderborn, 2021.","short":"J. Dierkes, Konkurrent oder Komplementär? Eine empirische Analyse über das  Nutzerverhalten in Online-Communities in Folge einer Smart Product  Innovation, Universität Paderborn, 2021.","ieee":"J. Dierkes, <i>Konkurrent oder Komplementär? Eine empirische Analyse über das  Nutzerverhalten in Online-Communities in Folge einer Smart Product  Innovation</i>. Universität Paderborn, 2021.","apa":"Dierkes, J. (2021). <i>Konkurrent oder Komplementär? Eine empirische Analyse über das  Nutzerverhalten in Online-Communities in Folge einer Smart Product  Innovation</i>.","bibtex":"@book{Dierkes_2021, place={Universität Paderborn}, title={Konkurrent oder Komplementär? Eine empirische Analyse über das  Nutzerverhalten in Online-Communities in Folge einer Smart Product  Innovation}, author={Dierkes, Johannes}, year={2021} }","ama":"Dierkes J. <i>Konkurrent oder Komplementär? Eine empirische Analyse über das  Nutzerverhalten in Online-Communities in Folge einer Smart Product  Innovation</i>.; 2021.","mla":"Dierkes, Johannes. <i>Konkurrent oder Komplementär? Eine empirische Analyse über das  Nutzerverhalten in Online-Communities in Folge einer Smart Product  Innovation</i>. 2021."}},{"user_id":"16205","_id":"21266","language":[{"iso":"eng"}],"date_updated":"2022-07-14T13:12:23Z","author":[{"first_name":"Noah","last_name":"Krüger","full_name":"Krüger, Noah"}],"title":"Raising Money for a Good Cause – An Econometric Analysis of Key Factors to Successful Personal and Charitable Crowdfunding Campaigns","status":"public","year":"2021","type":"mastersthesis","place":"Universität Paderborn","date_created":"2021-02-23T16:10:23Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"supervisor":[{"id":"21117","last_name":"Kundisch","first_name":"Dennis","full_name":"Kundisch, Dennis"}],"citation":{"ieee":"N. Krüger, <i>Raising Money for a Good Cause – An Econometric Analysis of Key Factors to Successful Personal and Charitable Crowdfunding Campaigns</i>. Universität Paderborn, 2021.","apa":"Krüger, N. (2021). <i>Raising Money for a Good Cause – An Econometric Analysis of Key Factors to Successful Personal and Charitable Crowdfunding Campaigns</i>.","mla":"Krüger, Noah. <i>Raising Money for a Good Cause – An Econometric Analysis of Key Factors to Successful Personal and Charitable Crowdfunding Campaigns</i>. 2021.","bibtex":"@book{Krüger_2021, place={Universität Paderborn}, title={Raising Money for a Good Cause – An Econometric Analysis of Key Factors to Successful Personal and Charitable Crowdfunding Campaigns}, author={Krüger, Noah}, year={2021} }","chicago":"Krüger, Noah. <i>Raising Money for a Good Cause – An Econometric Analysis of Key Factors to Successful Personal and Charitable Crowdfunding Campaigns</i>. Universität Paderborn, 2021.","short":"N. Krüger, Raising Money for a Good Cause – An Econometric Analysis of Key Factors to Successful Personal and Charitable Crowdfunding Campaigns, Universität Paderborn, 2021.","ama":"Krüger N. <i>Raising Money for a Good Cause – An Econometric Analysis of Key Factors to Successful Personal and Charitable Crowdfunding Campaigns</i>.; 2021."}},{"place":"Universität Paderborn","date_created":"2021-02-08T15:57:24Z","type":"mastersthesis","supervisor":[{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"citation":{"bibtex":"@book{Schröder_2021, place={Universität Paderborn}, title={Benchmarking digitaler Gebrauchtgütermärkte - Eine Analyse zur Entwicklung von Best Practices am Beispiel von Miele Professional}, author={Schröder, Felix}, year={2021} }","short":"F. Schröder, Benchmarking digitaler Gebrauchtgütermärkte - Eine Analyse zur Entwicklung von Best Practices am Beispiel von Miele Professional, Universität Paderborn, 2021.","ama":"Schröder F. <i>Benchmarking digitaler Gebrauchtgütermärkte - Eine Analyse zur Entwicklung von Best Practices am Beispiel von Miele Professional</i>.; 2021.","chicago":"Schröder, Felix. <i>Benchmarking digitaler Gebrauchtgütermärkte - Eine Analyse zur Entwicklung von Best Practices am Beispiel von Miele Professional</i>. Universität Paderborn, 2021.","ieee":"F. Schröder, <i>Benchmarking digitaler Gebrauchtgütermärkte - Eine Analyse zur Entwicklung von Best Practices am Beispiel von Miele Professional</i>. Universität Paderborn, 2021.","apa":"Schröder, F. (2021). <i>Benchmarking digitaler Gebrauchtgütermärkte - Eine Analyse zur Entwicklung von Best Practices am Beispiel von Miele Professional</i>.","mla":"Schröder, Felix. <i>Benchmarking digitaler Gebrauchtgütermärkte - Eine Analyse zur Entwicklung von Best Practices am Beispiel von Miele Professional</i>. 2021."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"21196","language":[{"iso":"ger"}],"user_id":"16205","author":[{"full_name":"Schröder, Felix","last_name":"Schröder","first_name":"Felix"}],"year":"2021","title":"Benchmarking digitaler Gebrauchtgütermärkte - Eine Analyse zur Entwicklung von Best Practices am Beispiel von Miele Professional","status":"public","date_updated":"2022-07-14T13:12:31Z"},{"place":"Universität Paderborn","date_created":"2021-05-28T09:20:54Z","type":"mastersthesis","supervisor":[{"id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis","last_name":"Kundisch"}],"citation":{"short":"T. Werner, „For Developers, by Developers”? – Analyzing the Impact of Programming Languages’ Major Releases on Online Q&#38;A Behavior, Universität Paderborn, 2021.","ama":"Werner T. <i>„For Developers, by Developers”? – Analyzing the Impact of Programming Languages’ Major Releases on Online Q&#38;A Behavior</i>.; 2021.","chicago":"Werner, Timur. <i>„For Developers, by Developers”? – Analyzing the Impact of Programming Languages’ Major Releases on Online Q&#38;A Behavior</i>. Universität Paderborn, 2021.","bibtex":"@book{Werner_2021, place={Universität Paderborn}, title={„For developers, by developers”? – Analyzing the Impact of Programming Languages’ Major Releases on Online Q&#38;A Behavior}, author={Werner, Timur}, year={2021} }","mla":"Werner, Timur. <i>„For Developers, by Developers”? – Analyzing the Impact of Programming Languages’ Major Releases on Online Q&#38;A Behavior</i>. 2021.","apa":"Werner, T. (2021). <i>„For developers, by developers”? – Analyzing the Impact of Programming Languages’ Major Releases on Online Q&#38;A Behavior</i>.","ieee":"T. Werner, <i>„For developers, by developers”? – Analyzing the Impact of Programming Languages’ Major Releases on Online Q&#38;A Behavior</i>. Universität Paderborn, 2021."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"language":[{"iso":"eng"}],"_id":"22262","user_id":"16205","status":"public","year":"2021","title":"„For developers, by developers”? – Analyzing the Impact of Programming Languages’ Major Releases on Online Q&A Behavior","author":[{"full_name":"Werner, Timur","last_name":"Werner","first_name":"Timur"}],"date_updated":"2022-07-14T13:12:10Z"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"citation":{"chicago":"Wittmann, Daniel. <i>Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen</i>. Universität Paderborn, 2021.","short":"D. Wittmann, Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen, Universität Paderborn, 2021.","ama":"Wittmann D. <i>Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen</i>.; 2021.","bibtex":"@book{Wittmann_2021, place={Universität Paderborn}, title={Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen}, author={Wittmann, Daniel}, year={2021} }","mla":"Wittmann, Daniel. <i>Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen</i>. 2021.","apa":"Wittmann, D. (2021). <i>Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen</i>.","ieee":"D. Wittmann, <i>Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen</i>. Universität Paderborn, 2021."},"supervisor":[{"id":"21117","first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis"}],"type":"mastersthesis","date_created":"2021-04-22T08:49:36Z","place":"Universität Paderborn","date_updated":"2022-07-14T13:12:17Z","title":"Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen","year":"2021","status":"public","author":[{"first_name":"Daniel","last_name":"Wittmann","full_name":"Wittmann, Daniel"}],"user_id":"16205","language":[{"iso":"ger"}],"_id":"21714"},{"abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>In this article we combine Debreu’s (Proc Natl Acad Sci 38(10):886–893, 1952) social system with Hurwicz’s (Econ Design 1(1):1–14, 1994; Am Econ Rev 98(3):577–585, 2008) ideas of embedding a “desired” game form into a “natural” game form that includes all feasible behavior, even if it is “illegal” according to the desired form. For the resulting socio-legal system we extend Debreu’s concepts of a social system and its social equilibria to a socio-legal system with its Debreu–Hurwicz equilibria. We build on a more general version of social equilibrium due to Shafer and Sonnenschein (J Math Econ 2(3):345–348, 1975) that also generalizes the dc-mechanism of Koray and Yildiz (J Econ Theory 176:479–502, 2018) which relates implementation via mechanisms with implementation via rights structures as introduced by Sertel (Designing rights: invisible hand theorems, covering and membership. Tech. rep. Mimeo, Bogazici University, 2001). In the second part we apply and illustrate these new concepts via an application in the narrow welfarist framework of two person cooperative bargaining. There we provide in a socio-legal system based on Nash’s demand game an implementation of the Nash bargaining solution in Debreu–Hurwicz equilibrium.</jats:p>","lang":"eng"}],"project":[{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"}],"publication":"Review of Economic Design","citation":{"bibtex":"@article{Haake_Trockel_2021, title={Socio-legal systems and implementation of the Nash solution in Debreu–Hurwicz equilibrium}, DOI={<a href=\"https://doi.org/10.1007/s10058-021-00278-z\">10.1007/s10058-021-00278-z</a>}, journal={Review of Economic Design}, publisher={Springer}, author={Haake, Claus-Jochen and Trockel, Walter}, year={2021} }","ama":"Haake C-J, Trockel W. Socio-legal systems and implementation of the Nash solution in Debreu–Hurwicz equilibrium. <i>Review of Economic Design</i>. Published online 2021. doi:<a href=\"https://doi.org/10.1007/s10058-021-00278-z\">10.1007/s10058-021-00278-z</a>","mla":"Haake, Claus-Jochen, and Walter Trockel. “Socio-Legal Systems and Implementation of the Nash Solution in Debreu–Hurwicz Equilibrium.” <i>Review of Economic Design</i>, Springer, 2021, doi:<a href=\"https://doi.org/10.1007/s10058-021-00278-z\">10.1007/s10058-021-00278-z</a>.","chicago":"Haake, Claus-Jochen, and Walter Trockel. “Socio-Legal Systems and Implementation of the Nash Solution in Debreu–Hurwicz Equilibrium.” <i>Review of Economic Design</i>, 2021. <a href=\"https://doi.org/10.1007/s10058-021-00278-z\">https://doi.org/10.1007/s10058-021-00278-z</a>.","short":"C.-J. Haake, W. Trockel, Review of Economic Design (2021).","ieee":"C.-J. Haake and W. Trockel, “Socio-legal systems and implementation of the Nash solution in Debreu–Hurwicz equilibrium,” <i>Review of Economic Design</i>, 2021, doi: <a href=\"https://doi.org/10.1007/s10058-021-00278-z\">10.1007/s10058-021-00278-z</a>.","apa":"Haake, C.-J., &#38; Trockel, W. (2021). Socio-legal systems and implementation of the Nash solution in Debreu–Hurwicz equilibrium. <i>Review of Economic Design</i>. <a href=\"https://doi.org/10.1007/s10058-021-00278-z\">https://doi.org/10.1007/s10058-021-00278-z</a>"},"type":"journal_article","department":[{"_id":"205"},{"_id":"475"}],"date_created":"2022-01-04T19:54:03Z","date_updated":"2022-11-17T14:24:26Z","publication_status":"epub_ahead","year":"2021","status":"public","title":"Socio-legal systems and implementation of the Nash solution in Debreu–Hurwicz equilibrium","author":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen","id":"20801"},{"full_name":"Trockel, Walter","first_name":"Walter","last_name":"Trockel"}],"publication_identifier":{"issn":["1434-4742","1434-4750"]},"doi":"10.1007/s10058-021-00278-z","user_id":"477","_id":"29152","funded_apc":"1","publisher":"Springer","language":[{"iso":"eng"}]},{"author":[{"full_name":"Pauck, Felix","first_name":"Felix","last_name":"Pauck","id":"22398"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"title":"Jicer: Simplifying Cooperative Android App Analysis Tasks","year":"2021","status":"public","date_updated":"2022-11-17T14:26:19Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"28199","doi":"10.1109/scam52516.2021.00031","user_id":"477","citation":{"mla":"Pauck, Felix, and Heike Wehrheim. “Jicer: Simplifying Cooperative Android App Analysis Tasks.” <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>, 2021, doi:<a href=\"https://doi.org/10.1109/scam52516.2021.00031\">10.1109/scam52516.2021.00031</a>.","ama":"Pauck F, Wehrheim H. Jicer: Simplifying Cooperative Android App Analysis Tasks. In: <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1109/scam52516.2021.00031\">10.1109/scam52516.2021.00031</a>","bibtex":"@inproceedings{Pauck_Wehrheim_2021, title={Jicer: Simplifying Cooperative Android App Analysis Tasks}, DOI={<a href=\"https://doi.org/10.1109/scam52516.2021.00031\">10.1109/scam52516.2021.00031</a>}, booktitle={2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)}, author={Pauck, Felix and Wehrheim, Heike}, year={2021} }","apa":"Pauck, F., &#38; Wehrheim, H. (2021). Jicer: Simplifying Cooperative Android App Analysis Tasks. <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>. <a href=\"https://doi.org/10.1109/scam52516.2021.00031\">https://doi.org/10.1109/scam52516.2021.00031</a>","ieee":"F. Pauck and H. Wehrheim, “Jicer: Simplifying Cooperative Android App Analysis Tasks,” 2021, doi: <a href=\"https://doi.org/10.1109/scam52516.2021.00031\">10.1109/scam52516.2021.00031</a>.","short":"F. Pauck, H. Wehrheim, in: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021.","chicago":"Pauck, Felix, and Heike Wehrheim. “Jicer: Simplifying Cooperative Android App Analysis Tasks.” In <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>, 2021. <a href=\"https://doi.org/10.1109/scam52516.2021.00031\">https://doi.org/10.1109/scam52516.2021.00031</a>."},"publication":"2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"date_created":"2021-12-01T08:53:29Z","department":[{"_id":"77"}],"type":"conference"},{"status":"public","year":"2021","title":"Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes","author":[{"full_name":"Bobolz, Jan","first_name":"Jan","last_name":"Bobolz","id":"27207"},{"full_name":"Eidens, Fabian","last_name":"Eidens","first_name":"Fabian","id":"25078"},{"full_name":"Heitjohann, Raphael","first_name":"Raphael","last_name":"Heitjohann"},{"first_name":"Jeremy","last_name":"Fell","full_name":"Fell, Jeremy"}],"date_updated":"2022-11-18T09:38:42Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/961"}],"_id":"26645","language":[{"iso":"eng"}],"publisher":"IACR eprint","user_id":"477","citation":{"mla":"Bobolz, Jan, et al. <i>Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes</i>. IACR eprint, 2021.","bibtex":"@article{Bobolz_Eidens_Heitjohann_Fell_2021, title={Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes}, publisher={IACR eprint}, author={Bobolz, Jan and Eidens, Fabian and Heitjohann, Raphael and Fell, Jeremy}, year={2021} }","ama":"Bobolz J, Eidens F, Heitjohann R, Fell J. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. Published online 2021.","ieee":"J. Bobolz, F. Eidens, R. Heitjohann, and J. Fell, “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.","apa":"Bobolz, J., Eidens, F., Heitjohann, R., &#38; Fell, J. (2021). <i>Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes</i>. IACR eprint.","short":"J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (2021).","chicago":"Bobolz, Jan, Fabian Eidens, Raphael Heitjohann, and Jeremy Fell. “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021."},"project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"82","name":"SFB 901 - Project Area T"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"date_created":"2021-10-21T07:51:32Z","type":"preprint","oa":"1","department":[{"_id":"64"}]},{"file_date_updated":"2022-10-20T16:41:10Z","citation":{"mla":"Schneider, Stefan Balthasar, et al. <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>. 2021.","ama":"Schneider SB, Karl H, Khalili R, Hecker A. <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>.; 2021.","bibtex":"@book{Schneider_Karl_Khalili_Hecker_2021, title={DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning}, author={Schneider, Stefan Balthasar and Karl, Holger and Khalili, Ramin and Hecker, Artur}, year={2021} }","apa":"Schneider, S. B., Karl, H., Khalili, R., &#38; Hecker, A. (2021). <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>.","ieee":"S. B. Schneider, H. Karl, R. Khalili, and A. Hecker, <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>. 2021.","short":"S.B. Schneider, H. Karl, R. Khalili, A. Hecker, DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning, 2021.","chicago":"Schneider, Stefan Balthasar, Holger Karl, Ramin Khalili, and Artur Hecker. <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>, 2021."},"abstract":[{"lang":"eng","text":"Macrodiversity is a key technique to increase the capacity of mobile networks. It can be realized using coordinated multipoint (CoMP), simultaneously connecting users to multiple overlapping cells. Selecting which users to serve by how many and which cells is NP-hard but needs to happen continuously in real time as users move and channel state changes. Existing approaches often require strict assumptions about or perfect knowledge of the underlying radio system, its resource allocation scheme, or user movements, none of which is readily available in practice.\r\n\r\nInstead, we propose three novel self-learning and self-adapting approaches using model-free deep reinforcement learning (DRL): DeepCoMP, DD-CoMP, and D3-CoMP. DeepCoMP leverages central observations and control of all users to select cells almost optimally. DD-CoMP and D3-CoMP use multi-agent DRL, which allows distributed, robust, and highly scalable coordination. All three approaches learn from experience and self-adapt to varying scenarios, reaching 2x higher Quality of Experience than other approaches. They have very few built-in assumptions and do not need prior system knowledge, making them more robust to change and better applicable in practice than existing approaches."}],"project":[{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901: SFB 901","_id":"1"}],"file":[{"date_created":"2022-10-20T16:41:10Z","creator":"stschn","content_type":"application/pdf","file_id":"33855","file_size":2521656,"access_level":"open_access","file_name":"preprint.pdf","date_updated":"2022-10-20T16:41:10Z","relation":"main_file"}],"date_created":"2022-10-20T16:44:19Z","type":"working_paper","keyword":["mobility management","coordinated multipoint","CoMP","cell selection","resource management","reinforcement learning","multi agent","MARL","self-learning","self-adaptation","QoE"],"department":[{"_id":"75"}],"oa":"1","year":"2021","status":"public","title":"DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning","author":[{"orcid":"0000-0001-8210-4011","last_name":"Schneider","first_name":"Stefan Balthasar","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger","id":"126"},{"full_name":"Khalili, Ramin","first_name":"Ramin","last_name":"Khalili"},{"last_name":"Hecker","first_name":"Artur","full_name":"Hecker, Artur"}],"date_updated":"2022-11-18T09:59:27Z","has_accepted_license":"1","_id":"33854","language":[{"iso":"eng"}],"user_id":"477","ddc":["004"]},{"place":"New York, NY, United States","date_created":"2021-12-27T12:01:02Z","department":[{"_id":"78"}],"type":"conference","citation":{"mla":"Hansmeier, Tim. “Self-Aware Operation of Heterogeneous Compute Nodes Using the Learning Classifier System XCS.” <i>HEART ’21: Proceedings of the 11th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>, Association for Computing Machinery (ACM), 2021, doi:<a href=\"https://doi.org/10.1145/3468044.3468055\">10.1145/3468044.3468055</a>.","ama":"Hansmeier T. Self-aware Operation of Heterogeneous Compute Nodes using the Learning Classifier System XCS. In: <i>HEART ’21: Proceedings of the 11th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>. Association for Computing Machinery (ACM); 2021. doi:<a href=\"https://doi.org/10.1145/3468044.3468055\">10.1145/3468044.3468055</a>","bibtex":"@inproceedings{Hansmeier_2021, place={New York, NY, United States}, title={Self-aware Operation of Heterogeneous Compute Nodes using the Learning Classifier System XCS}, DOI={<a href=\"https://doi.org/10.1145/3468044.3468055\">10.1145/3468044.3468055</a>}, booktitle={HEART ’21: Proceedings of the 11th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies}, publisher={Association for Computing Machinery (ACM)}, author={Hansmeier, Tim}, year={2021} }","apa":"Hansmeier, T. (2021). Self-aware Operation of Heterogeneous Compute Nodes using the Learning Classifier System XCS. <i>HEART ’21: Proceedings of the 11th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>. International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART ’21), Online. <a href=\"https://doi.org/10.1145/3468044.3468055\">https://doi.org/10.1145/3468044.3468055</a>","ieee":"T. Hansmeier, “Self-aware Operation of Heterogeneous Compute Nodes using the Learning Classifier System XCS,” presented at the International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART ’21), Online, 2021, doi: <a href=\"https://doi.org/10.1145/3468044.3468055\">10.1145/3468044.3468055</a>.","chicago":"Hansmeier, Tim. “Self-Aware Operation of Heterogeneous Compute Nodes Using the Learning Classifier System XCS.” In <i>HEART ’21: Proceedings of the 11th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies</i>. New York, NY, United States: Association for Computing Machinery (ACM), 2021. <a href=\"https://doi.org/10.1145/3468044.3468055\">https://doi.org/10.1145/3468044.3468055</a>.","short":"T. Hansmeier, in: HEART ’21: Proceedings of the 11th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies, Association for Computing Machinery (ACM), New York, NY, United States, 2021."},"publication":"HEART '21: Proceedings of the 11th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies","project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C2: SFB 901 - Subproject C2","_id":"14"}],"publisher":"Association for Computing Machinery (ACM)","_id":"29137","language":[{"iso":"eng"}],"doi":"10.1145/3468044.3468055","user_id":"477","conference":{"end_date":"2021-06-23","location":"Online","start_date":"2021-06-21","name":"International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART ’21)"},"author":[{"id":"49992","full_name":"Hansmeier, Tim","last_name":"Hansmeier","first_name":"Tim","orcid":"0000-0003-1377-3339"}],"status":"public","year":"2021","title":"Self-aware Operation of Heterogeneous Compute Nodes using the Learning Classifier System XCS","date_updated":"2022-11-18T10:03:24Z","publication_status":"published"},{"project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"1","name":"SFB 901: SFB 901"}],"citation":{"apa":"Götte, T., Kolb, C., Scheideler, C., &#38; Werthmann, J. (2021). Beep-And-Sleep: Message and Energy Efficient Set Cover. In <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>. ALGOSENSORS 2021, Lisbon, Portgual. <a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">https://doi.org/10.1007/978-3-030-89240-1_7</a>","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message and Energy Efficient Set Cover,” in <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>, Cham, 2021.","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” In <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">https://doi.org/10.1007/978-3-030-89240-1_7</a>.","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.","mla":"Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">10.1007/978-3-030-89240-1_7</a>.","ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-And-Sleep: Message and Energy Efficient Set Cover. In: <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">10.1007/978-3-030-89240-1_7</a>","bibtex":"@inbook{Götte_Kolb_Scheideler_Werthmann_2021, place={Cham}, title={Beep-And-Sleep: Message and Energy Efficient Set Cover}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">10.1007/978-3-030-89240-1_7</a>}, booktitle={Algorithms for Sensor Systems (ALGOSENSORS ’21)}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2021} }"},"publication":"Algorithms for Sensor Systems (ALGOSENSORS '21)","type":"book_chapter","place":"Cham","date_created":"2021-10-26T12:06:04Z","date_updated":"2022-11-18T10:01:36Z","publication_status":"published","conference":{"location":"Lisbon, Portgual","name":"ALGOSENSORS 2021"},"publication_identifier":{"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Götte, Thorsten","first_name":"Thorsten","last_name":"Götte","id":"34727"},{"first_name":"Christina","last_name":"Kolb","full_name":"Kolb, Christina","id":"43647"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Werthmann, Julian","first_name":"Julian","last_name":"Werthmann","id":"50024"}],"title":"Beep-And-Sleep: Message and Energy Efficient Set Cover","status":"public","year":"2021","doi":"10.1007/978-3-030-89240-1_7","user_id":"477","language":[{"iso":"eng"}],"_id":"26888"},{"doi":"10.17619/UNIPB/1-1270 ","language":[{"iso":"eng"}],"date_updated":"2022-12-30T22:15:37Z","author":[{"id":"36399","first_name":"Bahar","last_name":"Schwichtenberg","full_name":"Schwichtenberg, Bahar"}],"title":"Modeling and Analyzing Software Ecosystems","year":"2021","department":[{"_id":"66"}],"keyword":["Enterprise Architecture","Architectural Design Decisions","Open Platforms"],"type":"dissertation","date_created":"2021-12-13T07:20:33Z","file":[{"file_id":"35069","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2022-12-30T22:15:15Z","file_name":"Bahar_Schwichtenberg_Thesis.pdf","access_level":"closed","file_size":9125342,"date_created":"2022-12-30T22:15:15Z","creator":"bahareh"}],"abstract":[{"lang":"ger","text":"In den letzten Jahren haben sich Software-Ökosysteme als neue, erfolgreiche Geschäftsform etabliert. Unternehmen agieren hierbei als Anbieter von Software-Plattformen, auf denen Drittanbieter Softwarelösungen für den Markt anbieten können.  Etablierte Beispiele sind hierbei sogenannte App-Stores, die z.B. von Google oder Apple angeboten werden.\r\n\r\nBeim Aufbau von Software-Ökosystemen müssen vom Plattformanbieter viele architektonische Entwurfsentscheidungen getroffen werden. Bisher gibt es keine Architekturrichtlinien und -werkzeuge, die den Entwurf einer Ökosystemarchitektur unterstützen. Dadurch fehlt hier systematisches, wiederverwendbares Wissen. Plattformanbieter müssen auf ad-hoc Entscheidungen zurückgreifen. Dies kann dann zu Problemen im Betrieb der Software-Plattformen führen, zu erhöhten Ausfallrisiken und Mehrkosten.\r\n\r\nDer Mangel an Architekturwissen manifestiert sich konkret in zwei Gruppen von Herausforderungen: Erstens fehlt eine Wissensbasis zu Architekturalternativen und zweitens fehlt es an methodischem Wissen zu Entwicklung und Betrieb von Software-Ökosystemen. Eine Architekturwissensbasis würde Orientierungshilfen zu den Bestandteilen von Software-Ökosystemen und deren Abhängigkeiten geben, während methodisches Wissen die Erstellung dieser Systeme erleichtern würde.\r\n\r\nIn der Dissertation werden diese Herausforderungen durch die Entwicklung des Frameworks SecoArc für die Modellierung von Software-Ökosystemen angegangen. Der Beitrag der Dissertation ist zweifach: \r\n1.\tDas SecoArc-Framework umfasst eine Architekturwissensbasis, die wiederverwendbare Architekturentwurfsentscheidungen\r\nvon Software-Ökosystemen enthält. Die Wissensbasis wurde entwickelt, indem das Architekturwissen bestehender Ökosysteme sowie aus existierender Fachliteratur ermittelt wurde und in einer Produktlinie für Software-Ökosysteme konsolidiert wurde. Die Produktlinie umfasst architektonische Gemeinsamkeiten und Variabilitäten von Software-Ökosystemen. \r\n2.\tDas SecoArc-Framework liefert methodisches Wissen, um die Ökosystemarchitektur in Modellen zu entwerfen und zu analysieren. Dieses Wissen wurde entwickelt, indem drei Architekturmuster identifiziert wurden. Jedes Muster erfasst unterschiedliche Beziehungen zwischen architektonischen Entwurfsentscheidungen zu den Qualitätsmerkmalen einer Ökosystemgesundheit und der Erreichung von Geschäftszielen. \r\n\r\nDie Architekturmuster und die Produktlinie wurden dazu genutzt, ein Modellierungsframework zu entwickeln und in Form eines Prototypen umzusetzen, welches einen Entwurfsprozess, eine Modellierungssprache und eine Architekturanalysetechnik umfasst. Es erleichtert das Modellieren, Analysieren und Vergleichen von Ökosystemarchitekturen.\r\n\r\nDie Ergebnisse der Dissertation wurden im Rahmen von zwei Studien evaluiert. In der ersten Validierungsstudie wurden das Framework sowie der Prototyp verwendet, um zwei alternative Ökosystemarchitekturen zu entwerfen und zu analysieren. In der zweiten Studie wurde eine Analyse von existierenden Ökosystemen basierend auf den architektonischen Variabilitäten des Frameworks durchgeführt."}],"ddc":["000"],"user_id":"36399","_id":"28683","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"},{"name":"SFB 901: SFB 901","_id":"1"}],"supervisor":[{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"citation":{"mla":"Schwichtenberg, Bahar. <i>Modeling and Analyzing Software Ecosystems</i>. 2021, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1270 \">10.17619/UNIPB/1-1270 </a>.","bibtex":"@book{Schwichtenberg_2021, title={Modeling and Analyzing Software Ecosystems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1270 \">10.17619/UNIPB/1-1270 </a>}, author={Schwichtenberg, Bahar}, year={2021} }","ama":"Schwichtenberg B. <i>Modeling and Analyzing Software Ecosystems</i>.; 2021. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1270 \">10.17619/UNIPB/1-1270 </a>","ieee":"B. Schwichtenberg, <i>Modeling and Analyzing Software Ecosystems</i>. 2021.","apa":"Schwichtenberg, B. (2021). <i>Modeling and Analyzing Software Ecosystems</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1270 \">https://doi.org/10.17619/UNIPB/1-1270 </a>","short":"B. Schwichtenberg, Modeling and Analyzing Software Ecosystems, 2021.","chicago":"Schwichtenberg, Bahar. <i>Modeling and Analyzing Software Ecosystems</i>, 2021. <a href=\"https://doi.org/10.17619/UNIPB/1-1270 \">https://doi.org/10.17619/UNIPB/1-1270 </a>."},"file_date_updated":"2022-12-30T22:15:15Z"},{"citation":{"ama":"Bobolz J, Eidens F, Krenn S, Ramacher S, Samelin K. Issuer-Hiding Attribute-Based Credentials. In: <i>Cryptology and Network Security</i>. Springer International Publishing; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>","bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Ramacher_Samelin_2021, place={Cham}, title={Issuer-Hiding Attribute-Based Credentials}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>}, booktitle={Cryptology and Network Security}, publisher={Springer International Publishing}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Ramacher, Sebastian and Samelin, Kai}, year={2021} }","mla":"Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.” <i>Cryptology and Network Security</i>, Springer International Publishing, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>.","short":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology and Network Security, Springer International Publishing, Cham, 2021.","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, and Kai Samelin. “Issuer-Hiding Attribute-Based Credentials.” In <i>Cryptology and Network Security</i>. Cham: Springer International Publishing, 2021. <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">https://doi.org/10.1007/978-3-030-92548-2_9</a>.","apa":"Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., &#38; Samelin, K. (2021). Issuer-Hiding Attribute-Based Credentials. <i>Cryptology and Network Security</i>. <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">https://doi.org/10.1007/978-3-030-92548-2_9</a>","ieee":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, “Issuer-Hiding Attribute-Based Credentials,” 2021, doi: <a href=\"https://doi.org/10.1007/978-3-030-92548-2_9\">10.1007/978-3-030-92548-2_9</a>."},"publication":"Cryptology and Network Security","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"place":"Cham","date_created":"2022-01-27T13:00:21Z","department":[{"_id":"7"},{"_id":"64"}],"type":"conference","author":[{"id":"27207","last_name":"Bobolz","first_name":"Jan","full_name":"Bobolz, Jan"},{"first_name":"Fabian","last_name":"Eidens","full_name":"Eidens, Fabian","id":"25078"},{"first_name":"Stephan","last_name":"Krenn","full_name":"Krenn, Stephan"},{"full_name":"Ramacher, Sebastian","last_name":"Ramacher","first_name":"Sebastian"},{"last_name":"Samelin","first_name":"Kai","full_name":"Samelin, Kai"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030925475","9783030925482"]},"title":"Issuer-Hiding Attribute-Based Credentials","status":"public","year":"2021","date_updated":"2022-01-27T13:02:23Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"29566","publisher":"Springer International Publishing","doi":"10.1007/978-3-030-92548-2_9","user_id":"27207"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"citation":{"short":"M. Poniatowski, J. Neumann, D. Kundisch, in: n.d.","chicago":"Poniatowski, Martin, Jürgen Neumann, and Dennis Kundisch. “Nudging Their Thoughts –  Analyzing the Impact of Online Review Templates on Review Sentiment,” n.d.","apa":"Poniatowski, M., Neumann, J., &#38; Kundisch, D. (n.d.). <i>Nudging Their Thoughts –  Analyzing the Impact of Online Review Templates on Review Sentiment</i>. Conference on Information Systems and Technology (CIST), Newport Beach, California, USA.","ieee":"M. Poniatowski, J. Neumann, and D. Kundisch, “Nudging Their Thoughts –  Analyzing the Impact of Online Review Templates on Review Sentiment,” presented at the Conference on Information Systems and Technology (CIST), Newport Beach, California, USA.","ama":"Poniatowski M, Neumann J, Kundisch D. Nudging Their Thoughts –  Analyzing the Impact of Online Review Templates on Review Sentiment.","bibtex":"@inproceedings{Poniatowski_Neumann_Kundisch, title={Nudging Their Thoughts –  Analyzing the Impact of Online Review Templates on Review Sentiment}, author={Poniatowski, Martin and Neumann, Jürgen and Kundisch, Dennis} }","mla":"Poniatowski, Martin, et al. <i>Nudging Their Thoughts –  Analyzing the Impact of Online Review Templates on Review Sentiment</i>."},"department":[{"_id":"276"}],"type":"conference_abstract","date_created":"2021-08-16T08:15:50Z","date_updated":"2022-02-04T10:18:43Z","publication_status":"accepted","conference":{"location":"Newport Beach, California, USA","name":"Conference on Information Systems and Technology (CIST)","start_date":"2021-10-23","end_date":"2021-10-24"},"author":[{"id":"32441","first_name":"Martin","last_name":"Poniatowski","full_name":"Poniatowski, Martin"},{"last_name":"Neumann","first_name":"Jürgen","full_name":"Neumann, Jürgen","id":"32456"},{"full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis","id":"21117"}],"status":"public","title":"Nudging Their Thoughts –  Analyzing the Impact of Online Review Templates on Review Sentiment","year":"2021","user_id":"16205","_id":"23410","language":[{"iso":"eng"}]},{"date_updated":"2022-05-09T15:00:09Z","author":[{"id":"82920","last_name":"Chen","first_name":"Wei-Fan","full_name":"Chen, Wei-Fan"},{"full_name":"Al Khatib, Khalid","last_name":"Al Khatib","first_name":"Khalid"},{"last_name":"Stein","first_name":"Benno","full_name":"Stein, Benno"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"}],"year":"2021","status":"public","title":"Controlled Neural Sentence-Level Reframing of News Articles","user_id":"82920","_id":"23709","language":[{"iso":"eng"}],"page":"2683 - 2693","main_file_link":[{"url":"https://aclanthology.org/2021.findings-emnlp.228.pdf"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"citation":{"chicago":"Chen, Wei-Fan, Khalid Al Khatib, Benno Stein, and Henning Wachsmuth. “Controlled Neural Sentence-Level Reframing of News Articles.” In <i>Findings of the Association for Computational Linguistics: EMNLP 2021</i>, 2683–93, 2021.","short":"W.-F. Chen, K. Al Khatib, B. Stein, H. Wachsmuth, in: Findings of the Association for Computational Linguistics: EMNLP 2021, 2021, pp. 2683–2693.","apa":"Chen, W.-F., Al Khatib, K., Stein, B., &#38; Wachsmuth, H. (2021). Controlled Neural Sentence-Level Reframing of News Articles. <i>Findings of the Association for Computational Linguistics: EMNLP 2021</i>, 2683–2693.","ieee":"W.-F. Chen, K. Al Khatib, B. Stein, and H. Wachsmuth, “Controlled Neural Sentence-Level Reframing of News Articles,” in <i>Findings of the Association for Computational Linguistics: EMNLP 2021</i>, 2021, pp. 2683–2693.","ama":"Chen W-F, Al Khatib K, Stein B, Wachsmuth H. Controlled Neural Sentence-Level Reframing of News Articles. In: <i>Findings of the Association for Computational Linguistics: EMNLP 2021</i>. ; 2021:2683-2693.","bibtex":"@inproceedings{Chen_Al Khatib_Stein_Wachsmuth_2021, title={Controlled Neural Sentence-Level Reframing of News Articles}, booktitle={Findings of the Association for Computational Linguistics: EMNLP 2021}, author={Chen, Wei-Fan and Al Khatib, Khalid and Stein, Benno and Wachsmuth, Henning}, year={2021}, pages={2683–2693} }","mla":"Chen, Wei-Fan, et al. “Controlled Neural Sentence-Level Reframing of News Articles.” <i>Findings of the Association for Computational Linguistics: EMNLP 2021</i>, 2021, pp. 2683–93."},"publication":"Findings of the Association for Computational Linguistics: EMNLP 2021","department":[{"_id":"600"}],"type":"conference","date_created":"2021-09-02T20:09:20Z"},{"publication":"Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)","citation":{"bibtex":"@inproceedings{Alshomary_Syed_Potthast_Wachsmuth_2021, series={Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021}, title={Argument Undermining: Counter-Argument Generation by Attacking Weak Premises}, DOI={<a href=\"https://doi.org/10.18653/v1/2021.findings-acl.159\">10.18653/v1/2021.findings-acl.159</a>}, booktitle={Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)}, publisher={Association for Computational Linguistics}, author={Alshomary, Milad and Syed, Shahbaz and Potthast, Martin and Wachsmuth, Henning}, year={2021}, pages={1816–1827}, collection={Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021} }","ama":"Alshomary M, Syed S, Potthast M, Wachsmuth H. Argument Undermining: Counter-Argument Generation by Attacking Weak Premises. In: <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>. Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021. Association for Computational Linguistics; 2021:1816–1827. doi:<a href=\"https://doi.org/10.18653/v1/2021.findings-acl.159\">10.18653/v1/2021.findings-acl.159</a>","short":"M. Alshomary, S. Syed, M. Potthast, H. Wachsmuth, in: Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021), Association for Computational Linguistics, 2021, pp. 1816–1827.","chicago":"Alshomary, Milad, Shahbaz Syed, Martin Potthast, and Henning Wachsmuth. “Argument Undermining: Counter-Argument Generation by Attacking Weak Premises.” In <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, 1816–1827. Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021. Association for Computational Linguistics, 2021. <a href=\"https://doi.org/10.18653/v1/2021.findings-acl.159\">https://doi.org/10.18653/v1/2021.findings-acl.159</a>.","ieee":"M. Alshomary, S. Syed, M. Potthast, and H. Wachsmuth, “Argument Undermining: Counter-Argument Generation by Attacking Weak Premises,” in <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, Online, 2021, pp. 1816–1827, doi: <a href=\"https://doi.org/10.18653/v1/2021.findings-acl.159\">10.18653/v1/2021.findings-acl.159</a>.","mla":"Alshomary, Milad, et al. “Argument Undermining: Counter-Argument Generation by Attacking Weak Premises.” <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, Association for Computational Linguistics, 2021, pp. 1816–1827, doi:<a href=\"https://doi.org/10.18653/v1/2021.findings-acl.159\">10.18653/v1/2021.findings-acl.159</a>.","apa":"Alshomary, M., Syed, S., Potthast, M., &#38; Wachsmuth, H. (2021). Argument Undermining: Counter-Argument Generation by Attacking Weak Premises. <i>Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)</i>, 1816–1827. <a href=\"https://doi.org/10.18653/v1/2021.findings-acl.159\">https://doi.org/10.18653/v1/2021.findings-acl.159</a>"},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"}],"date_created":"2021-05-26T07:06:18Z","type":"conference","department":[{"_id":"600"}],"title":"Argument Undermining: Counter-Argument Generation by Attacking Weak Premises","status":"public","year":"2021","conference":{"location":"Online","name":"The Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)"},"author":[{"id":"73059","last_name":"Alshomary","first_name":"Milad","full_name":"Alshomary, Milad"},{"full_name":"Syed, Shahbaz","last_name":"Syed","first_name":"Shahbaz"},{"last_name":"Potthast","first_name":"Martin","full_name":"Potthast, Martin"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning","id":"3900"}],"date_updated":"2022-05-09T15:06:36Z","main_file_link":[{"url":"https://aclanthology.org/2021.findings-acl.159.pdf"}],"page":"1816–1827","publisher":"Association for Computational Linguistics","_id":"22229","series_title":"Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021","language":[{"iso":"eng"}],"doi":"10.18653/v1/2021.findings-acl.159","user_id":"82920"},{"date_created":"2021-02-09T09:30:14Z","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"type":"conference","citation":{"bibtex":"@article{Hanselle_Tornede_Wever_Hüllermeier_2021, series={PAKDD}, title={Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data}, author={Hanselle, Jonas Manuel and Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2021}, collection={PAKDD} }","chicago":"Hanselle, Jonas Manuel, Alexander Tornede, Marcel Dominik Wever, and Eyke Hüllermeier. “Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data.” PAKDD, 2021.","short":"J.M. Hanselle, A. Tornede, M.D. Wever, E. Hüllermeier, (2021).","ama":"Hanselle JM, Tornede A, Wever MD, Hüllermeier E. Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data. Published online 2021.","ieee":"J. M. Hanselle, A. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data.” 2021.","apa":"Hanselle, J. M., Tornede, A., Wever, M. D., &#38; Hüllermeier, E. (2021). <i>Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data</i>. The 25th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-2021), Delhi, India.","mla":"Hanselle, Jonas Manuel, et al. <i>Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data</i>. 2021."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"series_title":"PAKDD","_id":"21198","language":[{"iso":"eng"}],"user_id":"38209","author":[{"first_name":"Jonas Manuel","orcid":"0000-0002-1231-4985","last_name":"Hanselle","full_name":"Hanselle, Jonas Manuel","id":"43980"},{"full_name":"Tornede, Alexander","last_name":"Tornede","first_name":"Alexander","id":"38209"},{"full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","first_name":"Marcel Dominik","id":"33176"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"conference":{"end_date":"2021-05-14","name":"The 25th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-2021)","start_date":"2021-05-11","location":"Delhi, India"},"title":"Algorithm Selection as Superset Learning: Constructing Algorithm Selectors from Imprecise Performance Data","year":"2021","status":"public","date_updated":"2022-08-24T12:49:06Z"},{"_id":"21813","publisher":"Association for Computing Machinery (ACM)","page":"1639–1647","user_id":"49992","conference":{"end_date":"2021-07-14","start_date":"2021-07-10","name":"International Workshop on Learning Classifier Systems (IWLCS 2021)","location":"Lille, France"},"status":"public","place":"New York, NY, United States","citation":{"ieee":"T. Hansmeier and M. Platzner, “An Experimental Comparison of Explore/Exploit Strategies for the Learning Classifier System XCS,” in <i>GECCO ’21: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Lille, France, 2021, pp. 1639–1647, doi: <a href=\"https://doi.org/10.1145/3449726.3463159\">10.1145/3449726.3463159</a>.","apa":"Hansmeier, T., &#38; Platzner, M. (2021). An Experimental Comparison of Explore/Exploit Strategies for the Learning Classifier System XCS. <i>GECCO ’21: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1639–1647. <a href=\"https://doi.org/10.1145/3449726.3463159\">https://doi.org/10.1145/3449726.3463159</a>","short":"T. Hansmeier, M. Platzner, in: GECCO ’21: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery (ACM), New York, NY, United States, 2021, pp. 1639–1647.","chicago":"Hansmeier, Tim, and Marco Platzner. “An Experimental Comparison of Explore/Exploit Strategies for the Learning Classifier System XCS.” In <i>GECCO ’21: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1639–1647. New York, NY, United States: Association for Computing Machinery (ACM), 2021. <a href=\"https://doi.org/10.1145/3449726.3463159\">https://doi.org/10.1145/3449726.3463159</a>.","mla":"Hansmeier, Tim, and Marco Platzner. “An Experimental Comparison of Explore/Exploit Strategies for the Learning Classifier System XCS.” <i>GECCO ’21: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery (ACM), 2021, pp. 1639–1647, doi:<a href=\"https://doi.org/10.1145/3449726.3463159\">10.1145/3449726.3463159</a>.","bibtex":"@inproceedings{Hansmeier_Platzner_2021, place={New York, NY, United States}, title={An Experimental Comparison of Explore/Exploit Strategies for the Learning Classifier System XCS}, DOI={<a href=\"https://doi.org/10.1145/3449726.3463159\">10.1145/3449726.3463159</a>}, booktitle={GECCO ’21: Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery (ACM)}, author={Hansmeier, Tim and Platzner, Marco}, year={2021}, pages={1639–1647} }","ama":"Hansmeier T, Platzner M. An Experimental Comparison of Explore/Exploit Strategies for the Learning Classifier System XCS. In: <i>GECCO ’21: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. Association for Computing Machinery (ACM); 2021:1639–1647. doi:<a href=\"https://doi.org/10.1145/3449726.3463159\">10.1145/3449726.3463159</a>"},"project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject C2","_id":"14"}],"language":[{"iso":"eng"}],"doi":"10.1145/3449726.3463159","publication_identifier":{"isbn":["978-1-4503-8351-6"]},"author":[{"last_name":"Hansmeier","orcid":"0000-0003-1377-3339","first_name":"Tim","full_name":"Hansmeier, Tim","id":"49992"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"}],"year":"2021","title":"An Experimental Comparison of Explore/Exploit Strategies for the Learning Classifier System XCS","publication_status":"published","date_updated":"2022-09-02T09:42:38Z","date_created":"2021-04-28T09:08:17Z","department":[{"_id":"78"}],"type":"conference","publication":"GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference Companion"},{"date_created":"2023-01-10T15:08:50Z","file":[{"creator":"stschn","date_created":"2023-01-10T15:07:03Z","file_name":"main.pdf","access_level":"open_access","file_size":133340,"relation":"main_file","date_updated":"2023-01-10T15:07:03Z","file_id":"35890","content_type":"application/pdf"}],"oa":"1","department":[{"_id":"75"}],"keyword":["nfv","coordination","machine learning","reinforcement learning","phd","digest"],"type":"working_paper","citation":{"chicago":"Schneider, Stefan Balthasar. <i>Conventional and Machine Learning Approaches for Network and Service Coordination</i>, 2021.","short":"S.B. Schneider, Conventional and Machine Learning Approaches for Network and Service Coordination, 2021.","ieee":"S. B. Schneider, <i>Conventional and Machine Learning Approaches for Network and Service Coordination</i>. 2021.","apa":"Schneider, S. B. (2021). <i>Conventional and Machine Learning Approaches for Network and Service Coordination</i>.","bibtex":"@book{Schneider_2021, title={Conventional and Machine Learning Approaches for Network and Service Coordination}, author={Schneider, Stefan Balthasar}, year={2021} }","ama":"Schneider SB. <i>Conventional and Machine Learning Approaches for Network and Service Coordination</i>.; 2021.","mla":"Schneider, Stefan Balthasar. <i>Conventional and Machine Learning Approaches for Network and Service Coordination</i>. 2021."},"file_date_updated":"2023-01-10T15:07:03Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"}],"abstract":[{"lang":"eng","text":"Network and service coordination is important to provide modern services consisting of multiple interconnected components, e.g., in 5G, network function virtualization (NFV), or cloud and edge computing. In this paper, I outline my dissertation research, which proposes six approaches to automate such network and service coordination. All approaches dynamically react to the current demand and optimize coordination for high service quality and low costs. The approaches range from centralized to distributed methods and from conventional heuristic algorithms and mixed-integer linear programs to machine learning approaches using supervised and reinforcement learning. I briefly discuss their main ideas and advantages over other state-of-the-art approaches and compare strengths and weaknesses."}],"language":[{"iso":"eng"}],"_id":"35889","ddc":["004"],"user_id":"35343","author":[{"full_name":"Schneider, Stefan Balthasar","orcid":"0000-0001-8210-4011","first_name":"Stefan Balthasar","last_name":"Schneider","id":"35343"}],"title":"Conventional and Machine Learning Approaches for Network and Service Coordination","status":"public","year":"2021","has_accepted_license":"1","date_updated":"2023-01-10T15:09:05Z"}]