[{"has_accepted_license":"1","year":"2021","citation":{"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>","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>.","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.","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>.","short":"S. Gottschalk, E. Yigitbas, A. Nowosad, G. Engels, in: Enterprise, Business-Process and Information Systems Modeling, Springer, 2021.","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>"},"publisher":"Springer","oa":"1","date_updated":"2022-01-06T06:55:08Z","author":[{"full_name":"Gottschalk, Sebastian","id":"47208","last_name":"Gottschalk","first_name":"Sebastian"},{"id":"8447","full_name":"Yigitbas, Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes"},{"first_name":"Alexander","full_name":"Nowosad, Alexander","last_name":"Nowosad"},{"last_name":"Engels","full_name":"Engels, Gregor","first_name":"Gregor"}],"date_created":"2021-04-20T13:23:41Z","title":"Situation-specific Business Model Development Methods for Mobile App Developers","doi":"10.1007/978-3-030-79186-5_17","type":"conference","publication":"Enterprise, Business-Process and Information Systems Modeling","abstract":[{"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.    ","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2021-07-20T16:19:27Z","creator":"sego","date_updated":"2021-07-20T16:20:15Z","file_name":"EMMSAD21.pdf","file_id":"22769","access_level":"open_access","file_size":638707}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"_id":"21639","user_id":"47208","department":[{"_id":"66"},{"_id":"534"}],"ddc":["000"],"keyword":["Business Model Development","Situational Method Engineering","Mobile App","Business Model Development Tools"],"language":[{"iso":"eng"}],"file_date_updated":"2021-07-20T16:20:15Z"},{"author":[{"first_name":"Joschka","last_name":"Kersting","full_name":"Kersting, Joschka","id":"58701"},{"last_name":"Geierhos","orcid":"0000-0002-8180-5606","full_name":"Geierhos, Michaela","id":"42496","first_name":"Michaela"}],"volume":939,"date_updated":"2022-01-06T06:53:23Z","doi":"10.1007/978-3-030-63787-3_6","publication_status":"published","has_accepted_license":"1","publication_identifier":{"unknown":["978-3-030-63786-6 ; 978-3-030-63787-3"]},"citation":{"mla":"Kersting, Joschka, and Michaela Geierhos. “Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks.” <i>Natural Language Processing in Artificial Intelligence -- NLPinAI 2020</i>, edited by Roussanka Loukanova, vol. 939, Springer, 2021, pp. 163--189, doi:<a href=\"https://doi.org/10.1007/978-3-030-63787-3_6\">10.1007/978-3-030-63787-3_6</a>.","bibtex":"@inbook{Kersting_Geierhos_2021, place={Cham}, series={Studies in Computational Intelligence (SCI)}, title={Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks}, volume={939}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-63787-3_6\">10.1007/978-3-030-63787-3_6</a>}, booktitle={Natural Language Processing in Artificial Intelligence -- NLPinAI 2020}, publisher={Springer}, author={Kersting, Joschka and Geierhos, Michaela}, editor={Loukanova, RoussankaEditor}, year={2021}, pages={163--189}, collection={Studies in Computational Intelligence (SCI)} }","short":"J. Kersting, M. Geierhos, in: R. Loukanova (Ed.), Natural Language Processing in Artificial Intelligence -- NLPinAI 2020, Springer, Cham, 2021, pp. 163--189.","apa":"Kersting, J., &#38; Geierhos, M. (2021). Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks. In R. Loukanova (Ed.), <i>Natural Language Processing in Artificial Intelligence -- NLPinAI 2020</i> (Vol. 939, pp. 163--189). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-030-63787-3_6\">https://doi.org/10.1007/978-3-030-63787-3_6</a>","ama":"Kersting J, Geierhos M. Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks. In: Loukanova R, ed. <i>Natural Language Processing in Artificial Intelligence -- NLPinAI 2020</i>. Vol 939. Studies in Computational Intelligence (SCI). Cham: Springer; 2021:163--189. doi:<a href=\"https://doi.org/10.1007/978-3-030-63787-3_6\">10.1007/978-3-030-63787-3_6</a>","ieee":"J. Kersting and M. Geierhos, “Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks,” in <i>Natural Language Processing in Artificial Intelligence -- NLPinAI 2020</i>, vol. 939, R. Loukanova, Ed. Cham: Springer, 2021, pp. 163--189.","chicago":"Kersting, Joschka, and Michaela Geierhos. “Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks.” In <i>Natural Language Processing in Artificial Intelligence -- NLPinAI 2020</i>, edited by Roussanka Loukanova, 939:163--189. Studies in Computational Intelligence (SCI). Cham: Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-63787-3_6\">https://doi.org/10.1007/978-3-030-63787-3_6</a>."},"page":"163--189 ","intvolume":"       939","place":"Cham","user_id":"58701","series_title":"Studies in Computational Intelligence (SCI)","department":[{"_id":"579"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"_id":"17905","file_date_updated":"2021-04-08T08:14:05Z","type":"book_chapter","status":"public","editor":[{"first_name":"Roussanka","full_name":"Loukanova, Roussanka","last_name":"Loukanova"}],"date_created":"2020-08-13T09:29:52Z","publisher":"Springer","title":"Towards Aspect Extraction and Classification for Opinion Mining with Deep Sequence Networks","year":"2021","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Natural Language Processing in Artificial Intelligence -- NLPinAI 2020","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"jkers","date_created":"2021-04-08T08:14:05Z","date_updated":"2021-04-08T08:14:05Z","file_id":"21594","file_name":"Kersting-Geierhos2021_Chapter_TowardsAspectExtractionAndClas.pdf","access_level":"closed","file_size":512065}],"abstract":[{"text":"This chapter concentrates on aspect-based sentiment analysis, a form of opinion mining where algorithms detect sentiments expressed about features of products, services, etc. We especially focus on novel approaches for aspect phrase extraction and classification trained on feature-rich datasets. Here, we present two new datasets, which we gathered from the linguistically rich domain of physician reviews, as other investigations have mainly concentrated on commercial reviews and social media reviews so far. To give readers a better understanding of the underlying datasets, we describe the annotation process and inter-annotator agreement in detail. In our research, we automatically assess implicit mentions or indications of specific aspects. To do this, we propose and utilize neural network models that perform the here-defined aspect phrase extraction and classification task, achieving F1-score values of about 80% and accuracy values of more than 90%. As we apply our models to a comparatively complex domain, we obtain promising results. ","lang":"eng"}]},{"publication":"Theory of Computing Systems","type":"journal_article","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"20683","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"language":[{"iso":"eng"}],"publication_status":"published","page":"943–984","intvolume":"        65","citation":{"ieee":"B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” <i>Theory of Computing Systems</i>, vol. 65, pp. 943–984, 2021, doi: <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>.","chicago":"Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” <i>Theory of Computing Systems</i> 65 (2021): 943–984. <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">https://doi.org/10.1007/s00224-020-10023-8</a>.","ama":"Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. <i>Theory of Computing Systems</i>. 2021;65:943–984. doi:<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>","short":"B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984.","bibtex":"@article{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2021, title={Managing Multiple Mobile Resources}, volume={65}, DOI={<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>}, journal={Theory of Computing Systems}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2021}, pages={943–984} }","mla":"Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Theory of Computing Systems</i>, vol. 65, 2021, pp. 943–984, doi:<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>.","apa":"Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2021). Managing Multiple Mobile Resources. <i>Theory of Computing Systems</i>, <i>65</i>, 943–984. <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">https://doi.org/10.1007/s00224-020-10023-8</a>"},"year":"2021","volume":65,"author":[{"id":"22704","full_name":"Feldkord, Björn","last_name":"Feldkord","first_name":"Björn"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241","first_name":"Till"},{"full_name":"Malatyali, Manuel","id":"41265","last_name":"Malatyali","first_name":"Manuel"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-12-08T08:40:10Z","date_updated":"2022-01-06T06:54:31Z","doi":"10.1007/s00224-020-10023-8","title":"Managing Multiple Mobile Resources"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"20693","user_id":"35343","department":[{"_id":"75"}],"file_date_updated":"2020-12-11T08:37:37Z","type":"conference","status":"public","date_updated":"2022-01-06T06:54:32Z","oa":"1","author":[{"first_name":"Stefan Balthasar","full_name":"Schneider, Stefan Balthasar","id":"35343","orcid":"0000-0001-8210-4011","last_name":"Schneider"},{"last_name":"Jürgens","full_name":"Jürgens, Mirko","first_name":"Mirko"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"conference":{"location":"Bordeaux, France","name":"IFIP/IEEE International Symposium on Integrated Network Management (IM)"},"has_accepted_license":"1","citation":{"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.","short":"S.B. Schneider, M. Jürgens, H. Karl, in: IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP/IEEE, 2021.","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.","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.","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.","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."},"ddc":["006"],"keyword":["network management","service management","coordination","hierarchical","scalability","nfv"],"language":[{"iso":"eng"}],"publication":"IFIP/IEEE International Symposium on Integrated Network Management (IM)","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."}],"file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2020-12-11T08:37:37Z","creator":"stschn","date_created":"2020-12-11T08:37:37Z","title":"Divide and Conquer: Hierarchical Network and Service Coordination","file_size":7979772,"access_level":"open_access","file_id":"20694","file_name":"preprint_with_header.pdf"}],"publisher":"IFIP/IEEE","date_created":"2020-12-11T08:39:47Z","title":"Divide and Conquer: Hierarchical Network and Service Coordination","quality_controlled":"1","year":"2021"},{"year":"2021","citation":{"ieee":"M. Bienkowski, B. Feldkord, and P. Schmidt, “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location,” in <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2021, pp. 14:1-14:17.","chicago":"Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” In <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 14:1-14:17, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">https://doi.org/10.4230/LIPIcs.STACS.2021.14</a>.","ama":"Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In: <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>. ; 2021:14:1-14:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>","bibtex":"@inproceedings{Bienkowski_Feldkord_Schmidt_2021, title={A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>}, booktitle={Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Feldkord, Björn and Schmidt, Pawel}, year={2021}, pages={14:1-14:17} }","mla":"Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2021, pp. 14:1-14:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>.","short":"M. Bienkowski, B. Feldkord, P. Schmidt, in: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.","apa":"Bienkowski, M., Feldkord, B., &#38; Schmidt, P. (2021). A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i> (pp. 14:1-14:17). <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">https://doi.org/10.4230/LIPIcs.STACS.2021.14</a>"},"page":"14:1 - 14:17","publication_status":"published","title":"A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location","doi":"10.4230/LIPIcs.STACS.2021.14","date_updated":"2022-01-06T06:54:40Z","date_created":"2020-12-21T13:46:16Z","author":[{"full_name":"Bienkowski, Marcin","last_name":"Bienkowski","first_name":"Marcin"},{"first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704"},{"last_name":"Schmidt","full_name":"Schmidt, Pawel","first_name":"Pawel"}],"status":"public","type":"conference","publication":"Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"20817","user_id":"22704","department":[{"_id":"63"}]},{"title":"Situation-specific Development of Business Models for Services in Software Ecosystems","publisher":"CEUR","date_updated":"2022-01-06T06:55:28Z","oa":"1","author":[{"last_name":"Gottschalk","id":"47208","full_name":"Gottschalk, Sebastian","first_name":"Sebastian"}],"date_created":"2021-05-11T12:46:07Z","year":"2021","citation":{"apa":"Gottschalk, S. (2021). Situation-specific Development of Business Models for Services in Software Ecosystems. In <i>Advanced Software Engineering. Doctorial Consortium</i>. CEUR.","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.","mla":"Gottschalk, Sebastian. “Situation-Specific Development of Business Models for Services in Software Ecosystems.” <i>Advanced Software Engineering. Doctorial Consortium</i>, CEUR, 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.","ieee":"S. Gottschalk, “Situation-specific Development of Business Models for Services in Software Ecosystems,” in <i>Advanced Software Engineering. Doctorial Consortium</i>, 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."},"has_accepted_license":"1","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2021-07-20T16:16:05Z","_id":"22155","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"department":[{"_id":"66"},{"_id":"534"}],"user_id":"47208","status":"public","file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"CAISEDC21.pdf","file_id":"22767","file_size":278027,"creator":"sego","date_created":"2021-07-20T16:16:05Z","date_updated":"2021-07-20T16:16:05Z"}],"publication":"Advanced Software Engineering. Doctorial Consortium","type":"conference"},{"year":"2021","title":"Time-Optimal Construction of Overlays","publisher":"ACM","date_created":"2021-06-06T19:10:26Z","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$."}],"file":[{"date_created":"2021-06-06T19:12:49Z","creator":"thgoette","date_updated":"2021-06-06T19:12:49Z","file_id":"22284","access_level":"closed","file_name":"Wicked_Fast_Overlay_Construction(1).pdf","file_size":590875,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)","ddc":["000"],"language":[{"iso":"eng"}],"place":"New York","citation":{"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>.","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} }","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.","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>","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>","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>.","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."},"has_accepted_license":"1","publication_status":"accepted","doi":"10.1145/3465084.3467932","conference":{"location":"Virtual","end_date":"2021-07-30","start_date":"2021-07-26","name":"ACM Symposium on Principles of Distributed Computing (PODC)"},"date_updated":"2022-01-06T06:55:30Z","author":[{"first_name":"Thorsten","last_name":"Götte","full_name":"Götte, Thorsten","id":"34727"},{"first_name":"Kristian","last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian","id":"32229"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024","first_name":"Julian"}],"editor":[{"last_name":"Censor-Hillel","full_name":"Censor-Hillel, Keren","first_name":"Keren"}],"status":"public","type":"conference","file_date_updated":"2021-06-06T19:12:49Z","_id":"22283","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"1","name":"SFB 901"}],"department":[{"_id":"34"}],"user_id":"477"},{"type":"mastersthesis","file":[{"file_id":"22305","access_level":"open_access","file_name":"Masters_Thesis_Stefan_Schott_unsigned.pdf","file_size":1918444,"creator":"fpauck","date_created":"2021-06-09T06:01:45Z","date_updated":"2021-06-09T06:01:45Z","relation":"main_file","content_type":"application/pdf"}],"status":"public","user_id":"477","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"22304","language":[{"iso":"eng"}],"file_date_updated":"2021-06-09T06:01:45Z","extern":"1","ddc":["000"],"has_accepted_license":"1","citation":{"short":"S. Schott, Android App Analysis Benchmark Case Generation, Paderborn, 2021.","bibtex":"@book{Schott_2021, place={Paderborn}, title={Android App Analysis Benchmark Case Generation}, author={Schott, Stefan}, year={2021} }","mla":"Schott, Stefan. <i>Android App Analysis Benchmark Case Generation</i>. 2021.","apa":"Schott, S. (2021). <i>Android App Analysis Benchmark Case Generation</i>. Paderborn.","ama":"Schott S. <i>Android App Analysis Benchmark Case Generation</i>. Paderborn; 2021.","ieee":"S. Schott, <i>Android App Analysis Benchmark Case Generation</i>. Paderborn, 2021.","chicago":"Schott, Stefan. <i>Android App Analysis Benchmark Case Generation</i>. Paderborn, 2021."},"place":"Paderborn","year":"2021","supervisor":[{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_created":"2021-06-09T06:04:12Z","author":[{"first_name":"Stefan","full_name":"Schott, Stefan","id":"54847","last_name":"Schott"}],"oa":"1","date_updated":"2022-01-06T06:55:31Z","title":"Android App Analysis Benchmark Case Generation"},{"title":"Implementation and Profiling of XCS in the Context of Embedded Systems","author":[{"full_name":"Brede, Mathis","last_name":"Brede","first_name":"Mathis"}],"supervisor":[{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"first_name":"Tim","orcid":"0000-0003-1377-3339","last_name":"Hansmeier","id":"49992","full_name":"Hansmeier, Tim"}],"date_created":"2021-06-21T09:35:03Z","date_updated":"2022-01-06T06:55:33Z","publisher":"Paderborn University","citation":{"mla":"Brede, Mathis. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn University, 2021.","short":"M. Brede, Implementation and Profiling of XCS in the Context of Embedded Systems, Paderborn University, Paderborn, 2021.","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} }","apa":"Brede, M. (2021). <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University.","ama":"Brede M. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: 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."},"year":"2021","place":"Paderborn","extern":"1","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"78"}],"project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"1","name":"SFB 901"}],"_id":"22483","status":"public","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."}],"type":"bachelorsthesis"},{"title":"Experimentelle Untersuchung der Visualisierung von Geschäftsmodell-Abhängigkeiten und dessen Auswirkung auf das Verständnis der Nutzer von Geschäftsmodellen","author":[{"last_name":"Frieden","full_name":"Frieden, Paula","first_name":"Paula"}],"date_created":"2021-07-23T08:46:29Z","supervisor":[{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"date_updated":"2022-01-06T06:55:41Z","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} }"},"year":"2021","place":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"16205","_id":"22803","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"status":"public","type":"mastersthesis"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"_id":"22913","user_id":"5786","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"language":[{"iso":"eng"}],"type":"conference","status":"public","date_updated":"2022-01-06T06:55:43Z","date_created":"2021-08-02T07:46:29Z","author":[{"first_name":"Eyke","id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"},{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"full_name":"Tornede, Alexander","id":"38209","last_name":"Tornede","first_name":"Alexander"},{"last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","id":"33176","first_name":"Marcel Dominik"}],"title":"Automated Machine Learning, Bounded Rationality, and Rational Metareasoning","conference":{"location":"Bilbao (Virtual)","end_date":"2021-09-17","start_date":"2021-09-13","name":"ECML/PKDD Workshop on Automating Data Science"},"quality_controlled":"1","year":"2021","citation":{"apa":"Hüllermeier, E., Mohr, F., Tornede, A., &#38; Wever, M. D. (2021). <i>Automated Machine Learning, Bounded Rationality, and Rational Metareasoning</i>. ECML/PKDD Workshop on Automating Data Science, Bilbao (Virtual).","mla":"Hüllermeier, Eyke, et al. <i>Automated Machine Learning, Bounded Rationality, and Rational Metareasoning</i>. 2021.","bibtex":"@inproceedings{Hüllermeier_Mohr_Tornede_Wever_2021, title={Automated Machine Learning, Bounded Rationality, and Rational Metareasoning}, author={Hüllermeier, Eyke and Mohr, Felix and Tornede, Alexander and Wever, Marcel Dominik}, year={2021} }","short":"E. Hüllermeier, F. Mohr, A. Tornede, M.D. Wever, in: 2021.","chicago":"Hüllermeier, Eyke, Felix Mohr, Alexander Tornede, and Marcel Dominik Wever. “Automated Machine Learning, Bounded Rationality, and Rational Metareasoning,” 2021.","ieee":"E. Hüllermeier, F. Mohr, A. Tornede, and M. D. Wever, “Automated Machine Learning, Bounded Rationality, and Rational Metareasoning,” presented at the ECML/PKDD Workshop on Automating Data Science, Bilbao (Virtual), 2021.","ama":"Hüllermeier E, Mohr F, Tornede A, Wever MD. Automated Machine Learning, Bounded Rationality, and Rational Metareasoning. In: ; 2021."}},{"title":"On Strong Observational Refinement and Forward Simulation","publisher":"Schloß Dagstuhl","date_updated":"2022-01-06T06:55:43Z","author":[{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"},{"last_name":"Doherty","full_name":"Doherty, Simon","first_name":"Simon"},{"first_name":"Brijesh","last_name":"Dongol","full_name":"Dongol, Brijesh"},{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2021-08-03T07:38:56Z","year":"2021","citation":{"chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. “On Strong Observational Refinement and Forward Simulation.” In <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Leibniz International Proceedings in Informatics. Schloß Dagstuhl, n.d.","ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “On Strong Observational Refinement and Forward Simulation,” in <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>.","ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. On Strong Observational Refinement and Forward Simulation. In: <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Leibniz International Proceedings in Informatics. Schloß Dagstuhl.","apa":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., &#38; Wehrheim, H. (n.d.). On Strong Observational Refinement and Forward Simulation. In <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Schloß Dagstuhl.","bibtex":"@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim, series={Leibniz International Proceedings in Informatics}, title={On Strong Observational Refinement and Forward Simulation}, booktitle={Proceedings of the 35th International Symposium on Distributed Computing (DISC)}, publisher={Schloß Dagstuhl}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, collection={Leibniz International Proceedings in Informatics} }","short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: Proceedings of the 35th International Symposium on Distributed Computing (DISC), Schloß Dagstuhl, n.d.","mla":"Derrick, John, et al. “On Strong Observational Refinement and Forward Simulation.” <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>, Schloß Dagstuhl."},"publication_status":"accepted","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"_id":"22927","user_id":"477","series_title":"Leibniz International Proceedings in Informatics","department":[{"_id":"7"}],"status":"public","type":"conference","publication":"Proceedings of the 35th International Symposium on Distributed Computing (DISC)"},{"conference":{"location":"Virtual Conference/Workshop","name":"29th European Conference on Information Systems (ECIS)"},"title":"Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems ","date_created":"2021-04-23T13:38:54Z","author":[{"id":"29951","full_name":"Vorbohle, Christian","last_name":"Vorbohle","first_name":"Christian"},{"full_name":"Gottschalk, Sebastian","id":"47208","last_name":"Gottschalk","first_name":"Sebastian"}],"date_updated":"2022-01-06T06:55:12Z","publisher":"AIS","citation":{"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} }","short":"C. Vorbohle, S. Gottschalk, in: Proceedings of the 29th European Conference on Information Systems (ECIS), AIS, n.d.","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.","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.","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."},"year":"2021","publication_status":"accepted","language":[{"iso":"eng"}],"keyword":["Platform Ecosystems","Platform Ecosystem Modeling Language","Platform Ecosystem Development Tool","Business Models","Design Science"],"department":[{"_id":"66"},{"_id":"534"},{"_id":"276"}],"user_id":"47208","_id":"21727","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"status":"public","abstract":[{"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. ","lang":"eng"}],"publication":"Proceedings of the 29th European Conference on Information Systems (ECIS)","type":"conference"},{"year":"2021","citation":{"mla":"Kutzner, K., et al. “”Sorry, Too Much Information” Designing Online Review Systems That Support Information Search and Processing.” <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, 2021.","short":"K. Kutzner, M. Stadtländer, J. Seutter, D. Kundisch, R. Knackstedt, in: Proceedings of the 29th European Conference on Information Systems (ECIS), 2021.","bibtex":"@inproceedings{Kutzner_Stadtländer_Seutter_Kundisch_Knackstedt_2021, title={”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing}, booktitle={Proceedings of the 29th European Conference on Information Systems (ECIS)}, author={Kutzner, K. and Stadtländer, M. and Seutter, Janina and Kundisch, Dennis and Knackstedt, R.}, year={2021} }","apa":"Kutzner, K., Stadtländer, M., Seutter, J., Kundisch, D., &#38; Knackstedt, R. (2021). ”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing. In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. Virtual Conference/Workshop.","ama":"Kutzner K, Stadtländer M, Seutter J, Kundisch D, Knackstedt R. ”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing. In: <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. ; 2021.","ieee":"K. Kutzner, M. Stadtländer, J. Seutter, D. Kundisch, and R. Knackstedt, “”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing,” in <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, Virtual Conference/Workshop, 2021.","chicago":"Kutzner, K., M. Stadtländer, Janina Seutter, Dennis Kundisch, and R. Knackstedt. “”Sorry, Too Much Information” Designing Online Review Systems That Support Information Search and Processing.” In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, 2021."},"date_updated":"2022-01-06T06:55:13Z","author":[{"first_name":"K.","last_name":"Kutzner","full_name":"Kutzner, K."},{"last_name":"Stadtländer","full_name":"Stadtländer, M.","first_name":"M."},{"id":"64464","full_name":"Seutter, Janina","last_name":"Seutter","first_name":"Janina"},{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"},{"last_name":"Knackstedt","full_name":"Knackstedt, R.","first_name":"R."}],"date_created":"2021-04-26T10:46:22Z","title":"”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing","conference":{"name":"29th European Conference on Information Systems (ECIS)","location":"Virtual Conference/Workshop"},"type":"conference","publication":"Proceedings of the 29th European Conference on Information Systems (ECIS)","status":"public","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"name":"SFB 901","_id":"1"}],"_id":"21799","user_id":"477","department":[{"_id":"276"}],"language":[{"iso":"eng"}]},{"doi":"10.1109/TNSM.2021.3076503","title":"Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning","date_created":"2021-04-27T08:04:16Z","author":[{"id":"35343","full_name":"Schneider, Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","first_name":"Stefan Balthasar"},{"last_name":"Khalili","full_name":"Khalili, Ramin","first_name":"Ramin"},{"last_name":"Manzoor","full_name":"Manzoor, Adnan","first_name":"Adnan"},{"first_name":"Haydar","full_name":"Qarawlus, Haydar","last_name":"Qarawlus"},{"first_name":"Rafael","full_name":"Schellenberg, Rafael","last_name":"Schellenberg"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"},{"last_name":"Hecker","full_name":"Hecker, Artur","first_name":"Artur"}],"date_updated":"2022-01-06T06:55:15Z","oa":"1","publisher":"IEEE","citation":{"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>","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} }","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>.","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.","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>"},"year":"2021","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2021-04-27T08:01:26Z","ddc":["000"],"article_type":"original","keyword":["network management","service management","coordination","reinforcement learning","self-learning","self-adaptation","multi-objective"],"user_id":"35343","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"21808","file":[{"date_created":"2021-04-27T08:01:26Z","creator":"stschn","date_updated":"2021-04-27T08:01:26Z","access_level":"open_access","file_name":"ris-accepted-version.pdf","file_id":"21809","file_size":4172270,"description":"Author version of the accepted paper","content_type":"application/pdf","relation":"main_file"}],"status":"public","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."}],"type":"journal_article","publication":"Transactions on Network and Service Management"},{"language":[{"iso":"eng"}],"department":[{"_id":"276"}],"user_id":"477","_id":"21812","project":[{"name":"SFB 901","_id":"1"},{"_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","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":[{"id":"29951","full_name":"Vorbohle, Christian","last_name":"Vorbohle","first_name":"Christian"},{"last_name":"Szopinski","full_name":"Szopinski, Daniel","id":"36372","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":{"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.","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} }","short":"C. Vorbohle, D. Szopinski, D. Kundisch, in: Proceedings of the 29th European Conference on Information Systems (ECIS), 2021.","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.","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.","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.","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."},"year":"2021"},{"status":"public","publication":"Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021)","type":"conference","language":[{"iso":"eng"}],"_id":"22051","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"department":[{"_id":"579"}],"user_id":"58701","year":"2021","place":"Online","page":"275--284","citation":{"apa":"Kersting, J., &#38; Geierhos, M. (2021). Well-being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations. <i>Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021)</i>, 275--284.","mla":"Kersting, Joschka, and Michaela Geierhos. “Well-Being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations.” <i>Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021)</i>, SCITEPRESS, 2021, pp. 275--284.","bibtex":"@inproceedings{Kersting_Geierhos_2021, place={Online}, title={Well-being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations}, booktitle={Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021)}, publisher={SCITEPRESS}, author={Kersting, Joschka and Geierhos, Michaela}, year={2021}, pages={275--284} }","short":"J. Kersting, M. Geierhos, in: Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021), SCITEPRESS, Online, 2021, pp. 275--284.","chicago":"Kersting, Joschka, and Michaela Geierhos. “Well-Being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations.” In <i>Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021)</i>, 275--284. Online: SCITEPRESS, 2021.","ieee":"J. Kersting and M. Geierhos, “Well-being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations,” in <i>Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021)</i>, Online, 2021, pp. 275--284.","ama":"Kersting J, Geierhos M. Well-being in Plastic Surgery: Deep Learning Reveals Patients’ Evaluations. In: <i>Proceedings of the 10th International Conference on Data Science, Technology and Applications (DATA 2021)</i>. SCITEPRESS; 2021:275--284."},"publication_status":"published","title":"Well-being in Plastic Surgery: Deep Learning Reveals Patients' Evaluations","conference":{"end_date":"2021-07-08","location":"Online","name":"10th International Conference on Data Science, Technology and Applications (DATA 2021)","start_date":"2021-07-06"},"publisher":"SCITEPRESS","date_updated":"2022-01-06T06:55:23Z","date_created":"2021-05-07T16:27:27Z","author":[{"first_name":"Joschka","last_name":"Kersting","id":"58701","full_name":"Kersting, Joschka"},{"first_name":"Michaela","orcid":"0000-0002-8180-5606","last_name":"Geierhos","id":"42496","full_name":"Geierhos, Michaela"}]},{"language":[{"iso":"eng"}],"ddc":["000"],"publication":"Public-Key Cryptography – PKC 2021","file":[{"file_size":701068,"file_id":"22058","file_name":"Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via N.pdf","access_level":"closed","date_updated":"2021-05-10T16:02:02Z","date_created":"2021-05-10T16:02:02Z","creator":"davnie","relation":"main_file","content_type":"application/pdf"}],"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."}],"date_created":"2021-05-10T15:56:24Z","title":"Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance","year":"2021","user_id":"36113","department":[{"_id":"558"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"22057","file_date_updated":"2021-05-10T16:02:02Z","type":"book_chapter","status":"public","author":[{"first_name":"Tibor","full_name":"Jager, Tibor","last_name":"Jager"},{"full_name":"Kurek, Rafael","last_name":"Kurek","first_name":"Rafael"},{"last_name":"Niehues","full_name":"Niehues, David","id":"36113","first_name":"David"}],"date_updated":"2022-01-06T06:55:23Z","doi":"10.1007/978-3-030-75245-3_22","publication_status":"published","publication_identifier":{"isbn":["9783030752446","9783030752453"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","citation":{"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>","short":"T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021, 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} }","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>.","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."},"place":"Cham"},{"doi":"10.1007/978-3-030-75248-4_3","title":"Verifiable Random Functions with Optimal Tightness","author":[{"id":"36113","full_name":"Niehues, David","last_name":"Niehues","first_name":"David"}],"date_created":"2021-05-10T16:07:50Z","date_updated":"2022-01-06T06:55:24Z","citation":{"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>","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.","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>.","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} }"},"place":"Cham","year":"2021","publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["9783030752477","9783030752484"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"file_date_updated":"2021-05-10T16:09:17Z","ddc":["000"],"user_id":"36113","department":[{"_id":"558"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"22059","file":[{"relation":"main_file","content_type":"application/pdf","file_size":697361,"access_level":"closed","file_name":"Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf","file_id":"22060","date_updated":"2021-05-10T16:09:17Z","creator":"davnie","date_created":"2021-05-10T16:09:17Z"}],"status":"public","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."}],"type":"book_chapter","publication":"Public-Key Cryptography – PKC 2021"},{"publication":"Proceedings of International Symposium on Applied Reconfigurable Computing (ARC'21)","type":"conference","status":"public","editor":[{"last_name":"Hannig","full_name":"Hannig, Frank","first_name":"Frank"},{"first_name":"Steven","last_name":"Derrien","full_name":"Derrien, Steven"},{"last_name":"Diniz","full_name":"Diniz, Pedro","first_name":"Pedro"},{"first_name":"Daniel","last_name":"Chillet","full_name":"Chillet, Daniel"}],"department":[{"_id":"78"}],"user_id":"3118","series_title":"Reconfigurable Computing: Architectures, Tools, and Applications","_id":"21953","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"language":[{"iso":"eng"}],"publication_status":"accepted","citation":{"apa":"Witschen, L. M., Wiersema, T., Raeisi Nafchi, M., Bockhorn, A., &#38; Platzner, M. (n.d.). Timing Optimization for Virtual FPGA Configurations. In F. Hannig, S. Derrien, P. Diniz, &#38; D. Chillet (Eds.), <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>. Springer Lecture Notes in Computer Science. <a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">https://doi.org/10.1007/978-3-030-79025-7_4</a>","bibtex":"@inproceedings{Witschen_Wiersema_Raeisi Nafchi_Bockhorn_Platzner, series={Reconfigurable Computing: Architectures, Tools, and Applications}, title={Timing Optimization for Virtual FPGA Configurations}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>}, booktitle={Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)}, publisher={Springer Lecture Notes in Computer Science}, author={Witschen, Linus Matthias and Wiersema, Tobias and Raeisi Nafchi, Masood and Bockhorn, Arne and Platzner, Marco}, editor={Hannig, Frank and Derrien, Steven and Diniz, Pedro and Chillet, Daniel}, collection={Reconfigurable Computing: Architectures, Tools, and Applications} }","short":"L.M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, M. Platzner, in: F. Hannig, S. Derrien, P. Diniz, D. Chillet (Eds.), Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21), Springer Lecture Notes in Computer Science, n.d.","mla":"Witschen, Linus Matthias, et al. “Timing Optimization for Virtual FPGA Configurations.” <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>, edited by Frank Hannig et al., Springer Lecture Notes in Computer Science, doi:<a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>.","ama":"Witschen LM, Wiersema T, Raeisi Nafchi M, Bockhorn A, Platzner M. Timing Optimization for Virtual FPGA Configurations. In: Hannig F, Derrien S, Diniz P, Chillet D, eds. <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>. Reconfigurable Computing: Architectures, Tools, and Applications. Springer Lecture Notes in Computer Science. doi:<a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Masood Raeisi Nafchi, Arne Bockhorn, and Marco Platzner. “Timing Optimization for Virtual FPGA Configurations.” In <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>, edited by Frank Hannig, Steven Derrien, Pedro Diniz, and Daniel Chillet. Reconfigurable Computing: Architectures, Tools, and Applications. Springer Lecture Notes in Computer Science, n.d. <a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">https://doi.org/10.1007/978-3-030-79025-7_4</a>.","ieee":"L. M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, and M. Platzner, “Timing Optimization for Virtual FPGA Configurations,” in <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>, Virtual conference, doi: <a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>."},"year":"2021","date_created":"2021-05-04T14:18:46Z","author":[{"last_name":"Witschen","full_name":"Witschen, Linus Matthias","id":"49051","first_name":"Linus Matthias"},{"last_name":"Wiersema","id":"3118","full_name":"Wiersema, Tobias","first_name":"Tobias"},{"full_name":"Raeisi Nafchi, Masood","last_name":"Raeisi Nafchi","first_name":"Masood"},{"last_name":"Bockhorn","full_name":"Bockhorn, Arne","first_name":"Arne"},{"first_name":"Marco","last_name":"Platzner","id":"398","full_name":"Platzner, Marco"}],"publisher":"Springer Lecture Notes in Computer Science","date_updated":"2022-02-14T11:03:09Z","doi":"10.1007/978-3-030-79025-7_4","conference":{"end_date":"2021-07-01","location":"Virtual conference","name":"International Symposium on Applied Reconfigurable Computing","start_date":"2021-06-29"},"title":"Timing Optimization for Virtual FPGA Configurations"}]