[{"type":"bachelorsthesis","status":"public","_id":"20820","project":[{"_id":"1","name":"SFB 901"},{"_id":"82","name":"SFB 901 - Project Area T"},{"_id":"83","name":"SFB 901 -Subproject T1"}],"department":[{"_id":"78"}],"user_id":"74287","language":[{"iso":"eng"}],"year":"2020","citation":{"ama":"Thiele S. <i>Implementing Machine Learning Functions as PYNQ FPGA Overlays</i>.; 2020.","chicago":"Thiele, Simon. <i>Implementing Machine Learning Functions as PYNQ FPGA Overlays</i>, 2020.","ieee":"S. Thiele, <i>Implementing Machine Learning Functions as PYNQ FPGA Overlays</i>. 2020.","bibtex":"@book{Thiele_2020, title={Implementing Machine Learning Functions as PYNQ FPGA Overlays}, author={Thiele, Simon}, year={2020} }","short":"S. Thiele, Implementing Machine Learning Functions as PYNQ FPGA Overlays, 2020.","mla":"Thiele, Simon. <i>Implementing Machine Learning Functions as PYNQ FPGA Overlays</i>. 2020.","apa":"Thiele, S. (2020). <i>Implementing Machine Learning Functions as PYNQ FPGA Overlays</i>."},"date_updated":"2022-01-06T06:54:40Z","date_created":"2020-12-21T13:59:55Z","supervisor":[{"full_name":"Clausing, Lennart","id":"74287","orcid":"0000-0003-3789-6034","last_name":"Clausing","first_name":"Lennart"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"},{"first_name":"Christian","id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl"}],"author":[{"first_name":"Simon","full_name":"Thiele, Simon","last_name":"Thiele"}],"title":"Implementing Machine Learning Functions as PYNQ FPGA Overlays"},{"department":[{"_id":"78"}],"user_id":"74287","_id":"20821","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area T","_id":"82"},{"_id":"83","name":"SFB 901 -Subproject T1"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","author":[{"full_name":"Jaganath, Vivek","last_name":"Jaganath","first_name":"Vivek"}],"supervisor":[{"id":"74287","full_name":"Clausing, Lennart","last_name":"Clausing","orcid":"0000-0003-3789-6034","first_name":"Lennart"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"}],"date_created":"2020-12-21T14:02:42Z","date_updated":"2022-01-06T06:54:40Z","title":"Extension and Evaluation of Python-based High-Level Synthesis Tool Flows","citation":{"ama":"Jaganath V. <i>Extension and Evaluation of Python-Based High-Level Synthesis Tool Flows</i>.; 2020.","chicago":"Jaganath, Vivek. <i>Extension and Evaluation of Python-Based High-Level Synthesis Tool Flows</i>, 2020.","ieee":"V. Jaganath, <i>Extension and Evaluation of Python-based High-Level Synthesis Tool Flows</i>. 2020.","mla":"Jaganath, Vivek. <i>Extension and Evaluation of Python-Based High-Level Synthesis Tool Flows</i>. 2020.","bibtex":"@book{Jaganath_2020, title={Extension and Evaluation of Python-based High-Level Synthesis Tool Flows}, author={Jaganath, Vivek}, year={2020} }","short":"V. Jaganath, Extension and Evaluation of Python-Based High-Level Synthesis Tool Flows, 2020.","apa":"Jaganath, V. (2020). <i>Extension and Evaluation of Python-based High-Level Synthesis Tool Flows</i>."},"year":"2020"},{"year":"2020","citation":{"ieee":"M. Skowronek, <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020.","chicago":"Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020.","ama":"Skowronek M. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn; 2020.","apa":"Skowronek, M. (2020). <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn.","bibtex":"@book{Skowronek_2020, title={Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks}, publisher={Universität Paderborn}, author={Skowronek, Michael}, year={2020} }","short":"M. Skowronek, Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks, Universität Paderborn, 2020.","mla":"Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020."},"title":"Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","author":[{"first_name":"Michael","full_name":"Skowronek, Michael","last_name":"Skowronek"}],"supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2020-08-20T07:40:58Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"18066","user_id":"477","department":[{"_id":"79"}]},{"ddc":["000"],"keyword":["Product Configuration","Augmented Reality","Runtime Adaptation","Dynamic Software Product Lines"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Augmented Reality (AR) has recently found high attention in mobile shopping apps such as in domains like furniture or decoration. Here, the developers of the apps focus on the positioning of atomic 3D objects in the physical environment. With this focus, they neglect the configuration of multi-faceted 3D object composition according to the user needs and environmental constraints. To tackle these challenges, we present a model-based approach to support AR-assisted product con-figuration based on the concept of Dynamic Software Product Lines. Our approach splits products (e.g. table) into parts (e.g. tabletop, ta-ble legs, funnier) with their 3D objects and additional information (e.g. name, price). The possible products, which can be configured out of these parts, are stored in a feature model. At runtime, this feature model can be used to configure 3D object compositions out of the product parts and adapt to user needs and environmental constraints. The benefits of this approach are demonstrated by a case study of configuring modular kitchens with the help of a prototypical mobile-based implementation."}],"file":[{"relation":"main_file","content_type":"application/pdf","file_name":"HCSE20_full.pdf","access_level":"open_access","file_id":"20541","file_size":2258601,"creator":"sego","date_created":"2020-11-30T08:33:30Z","date_updated":"2020-11-30T08:36:52Z"}],"publication":"Human-Centered Software Engineering. HCSE 2020","title":"Model-based Product Configuration in Augmented Reality Applications","publisher":"Springer","date_created":"2020-08-25T08:27:38Z","year":"2020","file_date_updated":"2020-11-30T08:36:52Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"18249","user_id":"47208","series_title":"Lecture Notes in Computer Science","department":[{"_id":"66"},{"_id":"534"}],"editor":[{"last_name":"Bernhaupt","full_name":"Bernhaupt, Regina","first_name":"Regina"},{"first_name":"Carmelo","last_name":"Ardito","full_name":"Ardito, Carmelo"},{"last_name":"Sauer","full_name":"Sauer, Stefan","first_name":"Stefan"}],"status":"public","type":"conference","doi":"10.1007/978-3-030-64266-2_5","conference":{"end_date":"2020-12-02","location":"Eindhoven","name":"8th International Working Conference on Human-Centered Software Engineering (HCSE'20)","start_date":"2020-11-30"},"date_updated":"2022-01-06T06:53:28Z","oa":"1","author":[{"full_name":"Gottschalk, Sebastian","id":"47208","last_name":"Gottschalk","first_name":"Sebastian"},{"orcid":"0000-0002-5967-833X","last_name":"Yigitbas","id":"8447","full_name":"Yigitbas, Enes","first_name":"Enes"},{"first_name":"Eugen","full_name":"Schmidt, Eugen","last_name":"Schmidt"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"}],"volume":12481,"place":"Cham","citation":{"chicago":"Gottschalk, Sebastian, Enes Yigitbas, Eugen Schmidt, and Gregor Engels. “Model-Based Product Configuration in Augmented Reality Applications.” In <i>Human-Centered Software Engineering. HCSE 2020</i>, edited by Regina Bernhaupt, Carmelo Ardito, and Stefan Sauer, Vol. 12481. Lecture Notes in Computer Science. Cham: Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64266-2_5\">https://doi.org/10.1007/978-3-030-64266-2_5</a>.","ieee":"S. Gottschalk, E. Yigitbas, E. Schmidt, and G. Engels, “Model-based Product Configuration in Augmented Reality Applications,” in <i>Human-Centered Software Engineering. HCSE 2020</i>, Eindhoven, 2020, vol. 12481.","ama":"Gottschalk S, Yigitbas E, Schmidt E, Engels G. Model-based Product Configuration in Augmented Reality Applications. In: Bernhaupt R, Ardito C, Sauer S, eds. <i>Human-Centered Software Engineering. HCSE 2020</i>. Vol 12481. Lecture Notes in Computer Science. Cham: Springer; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-64266-2_5\">10.1007/978-3-030-64266-2_5</a>","short":"S. Gottschalk, E. Yigitbas, E. Schmidt, G. Engels, in: R. Bernhaupt, C. Ardito, S. Sauer (Eds.), Human-Centered Software Engineering. HCSE 2020, Springer, Cham, 2020.","bibtex":"@inproceedings{Gottschalk_Yigitbas_Schmidt_Engels_2020, place={Cham}, series={Lecture Notes in Computer Science}, title={Model-based Product Configuration in Augmented Reality Applications}, volume={12481}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64266-2_5\">10.1007/978-3-030-64266-2_5</a>}, booktitle={Human-Centered Software Engineering. HCSE 2020}, publisher={Springer}, author={Gottschalk, Sebastian and Yigitbas, Enes and Schmidt, Eugen and Engels, Gregor}, editor={Bernhaupt, Regina and Ardito, Carmelo and Sauer, StefanEditors}, year={2020}, collection={Lecture Notes in Computer Science} }","mla":"Gottschalk, Sebastian, et al. “Model-Based Product Configuration in Augmented Reality Applications.” <i>Human-Centered Software Engineering. HCSE 2020</i>, edited by Regina Bernhaupt et al., vol. 12481, Springer, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-64266-2_5\">10.1007/978-3-030-64266-2_5</a>.","apa":"Gottschalk, S., Yigitbas, E., Schmidt, E., &#38; Engels, G. (2020). Model-based Product Configuration in Augmented Reality Applications. In R. Bernhaupt, C. Ardito, &#38; S. Sauer (Eds.), <i>Human-Centered Software Engineering. HCSE 2020</i> (Vol. 12481). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-030-64266-2_5\">https://doi.org/10.1007/978-3-030-64266-2_5</a>"},"intvolume":"     12481","publication_status":"published","has_accepted_license":"1"},{"date_updated":"2022-01-06T06:53:28Z","author":[{"first_name":"Alexander","full_name":"Tornede, Alexander","id":"38209","last_name":"Tornede"},{"orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","id":"33176","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik"},{"full_name":"Werner, Stefan","last_name":"Werner","first_name":"Stefan"},{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"}],"date_created":"2020-08-25T12:09:28Z","title":"Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis","conference":{"name":"12th Asian Conference on Machine Learning","start_date":"2020-11-18","end_date":"2020-11-20","location":"Bangkok, Thailand"},"main_file_link":[{"url":"https://arxiv.org/pdf/2007.02816.pdf"}],"year":"2020","citation":{"apa":"Tornede, A., Wever, M. D., Werner, S., Mohr, F., &#38; Hüllermeier, E. (2020). Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis. <i>ACML 2020</i>. 12th Asian Conference on Machine Learning, Bangkok, Thailand.","bibtex":"@inproceedings{Tornede_Wever_Werner_Mohr_Hüllermeier_2020, title={Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis}, booktitle={ACML 2020}, author={Tornede, Alexander and Wever, Marcel Dominik and Werner, Stefan and Mohr, Felix and Hüllermeier, Eyke}, year={2020} }","short":"A. Tornede, M.D. Wever, S. Werner, F. Mohr, E. Hüllermeier, in: ACML 2020, 2020.","mla":"Tornede, Alexander, et al. “Run2Survive: A Decision-Theoretic Approach to Algorithm Selection Based on Survival Analysis.” <i>ACML 2020</i>, 2020.","ama":"Tornede A, Wever MD, Werner S, Mohr F, Hüllermeier E. Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis. In: <i>ACML 2020</i>. ; 2020.","ieee":"A. Tornede, M. D. Wever, S. Werner, F. Mohr, and E. Hüllermeier, “Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis,” presented at the 12th Asian Conference on Machine Learning, Bangkok, Thailand, 2020.","chicago":"Tornede, Alexander, Marcel Dominik Wever, Stefan Werner, Felix Mohr, and Eyke Hüllermeier. “Run2Survive: A Decision-Theoretic Approach to Algorithm Selection Based on Survival Analysis.” In <i>ACML 2020</i>, 2020."},"_id":"18276","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"user_id":"5786","language":[{"iso":"eng"}],"publication":"ACML 2020","type":"conference","abstract":[{"lang":"eng","text":"Algorithm selection (AS) deals with the automatic selection of an algorithm\r\nfrom a fixed set of candidate algorithms most suitable for a specific instance\r\nof an algorithmic problem class, where \"suitability\" often refers to an\r\nalgorithm's runtime. Due to possibly extremely long runtimes of candidate\r\nalgorithms, training data for algorithm selection models is usually generated\r\nunder time constraints in the sense that not all algorithms are run to\r\ncompletion on all instances. Thus, training data usually comprises censored\r\ninformation, as the true runtime of algorithms timed out remains unknown.\r\nHowever, many standard AS approaches are not able to handle such information in\r\na proper way. On the other side, survival analysis (SA) naturally supports\r\ncensored data and offers appropriate ways to use such data for learning\r\ndistributional models of algorithm runtime, as we demonstrate in this work. We\r\nleverage such models as a basis of a sophisticated decision-theoretic approach\r\nto algorithm selection, which we dub Run2Survive. Moreover, taking advantage of\r\na framework of this kind, we advocate a risk-averse approach to algorithm\r\nselection, in which the avoidance of a timeout is given high priority. In an\r\nextensive experimental study with the standard benchmark ASlib, our approach is\r\nshown to be highly competitive and in many cases even superior to\r\nstate-of-the-art AS approaches."}],"status":"public"},{"citation":{"apa":"Setzer, A. (2020). <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-1026\">https://doi.org/10.17619/UNIPB/1-1026</a>","bibtex":"@book{Setzer_2020, title={Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1026\">10.17619/UNIPB/1-1026</a>}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2020} }","mla":"Setzer, Alexander. <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn, 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1026\">10.17619/UNIPB/1-1026</a>.","short":"A. Setzer, Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks, Universität Paderborn, 2020.","ieee":"A. Setzer, <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn, 2020.","chicago":"Setzer, Alexander. <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-1026\">https://doi.org/10.17619/UNIPB/1-1026</a>.","ama":"Setzer A. <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1026\">10.17619/UNIPB/1-1026</a>"},"year":"2020","doi":"10.17619/UNIPB/1-1026","title":"Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"author":[{"last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108","first_name":"Alexander"}],"date_created":"2020-08-28T06:50:29Z","date_updated":"2022-01-06T06:53:36Z","publisher":"Universität Paderborn","status":"public","type":"dissertation","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"18520"},{"status":"public","file":[{"date_created":"2020-10-23T08:36:34Z","creator":"feidens","date_updated":"2020-10-23T08:36:34Z","file_id":"20186","access_level":"open_access","file_name":"thesis_schuermann_published.pdf","file_size":1060142,"description":"This is a bachelor thesis.","content_type":"application/pdf","relation":"main_file"}],"type":"bachelorsthesis","ddc":["000"],"extern":"1","file_date_updated":"2020-10-23T08:36:34Z","language":[{"iso":"eng"}],"_id":"18637","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"7"},{"_id":"64"}],"user_id":"25078","year":"2020","citation":{"chicago":"Schürmann, Patrick. <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn, 2020.","ieee":"P. Schürmann, <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn, 2020.","ama":"Schürmann P. <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn; 2020.","short":"P. Schürmann, A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes, Universität Paderborn, 2020.","mla":"Schürmann, Patrick. <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn, 2020.","bibtex":"@book{Schürmann_2020, title={A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes}, publisher={Universität Paderborn}, author={Schürmann, Patrick}, year={2020} }","apa":"Schürmann, P. (2020). <i>A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes</i>. Universität Paderborn."},"has_accepted_license":"1","title":"A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes","publisher":"Universität Paderborn","oa":"1","date_updated":"2022-01-06T06:53:50Z","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"date_created":"2020-08-29T13:24:51Z","author":[{"first_name":"Patrick","last_name":"Schürmann","full_name":"Schürmann, Patrick"}]},{"year":"2020","citation":{"ama":"Terfort T. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn; 2020.","ieee":"T. Terfort, <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn, 2020.","chicago":"Terfort, Tobias. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn, 2020.","apa":"Terfort, T. (2020). <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn.","mla":"Terfort, Tobias. <i>Enhancing Security by Usage of Universal One-Way Hash Functions</i>. Universität Paderborn, 2020.","bibtex":"@book{Terfort_2020, title={Enhancing Security by Usage of Universal One-Way Hash Functions}, publisher={Universität Paderborn}, author={Terfort, Tobias}, year={2020} }","short":"T. Terfort, Enhancing Security by Usage of Universal One-Way Hash Functions, Universität Paderborn, 2020."},"title":"Enhancing Security by Usage of Universal One-Way Hash Functions","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:50Z","supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"author":[{"first_name":"Tobias","full_name":"Terfort, Tobias","last_name":"Terfort"}],"date_created":"2020-08-29T13:30:56Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"18639","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"7"},{"_id":"64"}],"user_id":"477"},{"type":"bachelorsthesis","status":"public","department":[{"_id":"79"}],"user_id":"477","_id":"18648","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"eng"}],"citation":{"bibtex":"@book{Guggenmos_2020, title={Algorithmen für selbststabilisierende Skip+-Delaunaygraphen}, publisher={Universität Paderborn}, author={Guggenmos, Andreas}, year={2020} }","short":"A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen, Universität Paderborn, 2020.","mla":"Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","apa":"Guggenmos, A. (2020). <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn.","ieee":"A. Guggenmos, <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","chicago":"Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","ama":"Guggenmos A. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn; 2020."},"year":"2020","date_created":"2020-08-31T07:14:51Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"author":[{"first_name":"Andreas","last_name":"Guggenmos","full_name":"Guggenmos, Andreas"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:50Z","title":"Algorithmen für selbststabilisierende Skip+-Delaunaygraphen"},{"status":"public","type":"working_paper","language":[{"iso":"ger"}],"department":[{"_id":"276"}],"series_title":"Update - Das Magazin des SICP–Software Innovation Campus Paderborn","user_id":"477","_id":"22161","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"},{"_id":"97","name":"its OWL - Digital Business"}],"intvolume":"         3","page":"1","citation":{"chicago":"Kundisch, Dennis. <i>Digitale mehrseitige Plattformen – Besser verstehen, wie digitale Plattformen funktionieren</i>. Vol. 3. Update - Das Magazin des SICP–Software Innovation Campus Paderborn, 2020.","ieee":"D. Kundisch, <i>Digitale mehrseitige Plattformen – Besser verstehen, wie digitale Plattformen funktionieren</i>, vol. 3. 2020.","ama":"Kundisch D. <i>Digitale mehrseitige Plattformen – Besser verstehen, wie digitale Plattformen funktionieren</i>. Vol 3.; 2020.","apa":"Kundisch, D. (2020). <i>Digitale mehrseitige Plattformen – Besser verstehen, wie digitale Plattformen funktionieren</i> (Vol. 3).","bibtex":"@book{Kundisch_2020, series={Update - Das Magazin des SICP–Software Innovation Campus Paderborn}, title={Digitale mehrseitige Plattformen – Besser verstehen, wie digitale Plattformen funktionieren}, volume={3}, author={Kundisch, Dennis}, year={2020}, collection={Update - Das Magazin des SICP–Software Innovation Campus Paderborn} }","mla":"Kundisch, Dennis. <i>Digitale mehrseitige Plattformen – Besser verstehen, wie digitale Plattformen funktionieren</i>. Vol. 3, 2020.","short":"D. Kundisch, Digitale mehrseitige Plattformen – Besser verstehen, wie digitale Plattformen funktionieren, 2020."},"year":"2020","title":"Digitale mehrseitige Plattformen – Besser verstehen, wie digitale Plattformen funktionieren","volume":3,"author":[{"last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis"}],"date_created":"2021-05-12T13:09:15Z","date_updated":"2022-01-06T06:55:28Z"},{"publication":"Electronic Markets","type":"journal_article","status":"public","file":[{"file_name":"Szopinski et al 2019 EM BMDT.pdf","access_level":"closed","file_id":"6735","file_size":1014012,"creator":"dsz","date_created":"2019-01-15T13:13:48Z","date_updated":"2019-01-15T13:13:48Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"department":[{"_id":"276"}],"user_id":"16205","_id":"6202","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"language":[{"iso":"eng"}],"file_date_updated":"2019-01-15T13:13:48Z","ddc":["040"],"issue":"3","has_accepted_license":"1","publication_status":"epub_ahead","page":"469-494","intvolume":"        30","citation":{"ieee":"D. Szopinski, T. Schoormann, T. John, R. Knackstedt, and D. Kundisch, “Software tools for business model innovation: Current state and future challenges,” <i>Electronic Markets</i>, vol. 30, no. 3, pp. 469–494, 2020.","chicago":"Szopinski, Daniel, T. Schoormann, Thomas John, R. Knackstedt, and Dennis Kundisch. “Software Tools for Business Model Innovation: Current State and Future Challenges.” <i>Electronic Markets</i> 30, no. 3 (2020): 469–94.","ama":"Szopinski D, Schoormann T, John T, Knackstedt R, Kundisch D. Software tools for business model innovation: Current state and future challenges. <i>Electronic Markets</i>. 2020;30(3):469-494.","short":"D. Szopinski, T. Schoormann, T. John, R. Knackstedt, D. Kundisch, Electronic Markets 30 (2020) 469–494.","bibtex":"@article{Szopinski_Schoormann_John_Knackstedt_Kundisch_2020, title={Software tools for business model innovation: Current state and future challenges}, volume={30}, number={3}, journal={Electronic Markets}, author={Szopinski, Daniel and Schoormann, T. and John, Thomas and Knackstedt, R. and Kundisch, Dennis}, year={2020}, pages={469–494} }","mla":"Szopinski, Daniel, et al. “Software Tools for Business Model Innovation: Current State and Future Challenges.” <i>Electronic Markets</i>, vol. 30, no. 3, 2020, pp. 469–94.","apa":"Szopinski, D., Schoormann, T., John, T., Knackstedt, R., &#38; Kundisch, D. (2020). Software tools for business model innovation: Current state and future challenges. <i>Electronic Markets</i>, <i>30</i>(3), 469–494."},"year":"2020","volume":30,"author":[{"full_name":"Szopinski, Daniel","id":"36372","last_name":"Szopinski","first_name":"Daniel"},{"first_name":"T.","last_name":"Schoormann","full_name":"Schoormann, T."},{"first_name":"Thomas","last_name":"John","id":"3952","full_name":"John, Thomas"},{"full_name":"Knackstedt, R.","last_name":"Knackstedt","first_name":"R."},{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"date_created":"2018-12-14T14:24:23Z","date_updated":"2022-01-06T07:02:57Z","title":"Software tools for business model innovation: Current state and future challenges"},{"type":"journal_article","status":"public","user_id":"18949","department":[{"_id":"183"}],"project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"name":"SFB 901","_id":"1"}],"_id":"4627","file_date_updated":"2018-11-08T10:18:19Z","has_accepted_license":"1","citation":{"chicago":"Kaimann, Daniel. “Ancillary Market Signaling: A Two-Stage Model of Economic Reputation on Ancillary Market Success.” <i>Applied Economics Letters</i> 27, no. 16 (2020): 1366–70. <a href=\"https://doi.org/10.1080/13504851.2019.1683136\">https://doi.org/10.1080/13504851.2019.1683136</a>.","ieee":"D. Kaimann, “Ancillary market signaling: A two-stage model of economic reputation on ancillary market success,” <i>Applied Economics Letters</i>, vol. 27, no. 16, pp. 1366–1370, 2020.","ama":"Kaimann D. Ancillary market signaling: A two-stage model of economic reputation on ancillary market success. <i>Applied Economics Letters</i>. 2020;27(16):1366-1370. doi:<a href=\"https://doi.org/10.1080/13504851.2019.1683136\">10.1080/13504851.2019.1683136</a>","mla":"Kaimann, Daniel. “Ancillary Market Signaling: A Two-Stage Model of Economic Reputation on Ancillary Market Success.” <i>Applied Economics Letters</i>, vol. 27, no. 16, 2020, pp. 1366–70, doi:<a href=\"https://doi.org/10.1080/13504851.2019.1683136\">10.1080/13504851.2019.1683136</a>.","bibtex":"@article{Kaimann_2020, title={Ancillary market signaling: A two-stage model of economic reputation on ancillary market success}, volume={27}, DOI={<a href=\"https://doi.org/10.1080/13504851.2019.1683136\">10.1080/13504851.2019.1683136</a>}, number={16}, journal={Applied Economics Letters}, author={Kaimann, Daniel}, year={2020}, pages={1366–1370} }","short":"D. Kaimann, Applied Economics Letters 27 (2020) 1366–1370.","apa":"Kaimann, D. (2020). Ancillary market signaling: A two-stage model of economic reputation on ancillary market success. <i>Applied Economics Letters</i>, <i>27</i>(16), 1366–1370. <a href=\"https://doi.org/10.1080/13504851.2019.1683136\">https://doi.org/10.1080/13504851.2019.1683136</a>"},"page":"1366-1370","intvolume":"        27","author":[{"first_name":"Daniel","id":"18949","full_name":"Kaimann, Daniel","last_name":"Kaimann"}],"volume":27,"date_updated":"2022-01-06T07:01:15Z","doi":"10.1080/13504851.2019.1683136","publication":"Applied Economics Letters","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-08T10:18:19Z","creator":"dkaimann","date_updated":"2018-11-08T10:18:19Z","file_name":"AEL_2018_Kaimann.pdf","access_level":"closed","file_id":"5429","file_size":163015}],"language":[{"iso":"eng"}],"ddc":["330"],"issue":"16","year":"2020","date_created":"2018-10-10T11:46:19Z","title":"Ancillary market signaling: A two-stage model of economic reputation on ancillary market success"},{"has_accepted_license":"1","place":"New York, NY, USA","citation":{"mla":"Bobolz, Jan, et al. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i> ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>.","short":"J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, C. Striecks, in: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), ACM, New York, NY, USA, 2020.","bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Slamanig_Striecks_2020, place={New York, NY, USA}, title={Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection}, DOI={<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>}, booktitle={Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),}, publisher={ACM}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Slamanig, Daniel and Striecks, Christoph}, year={2020} }","apa":"Bobolz, J., Eidens, F., Krenn, S., Slamanig, D., &#38; Striecks, C. (2020). Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3320269.3384769\">https://doi.org/10.1145/3320269.3384769</a>","ieee":"J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, and C. Striecks, “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection,” in <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i> Taiwan, 2020.","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Daniel Slamanig, and Christoph Striecks. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.” In <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM, 2020. <a href=\"https://doi.org/10.1145/3320269.3384769\">https://doi.org/10.1145/3320269.3384769</a>.","ama":"Bobolz J, Eidens F, Krenn S, Slamanig D, Striecks C. Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In: <i>Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),</i>. New York, NY, USA: ACM; 2020. doi:<a href=\"https://doi.org/10.1145/3320269.3384769\">10.1145/3320269.3384769</a>"},"oa":"1","date_updated":"2022-01-06T06:52:51Z","author":[{"id":"27207","full_name":"Bobolz, Jan","last_name":"Bobolz","first_name":"Jan"},{"id":"25078","full_name":"Eidens, Fabian","last_name":"Eidens","first_name":"Fabian"},{"first_name":"Stephan","full_name":"Krenn, Stephan","last_name":"Krenn"},{"first_name":"Daniel","last_name":"Slamanig","full_name":"Slamanig, Daniel"},{"full_name":"Striecks, Christoph","last_name":"Striecks","first_name":"Christoph"}],"conference":{"location":"Taiwan","name":"ASIA CCS'20"},"doi":"10.1145/3320269.3384769","main_file_link":[{"url":"https://eprint.iacr.org/2020/382","open_access":"1"}],"type":"conference","status":"public","_id":"16487","project":[{"name":"SFB 901","_id":"1"},{"_id":"84","name":"SFB 901 -Subproject T2"},{"name":"SFB 901 - Project Area T","_id":"82"}],"department":[{"_id":"64"}],"user_id":"477","file_date_updated":"2020-04-09T09:59:03Z","year":"2020","publisher":"ACM","date_created":"2020-04-09T10:00:29Z","title":"Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection","publication":"Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),","file":[{"date_updated":"2020-04-09T09:59:03Z","creator":"feidens","date_created":"2020-04-09T09:59:03Z","file_size":553623,"access_level":"closed","file_name":"main.pdf","file_id":"16488","content_type":"application/pdf","success":1,"relation":"main_file"}],"ddc":["000"],"language":[{"iso":"eng"}]},{"publication":"Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).","type":"conference","status":"public","department":[{"_id":"7"},{"_id":"77"}],"user_id":"477","_id":"16724","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"language":[{"iso":"eng"}],"publication_status":"accepted","citation":{"apa":"Sharma, A., &#38; Wehrheim, H. (n.d.). Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models. In <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i> ACM.","bibtex":"@inproceedings{Sharma_Wehrheim, title={Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models}, booktitle={Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).}, publisher={ACM}, author={Sharma, Arnab and Wehrheim, Heike} }","short":"A. Sharma, H. Wehrheim, in: Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA)., ACM, n.d.","mla":"Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models.” <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i>, ACM.","ieee":"A. Sharma and H. Wehrheim, “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models,” in <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i>","chicago":"Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models.” In <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i> ACM, n.d.","ama":"Sharma A, Wehrheim H. Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models. In: <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i> ACM."},"year":"2020","author":[{"first_name":"Arnab","last_name":"Sharma","id":"67200","full_name":"Sharma, Arnab"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"date_created":"2020-04-19T14:01:53Z","publisher":"ACM","date_updated":"2022-01-06T06:52:55Z","title":"Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models"},{"publication_status":"accepted","year":"2020","citation":{"apa":"Richter, C., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (n.d.). Algorithm Selection for Software Validation Based on Graph Kernels. <i>Journal of Automated Software Engineering</i>.","short":"C. Richter, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Journal of Automated Software Engineering (n.d.).","mla":"Richter, Cedric, et al. “Algorithm Selection for Software Validation Based on Graph Kernels.” <i>Journal of Automated Software Engineering</i>, Springer.","bibtex":"@article{Richter_Hüllermeier_Jakobs_Wehrheim, title={Algorithm Selection for Software Validation Based on Graph Kernels}, journal={Journal of Automated Software Engineering}, publisher={Springer}, author={Richter, Cedric and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike} }","ama":"Richter C, Hüllermeier E, Jakobs M-C, Wehrheim H. Algorithm Selection for Software Validation Based on Graph Kernels. <i>Journal of Automated Software Engineering</i>.","ieee":"C. Richter, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Algorithm Selection for Software Validation Based on Graph Kernels,” <i>Journal of Automated Software Engineering</i>.","chicago":"Richter, Cedric, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Algorithm Selection for Software Validation Based on Graph Kernels.” <i>Journal of Automated Software Engineering</i>, n.d."},"date_updated":"2022-01-06T06:52:55Z","publisher":"Springer","author":[{"first_name":"Cedric","full_name":"Richter, Cedric","id":"50003","last_name":"Richter"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"},{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"date_created":"2020-04-19T14:08:06Z","title":"Algorithm Selection for Software Validation Based on Graph Kernels","publication":"Journal of Automated Software Engineering","type":"journal_article","status":"public","_id":"16725","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"department":[{"_id":"7"},{"_id":"77"},{"_id":"355"}],"user_id":"477","language":[{"iso":"eng"}]},{"project":[{"grant_number":"762057","_id":"23","name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901"}],"_id":"16726","user_id":"60845","department":[{"_id":"34"}],"language":[{"iso":"eng"}],"type":"conference","publication":"European Conference on Networks and Communications (EUCNC 2020)","status":"public","date_updated":"2022-01-06T06:52:55Z","author":[{"first_name":"Hadi","id":"60845","full_name":"Razzaghi Kouchaksaraei, Hadi","last_name":"Razzaghi Kouchaksaraei"},{"first_name":"Ashwin Prasad","full_name":"Shivarpatna Venkatesh, Ashwin Prasad","id":"66637","last_name":"Shivarpatna Venkatesh"},{"first_name":"Amey","full_name":"Churi, Amey","last_name":"Churi"},{"first_name":"Marvin","id":"44169","full_name":"Illian, Marvin","last_name":"Illian"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_created":"2020-04-20T09:36:53Z","title":"Dynamic Provisioning of Network Services on Heterogeneous Resources","conference":{"start_date":"2020-06-15","name":"European Conference on Networks and Communications (EUCNC 2020)","end_date":"2020-06-18"},"publication_status":"accepted","year":"2020","citation":{"bibtex":"@inproceedings{Razzaghi Kouchaksaraei_Shivarpatna Venkatesh_Churi_Illian_Karl, title={Dynamic Provisioning of Network Services on Heterogeneous Resources}, booktitle={European Conference on Networks and Communications (EUCNC 2020)}, author={Razzaghi Kouchaksaraei, Hadi and Shivarpatna Venkatesh, Ashwin Prasad and Churi, Amey and Illian, Marvin and Karl, Holger} }","mla":"Razzaghi Kouchaksaraei, Hadi, et al. “Dynamic Provisioning of Network Services on Heterogeneous Resources.” <i>European Conference on Networks and Communications (EUCNC 2020)</i>.","short":"H. Razzaghi Kouchaksaraei, A.P. Shivarpatna Venkatesh, A. Churi, M. Illian, H. Karl, in: European Conference on Networks and Communications (EUCNC 2020), n.d.","apa":"Razzaghi Kouchaksaraei, H., Shivarpatna Venkatesh, A. P., Churi, A., Illian, M., &#38; Karl, H. (n.d.). Dynamic Provisioning of Network Services on Heterogeneous Resources. In <i>European Conference on Networks and Communications (EUCNC 2020)</i>.","ama":"Razzaghi Kouchaksaraei H, Shivarpatna Venkatesh AP, Churi A, Illian M, Karl H. Dynamic Provisioning of Network Services on Heterogeneous Resources. In: <i>European Conference on Networks and Communications (EUCNC 2020)</i>.","ieee":"H. Razzaghi Kouchaksaraei, A. P. Shivarpatna Venkatesh, A. Churi, M. Illian, and H. Karl, “Dynamic Provisioning of Network Services on Heterogeneous Resources,” in <i>European Conference on Networks and Communications (EUCNC 2020)</i>.","chicago":"Razzaghi Kouchaksaraei, Hadi, Ashwin Prasad Shivarpatna Venkatesh, Amey Churi, Marvin Illian, and Holger Karl. “Dynamic Provisioning of Network Services on Heterogeneous Resources.” In <i>European Conference on Networks and Communications (EUCNC 2020)</i>, n.d."}},{"status":"public","abstract":[{"text":"The maintenance of efficient and robust overlay networks is one\r\nof the most fundamental and reoccurring themes in networking.\r\nThis paper presents a survey of state-of-the-art \r\nalgorithms to design and repair overlay networks in a distributed\r\nmanner. In particular, we discuss basic algorithmic primitives\r\nto preserve connectivity, review algorithms for the fundamental\r\nproblem of graph linearization, and then survey self-stabilizing\r\nalgorithms for metric and scalable topologies. \r\nWe also identify open problems and avenues for future research.\r\n","lang":"eng"}],"type":"journal_article","publication":"ACM Computing Surveys","language":[{"iso":"eng"}],"user_id":"23538","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"16902","citation":{"apa":"Feldmann, M., Scheideler, C., &#38; Schmid, S. (2020). Survey on Algorithms for Self-Stabilizing Overlay Networks. <i>ACM Computing Surveys</i>. <a href=\"https://doi.org/10.1145/3397190\">https://doi.org/10.1145/3397190</a>","short":"M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).","mla":"Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” <i>ACM Computing Surveys</i>, ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>.","bibtex":"@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for Self-Stabilizing Overlay Networks}, DOI={<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>}, journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}, year={2020} }","chicago":"Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” <i>ACM Computing Surveys</i>, 2020. <a href=\"https://doi.org/10.1145/3397190\">https://doi.org/10.1145/3397190</a>.","ieee":"M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing Overlay Networks,” <i>ACM Computing Surveys</i>, 2020.","ama":"Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing Overlay Networks. <i>ACM Computing Surveys</i>. 2020. doi:<a href=\"https://doi.org/10.1145/3397190\">10.1145/3397190</a>"},"year":"2020","doi":"10.1145/3397190","title":"Survey on Algorithms for Self-Stabilizing Overlay Networks","date_created":"2020-04-29T07:09:50Z","author":[{"first_name":"Michael","last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"publisher":"ACM","date_updated":"2022-01-06T06:52:58Z"},{"user_id":"477","department":[{"_id":"205"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"16910","language":[{"iso":"eng"}],"type":"dissertation","status":"public","date_created":"2020-04-29T08:29:45Z","author":[{"last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja","id":"13264","first_name":"Nadja"}],"supervisor":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:58Z","doi":"10.17619/UNIPB/1-958","title":"Mechanisms, Preferences, and Heterogeneity in Matching Markets","citation":{"ama":"Stroh-Maraun N. <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-958\">10.17619/UNIPB/1-958</a>","chicago":"Stroh-Maraun, Nadja. <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-958\">https://doi.org/10.17619/UNIPB/1-958</a>.","ieee":"N. Stroh-Maraun, <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn, 2020.","mla":"Stroh-Maraun, Nadja. <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn, 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-958\">10.17619/UNIPB/1-958</a>.","short":"N. Stroh-Maraun, Mechanisms, Preferences, and Heterogeneity in Matching Markets, Universität Paderborn, 2020.","bibtex":"@book{Stroh-Maraun_2020, title={Mechanisms, Preferences, and Heterogeneity in Matching Markets}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-958\">10.17619/UNIPB/1-958</a>}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2020} }","apa":"Stroh-Maraun, N. (2020). <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-958\">https://doi.org/10.17619/UNIPB/1-958</a>"},"year":"2020"},{"year":"2020","date_created":"2020-05-04T12:16:54Z","publisher":"IEEE","title":"Hypothesis-driven Adaptation of Business Models based on Product Line Engineering","publication":"Proceedings of the 22nd IEEE International Conference on Business Informatics","file":[{"file_size":569290,"file_name":"CBI.pdf","access_level":"open_access","file_id":"17383","date_updated":"2020-07-14T09:33:00Z","creator":"sego","date_created":"2020-07-14T09:33:00Z","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"The continuous innovation of its business models is an important task for a company to stay competitive. During this process, the company has to validate various hypotheses about its business models by adapting to uncertain and changing customer needs effectively and efficiently. This adaptation, in turn, can be supported by the concept of Software Product Lines (SPLs). SPLs reduce the time to market by deriving products for customers with changing requirements using a common set of features, structured as a feature model. Analogously, we support the process of business model adaptation by applying the engineering process of SPLs to the structure of the Business Model Canvas (BMC). We call this concept a Business Model Decision Line (BMDL). The BMDL matches business domain knowledge in the form of a feature model with customer needs to derive hypotheses about the business model together with experiments for validation. Our approach is effective by providing a comprehensive overview of possible business model adaptations and efficient by reusing experiments for different hypotheses. We implement our approach in a tool and illustrate the usefulness with an example of developing business models for a mobile application."}],"language":[{"iso":"eng"}],"keyword":["Business Model Decision Line","Business Model Adaptation","Hypothesis-driven Adaptation","Software Product Line","Feature Model"],"ddc":["006"],"has_accepted_license":"1","citation":{"apa":"Gottschalk, S., Rittmeier, F., &#38; Engels, G. (2020). Hypothesis-driven Adaptation of Business Models based on Product Line Engineering. In <i>Proceedings of the 22nd IEEE International Conference on Business Informatics</i>. Antwerp: IEEE. <a href=\"https://doi.org/10.1109/CBI49978.2020.00022\">https://doi.org/10.1109/CBI49978.2020.00022</a>","short":"S. Gottschalk, F. Rittmeier, G. Engels, in: Proceedings of the 22nd IEEE International Conference on Business Informatics, IEEE, 2020.","bibtex":"@inproceedings{Gottschalk_Rittmeier_Engels_2020, title={Hypothesis-driven Adaptation of Business Models based on Product Line Engineering}, DOI={<a href=\"https://doi.org/10.1109/CBI49978.2020.00022\">10.1109/CBI49978.2020.00022</a>}, booktitle={Proceedings of the 22nd IEEE International Conference on Business Informatics}, publisher={IEEE}, author={Gottschalk, Sebastian and Rittmeier, Florian and Engels, Gregor}, year={2020} }","mla":"Gottschalk, Sebastian, et al. “Hypothesis-Driven Adaptation of Business Models Based on Product Line Engineering.” <i>Proceedings of the 22nd IEEE International Conference on Business Informatics</i>, IEEE, 2020, doi:<a href=\"https://doi.org/10.1109/CBI49978.2020.00022\">10.1109/CBI49978.2020.00022</a>.","ama":"Gottschalk S, Rittmeier F, Engels G. Hypothesis-driven Adaptation of Business Models based on Product Line Engineering. In: <i>Proceedings of the 22nd IEEE International Conference on Business Informatics</i>. IEEE; 2020. doi:<a href=\"https://doi.org/10.1109/CBI49978.2020.00022\">10.1109/CBI49978.2020.00022</a>","ieee":"S. Gottschalk, F. Rittmeier, and G. Engels, “Hypothesis-driven Adaptation of Business Models based on Product Line Engineering,” in <i>Proceedings of the 22nd IEEE International Conference on Business Informatics</i>, Antwerp, 2020.","chicago":"Gottschalk, Sebastian, Florian Rittmeier, and Gregor Engels. “Hypothesis-Driven Adaptation of Business Models Based on Product Line Engineering.” In <i>Proceedings of the 22nd IEEE International Conference on Business Informatics</i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/CBI49978.2020.00022\">https://doi.org/10.1109/CBI49978.2020.00022</a>."},"author":[{"first_name":"Sebastian","id":"47208","full_name":"Gottschalk, Sebastian","last_name":"Gottschalk"},{"first_name":"Florian","last_name":"Rittmeier","full_name":"Rittmeier, Florian","id":"5281"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"date_updated":"2022-01-06T06:52:59Z","oa":"1","conference":{"name":"22nd IEEE International Conference on Business Informatics","start_date":"2020-06-22","end_date":"2020-06-24","location":"Antwerp"},"doi":"10.1109/CBI49978.2020.00022","type":"conference","status":"public","department":[{"_id":"66"}],"user_id":"47208","_id":"16933","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"file_date_updated":"2020-07-14T09:33:00Z"},{"date_updated":"2022-01-06T06:52:59Z","oa":"1","volume":391,"author":[{"full_name":"Gottschalk, Sebastian","id":"47208","last_name":"Gottschalk","first_name":"Sebastian"},{"first_name":"Enes","full_name":"Yigitbas, Enes","id":"8447","orcid":"0000-0002-5967-833X","last_name":"Yigitbas"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"doi":"10.1007/978-3-030-52306-0_18","conference":{"name":"10th International Symposium on Business Modeling and Software Design ","start_date":"2020-07-06","end_date":"2020-07-08","location":"Potsdam"},"has_accepted_license":"1","intvolume":"       391","page":"276-286","citation":{"apa":"Gottschalk, S., Yigitbas, E., &#38; Engels, G. (2020). Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs. In B. Shishkov (Ed.), <i>Business Modeling and Software Design</i> (Vol. 391, pp. 276–286). Potsdam: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">https://doi.org/10.1007/978-3-030-52306-0_18</a>","short":"S. Gottschalk, E. Yigitbas, G. Engels, in: B. Shishkov (Ed.), Business Modeling and Software Design, Springer International Publishing, 2020, pp. 276–286.","mla":"Gottschalk, Sebastian, et al. “Model-Based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs.” <i>Business Modeling and Software Design</i>, edited by Boris Shishkov, vol. 391, Springer International Publishing, 2020, pp. 276–86, doi:<a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">10.1007/978-3-030-52306-0_18</a>.","bibtex":"@inproceedings{Gottschalk_Yigitbas_Engels_2020, series={Lecture Notes in Business Information Processing}, title={Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs}, volume={391}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">10.1007/978-3-030-52306-0_18</a>}, booktitle={Business Modeling and Software Design}, publisher={Springer International Publishing}, author={Gottschalk, Sebastian and Yigitbas, Enes and Engels, Gregor}, editor={Shishkov, BorisEditor}, year={2020}, pages={276–286}, collection={Lecture Notes in Business Information Processing} }","ama":"Gottschalk S, Yigitbas E, Engels G. Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs. In: Shishkov B, ed. <i>Business Modeling and Software Design</i>. Vol 391. Lecture Notes in Business Information Processing. Springer International Publishing; 2020:276-286. doi:<a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">10.1007/978-3-030-52306-0_18</a>","ieee":"S. Gottschalk, E. Yigitbas, and G. Engels, “Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs,” in <i>Business Modeling and Software Design</i>, Potsdam, 2020, vol. 391, pp. 276–286.","chicago":"Gottschalk, Sebastian, Enes Yigitbas, and Gregor Engels. “Model-Based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs.” In <i>Business Modeling and Software Design</i>, edited by Boris Shishkov, 391:276–86. Lecture Notes in Business Information Processing. Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-52306-0_18\">https://doi.org/10.1007/978-3-030-52306-0_18</a>."},"_id":"16934","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"department":[{"_id":"66"}],"user_id":"47208","series_title":"Lecture Notes in Business Information Processing","file_date_updated":"2020-07-14T09:28:33Z","type":"conference","editor":[{"full_name":"Shishkov, Boris","last_name":"Shishkov","first_name":"Boris"}],"status":"public","publisher":"Springer International Publishing","date_created":"2020-05-04T12:27:38Z","title":"Model-based Hypothesis Engineering for Supporting Adaptation to Uncertain Customer Needs","year":"2020","keyword":["Hypothesis Engineering","Model-based","Customer Need Adaptation","Business Model","Product Features"],"ddc":["006"],"language":[{"iso":"eng"}],"publication":"Business Modeling and Software Design","abstract":[{"lang":"eng","text":"To build successful products, the developers have to adapt their product features and business models to uncertain customer needs. This adaptation is part of the research discipline of Hypotheses Engineering (HE) where customer needs can be seen as hypotheses that need to be tested iteratively by conducting experiments together with the customer. So far, modeling support and associated traceability of this iterative process are missing. Both, in turn, are important to document the adaptation to the customer needs and identify experiments that provide most evidence to the customer needs. To target this issue, we introduce a model-based HE approach with a twofold contribution: First, we develop a modeling language that models hypotheses and experiments as interrelated hierarchies together with a mapping between them. While the hypotheses are labeled with a score level of their current evidence, the experiments are labeled with a score level of maximum evidence that can be achieved during conduction. Second, we provide an iterative process to determine experiments that offer the most evidence improvement to the modeled hypotheses. We illustrate the usefulness of the approach with an example of testing the business model of a mobile application."}],"file":[{"content_type":"application/pdf","relation":"main_file","creator":"sego","date_created":"2020-07-14T09:25:30Z","date_updated":"2020-07-14T09:28:33Z","file_name":"BMSD20.pdf","file_id":"17380","access_level":"open_access","file_size":267658}]}]