[{"year":"2020","citation":{"short":"N. N., Kronzeugenprogramme zur Aufdeckung von Kartellen - Eine spieltheoretische Analyse, Universität Paderborn, 2020.","mla":"N., N. <i>Kronzeugenprogramme zur Aufdeckung von Kartellen - Eine spieltheoretische Analyse</i>. Universität Paderborn, 2020.","bibtex":"@book{N._2020, title={Kronzeugenprogramme zur Aufdeckung von Kartellen - Eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N., N.}, year={2020} }","apa":"N., N. (2020). <i>Kronzeugenprogramme zur Aufdeckung von Kartellen - Eine spieltheoretische Analyse</i>. Universität Paderborn.","chicago":"N., N. <i>Kronzeugenprogramme zur Aufdeckung von Kartellen - Eine spieltheoretische Analyse</i>. Universität Paderborn, 2020.","ieee":"N. N., <i>Kronzeugenprogramme zur Aufdeckung von Kartellen - Eine spieltheoretische Analyse</i>. Universität Paderborn, 2020.","ama":"N. N. <i>Kronzeugenprogramme zur Aufdeckung von Kartellen - Eine spieltheoretische Analyse</i>. Universität Paderborn; 2020."},"title":"Kronzeugenprogramme zur Aufdeckung von Kartellen - Eine spieltheoretische Analyse","date_updated":"2023-05-23T12:46:08Z","publisher":"Universität Paderborn","author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"supervisor":[{"first_name":"Claus-Jochen","id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake"}],"date_created":"2023-02-22T11:14:15Z","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"42301","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"user_id":"477"},{"citation":{"short":"N. N., Eine ökonomische Analyse der Piraterie in zweiseitigen Softwaremärkten, Universität Paderborn, 2020.","bibtex":"@book{N._2020, title={Eine ökonomische Analyse der Piraterie in zweiseitigen Softwaremärkten}, publisher={Universität Paderborn}, author={N., N.}, year={2020} }","mla":"N., N. <i>Eine ökonomische Analyse der Piraterie in zweiseitigen Softwaremärkten</i>. Universität Paderborn, 2020.","apa":"N., N. (2020). <i>Eine ökonomische Analyse der Piraterie in zweiseitigen Softwaremärkten</i>. Universität Paderborn.","chicago":"N., N. <i>Eine ökonomische Analyse der Piraterie in zweiseitigen Softwaremärkten</i>. Universität Paderborn, 2020.","ieee":"N. N., <i>Eine ökonomische Analyse der Piraterie in zweiseitigen Softwaremärkten</i>. Universität Paderborn, 2020.","ama":"N. N. <i>Eine ökonomische Analyse der Piraterie in zweiseitigen Softwaremärkten</i>. Universität Paderborn; 2020."},"year":"2020","title":"Eine ökonomische Analyse der Piraterie in zweiseitigen Softwaremärkten","author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"supervisor":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"}],"date_created":"2023-02-22T11:12:20Z","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:46:15Z","status":"public","type":"mastersthesis","language":[{"iso":"ger"}],"user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"42299"},{"author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"date_created":"2023-02-22T11:17:53Z","supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"date_updated":"2023-05-23T12:45:34Z","publisher":"Universität Paderborn","title":"Kulturelle Unterschiede beim Lösen von Verhandlungsproblemen","citation":{"ieee":"N. N., <i>Kulturelle Unterschiede beim Lösen von Verhandlungsproblemen</i>. Universität Paderborn, 2020.","chicago":"N., N. <i>Kulturelle Unterschiede beim Lösen von Verhandlungsproblemen</i>. Universität Paderborn, 2020.","ama":"N. N. <i>Kulturelle Unterschiede beim Lösen von Verhandlungsproblemen</i>. Universität Paderborn; 2020.","short":"N. N., Kulturelle Unterschiede beim Lösen von Verhandlungsproblemen, Universität Paderborn, 2020.","bibtex":"@book{N._2020, title={Kulturelle Unterschiede beim Lösen von Verhandlungsproblemen}, publisher={Universität Paderborn}, author={N., N.}, year={2020} }","mla":"N., N. <i>Kulturelle Unterschiede beim Lösen von Verhandlungsproblemen</i>. Universität Paderborn, 2020.","apa":"N., N. (2020). <i>Kulturelle Unterschiede beim Lösen von Verhandlungsproblemen</i>. Universität Paderborn."},"year":"2020","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"user_id":"477","_id":"42304","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"citation":{"ama":"N. N. <i>Productivity Optimization through Project Matching</i>. Universität Paderborn; 2020.","ieee":"N. N., <i>Productivity optimization through project matching</i>. Universität Paderborn, 2020.","chicago":"N., N. <i>Productivity Optimization through Project Matching</i>. Universität Paderborn, 2020.","apa":"N., N. (2020). <i>Productivity optimization through project matching</i>. Universität Paderborn.","bibtex":"@book{N._2020, title={Productivity optimization through project matching}, publisher={Universität Paderborn}, author={N., N.}, year={2020} }","mla":"N., N. <i>Productivity Optimization through Project Matching</i>. Universität Paderborn, 2020.","short":"N. N., Productivity Optimization through Project Matching, Universität Paderborn, 2020."},"year":"2020","date_created":"2023-02-22T11:10:47Z","author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"supervisor":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"}],"publisher":"Universität Paderborn","date_updated":"2023-05-23T12:46:30Z","title":"Productivity optimization through project matching","type":"bachelorsthesis","status":"public","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"user_id":"477","_id":"42298","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"language":[{"iso":"eng"}]},{"type":"mastersthesis","status":"public","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"user_id":"477","_id":"42306","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"language":[{"iso":"eng"}],"citation":{"chicago":"N., N. <i>Matching Mechanisms and Organ Exchange</i>. Universität Paderborn, 2020.","ieee":"N. N., <i>Matching Mechanisms and Organ Exchange</i>. Universität Paderborn, 2020.","ama":"N. N. <i>Matching Mechanisms and Organ Exchange</i>. Universität Paderborn; 2020.","apa":"N., N. (2020). <i>Matching Mechanisms and Organ Exchange</i>. Universität Paderborn.","bibtex":"@book{N._2020, title={Matching Mechanisms and Organ Exchange}, publisher={Universität Paderborn}, author={N., N.}, year={2020} }","short":"N. N., Matching Mechanisms and Organ Exchange, Universität Paderborn, 2020.","mla":"N., N. <i>Matching Mechanisms and Organ Exchange</i>. Universität Paderborn, 2020."},"year":"2020","date_created":"2023-02-22T11:18:47Z","author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"supervisor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"date_updated":"2023-05-23T12:45:27Z","publisher":"Universität Paderborn","title":"Matching Mechanisms and Organ Exchange"},{"title":"Cartel Fines in the European Union","date_updated":"2023-05-23T12:46:00Z","publisher":"Universität Paderborn","date_created":"2023-02-22T11:13:16Z","author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"supervisor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"year":"2020","citation":{"chicago":"N., N. <i>Cartel Fines in the European Union</i>. Universität Paderborn, 2020.","ieee":"N. N., <i>Cartel Fines in the European Union</i>. Universität Paderborn, 2020.","ama":"N. N. <i>Cartel Fines in the European Union</i>. Universität Paderborn; 2020.","apa":"N., N. (2020). <i>Cartel Fines in the European Union</i>. Universität Paderborn.","bibtex":"@book{N._2020, title={Cartel Fines in the European Union}, publisher={Universität Paderborn}, author={N., N.}, year={2020} }","short":"N. N., Cartel Fines in the European Union, Universität Paderborn, 2020.","mla":"N., N. <i>Cartel Fines in the European Union</i>. Universität Paderborn, 2020."},"language":[{"iso":"eng"}],"_id":"42300","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"user_id":"477","status":"public","type":"bachelorsthesis"},{"year":"2020","citation":{"apa":"N., N. (2020). <i>Anspruchsregeln in Verhandlungen</i>. Universität Paderborn.","mla":"N., N. <i>Anspruchsregeln in Verhandlungen</i>. Universität Paderborn, 2020.","bibtex":"@book{N._2020, title={Anspruchsregeln in Verhandlungen}, publisher={Universität Paderborn}, author={N., N.}, year={2020} }","short":"N. N., Anspruchsregeln in Verhandlungen, Universität Paderborn, 2020.","chicago":"N., N. <i>Anspruchsregeln in Verhandlungen</i>. Universität Paderborn, 2020.","ieee":"N. N., <i>Anspruchsregeln in Verhandlungen</i>. Universität Paderborn, 2020.","ama":"N. N. <i>Anspruchsregeln in Verhandlungen</i>. Universität Paderborn; 2020."},"title":"Anspruchsregeln in Verhandlungen","date_updated":"2023-05-23T12:45:52Z","publisher":"Universität Paderborn","date_created":"2023-02-22T11:15:31Z","author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"42302","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"user_id":"477"},{"type":"mastersthesis","status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"42292","user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"language":[{"iso":"ger"}],"year":"2020","citation":{"bibtex":"@book{N._2020, title={Die Zusammenstellung eines Sortiments als Beispiel interdependenter Verhandlungen}, publisher={Universität Paderborn}, author={N., N.}, year={2020} }","mla":"N., N. <i>Die Zusammenstellung eines Sortiments als Beispiel interdependenter Verhandlungen</i>. Universität Paderborn, 2020.","short":"N. N., Die Zusammenstellung eines Sortiments als Beispiel interdependenter Verhandlungen, Universität Paderborn, 2020.","apa":"N., N. (2020). <i>Die Zusammenstellung eines Sortiments als Beispiel interdependenter Verhandlungen</i>. Universität Paderborn.","ieee":"N. N., <i>Die Zusammenstellung eines Sortiments als Beispiel interdependenter Verhandlungen</i>. Universität Paderborn, 2020.","chicago":"N., N. <i>Die Zusammenstellung eines Sortiments als Beispiel interdependenter Verhandlungen</i>. Universität Paderborn, 2020.","ama":"N. N. <i>Die Zusammenstellung eines Sortiments als Beispiel interdependenter Verhandlungen</i>. Universität Paderborn; 2020."},"publisher":"Universität Paderborn","date_updated":"2023-05-23T12:46:58Z","supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"}],"date_created":"2023-02-22T11:04:42Z","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"title":"Die Zusammenstellung eines Sortiments als Beispiel interdependenter Verhandlungen"},{"language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"42294","user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"status":"public","type":"mastersthesis","title":"Matching in Netzwerken","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:46:44Z","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"date_created":"2023-02-22T11:06:52Z","year":"2020","citation":{"mla":"N., N. <i>Matching in Netzwerken</i>. Universität Paderborn, 2020.","bibtex":"@book{N._2020, title={Matching in Netzwerken}, publisher={Universität Paderborn}, author={N., N.}, year={2020} }","short":"N. N., Matching in Netzwerken, Universität Paderborn, 2020.","apa":"N., N. (2020). <i>Matching in Netzwerken</i>. Universität Paderborn.","ieee":"N. N., <i>Matching in Netzwerken</i>. Universität Paderborn, 2020.","chicago":"N., N. <i>Matching in Netzwerken</i>. Universität Paderborn, 2020.","ama":"N. N. <i>Matching in Netzwerken</i>. Universität Paderborn; 2020."}},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"_id":"45232","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"}],"department":[{"_id":"66"}],"user_id":"47208","year":"2020","citation":{"ieee":"N. N., <i>A Framework for Measurable Value Propositions of Mobile Applications</i>. 2020.","chicago":"N., N. <i>A Framework for Measurable Value Propositions of Mobile Applications</i>, 2020.","ama":"N. N. <i>A Framework for Measurable Value Propositions of Mobile Applications</i>.; 2020.","bibtex":"@book{N._2020, title={A Framework for Measurable Value Propositions of Mobile Applications}, author={N., N.}, year={2020} }","mla":"N., N. <i>A Framework for Measurable Value Propositions of Mobile Applications</i>. 2020.","short":"N. N., A Framework for Measurable Value Propositions of Mobile Applications, 2020.","apa":"N., N. (2020). <i>A Framework for Measurable Value Propositions of Mobile Applications</i>."},"title":"A Framework for Measurable Value Propositions of Mobile Applications","date_updated":"2023-05-23T13:04:16Z","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"supervisor":[{"last_name":"Oberthür","id":"383","full_name":"Oberthür, Simon","first_name":"Simon"},{"last_name":"Gottschalk","id":"47208","full_name":"Gottschalk, Sebastian","first_name":"Sebastian"}],"date_created":"2023-05-23T13:03:24Z"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"department":[{"_id":"66"}],"user_id":"47208","_id":"45234","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"}],"citation":{"chicago":"N., N. <i>Model-Based Product Configuration in Augmented Reality Applications</i>, 2020.","ieee":"N. N., <i>Model-Based Product Configuration in Augmented Reality Applications</i>. 2020.","ama":"N. N. <i>Model-Based Product Configuration in Augmented Reality Applications</i>.; 2020.","apa":"N., N. (2020). <i>Model-Based Product Configuration in Augmented Reality Applications</i>.","short":"N. N., Model-Based Product Configuration in Augmented Reality Applications, 2020.","bibtex":"@book{N._2020, title={Model-Based Product Configuration in Augmented Reality Applications}, author={N., N.}, year={2020} }","mla":"N., N. <i>Model-Based Product Configuration in Augmented Reality Applications</i>. 2020."},"year":"2020","title":"Model-Based Product Configuration in Augmented Reality Applications","date_created":"2023-05-23T13:05:23Z","supervisor":[{"last_name":"Yigitbas","orcid":"0000-0002-5967-833X","id":"8447","full_name":"Yigitbas, Enes","first_name":"Enes"},{"last_name":"Gottschalk","full_name":"Gottschalk, Sebastian","id":"47208","first_name":"Sebastian"}],"author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"date_updated":"2023-05-23T13:05:26Z"},{"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"}],"_id":"45235","user_id":"47208","department":[{"_id":"66"}],"status":"public","type":"mastersthesis","title":"Design and Implementation of a Crowd-based Prototype Validation Platform","date_updated":"2023-05-23T13:08:22Z","date_created":"2023-05-23T13:08:17Z","author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"year":"2020","citation":{"apa":"N., N. (2020). <i>Design and Implementation of a Crowd-based Prototype Validation Platform</i>.","bibtex":"@book{N._2020, title={Design and Implementation of a Crowd-based Prototype Validation Platform}, author={N., N.}, year={2020} }","mla":"N., N. <i>Design and Implementation of a Crowd-Based Prototype Validation Platform</i>. 2020.","short":"N. N., Design and Implementation of a Crowd-Based Prototype Validation Platform, 2020.","ama":"N. N. <i>Design and Implementation of a Crowd-Based Prototype Validation Platform</i>.; 2020.","chicago":"N., N. <i>Design and Implementation of a Crowd-Based Prototype Validation Platform</i>, 2020.","ieee":"N. N., <i>Design and Implementation of a Crowd-based Prototype Validation Platform</i>. 2020."}},{"_id":"20808","project":[{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"}],"user_id":"398","language":[{"iso":"eng"}],"publication":"2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","type":"conference","status":"public","date_updated":"2023-07-09T13:08:07Z","author":[{"first_name":"Hassan","full_name":"Ghasemzadeh Mohammadi, Hassan","id":"61186","last_name":"Ghasemzadeh Mohammadi"},{"last_name":"Arshad","full_name":"Arshad, Rahil","first_name":"Rahil"},{"first_name":"Sneha","last_name":"Rautmare","full_name":"Rautmare, Sneha"},{"full_name":"Manjunatha, Suraj","last_name":"Manjunatha","first_name":"Suraj"},{"first_name":"Maurice","full_name":"Kuschel, Maurice","last_name":"Kuschel"},{"last_name":"Jentzsch","full_name":"Jentzsch, Felix Paul","first_name":"Felix Paul"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"},{"first_name":"Alexander","full_name":"Boschmann, Alexander","last_name":"Boschmann"},{"first_name":"Dirk","last_name":"Schollbach","full_name":"Schollbach, Dirk"}],"date_created":"2020-12-21T10:03:49Z","title":"DeepWind: An Accurate Wind Turbine Condition Monitoring Framework via Deep Learning on Embedded Platforms","doi":"10.1109/etfa46521.2020.9211880","publication_identifier":{"isbn":["9781728189567"]},"publication_status":"published","year":"2020","citation":{"ama":"Ghasemzadeh Mohammadi H, Arshad R, Rautmare S, et al. DeepWind: An Accurate Wind Turbine Condition Monitoring Framework via Deep Learning on Embedded Platforms. In: <i>2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>. ; 2020. doi:<a href=\"https://doi.org/10.1109/etfa46521.2020.9211880\">10.1109/etfa46521.2020.9211880</a>","apa":"Ghasemzadeh Mohammadi, H., Arshad, R., Rautmare, S., Manjunatha, S., Kuschel, M., Jentzsch, F. P., Platzner, M., Boschmann, A., &#38; Schollbach, D. (2020). DeepWind: An Accurate Wind Turbine Condition Monitoring Framework via Deep Learning on Embedded Platforms. <i>2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>. <a href=\"https://doi.org/10.1109/etfa46521.2020.9211880\">https://doi.org/10.1109/etfa46521.2020.9211880</a>","short":"H. Ghasemzadeh Mohammadi, R. Arshad, S. Rautmare, S. Manjunatha, M. Kuschel, F.P. Jentzsch, M. Platzner, A. Boschmann, D. Schollbach, in: 2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2020.","mla":"Ghasemzadeh Mohammadi, Hassan, et al. “DeepWind: An Accurate Wind Turbine Condition Monitoring Framework via Deep Learning on Embedded Platforms.” <i>2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>, 2020, doi:<a href=\"https://doi.org/10.1109/etfa46521.2020.9211880\">10.1109/etfa46521.2020.9211880</a>.","bibtex":"@inproceedings{Ghasemzadeh Mohammadi_Arshad_Rautmare_Manjunatha_Kuschel_Jentzsch_Platzner_Boschmann_Schollbach_2020, title={DeepWind: An Accurate Wind Turbine Condition Monitoring Framework via Deep Learning on Embedded Platforms}, DOI={<a href=\"https://doi.org/10.1109/etfa46521.2020.9211880\">10.1109/etfa46521.2020.9211880</a>}, booktitle={2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)}, author={Ghasemzadeh Mohammadi, Hassan and Arshad, Rahil and Rautmare, Sneha and Manjunatha, Suraj and Kuschel, Maurice and Jentzsch, Felix Paul and Platzner, Marco and Boschmann, Alexander and Schollbach, Dirk}, year={2020} }","ieee":"H. Ghasemzadeh Mohammadi <i>et al.</i>, “DeepWind: An Accurate Wind Turbine Condition Monitoring Framework via Deep Learning on Embedded Platforms,” 2020, doi: <a href=\"https://doi.org/10.1109/etfa46521.2020.9211880\">10.1109/etfa46521.2020.9211880</a>.","chicago":"Ghasemzadeh Mohammadi, Hassan, Rahil Arshad, Sneha Rautmare, Suraj Manjunatha, Maurice Kuschel, Felix Paul Jentzsch, Marco Platzner, Alexander Boschmann, and Dirk Schollbach. “DeepWind: An Accurate Wind Turbine Condition Monitoring Framework via Deep Learning on Embedded Platforms.” In <i>2020 25th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)</i>, 2020. <a href=\"https://doi.org/10.1109/etfa46521.2020.9211880\">https://doi.org/10.1109/etfa46521.2020.9211880</a>."}},{"_id":"21433","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"},{"name":"SFB 901 - T1: SFB 901 -Subproject T1","_id":"83"}],"department":[{"_id":"78"}],"user_id":"398","language":[{"iso":"eng"}],"type":"mastersthesis","abstract":[{"lang":"eng","text":"Modern machine learning (ML) techniques continue to move into the embedded system space because traditional centralized compute resources do not suit certain application domains, for example in mobile or real-time environments. Google’s TensorFlow Lite (TFLite) framework supports this shift from cloud to edge computing and makes ML inference accessible on resource-constrained devices. While it offers the possibility to partially delegate computation to hardware accelerators, there is no such “delegate” available to utilize the promising characteristics of reconfigurable hardware.\r\nThis thesis incorporates modern platform FPGAs into TFLite by implementing a modular delegate framework, which allows accelerators within the programmable logic to take over the execution of neural network layers. To facilitate the necessary hardware/software codesign, the FPGA delegate is based on the operating system for reconfigurable\r\ncomputing (ReconOS), whose partial reconfiguration support enables the instantiation of model-tailored accelerator architectures. In the hardware back-end, a streaming-based prototype accelerator for the MobileNet model family showcases the working order of the platform, but falls short of the desired performance. Thus, it indicates the need for further exploration of alternative accelerator designs, which the delegate could automatically synthesize to meet a model’s demands."}],"status":"public","date_updated":"2023-07-09T17:12:52Z","author":[{"full_name":"Jentzsch, Felix P.","last_name":"Jentzsch","first_name":"Felix P."}],"date_created":"2021-03-10T07:09:14Z","supervisor":[{"first_name":"Christian","full_name":"Lienen, Christian","id":"60323","last_name":"Lienen"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"},{"first_name":"Christian","id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982"}],"title":"Design and Implementation of a ReconOS-based TensorFlow Lite Delegate Architecture","year":"2020","citation":{"short":"F.P. Jentzsch, Design and Implementation of a ReconOS-Based TensorFlow Lite Delegate Architecture, 2020.","bibtex":"@book{Jentzsch_2020, title={Design and Implementation of a ReconOS-based TensorFlow Lite Delegate Architecture}, author={Jentzsch, Felix P.}, year={2020} }","mla":"Jentzsch, Felix P. <i>Design and Implementation of a ReconOS-Based TensorFlow Lite Delegate Architecture</i>. 2020.","apa":"Jentzsch, F. P. (2020). <i>Design and Implementation of a ReconOS-based TensorFlow Lite Delegate Architecture</i>.","chicago":"Jentzsch, Felix P. <i>Design and Implementation of a ReconOS-Based TensorFlow Lite Delegate Architecture</i>, 2020.","ieee":"F. P. Jentzsch, <i>Design and Implementation of a ReconOS-based TensorFlow Lite Delegate Architecture</i>. 2020.","ama":"Jentzsch FP. <i>Design and Implementation of a ReconOS-Based TensorFlow Lite Delegate Architecture</i>.; 2020."}},{"abstract":[{"text":"For optimal placement and orchestration of network services, it is crucial\r\nthat their structure and semantics are specified clearly and comprehensively\r\nand are available to an orchestrator. Existing specification approaches are\r\neither ambiguous or miss important aspects regarding the behavior of virtual\r\nnetwork functions (VNFs) forming a service. We propose to formally and\r\nunambiguously specify the behavior of these functions and services using\r\nQueuing Petri Nets (QPNs). QPNs are an established method that allows to\r\nexpress queuing, synchronization, stochastically distributed processing delays,\r\nand changing traffic volume and characteristics at each VNF. With QPNs,\r\nmultiple VNFs can be connected to complete network services in any structure,\r\neven specifying bidirectional network services containing loops.\r\n  We discuss how management and orchestration systems can benefit from our\r\nclear and comprehensive specification approach, leading to better placement of\r\nVNFs and improved Quality of Service. Another benefit of formally specifying\r\nnetwork services with QPNs are diverse analysis options, which allow valuable\r\ninsights such as the distribution of end-to-end delay. We propose a tool-based\r\nworkflow that supports the specification of network services and the automatic\r\ngeneration of corresponding simulation code to enable an in-depth analysis of\r\ntheir behavior and performance.","lang":"eng"}],"file":[{"date_updated":"2019-01-07T12:38:35Z","date_created":"2019-01-07T12:38:35Z","creator":"stschn","file_size":497528,"file_name":"ris_preprint.pdf","file_id":"6504","access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"publication":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","ddc":["040"],"language":[{"iso":"eng"}],"year":"2019","title":"Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets","publisher":"IFIP","date_created":"2018-06-18T15:23:18Z","status":"public","type":"conference","file_date_updated":"2019-01-07T12:38:35Z","_id":"3287","project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"call_identifier":"5G PPP Phase 1","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","grant_number":"671517"}],"department":[{"_id":"77"},{"_id":"75"}],"user_id":"35343","place":"Washington, DC, USA","page":"116--124","citation":{"apa":"Schneider, S. B., Sharma, A., Karl, H., &#38; Wehrheim, H. (2019). Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i> (pp. 116--124). Washington, DC, USA: IFIP.","bibtex":"@inproceedings{Schneider_Sharma_Karl_Wehrheim_2019, place={Washington, DC, USA}, title={Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets}, booktitle={2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)}, publisher={IFIP}, author={Schneider, Stefan Balthasar and Sharma, Arnab and Karl, Holger and Wehrheim, Heike}, year={2019}, pages={116--124} }","mla":"Schneider, Stefan Balthasar, et al. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, IFIP, 2019, pp. 116--124.","short":"S.B. Schneider, A. Sharma, H. Karl, H. Wehrheim, in: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP, Washington, DC, USA, 2019, pp. 116--124.","ama":"Schneider SB, Sharma A, Karl H, Wehrheim H. Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In: <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>. Washington, DC, USA: IFIP; 2019:116--124.","ieee":"S. B. Schneider, A. Sharma, H. Karl, and H. Wehrheim, “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets,” in <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, Washington, DC, USA, 2019, pp. 116--124.","chicago":"Schneider, Stefan Balthasar, Arnab Sharma, Holger Karl, and Heike Wehrheim. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” In <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, 116--124. Washington, DC, USA: IFIP, 2019."},"has_accepted_license":"1","conference":{"end_date":"2019-04-12","location":"Washington, DC, USA","name":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","start_date":"2019-04-08"},"main_file_link":[{"open_access":"1","url":"http://dl.ifip.org/db/conf/im/im2019/188490.pdf"}],"date_updated":"2022-01-06T06:59:09Z","oa":"1","author":[{"first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider","id":"35343","full_name":"Schneider, Stefan Balthasar"},{"first_name":"Arnab","id":"67200","full_name":"Sharma, Arnab","last_name":"Sharma"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}]},{"date_created":"2018-07-20T14:08:49Z","publisher":"Elsevier","title":"CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation","year":"2019","language":[{"iso":"eng"}],"keyword":["Approximate Computing","Framework","Pareto Front","Accuracy"],"publication":"Microelectronics Reliability","abstract":[{"lang":"eng","text":"Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments."}],"volume":99,"author":[{"full_name":"Witschen, Linus Matthias","id":"49051","last_name":"Witschen","first_name":"Linus Matthias"},{"last_name":"Wiersema","id":"3118","full_name":"Wiersema, Tobias","first_name":"Tobias"},{"last_name":"Ghasemzadeh Mohammadi","id":"61186","full_name":"Ghasemzadeh Mohammadi, Hassan","first_name":"Hassan"},{"last_name":"Awais","orcid":"https://orcid.org/0000-0003-4148-2969","id":"64665","full_name":"Awais, Muhammad","first_name":"Muhammad"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"}],"date_updated":"2022-01-06T06:59:25Z","doi":"10.1016/j.microrel.2019.04.003","publication_identifier":{"issn":["0026-2714"]},"publication_status":"published","intvolume":"        99","page":"277-290","citation":{"apa":"Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., &#38; Platzner, M. (2019). CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Microelectronics Reliability</i>, <i>99</i>, 277–290. <a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">https://doi.org/10.1016/j.microrel.2019.04.003</a>","bibtex":"@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner_2019, title={CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}, volume={99}, DOI={<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>}, journal={Microelectronics Reliability}, publisher={Elsevier}, author={Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco}, year={2019}, pages={277–290} }","mla":"Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Microelectronics Reliability</i>, vol. 99, Elsevier, 2019, pp. 277–90, doi:<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>.","short":"L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner, Microelectronics Reliability 99 (2019) 277–290.","ieee":"L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner, “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,” <i>Microelectronics Reliability</i>, vol. 99, pp. 277–290, 2019.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi, Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Microelectronics Reliability</i> 99 (2019): 277–90. <a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">https://doi.org/10.1016/j.microrel.2019.04.003</a>.","ama":"Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Microelectronics Reliability</i>. 2019;99:277-290. doi:<a href=\"https://doi.org/10.1016/j.microrel.2019.04.003\">10.1016/j.microrel.2019.04.003</a>"},"department":[{"_id":"78"}],"user_id":"49051","_id":"3585","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"type":"journal_article","status":"public"},{"ddc":["000"],"language":[{"iso":"eng"}],"abstract":[{"text":"We investigate the degree of price competition among telecommunication firms. Underlying a Bertrand model of price competition, we empirically model pricing behaviour in an oligopoly. We analyse panel data of individual pricing information of mobile phone contracts offered between 2011 and 2017. We provide empirical evidence that price differences as well as reputational effects serve as a signal to buyers and significantly affect market demand. Additionally, we find that brands lead to an increase in demand and thus are able to generate spillover effects even after price increase.","lang":"eng"}],"file":[{"date_created":"2018-11-02T15:35:29Z","creator":"ups","date_updated":"2018-11-02T15:35:29Z","access_level":"closed","file_id":"5307","file_name":"KaimannHoyer.pdf","file_size":625230,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Applied Economics Letters","title":"Price competition and the Bertrand model: The paradox of the German mobile discount market","publisher":"Taylor and Francis Online","date_created":"2018-01-31T08:34:35Z","year":"2019","issue":"1","file_date_updated":"2018-11-02T15:35:29Z","project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"name":"SFB 901","_id":"1"}],"_id":"1139","user_id":"18949","department":[{"_id":"280"},{"_id":"183"},{"_id":"475"}],"status":"public","type":"journal_article","main_file_link":[{"url":"http://www.tandfonline.com/doi/full/10.1080/13504851.2018.1436141"}],"doi":"10.1080/13504851.2018.1436141","date_updated":"2022-01-06T06:51:00Z","author":[{"last_name":"Kaimann","full_name":"Kaimann, Daniel","id":"18949","first_name":"Daniel"},{"first_name":"Britta","id":"42447","full_name":"Hoyer, Britta","last_name":"Hoyer"}],"volume":26,"citation":{"ama":"Kaimann D, Hoyer B. Price competition and the Bertrand model: The paradox of the German mobile discount market. <i>Applied Economics Letters</i>. 2019;26(1):54-57. doi:<a href=\"https://doi.org/10.1080/13504851.2018.1436141\">10.1080/13504851.2018.1436141</a>","ieee":"D. Kaimann and B. Hoyer, “Price competition and the Bertrand model: The paradox of the German mobile discount market,” <i>Applied Economics Letters</i>, vol. 26, no. 1, pp. 54–57, 2019.","chicago":"Kaimann, Daniel, and Britta Hoyer. “Price Competition and the Bertrand Model: The Paradox of the German Mobile Discount Market.” <i>Applied Economics Letters</i> 26, no. 1 (2019): 54–57. <a href=\"https://doi.org/10.1080/13504851.2018.1436141\">https://doi.org/10.1080/13504851.2018.1436141</a>.","short":"D. Kaimann, B. Hoyer, Applied Economics Letters 26 (2019) 54–57.","mla":"Kaimann, Daniel, and Britta Hoyer. “Price Competition and the Bertrand Model: The Paradox of the German Mobile Discount Market.” <i>Applied Economics Letters</i>, vol. 26, no. 1, Taylor and Francis Online, 2019, pp. 54–57, doi:<a href=\"https://doi.org/10.1080/13504851.2018.1436141\">10.1080/13504851.2018.1436141</a>.","bibtex":"@article{Kaimann_Hoyer_2019, title={Price competition and the Bertrand model: The paradox of the German mobile discount market}, volume={26}, DOI={<a href=\"https://doi.org/10.1080/13504851.2018.1436141\">10.1080/13504851.2018.1436141</a>}, number={1}, journal={Applied Economics Letters}, publisher={Taylor and Francis Online}, author={Kaimann, Daniel and Hoyer, Britta}, year={2019}, pages={54–57} }","apa":"Kaimann, D., &#38; Hoyer, B. (2019). Price competition and the Bertrand model: The paradox of the German mobile discount market. <i>Applied Economics Letters</i>, <i>26</i>(1), 54–57. <a href=\"https://doi.org/10.1080/13504851.2018.1436141\">https://doi.org/10.1080/13504851.2018.1436141</a>"},"intvolume":"        26","page":"54-57","publication_status":"epub_ahead","has_accepted_license":"1"},{"publication":"Journal of Economic Behavior & Organization","type":"journal_article","abstract":[{"lang":"eng","text":"Social psychology studies the \"common enemy effect\", the phenomenon\r\nthat members of a group work together when they face an opponent, although they otherwise have little in common. An interesting scenario\r\nis the formation of an information network where group members individually sponsor costly links. Suppose that ceteris paribus, an outsider\r\nappears who aims to disrupt the information \r\nflow within the network\r\nby deleting some of the links. The question is how the group responds\r\nto this common enemy. We address this question for the homogeneous\r\nconnections model of strategic network formation, with two-way \r\nflow of\r\ninformation and without information decay. For sufficiently low linkage\r\ncosts, the external threat can lead to a more connected network, a positive\r\ncommon enemy effect. For very high but not prohibitively high linkage\r\ncosts, the equilibrium network can be minimally connected and efficient\r\nin the absence of the external threat whereas it is always empty and ineffi\fcient in the presence of the external threat, a negative common enemy\r\neffect. For intermediate linkage costs, both connected networks and the\r\nempty network are Nash for certain cost ranges."}],"status":"public","_id":"2256","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"280"},{"_id":"475"}],"user_id":"477","language":[{"iso":"eng"}],"publication_status":"published","year":"2019","page":"146-163","intvolume":"       162","citation":{"mla":"Hoyer, Britta, and Hans Haller. “The Common Enemy Effect under Strategic Network Formation and  Disruption.” <i>Journal of Economic Behavior &#38; Organization</i>, vol. 162, 2019, pp. 146–63, doi:<a href=\"https://doi.org/10.1016/j.jebo.2019.03.011\">10.1016/j.jebo.2019.03.011</a>.","bibtex":"@article{Hoyer_Haller_2019, title={The Common Enemy Effect under Strategic Network Formation and  Disruption}, volume={162}, DOI={<a href=\"https://doi.org/10.1016/j.jebo.2019.03.011\">10.1016/j.jebo.2019.03.011</a>}, journal={Journal of Economic Behavior &#38; Organization}, author={Hoyer, Britta and Haller, Hans}, year={2019}, pages={146–163} }","short":"B. Hoyer, H. Haller, Journal of Economic Behavior &#38; Organization 162 (2019) 146–163.","apa":"Hoyer, B., &#38; Haller, H. (2019). The Common Enemy Effect under Strategic Network Formation and  Disruption. <i>Journal of Economic Behavior &#38; Organization</i>, <i>162</i>, 146–163. <a href=\"https://doi.org/10.1016/j.jebo.2019.03.011\">https://doi.org/10.1016/j.jebo.2019.03.011</a>","ama":"Hoyer B, Haller H. The Common Enemy Effect under Strategic Network Formation and  Disruption. <i>Journal of Economic Behavior &#38; Organization</i>. 2019;162:146-163. doi:<a href=\"https://doi.org/10.1016/j.jebo.2019.03.011\">10.1016/j.jebo.2019.03.011</a>","ieee":"B. Hoyer and H. Haller, “The Common Enemy Effect under Strategic Network Formation and  Disruption,” <i>Journal of Economic Behavior &#38; Organization</i>, vol. 162, pp. 146–163, 2019.","chicago":"Hoyer, Britta, and Hans Haller. “The Common Enemy Effect under Strategic Network Formation and  Disruption.” <i>Journal of Economic Behavior &#38; Organization</i> 162 (2019): 146–63. <a href=\"https://doi.org/10.1016/j.jebo.2019.03.011\">https://doi.org/10.1016/j.jebo.2019.03.011</a>."},"date_updated":"2022-01-06T06:55:36Z","volume":162,"date_created":"2018-04-06T07:59:01Z","author":[{"first_name":"Britta","last_name":"Hoyer","full_name":"Hoyer, Britta","id":"42447"},{"last_name":"Haller","full_name":"Haller, Hans","first_name":"Hans"}],"title":"The Common Enemy Effect under Strategic Network Formation and  Disruption","doi":"10.1016/j.jebo.2019.03.011","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0167268119300824"}]},{"year":"2019","citation":{"ama":"Szopinski D. Jumping, dumping, and pumping: Three mental principles for idea generation to activate software-based tools in business model innovation. In: <i>Proceedings of the 32nd Bled EConference</i>. ; 2019.","ieee":"D. Szopinski, “Jumping, dumping, and pumping: Three mental principles for idea generation to activate software-based tools in business model innovation,” in <i>Proceedings of the 32nd Bled eConference</i>, Bled, Slovenia, 2019.","chicago":"Szopinski, Daniel. “Jumping, Dumping, and Pumping: Three Mental Principles for Idea Generation to Activate Software-Based Tools in Business Model Innovation.” In <i>Proceedings of the 32nd Bled EConference</i>, 2019.","bibtex":"@inproceedings{Szopinski_2019, title={Jumping, dumping, and pumping: Three mental principles for idea generation to activate software-based tools in business model innovation}, booktitle={Proceedings of the 32nd Bled eConference}, author={Szopinski, Daniel}, year={2019} }","short":"D. Szopinski, in: Proceedings of the 32nd Bled EConference, 2019.","mla":"Szopinski, Daniel. “Jumping, Dumping, and Pumping: Three Mental Principles for Idea Generation to Activate Software-Based Tools in Business Model Innovation.” <i>Proceedings of the 32nd Bled EConference</i>, 2019.","apa":"Szopinski, D. (2019). Jumping, dumping, and pumping: Three mental principles for idea generation to activate software-based tools in business model innovation. In <i>Proceedings of the 32nd Bled eConference</i>. Bled, Slovenia."},"has_accepted_license":"1","title":"Jumping, dumping, and pumping: Three mental principles for idea generation to activate software-based tools in business model innovation","conference":{"name":"32nd Bled eConference","location":"Bled, Slovenia"},"date_updated":"2022-01-06T07:04:10Z","date_created":"2019-04-17T12:14:39Z","author":[{"first_name":"Daniel","last_name":"Szopinski","full_name":"Szopinski, Daniel","id":"36372"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1465891,"access_level":"closed","file_name":"BLED 2019 Manuscript_final.pdf","file_id":"9262","date_updated":"2019-04-17T12:17:42Z","creator":"abursig","date_created":"2019-04-17T12:17:42Z"}],"publication":"Proceedings of the 32nd Bled eConference","type":"conference","ddc":["040"],"file_date_updated":"2019-04-17T12:17:42Z","language":[{"iso":"eng"}],"_id":"9261","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"department":[{"_id":"276"}],"user_id":"16205"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"9263","user_id":"16205","department":[{"_id":"276"}],"ddc":["040"],"file_date_updated":"2019-04-17T12:21:28Z","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 27th European Conference on Information Systems (ECIS)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-04-17T12:21:28Z","date_created":"2019-04-17T12:21:28Z","creator":"abursig","file_size":414949,"file_id":"9264","access_level":"closed","file_name":"ECIS2019_TaxonomyEvaluation_RevisedManuscript_final.pdf"}],"status":"public","date_updated":"2022-01-06T07:04:10Z","author":[{"full_name":"Szopinski, Daniel","id":"36372","last_name":"Szopinski","first_name":"Daniel"},{"first_name":"T.","full_name":"Schoormann, T.","last_name":"Schoormann"},{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"date_created":"2019-04-17T12:21:40Z","title":"Because your taxonomy is worth it: Towards a framework for taxonomy evaluation","conference":{"name":"27th European Conference on Information Systems (ECIS)","location":"Stockholm, Sweden"},"has_accepted_license":"1","year":"2019","citation":{"chicago":"Szopinski, Daniel, T. Schoormann, and Dennis Kundisch. “Because Your Taxonomy Is Worth It: Towards a Framework for Taxonomy Evaluation.” In <i>Proceedings of the 27th European Conference on Information Systems (ECIS)</i>, 2019.","ieee":"D. Szopinski, T. Schoormann, and D. Kundisch, “Because your taxonomy is worth it: Towards a framework for taxonomy evaluation,” in <i>Proceedings of the 27th European Conference on Information Systems (ECIS)</i>, Stockholm, Sweden, 2019.","ama":"Szopinski D, Schoormann T, Kundisch D. Because your taxonomy is worth it: Towards a framework for taxonomy evaluation. In: <i>Proceedings of the 27th European Conference on Information Systems (ECIS)</i>. ; 2019.","apa":"Szopinski, D., Schoormann, T., &#38; Kundisch, D. (2019). Because your taxonomy is worth it: Towards a framework for taxonomy evaluation. In <i>Proceedings of the 27th European Conference on Information Systems (ECIS)</i>. Stockholm, Sweden.","mla":"Szopinski, Daniel, et al. “Because Your Taxonomy Is Worth It: Towards a Framework for Taxonomy Evaluation.” <i>Proceedings of the 27th European Conference on Information Systems (ECIS)</i>, 2019.","bibtex":"@inproceedings{Szopinski_Schoormann_Kundisch_2019, title={Because your taxonomy is worth it: Towards a framework for taxonomy evaluation}, booktitle={Proceedings of the 27th European Conference on Information Systems (ECIS)}, author={Szopinski, Daniel and Schoormann, T. and Kundisch, Dennis}, year={2019} }","short":"D. Szopinski, T. Schoormann, D. Kundisch, in: Proceedings of the 27th European Conference on Information Systems (ECIS), 2019."}}]