[{"user_id":"47208","department":[{"_id":"66"},{"_id":"534"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"_id":"21639","language":[{"iso":"eng"}],"file_date_updated":"2021-07-20T16:20:15Z","ddc":["000"],"keyword":["Business Model Development","Situational Method Engineering","Mobile App","Business Model Development Tools"],"type":"conference","publication":"Enterprise, Business-Process and Information Systems Modeling","file":[{"date_updated":"2021-07-20T16:20:15Z","creator":"sego","date_created":"2021-07-20T16:19:27Z","file_size":638707,"file_id":"22769","file_name":"EMMSAD21.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"status":"public","abstract":[{"lang":"eng","text":"The development of effective business models is an essential task in highly competitive markets like mobile ecosystems. Existing development methods for these business models do not specifically focus that the development process profoundly depends on the situation (e.g., market size, regulations) of the mobile app developer. Here, a mismatch between method and situation can lead to poor resource management and longer development cycles. In software engineering, situational method engineering is used for software projects to configure a development method out of a method repository based on the project situation. Analogously, we support creating situation-specific business model development methods with a method base and new user roles. Here, the method engineer obtains the knowledge of the domain expert and stores it in the method base as elements, building blocks, and patterns. The expert knowledge is derived from a grey literature review on mobile development processes. After this, the method engineer constructs the development method based on the described situation of the business developer. We provide an open-source tool and evaluate it by constructing a local event platform's business model development method.    "}],"date_created":"2021-04-20T13:23:41Z","author":[{"last_name":"Gottschalk","id":"47208","full_name":"Gottschalk, Sebastian","first_name":"Sebastian"},{"orcid":"0000-0002-5967-833X","last_name":"Yigitbas","id":"8447","full_name":"Yigitbas, Enes","first_name":"Enes"},{"first_name":"Alexander","full_name":"Nowosad, Alexander","last_name":"Nowosad"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"date_updated":"2022-01-06T06:55:08Z","oa":"1","publisher":"Springer","doi":"10.1007/978-3-030-79186-5_17","title":"Situation-specific Business Model Development Methods for Mobile App Developers","has_accepted_license":"1","citation":{"short":"S. Gottschalk, E. Yigitbas, A. Nowosad, G. Engels, in: Enterprise, Business-Process and Information Systems Modeling, Springer, 2021.","bibtex":"@inproceedings{Gottschalk_Yigitbas_Nowosad_Engels_2021, title={Situation-specific Business Model Development Methods for Mobile App Developers}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-79186-5_17\">10.1007/978-3-030-79186-5_17</a>}, booktitle={Enterprise, Business-Process and Information Systems Modeling}, publisher={Springer}, author={Gottschalk, Sebastian and Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}, year={2021} }","mla":"Gottschalk, Sebastian, et al. “Situation-Specific Business Model Development Methods for Mobile App Developers.” <i>Enterprise, Business-Process and Information Systems Modeling</i>, Springer, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-79186-5_17\">10.1007/978-3-030-79186-5_17</a>.","apa":"Gottschalk, S., Yigitbas, E., Nowosad, A., &#38; Engels, G. (2021). Situation-specific Business Model Development Methods for Mobile App Developers. In <i>Enterprise, Business-Process and Information Systems Modeling</i>. Springer. <a href=\"https://doi.org/10.1007/978-3-030-79186-5_17\">https://doi.org/10.1007/978-3-030-79186-5_17</a>","ieee":"S. Gottschalk, E. Yigitbas, A. Nowosad, and G. Engels, “Situation-specific Business Model Development Methods for Mobile App Developers,” in <i>Enterprise, Business-Process and Information Systems Modeling</i>, 2021.","chicago":"Gottschalk, Sebastian, Enes Yigitbas, Alexander Nowosad, and Gregor Engels. “Situation-Specific Business Model Development Methods for Mobile App Developers.” In <i>Enterprise, Business-Process and Information Systems Modeling</i>. Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-79186-5_17\">https://doi.org/10.1007/978-3-030-79186-5_17</a>.","ama":"Gottschalk S, Yigitbas E, Nowosad A, Engels G. Situation-specific Business Model Development Methods for Mobile App Developers. In: <i>Enterprise, Business-Process and Information Systems Modeling</i>. Springer; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-79186-5_17\">10.1007/978-3-030-79186-5_17</a>"},"year":"2021"},{"quality_controlled":"1","year":"2021","date_created":"2020-12-11T08:39:47Z","publisher":"IFIP/IEEE","title":"Divide and Conquer: Hierarchical Network and Service Coordination","publication":"IFIP/IEEE International Symposium on Integrated Network Management (IM)","file":[{"relation":"main_file","content_type":"application/pdf","file_name":"preprint_with_header.pdf","access_level":"open_access","file_id":"20694","file_size":7979772,"title":"Divide and Conquer: Hierarchical Network and Service Coordination","date_created":"2020-12-11T08:37:37Z","creator":"stschn","date_updated":"2020-12-11T08:37:37Z"}],"abstract":[{"lang":"eng","text":"In practical, large-scale networks, services are requested\r\nby users across the globe, e.g., for video streaming.\r\nServices consist of multiple interconnected components such as\r\nmicroservices in a service mesh. Coordinating these services\r\nrequires scaling them according to continuously changing user\r\ndemand, deploying instances at the edge close to their users,\r\nand routing traffic efficiently between users and connected instances.\r\nNetwork and service coordination is commonly addressed\r\nthrough centralized approaches, where a single coordinator\r\nknows everything and coordinates the entire network globally.\r\nWhile such centralized approaches can reach global optima, they\r\ndo not scale to large, realistic networks. In contrast, distributed\r\napproaches scale well, but sacrifice solution quality due to their\r\nlimited scope of knowledge and coordination decisions.\r\n\r\nTo this end, we propose a hierarchical coordination approach\r\nthat combines the good solution quality of centralized approaches\r\nwith the scalability of distributed approaches. In doing so, we divide\r\nthe network into multiple hierarchical domains and optimize\r\ncoordination in a top-down manner. We compare our hierarchical\r\nwith a centralized approach in an extensive evaluation on a real-world\r\nnetwork topology. Our results indicate that hierarchical\r\ncoordination can find close-to-optimal solutions in a fraction of\r\nthe runtime of centralized approaches."}],"language":[{"iso":"eng"}],"ddc":["006"],"keyword":["network management","service management","coordination","hierarchical","scalability","nfv"],"has_accepted_license":"1","citation":{"apa":"Schneider, S. B., Jürgens, M., &#38; Karl, H. (2021). Divide and Conquer: Hierarchical Network and Service Coordination. In <i>IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>. Bordeaux, France: IFIP/IEEE.","short":"S.B. Schneider, M. Jürgens, H. Karl, in: IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP/IEEE, 2021.","bibtex":"@inproceedings{Schneider_Jürgens_Karl_2021, title={Divide and Conquer: Hierarchical Network and Service Coordination}, booktitle={IFIP/IEEE International Symposium on Integrated Network Management (IM)}, publisher={IFIP/IEEE}, author={Schneider, Stefan Balthasar and Jürgens, Mirko and Karl, Holger}, year={2021} }","mla":"Schneider, Stefan Balthasar, et al. “Divide and Conquer: Hierarchical Network and Service Coordination.” <i>IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, IFIP/IEEE, 2021.","chicago":"Schneider, Stefan Balthasar, Mirko Jürgens, and Holger Karl. “Divide and Conquer: Hierarchical Network and Service Coordination.” In <i>IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>. IFIP/IEEE, 2021.","ieee":"S. B. Schneider, M. Jürgens, and H. Karl, “Divide and Conquer: Hierarchical Network and Service Coordination,” in <i>IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, Bordeaux, France, 2021.","ama":"Schneider SB, Jürgens M, Karl H. Divide and Conquer: Hierarchical Network and Service Coordination. In: <i>IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>. IFIP/IEEE; 2021."},"author":[{"orcid":"0000-0001-8210-4011","last_name":"Schneider","id":"35343","full_name":"Schneider, Stefan Balthasar","first_name":"Stefan Balthasar"},{"first_name":"Mirko","last_name":"Jürgens","full_name":"Jürgens, Mirko"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"oa":"1","date_updated":"2022-01-06T06:54:32Z","conference":{"name":"IFIP/IEEE International Symposium on Integrated Network Management (IM)","location":"Bordeaux, France"},"type":"conference","status":"public","user_id":"35343","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"20693","file_date_updated":"2020-12-11T08:37:37Z"},{"publication":"Advanced Software Engineering. Doctorial Consortium","type":"conference","status":"public","file":[{"file_size":278027,"file_id":"22767","access_level":"open_access","file_name":"CAISEDC21.pdf","date_updated":"2021-07-20T16:16:05Z","date_created":"2021-07-20T16:16:05Z","creator":"sego","relation":"main_file","content_type":"application/pdf"}],"department":[{"_id":"66"},{"_id":"534"}],"user_id":"47208","_id":"22155","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"file_date_updated":"2021-07-20T16:16:05Z","language":[{"iso":"eng"}],"ddc":["000"],"has_accepted_license":"1","citation":{"ieee":"S. Gottschalk, “Situation-specific Development of Business Models for Services in Software Ecosystems,” in <i>Advanced Software Engineering. Doctorial Consortium</i>, 2021.","chicago":"Gottschalk, Sebastian. “Situation-Specific Development of Business Models for Services in Software Ecosystems.” In <i>Advanced Software Engineering. Doctorial Consortium</i>. CEUR, 2021.","ama":"Gottschalk S. Situation-specific Development of Business Models for Services in Software Ecosystems. In: <i>Advanced Software Engineering. Doctorial Consortium</i>. CEUR; 2021.","mla":"Gottschalk, Sebastian. “Situation-Specific Development of Business Models for Services in Software Ecosystems.” <i>Advanced Software Engineering. Doctorial Consortium</i>, CEUR, 2021.","bibtex":"@inproceedings{Gottschalk_2021, title={Situation-specific Development of Business Models for Services in Software Ecosystems}, booktitle={Advanced Software Engineering. Doctorial Consortium}, publisher={CEUR}, author={Gottschalk, Sebastian}, year={2021} }","short":"S. Gottschalk, in: Advanced Software Engineering. Doctorial Consortium, CEUR, 2021.","apa":"Gottschalk, S. (2021). Situation-specific Development of Business Models for Services in Software Ecosystems. In <i>Advanced Software Engineering. Doctorial Consortium</i>. CEUR."},"year":"2021","date_created":"2021-05-11T12:46:07Z","author":[{"last_name":"Gottschalk","full_name":"Gottschalk, Sebastian","id":"47208","first_name":"Sebastian"}],"oa":"1","publisher":"CEUR","date_updated":"2022-01-06T06:55:28Z","title":"Situation-specific Development of Business Models for Services in Software Ecosystems"},{"type":"conference","status":"public","editor":[{"first_name":"Keren","last_name":"Censor-Hillel","full_name":"Censor-Hillel, Keren"}],"user_id":"477","department":[{"_id":"34"}],"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901","_id":"1"}],"_id":"22283","file_date_updated":"2021-06-06T19:12:49Z","publication_status":"accepted","has_accepted_license":"1","citation":{"apa":"Götte, T., Hinnenthal, K., Scheideler, C., &#38; Werthmann, J. (n.d.). Time-Optimal Construction of Overlays. In K. Censor-Hillel (Ed.), <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>","bibtex":"@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York}, title={Time-Optimal Construction of Overlays}, DOI={<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>}, booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor} }","mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel, ACM, doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>.","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), ACM, New York, n.d.","ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. In: Censor-Hillel K, ed. <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>","ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” in <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, Virtual.","chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” In <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel. New York: ACM, n.d. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>."},"place":"New York","author":[{"last_name":"Götte","id":"34727","full_name":"Götte, Thorsten","first_name":"Thorsten"},{"full_name":"Hinnenthal, Kristian","id":"32229","last_name":"Hinnenthal","first_name":"Kristian"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Julian","full_name":"Werthmann, Julian","id":"50024","last_name":"Werthmann"}],"date_updated":"2022-01-06T06:55:30Z","doi":"10.1145/3465084.3467932","conference":{"name":"ACM Symposium on Principles of Distributed Computing (PODC)","start_date":"2021-07-26","end_date":"2021-07-30","location":"Virtual"},"publication":"Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)","file":[{"file_size":590875,"access_level":"closed","file_name":"Wicked_Fast_Overlay_Construction(1).pdf","file_id":"22284","date_updated":"2021-06-06T19:12:49Z","date_created":"2021-06-06T19:12:49Z","creator":"thgoette","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"    We show how to construct an overlay network of constant degree and diameter $O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected graph.\r\n    We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers.\r\n    If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\\log n)$ messages in each round in time $O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19].\r\n    Since the problem cannot be solved faster than by using pointer jumping for $O(\\log n)$ rounds (which would even require each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n    We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14].\r\n    \r\n    Additionally, we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid networks} [Augustine et al., SODA'20].\r\n    Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution.\r\n    For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\\log n)$, w.h.p.\r\n    Furthermore, we show how to compute an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial degree of $G$."}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2021","date_created":"2021-06-06T19:10:26Z","publisher":"ACM","title":"Time-Optimal Construction of Overlays"},{"year":"2021","place":"Paderborn","citation":{"apa":"Brede, M. (2021). <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University.","bibtex":"@book{Brede_2021, place={Paderborn}, title={Implementation and Profiling of XCS in the Context of Embedded Systems}, publisher={Paderborn University}, author={Brede, Mathis}, year={2021} }","short":"M. Brede, Implementation and Profiling of XCS in the Context of Embedded Systems, Paderborn University, Paderborn, 2021.","mla":"Brede, Mathis. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn University, 2021.","chicago":"Brede, Mathis. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University, 2021.","ieee":"M. Brede, <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University, 2021.","ama":"Brede M. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University; 2021."},"title":"Implementation and Profiling of XCS in the Context of Embedded Systems","publisher":"Paderborn University","date_updated":"2022-01-06T06:55:33Z","date_created":"2021-06-21T09:35:03Z","supervisor":[{"first_name":"Marco","last_name":"Platzner","id":"398","full_name":"Platzner, Marco"},{"last_name":"Hansmeier","orcid":"0000-0003-1377-3339","id":"49992","full_name":"Hansmeier, Tim","first_name":"Tim"}],"author":[{"first_name":"Mathis","last_name":"Brede","full_name":"Brede, Mathis"}],"abstract":[{"lang":"eng","text":"This bachelor thesis presents a C/C++ implementation of the XCS algorithm for an embedded system and profiling results concerning the execution time of the functions. These are then analyzed in relation to the input characteristics of the examined learning environments and compared with related work. Three main conclusions can be drawn from the measured results. First, the maximum size of the population of the classifiers influences the runtime of the genetic algorithm; second, the size of the input space has a direct effect on the execution time of the matching function; and last, a larger action space results in a longer runtime generating the prediction for the possible actions. The dependencies identified here can serve to optimize the computational efficiency and make XCS more suitable for embedded systems."}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"extern":"1","_id":"22483","project":[{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"1","name":"SFB 901"}],"department":[{"_id":"78"}],"user_id":"477"},{"citation":{"ama":"Frieden P. <i>Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen</i>. Universität Paderborn; 2021.","ieee":"P. Frieden, <i>Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen</i>. Universität Paderborn, 2021.","chicago":"Frieden, Paula. <i>Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen</i>. Universität Paderborn, 2021.","apa":"Frieden, P. (2021). <i>Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen</i>. Universität Paderborn.","mla":"Frieden, Paula. <i>Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen</i>. 2021.","short":"P. Frieden, Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen, Universität Paderborn, 2021.","bibtex":"@book{Frieden_2021, place={Universität Paderborn}, title={Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen}, author={Frieden, Paula}, year={2021} }"},"place":"Universität Paderborn","year":"2021","author":[{"first_name":"Paula","full_name":"Frieden, Paula","last_name":"Frieden"}],"date_created":"2021-07-23T08:46:29Z","supervisor":[{"first_name":"Dennis","id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch"}],"date_updated":"2022-01-06T06:55:41Z","title":"Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen","type":"mastersthesis","status":"public","user_id":"16205","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"_id":"22803","language":[{"iso":"ger"}]},{"user_id":"47208","department":[{"_id":"66"},{"_id":"534"},{"_id":"276"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"21727","language":[{"iso":"eng"}],"keyword":["Platform Ecosystems","Platform Ecosystem Modeling Language","Platform Ecosystem Development Tool","Business Models","Design Science"],"type":"conference","publication":"Proceedings of the 29th European Conference on Information Systems (ECIS)","status":"public","abstract":[{"lang":"eng","text":"Platform-based business models underlie the success of many of today’s largest, fastest-growing, and most disruptive companies. Despite the success of prominent examples, such as Uber and Airbnb, creating a profitable platform ecosystem presents a key challenge for many companies across all industries. Although research provides knowledge about platforms’ different value drivers (e.g., network effects), companies that seek to transform their current business model into a platform-based one lack an artifact to reduce knowledge boundaries, collaborate effectively, and cope with the complexities and dynamics of platform ecosystems. We address this challenge by developing two artifacts and combining research from variability modeling, business model dependencies, and system dynamics. This paper presents a design science research approach to develop the platform ecosystem modeling language and the platform ecosystem development tool that support researcher and practitioner by visualizing and simulating platform ecosystems. "}],"date_created":"2021-04-23T13:38:54Z","author":[{"last_name":"Vorbohle","full_name":"Vorbohle, Christian","id":"29951","first_name":"Christian"},{"full_name":"Gottschalk, Sebastian","id":"47208","last_name":"Gottschalk","first_name":"Sebastian"}],"date_updated":"2022-01-06T06:55:12Z","publisher":"AIS","conference":{"location":"Virtual Conference/Workshop","name":"29th European Conference on Information Systems (ECIS)"},"title":"Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems ","publication_status":"accepted","citation":{"ama":"Vorbohle C, Gottschalk S. Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems . In: <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. AIS.","chicago":"Vorbohle, Christian, and Sebastian Gottschalk. “Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems .” In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. AIS, n.d.","ieee":"C. Vorbohle and S. Gottschalk, “Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems ,” in <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, Virtual Conference/Workshop.","apa":"Vorbohle, C., &#38; Gottschalk, S. (n.d.). Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems . In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. Virtual Conference/Workshop: AIS.","short":"C. Vorbohle, S. Gottschalk, in: Proceedings of the 29th European Conference on Information Systems (ECIS), AIS, n.d.","bibtex":"@inproceedings{Vorbohle_Gottschalk, title={Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems }, booktitle={Proceedings of the 29th European Conference on Information Systems (ECIS)}, publisher={AIS}, author={Vorbohle, Christian and Gottschalk, Sebastian} }","mla":"Vorbohle, Christian, and Sebastian Gottschalk. “Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems .” <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, AIS."},"year":"2021"},{"has_accepted_license":"1","citation":{"ieee":"S. B. Schneider <i>et al.</i>, “Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning,” <i>Transactions on Network and Service Management</i>, 2021.","chicago":"Schneider, Stefan Balthasar, Ramin Khalili, Adnan Manzoor, Haydar Qarawlus, Rafael Schellenberg, Holger Karl, and Artur Hecker. “Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning.” <i>Transactions on Network and Service Management</i>, 2021. <a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">https://doi.org/10.1109/TNSM.2021.3076503</a>.","ama":"Schneider SB, Khalili R, Manzoor A, et al. Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning. <i>Transactions on Network and Service Management</i>. 2021. doi:<a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">10.1109/TNSM.2021.3076503</a>","short":"S.B. Schneider, R. Khalili, A. Manzoor, H. Qarawlus, R. Schellenberg, H. Karl, A. Hecker, Transactions on Network and Service Management (2021).","mla":"Schneider, Stefan Balthasar, et al. “Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning.” <i>Transactions on Network and Service Management</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">10.1109/TNSM.2021.3076503</a>.","bibtex":"@article{Schneider_Khalili_Manzoor_Qarawlus_Schellenberg_Karl_Hecker_2021, title={Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning}, DOI={<a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">10.1109/TNSM.2021.3076503</a>}, journal={Transactions on Network and Service Management}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Khalili, Ramin and Manzoor, Adnan and Qarawlus, Haydar and Schellenberg, Rafael and Karl, Holger and Hecker, Artur}, year={2021} }","apa":"Schneider, S. B., Khalili, R., Manzoor, A., Qarawlus, H., Schellenberg, R., Karl, H., &#38; Hecker, A. (2021). Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning. <i>Transactions on Network and Service Management</i>. <a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">https://doi.org/10.1109/TNSM.2021.3076503</a>"},"year":"2021","author":[{"orcid":"0000-0001-8210-4011","last_name":"Schneider","id":"35343","full_name":"Schneider, Stefan Balthasar","first_name":"Stefan Balthasar"},{"full_name":"Khalili, Ramin","last_name":"Khalili","first_name":"Ramin"},{"first_name":"Adnan","last_name":"Manzoor","full_name":"Manzoor, Adnan"},{"full_name":"Qarawlus, Haydar","last_name":"Qarawlus","first_name":"Haydar"},{"first_name":"Rafael","last_name":"Schellenberg","full_name":"Schellenberg, Rafael"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"},{"full_name":"Hecker, Artur","last_name":"Hecker","first_name":"Artur"}],"date_created":"2021-04-27T08:04:16Z","oa":"1","date_updated":"2022-01-06T06:55:15Z","publisher":"IEEE","doi":"10.1109/TNSM.2021.3076503","title":"Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning","publication":"Transactions on Network and Service Management","type":"journal_article","status":"public","file":[{"date_created":"2021-04-27T08:01:26Z","creator":"stschn","date_updated":"2021-04-27T08:01:26Z","file_name":"ris-accepted-version.pdf","access_level":"open_access","file_id":"21809","description":"Author version of the accepted paper","file_size":4172270,"content_type":"application/pdf","relation":"main_file"}],"abstract":[{"lang":"eng","text":"Modern services consist of interconnected components,e.g., microservices in a service mesh or machine learning functions in a pipeline. These services can scale and run across multiple network nodes on demand. To process incoming traffic, service components have to be instantiated and traffic assigned to these instances, taking capacities, changing demands, and Quality of Service (QoS) requirements into account. This challenge is usually solved with custom approaches designed by experts. While this typically works well for the considered scenario, the models often rely on unrealistic assumptions or on knowledge that is not available in practice (e.g., a priori knowledge).\r\n\r\nWe propose DeepCoord, a novel deep reinforcement learning approach that learns how to best coordinate services and is geared towards realistic assumptions. It interacts with the network and relies on available, possibly delayed monitoring information. Rather than defining a complex model or an algorithm on how to achieve an objective, our model-free approach adapts to various objectives and traffic patterns. An agent is trained offline without expert knowledge and then applied online with minimal overhead. Compared to a state-of-the-art heuristic, DeepCoord significantly improves flow throughput (up to 76%) and overall network utility (more than 2x) on realworld network topologies and traffic traces. It also supports optimizing multiple, possibly competing objectives, learns to respect QoS requirements, generalizes to scenarios with unseen, stochastic traffic, and scales to large real-world networks. For reproducibility and reuse, our code is publicly available."}],"department":[{"_id":"75"}],"user_id":"35343","_id":"21808","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"language":[{"iso":"eng"}],"file_date_updated":"2021-04-27T08:01:26Z","keyword":["network management","service management","coordination","reinforcement learning","self-learning","self-adaptation","multi-objective"],"article_type":"original","ddc":["000"]},{"conference":{"location":"Virtual Conference/Workshop","name":"29th European Conference on Information Systems (ECIS)"},"title":"Toward Understanding the Complexity of Business Models – A Taxonomy of Business Model Dependencies","author":[{"first_name":"Christian","last_name":"Vorbohle","id":"29951","full_name":"Vorbohle, Christian"},{"full_name":"Szopinski, Daniel","id":"36372","last_name":"Szopinski","first_name":"Daniel"},{"last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis"}],"date_created":"2021-04-28T08:22:41Z","date_updated":"2022-01-06T06:55:15Z","citation":{"apa":"Vorbohle, C., Szopinski, D., &#38; Kundisch, D. (2021). Toward Understanding the Complexity of Business Models – A Taxonomy of Business Model Dependencies. In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. Virtual Conference/Workshop.","mla":"Vorbohle, Christian, et al. “Toward Understanding the Complexity of Business Models – A Taxonomy of Business Model Dependencies.” <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, 2021.","short":"C. Vorbohle, D. Szopinski, D. Kundisch, in: Proceedings of the 29th European Conference on Information Systems (ECIS), 2021.","bibtex":"@inproceedings{Vorbohle_Szopinski_Kundisch_2021, title={Toward Understanding the Complexity of Business Models – A Taxonomy of Business Model Dependencies}, booktitle={Proceedings of the 29th European Conference on Information Systems (ECIS)}, author={Vorbohle, Christian and Szopinski, Daniel and Kundisch, Dennis}, year={2021} }","chicago":"Vorbohle, Christian, Daniel Szopinski, and Dennis Kundisch. “Toward Understanding the Complexity of Business Models – A Taxonomy of Business Model Dependencies.” In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, 2021.","ieee":"C. Vorbohle, D. Szopinski, and D. Kundisch, “Toward Understanding the Complexity of Business Models – A Taxonomy of Business Model Dependencies,” in <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, Virtual Conference/Workshop, 2021.","ama":"Vorbohle C, Szopinski D, Kundisch D. Toward Understanding the Complexity of Business Models – A Taxonomy of Business Model Dependencies. In: <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. ; 2021."},"year":"2021","language":[{"iso":"eng"}],"department":[{"_id":"276"}],"user_id":"477","_id":"21812","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"status":"public","publication":"Proceedings of the 29th European Conference on Information Systems (ECIS)","type":"conference"},{"ddc":["000"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We construct more efficient cryptosystems with provable\r\nsecurity against adaptive attacks, based on simple and natural hardness\r\nassumptions in the standard model. Concretely, we describe:\r\n– An adaptively-secure variant of the efficient, selectively-secure LWE-\r\nbased identity-based encryption (IBE) scheme of Agrawal, Boneh,\r\nand Boyen (EUROCRYPT 2010). In comparison to the previously\r\nmost efficient such scheme by Yamada (CRYPTO 2017) we achieve\r\nsmaller lattice parameters and shorter public keys of size O(log λ),\r\nwhere λ is the security parameter.\r\n– Adaptively-secure variants of two efficient selectively-secure pairing-\r\nbased IBEs of Boneh and Boyen (EUROCRYPT 2004). One is based\r\non the DBDH assumption, has the same ciphertext size as the cor-\r\nresponding BB04 scheme, and achieves full adaptive security with\r\npublic parameters of size only O(log λ). The other is based on a q-\r\ntype assumption and has public key size O(λ), but a ciphertext is\r\nonly a single group element and the security reduction is quadrat-\r\nically tighter than the corresponding scheme by Jager and Kurek\r\n(ASIACRYPT 2018).\r\n– A very efficient adaptively-secure verifiable random function where\r\nproofs, public keys, and secret keys have size O(log λ).\r\nAs a technical contribution we introduce blockwise partitioning, which\r\nleverages the assumption that a cryptographic hash function is weak\r\nnear-collision resistant to prove full adaptive security of cryptosystems."}],"file":[{"date_created":"2021-05-10T16:02:02Z","creator":"davnie","date_updated":"2021-05-10T16:02:02Z","file_id":"22058","access_level":"closed","file_name":"Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via N.pdf","file_size":701068,"content_type":"application/pdf","relation":"main_file"}],"publication":"Public-Key Cryptography – PKC 2021","title":"Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance","date_created":"2021-05-10T15:56:24Z","year":"2021","file_date_updated":"2021-05-10T16:02:02Z","_id":"22057","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"558"}],"user_id":"36113","status":"public","type":"book_chapter","doi":"10.1007/978-3-030-75245-3_22","date_updated":"2022-01-06T06:55:23Z","author":[{"last_name":"Jager","full_name":"Jager, Tibor","first_name":"Tibor"},{"full_name":"Kurek, Rafael","last_name":"Kurek","first_name":"Rafael"},{"id":"36113","full_name":"Niehues, David","last_name":"Niehues","first_name":"David"}],"place":"Cham","citation":{"ama":"Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In: <i>Public-Key Cryptography – PKC 2021</i>. Cham; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>","chicago":"Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” In <i>Public-Key Cryptography – PKC 2021</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">https://doi.org/10.1007/978-3-030-75245-3_22</a>.","ieee":"T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance,” in <i>Public-Key Cryptography – PKC 2021</i>, Cham, 2021.","bibtex":"@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>}, booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek, Rafael and Niehues, David}, year={2021} }","short":"T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","mla":"Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” <i>Public-Key Cryptography – PKC 2021</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>.","apa":"Jager, T., Kurek, R., &#38; Niehues, D. (2021). Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In <i>Public-Key Cryptography – PKC 2021</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">https://doi.org/10.1007/978-3-030-75245-3_22</a>"},"has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030752446","9783030752453"]},"publication_status":"published"},{"publication_identifier":{"isbn":["9783030752477","9783030752484"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","publication_status":"published","citation":{"apa":"Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In <i>Public-Key Cryptography – PKC 2021</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">https://doi.org/10.1007/978-3-030-75248-4_3</a>","short":"D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","bibtex":"@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions with Optimal Tightness}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>}, booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021} }","mla":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” <i>Public-Key Cryptography – PKC 2021</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>.","ieee":"D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in <i>Public-Key Cryptography – PKC 2021</i>, Cham, 2021.","chicago":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In <i>Public-Key Cryptography – PKC 2021</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">https://doi.org/10.1007/978-3-030-75248-4_3</a>.","ama":"Niehues D. Verifiable Random Functions with Optimal Tightness. In: <i>Public-Key Cryptography – PKC 2021</i>. Cham; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>"},"year":"2021","place":"Cham","date_created":"2021-05-10T16:07:50Z","author":[{"first_name":"David","id":"36113","full_name":"Niehues, David","last_name":"Niehues"}],"date_updated":"2022-01-06T06:55:24Z","doi":"10.1007/978-3-030-75248-4_3","title":"Verifiable Random Functions with Optimal Tightness","publication":"Public-Key Cryptography – PKC 2021","type":"book_chapter","status":"public","file":[{"date_updated":"2021-05-10T16:09:17Z","creator":"davnie","date_created":"2021-05-10T16:09:17Z","file_size":697361,"file_id":"22060","access_level":"closed","file_name":"Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf","content_type":"application/pdf","relation":"main_file"}],"abstract":[{"lang":"eng","text":"Verifiable random functions (VRFs), introduced by Micali,\r\nRabin and Vadhan (FOCS’99), are the public-key equivalent of pseudo-\r\nrandom functions. A public verification key and proofs accompanying the\r\noutput enable all parties to verify the correctness of the output. How-\r\never, all known standard model VRFs have a reduction loss that is much\r\nworse than what one would expect from known optimal constructions of\r\nclosely related primitives like unique signatures. We show that:\r\n1. Every security proof for a VRF that relies on a non-interactive\r\nassumption has to lose a factor of Q, where Q is the number of adver-\r\nsarial queries. To that end, we extend the meta-reduction technique\r\nof Bader et al. (EUROCRYPT’16) to also cover VRFs.\r\n2. This raises the question: Is this bound optimal? We answer this ques-\r\ntion in the affirmative by presenting the first VRF with a reduction\r\nfrom the non-interactive qDBDHI assumption to the security of VRF\r\nthat achieves this optimal loss.\r\nWe thus paint a complete picture of the achievability of tight verifiable\r\nrandom functions: We show that a security loss of Q is unavoidable and\r\npresent the first construction that achieves this bound."}],"department":[{"_id":"558"}],"user_id":"36113","_id":"22059","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"language":[{"iso":"eng"}],"file_date_updated":"2021-05-10T16:09:17Z","ddc":["000"]},{"publisher":"Springer","date_updated":"2022-02-15T07:32:52Z","date_created":"2022-01-11T12:43:22Z","author":[{"first_name":"Sebastian","last_name":"Gottschalk","full_name":"Gottschalk, Sebastian","id":"47208"},{"first_name":"Muhammad Suffyan","full_name":"Aziz, Muhammad Suffyan","last_name":"Aziz"},{"full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"volume":434,"title":"Design Principles for a Crowd-Based Prototype Validation Platform","doi":"10.1007/978-3-030-91983-2_16","year":"2021","citation":{"mla":"Gottschalk, Sebastian, et al. “Design Principles for a Crowd-Based Prototype Validation Platform.” <i>Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings</i>, edited by Xiaofeng Wang et al., vol. 434, Springer, 2021, pp. 205–220, doi:<a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">10.1007/978-3-030-91983-2_16</a>.","short":"S. Gottschalk, M.S. Aziz, E. Yigitbas, G. Engels, in: X. Wang, A. Martini, A. Nguyen-Duc, V. Stray (Eds.), Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings, Springer, 2021, pp. 205–220.","bibtex":"@inproceedings{Gottschalk_Aziz_Yigitbas_Engels_2021, series={Lecture Notes in Business Information Processing}, title={Design Principles for a Crowd-Based Prototype Validation Platform}, volume={434}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">10.1007/978-3-030-91983-2_16</a>}, booktitle={Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings}, publisher={Springer}, author={Gottschalk, Sebastian and Aziz, Muhammad Suffyan and Yigitbas, Enes and Engels, Gregor}, editor={Wang, Xiaofeng and Martini, Antonio and Nguyen-Duc, Anh and Stray, Viktoria}, year={2021}, pages={205–220}, collection={Lecture Notes in Business Information Processing} }","apa":"Gottschalk, S., Aziz, M. S., Yigitbas, E., &#38; Engels, G. (2021). Design Principles for a Crowd-Based Prototype Validation Platform. In X. Wang, A. Martini, A. Nguyen-Duc, &#38; V. Stray (Eds.), <i>Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings</i> (Vol. 434, pp. 205–220). Springer. <a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">https://doi.org/10.1007/978-3-030-91983-2_16</a>","chicago":"Gottschalk, Sebastian, Muhammad Suffyan Aziz, Enes Yigitbas, and Gregor Engels. “Design Principles for a Crowd-Based Prototype Validation Platform.” In <i>Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings</i>, edited by Xiaofeng Wang, Antonio Martini, Anh Nguyen-Duc, and Viktoria Stray, 434:205–220. Lecture Notes in Business Information Processing. Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">https://doi.org/10.1007/978-3-030-91983-2_16</a>.","ieee":"S. Gottschalk, M. S. Aziz, E. Yigitbas, and G. Engels, “Design Principles for a Crowd-Based Prototype Validation Platform,” in <i>Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings</i>, 2021, vol. 434, pp. 205–220, doi: <a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">10.1007/978-3-030-91983-2_16</a>.","ama":"Gottschalk S, Aziz MS, Yigitbas E, Engels G. Design Principles for a Crowd-Based Prototype Validation Platform. In: Wang X, Martini A, Nguyen-Duc A, Stray V, eds. <i>Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings</i>. Vol 434. Lecture Notes in Business Information Processing. Springer; 2021:205–220. doi:<a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">10.1007/978-3-030-91983-2_16</a>"},"intvolume":"       434","page":"205–220","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"}],"_id":"29235","series_title":"Lecture Notes in Business Information Processing","user_id":"47208","department":[{"_id":"66"},{"_id":"534"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings","editor":[{"last_name":"Wang","full_name":"Wang, Xiaofeng","first_name":"Xiaofeng"},{"first_name":"Antonio","full_name":"Martini, Antonio","last_name":"Martini"},{"first_name":"Anh","last_name":"Nguyen-Duc","full_name":"Nguyen-Duc, Anh"},{"full_name":"Stray, Viktoria","last_name":"Stray","first_name":"Viktoria"}],"status":"public"},{"year":"2021","citation":{"chicago":"Gottschalk, Sebastian, Enes Yigitbas, Alexander Nowosad, and Gregor Engels. “Situation- and  Domain-Specific Composition and Enactment of Business Model Development Methods.” In <i>Product-Focused Software Process Improvement</i>. Springer, 2021.","ieee":"S. Gottschalk, E. Yigitbas, A. Nowosad, and G. Engels, “Situation- and  Domain-specific Composition and Enactment of Business Model Development Methods,” in <i>Product-focused Software Process Improvement</i>, Springer, 2021.","ama":"Gottschalk S, Yigitbas E, Nowosad A, Engels G. Situation- and  Domain-specific Composition and Enactment of Business Model Development Methods. In: <i>Product-Focused Software Process Improvement</i>. Springer; 2021.","apa":"Gottschalk, S., Yigitbas, E., Nowosad, A., &#38; Engels, G. (2021). Situation- and  Domain-specific Composition and Enactment of Business Model Development Methods. In <i>Product-focused Software Process Improvement</i>. 22nd International Conference on Product-Focused Software Process Improvement, Turin. Springer.","bibtex":"@inbook{Gottschalk_Yigitbas_Nowosad_Engels_2021, title={Situation- and  Domain-specific Composition and Enactment of Business Model Development Methods}, booktitle={Product-focused Software Process Improvement}, publisher={Springer}, author={Gottschalk, Sebastian and Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}, year={2021} }","short":"S. Gottschalk, E. Yigitbas, A. Nowosad, G. Engels, in: Product-Focused Software Process Improvement, Springer, 2021.","mla":"Gottschalk, Sebastian, et al. “Situation- and  Domain-Specific Composition and Enactment of Business Model Development Methods.” <i>Product-Focused Software Process Improvement</i>, Springer, 2021."},"publisher":"Springer","date_updated":"2022-02-15T08:36:09Z","date_created":"2021-10-05T20:11:09Z","author":[{"first_name":"Sebastian","id":"47208","full_name":"Gottschalk, Sebastian","last_name":"Gottschalk"},{"id":"8447","full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","first_name":"Enes"},{"first_name":"Alexander","last_name":"Nowosad","full_name":"Nowosad, Alexander"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"title":"Situation- and  Domain-specific Composition and Enactment of Business Model Development Methods","conference":{"location":"Turin","end_date":"2021-11-26","start_date":"2021-11-25","name":"22nd International Conference on Product-Focused Software Process Improvement"},"publication":"Product-focused Software Process Improvement","type":"book_chapter","abstract":[{"text":"Developing effective business models is a complex process for a company where several tasks (e.g., conduct customer interviews) need to be accomplished, and decisions (e.g., advertisement as a revenue stream) must be made. Here, domain experts can guide the choices of tasks and decisions with their knowledge. Nevertheless, this knowledge needs to match the situation of the company (e.g., financial resources) and the application domain of the product/service (e.g., mobile app) to reduce the risk of developing ineffective business models with low market penetration. This is not covered by one-size-fits-all development methods without tailoring before the enaction.\r\nTherefore, we conduct a design science study to create a situation-specific development approach for business models. Based on situational method engineering and our previous work in storing knowledge of methods and models in distinct repositories, this paper shows the situation-specific composition and enaction of business model development methods. First, the method engineer composes the development method out of both repositories based on the situational context. Second, the business developer enacts the method and develops the business model.  We implement the approach in a tool and evaluate it with a industrial case study on mobile apps.","lang":"eng"}],"status":"public","_id":"25528","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"department":[{"_id":"66"}],"user_id":"47208","keyword":["Business Model Development","Situational Method Engineering","Lean Development","Kanban Boards","Canvas Models"],"language":[{"iso":"eng"}]},{"year":"2021","place":"Universität Paderborn","citation":{"mla":"Pieper, Florian. <i>Systematische Identifikation und Analyse von Vorgehensmodellen zur Geschäftsmodellentwicklung auf digitalen Plattformen</i>. 2021.","bibtex":"@book{Pieper_2021, place={Universität Paderborn}, title={Systematische Identifikation und Analyse von Vorgehensmodellen zur Geschäftsmodellentwicklung auf digitalen Plattformen}, author={Pieper, Florian}, year={2021} }","short":"F. Pieper, Systematische Identifikation und Analyse von Vorgehensmodellen zur Geschäftsmodellentwicklung auf digitalen Plattformen, Universität Paderborn, 2021.","apa":"Pieper, F. (2021). <i>Systematische Identifikation und Analyse von Vorgehensmodellen zur Geschäftsmodellentwicklung auf digitalen Plattformen</i>.","ama":"Pieper F. <i>Systematische Identifikation und Analyse von Vorgehensmodellen zur Geschäftsmodellentwicklung auf digitalen Plattformen</i>.; 2021.","chicago":"Pieper, Florian. <i>Systematische Identifikation und Analyse von Vorgehensmodellen zur Geschäftsmodellentwicklung auf digitalen Plattformen</i>. Universität Paderborn, 2021.","ieee":"F. Pieper, <i>Systematische Identifikation und Analyse von Vorgehensmodellen zur Geschäftsmodellentwicklung auf digitalen Plattformen</i>. Universität Paderborn, 2021."},"date_updated":"2022-07-14T13:06:02Z","date_created":"2021-08-27T13:12:37Z","supervisor":[{"first_name":"Dennis","last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis"}],"author":[{"last_name":"Pieper","full_name":"Pieper, Florian","first_name":"Florian"}],"title":"Systematische Identifikation und Analyse von Vorgehensmodellen zur Geschäftsmodellentwicklung auf digitalen Plattformen","type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"23554","user_id":"16205","language":[{"iso":"ger"}]},{"place":"Universität Paderborn","year":"2021","citation":{"ama":"Richert LJ. <i>Abhängigkeiten innerhalb und zwischen Business Model Canvas und  ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen</i>.; 2021.","chicago":"Richert, Laurenz Jobst. <i>Abhängigkeiten innerhalb und zwischen Business Model Canvas und  ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen</i>. Universität Paderborn, 2021.","ieee":"L. J. Richert, <i>Abhängigkeiten innerhalb und zwischen Business Model Canvas und  ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen</i>. Universität Paderborn, 2021.","mla":"Richert, Laurenz Jobst. <i>Abhängigkeiten innerhalb und zwischen Business Model Canvas und  ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen</i>. 2021.","short":"L.J. Richert, Abhängigkeiten innerhalb und zwischen Business Model Canvas und  ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen, Universität Paderborn, 2021.","bibtex":"@book{Richert_2021, place={Universität Paderborn}, title={Abhängigkeiten innerhalb und zwischen Business Model Canvas und  ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen}, author={Richert, Laurenz Jobst}, year={2021} }","apa":"Richert, L. J. (2021). <i>Abhängigkeiten innerhalb und zwischen Business Model Canvas und  ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen</i>."},"date_updated":"2022-07-14T13:06:32Z","author":[{"first_name":"Laurenz Jobst","full_name":"Richert, Laurenz Jobst","last_name":"Richert"}],"supervisor":[{"last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis"}],"date_created":"2021-04-26T10:35:02Z","title":"Abhängigkeiten innerhalb und zwischen Business Model Canvas und  ArchiMate - Ein konzeptioneller Vergleich zweier Modellierungssprachen","type":"bachelorsthesis","status":"public","_id":"21798","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"user_id":"16205","language":[{"iso":"ger"}]},{"user_id":"16205","author":[{"full_name":"Rennemeier, Steffen","last_name":"Rennemeier","first_name":"Steffen"}],"supervisor":[{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"}],"date_created":"2021-02-01T09:51:47Z","date_updated":"2022-07-14T13:08:13Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"21116","language":[{"iso":"ger"}],"title":"Entwicklung und Pilotierung eines Experiments über Visualisierungen von Taxonomien in der Wirtschaftsinformatik","type":"bachelorsthesis","citation":{"ieee":"S. Rennemeier, <i>Entwicklung und Pilotierung eines Experiments über Visualisierungen von Taxonomien in der Wirtschaftsinformatik</i>. 2021.","chicago":"Rennemeier, Steffen. <i>Entwicklung und Pilotierung eines Experiments über Visualisierungen von Taxonomien in der Wirtschaftsinformatik</i>, 2021.","ama":"Rennemeier S. <i>Entwicklung und Pilotierung eines Experiments über Visualisierungen von Taxonomien in der Wirtschaftsinformatik</i>.; 2021.","apa":"Rennemeier, S. (2021). <i>Entwicklung und Pilotierung eines Experiments über Visualisierungen von Taxonomien in der Wirtschaftsinformatik</i>.","mla":"Rennemeier, Steffen. <i>Entwicklung und Pilotierung eines Experiments über Visualisierungen von Taxonomien in der Wirtschaftsinformatik</i>. 2021.","bibtex":"@book{Rennemeier_2021, title={Entwicklung und Pilotierung eines Experiments über Visualisierungen von Taxonomien in der Wirtschaftsinformatik}, author={Rennemeier, Steffen}, year={2021} }","short":"S. Rennemeier, Entwicklung und Pilotierung eines Experiments über Visualisierungen von Taxonomien in der Wirtschaftsinformatik, 2021."},"status":"public","year":"2021"},{"user_id":"16205","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"21714","language":[{"iso":"ger"}],"type":"mastersthesis","status":"public","author":[{"full_name":"Wittmann, Daniel","last_name":"Wittmann","first_name":"Daniel"}],"date_created":"2021-04-22T08:49:36Z","supervisor":[{"first_name":"Dennis","id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch"}],"date_updated":"2022-07-14T13:12:17Z","title":"Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen","citation":{"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.","short":"D. Wittmann, Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen, Universität Paderborn, 2021.","apa":"Wittmann, D. (2021). <i>Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen</i>.","ama":"Wittmann D. <i>Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen</i>.; 2021.","ieee":"D. Wittmann, <i>Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen</i>. Universität Paderborn, 2021.","chicago":"Wittmann, Daniel. <i>Interdependente Geschäftsmodelle: Eine systematische Analyse von Relationen in Geschäftsmodell-Modellierungssprachen</i>. Universität Paderborn, 2021."},"place":"Universität Paderborn","year":"2021"},{"year":"2021","citation":{"ieee":"J. Bobolz, F. Eidens, R. Heitjohann, and J. Fell, “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 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.","ama":"Bobolz J, Eidens F, Heitjohann R, Fell J. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. Published online 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).","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} }"},"title":"Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/961"}],"publisher":"IACR eprint","oa":"1","date_updated":"2022-11-18T09:38:42Z","date_created":"2021-10-21T07:51:32Z","author":[{"full_name":"Bobolz, Jan","id":"27207","last_name":"Bobolz","first_name":"Jan"},{"first_name":"Fabian","last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian"},{"first_name":"Raphael","last_name":"Heitjohann","full_name":"Heitjohann, Raphael"},{"full_name":"Fell, Jeremy","last_name":"Fell","first_name":"Jeremy"}],"status":"public","type":"preprint","language":[{"iso":"eng"}],"_id":"26645","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"82","name":"SFB 901 - Project Area T"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"64"}],"user_id":"477"},{"year":"2021","citation":{"ieee":"S. B. Schneider, H. Karl, R. Khalili, and A. Hecker, <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>. 2021.","chicago":"Schneider, Stefan Balthasar, Holger Karl, Ramin Khalili, and Artur Hecker. <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.","apa":"Schneider, S. B., Karl, H., Khalili, R., &#38; Hecker, A. (2021). <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>.","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} }","short":"S.B. Schneider, H. Karl, R. Khalili, A. Hecker, DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning, 2021.","mla":"Schneider, Stefan Balthasar, et al. <i>DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning</i>. 2021."},"has_accepted_license":"1","title":"DeepCoMP: Coordinated Multipoint Using Multi-Agent Deep Reinforcement Learning","oa":"1","date_updated":"2022-11-18T09:59:27Z","author":[{"orcid":"0000-0001-8210-4011","last_name":"Schneider","full_name":"Schneider, Stefan Balthasar","id":"35343","first_name":"Stefan Balthasar"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"},{"first_name":"Ramin","full_name":"Khalili, Ramin","last_name":"Khalili"},{"last_name":"Hecker","full_name":"Hecker, Artur","first_name":"Artur"}],"date_created":"2022-10-20T16:44:19Z","abstract":[{"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.","lang":"eng"}],"file":[{"file_size":2521656,"file_name":"preprint.pdf","access_level":"open_access","file_id":"33855","date_updated":"2022-10-20T16:41:10Z","date_created":"2022-10-20T16:41:10Z","creator":"stschn","relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"working_paper","ddc":["004"],"keyword":["mobility management","coordinated multipoint","CoMP","cell selection","resource management","reinforcement learning","multi agent","MARL","self-learning","self-adaptation","QoE"],"file_date_updated":"2022-10-20T16:41:10Z","language":[{"iso":"eng"}],"project":[{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901: SFB 901"}],"_id":"33854","user_id":"477","department":[{"_id":"75"}]},{"date_created":"2021-12-27T12:01:02Z","author":[{"orcid":"0000-0003-1377-3339","last_name":"Hansmeier","full_name":"Hansmeier, Tim","id":"49992","first_name":"Tim"}],"publisher":"Association for Computing Machinery (ACM)","date_updated":"2022-11-18T10:03:24Z","conference":{"location":"Online","end_date":"2021-06-23","start_date":"2021-06-21","name":"International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART ’21)"},"doi":"10.1145/3468044.3468055","title":"Self-aware Operation of Heterogeneous Compute Nodes using the Learning Classifier System XCS","publication_status":"published","citation":{"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} }","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.","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>.","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>","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>.","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>.","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>"},"year":"2021","place":"New York, NY, United States","department":[{"_id":"78"}],"user_id":"477","_id":"29137","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C2: SFB 901 - Subproject C2","_id":"14"}],"language":[{"iso":"eng"}],"publication":"HEART '21: Proceedings of the 11th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies","type":"conference","status":"public"}]