[{"has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file":[{"success":1,"relation":"main_file","date_updated":"2018-03-21T10:45:57Z","date_created":"2018-03-21T10:45:57Z","content_type":"application/pdf","file_id":"1525","access_level":"closed","file_name":"200-thesis.pdf","file_size":880390,"creator":"florida"}],"title":"Existence and Properties of Pure Nash Equilibria in Budget Games","user_id":"15415","type":"dissertation","ddc":["040"],"supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"}],"department":[{"_id":"63"},{"_id":"541"}],"citation":{"mla":"Drees, Maximilian. <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>. Universität Paderborn, 2016.","bibtex":"@book{Drees_2016, title={Existence and Properties of Pure Nash Equilibria in Budget Games}, publisher={Universität Paderborn}, author={Drees, Maximilian}, year={2016} }","short":"M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games, Universität Paderborn, 2016.","ama":"Drees M. <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>. Universität Paderborn; 2016.","apa":"Drees, M. (2016). <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>. Universität Paderborn.","chicago":"Drees, Maximilian. <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>. Universität Paderborn, 2016.","ieee":"M. Drees, <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>. Universität Paderborn, 2016."},"status":"public","language":[{"iso":"eng"}],"year":"2016","publisher":"Universität Paderborn","related_material":{"link":[{"url":"https://nbn-resolving.de/urn:nbn:de:hbz:466:2-24915","relation":"confirmation"}]},"date_created":"2017-10-17T12:41:31Z","date_updated":"2022-01-06T06:54:18Z","_id":"200","file_date_updated":"2018-03-21T10:45:57Z"},{"date_updated":"2022-01-06T06:54:18Z","_id":"201","language":[{"iso":"ger"}],"type":"bachelorsthesis","year":"2016","status":"public","date_created":"2017-10-17T12:41:31Z","publisher":"Universität Paderborn","department":[{"_id":"77"}],"citation":{"short":"H. Bröcher, Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung, Universität Paderborn, 2016.","mla":"Bröcher, Henrik. <i>Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung</i>. Universität Paderborn, 2016.","bibtex":"@book{Bröcher_2016, title={Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung}, publisher={Universität Paderborn}, author={Bröcher, Henrik}, year={2016} }","chicago":"Bröcher, Henrik. <i>Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung</i>. Universität Paderborn, 2016.","ieee":"H. Bröcher, <i>Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung</i>. Universität Paderborn, 2016.","apa":"Bröcher, H. (2016). <i>Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung</i>. Universität Paderborn.","ama":"Bröcher H. <i>Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung</i>. Universität Paderborn; 2016."},"user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"title":"Evaluation von Graphpartitionierungsalgorithmen im Kontext von Konfigurierbarer Softwarezertifizierung","author":[{"first_name":"Henrik","full_name":"Bröcher, Henrik","last_name":"Bröcher"}]},{"_id":"202","file_date_updated":"2018-03-21T10:45:23Z","date_updated":"2022-01-06T06:54:22Z","ddc":["040"],"date_created":"2017-10-17T12:41:31Z","publisher":"Universität Paderborn","year":"2016","type":"dissertation","status":"public","citation":{"ama":"Dimant E. <i>Economics of Corruption and Crime: An Interdisciplinary Approach to Behavioral Ethics</i>. Universität Paderborn; 2016.","apa":"Dimant, E. (2016). <i>Economics of Corruption and Crime: An Interdisciplinary Approach to Behavioral Ethics</i>. Universität Paderborn.","chicago":"Dimant, Eugen. <i>Economics of Corruption and Crime: An Interdisciplinary Approach to Behavioral Ethics</i>. Universität Paderborn, 2016.","ieee":"E. Dimant, <i>Economics of Corruption and Crime: An Interdisciplinary Approach to Behavioral Ethics</i>. Universität Paderborn, 2016.","mla":"Dimant, Eugen. <i>Economics of Corruption and Crime: An Interdisciplinary Approach to Behavioral Ethics</i>. Universität Paderborn, 2016.","bibtex":"@book{Dimant_2016, title={Economics of Corruption and Crime: An Interdisciplinary Approach to Behavioral Ethics}, publisher={Universität Paderborn}, author={Dimant, Eugen}, year={2016} }","short":"E. Dimant, Economics of Corruption and Crime: An Interdisciplinary Approach to Behavioral Ethics, Universität Paderborn, 2016."},"user_id":"42447","department":[{"_id":"280"}],"title":"Economics of Corruption and Crime: An Interdisciplinary Approach to Behavioral Ethics","file":[{"date_created":"2018-03-21T10:45:23Z","file_id":"1524","content_type":"application/pdf","access_level":"closed","file_name":"202-Dissertation_Final.pdf","file_size":8752559,"creator":"florida","success":1,"relation":"main_file","date_updated":"2018-03-21T10:45:23Z"}],"author":[{"last_name":"Dimant","full_name":"Dimant, Eugen","first_name":"Eugen"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"supervisor":[{"full_name":"Hehenkamp, Burkhard","first_name":"Burkhard","last_name":"Hehenkamp","id":"37339"}],"has_accepted_license":"1"},{"intvolume":"        98","author":[{"last_name":"Manegold","full_name":"Manegold, Jochen","first_name":"Jochen"}],"department":[{"_id":"205"},{"_id":"475"}],"series_title":"Working Papers CIE","citation":{"apa":"Manegold, J. (2016). <i>Stackelberg Competition among Intermediaries in a Differentiated Duopoly with Product Innovation</i> (Vol. 98). CIE Working Paper Series, Paderborn University.","ama":"Manegold J. <i>Stackelberg Competition among Intermediaries in a Differentiated Duopoly with Product Innovation</i>. Vol 98. CIE Working Paper Series, Paderborn University; 2016.","ieee":"J. Manegold, <i>Stackelberg Competition among Intermediaries in a Differentiated Duopoly with Product Innovation</i>, vol. 98. CIE Working Paper Series, Paderborn University, 2016.","chicago":"Manegold, Jochen. <i>Stackelberg Competition among Intermediaries in a Differentiated Duopoly with Product Innovation</i>. Vol. 98. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2016.","bibtex":"@book{Manegold_2016, series={Working Papers CIE}, title={Stackelberg Competition among Intermediaries in a Differentiated Duopoly with Product Innovation}, volume={98}, publisher={CIE Working Paper Series, Paderborn University}, author={Manegold, Jochen}, year={2016}, collection={Working Papers CIE} }","mla":"Manegold, Jochen. <i>Stackelberg Competition among Intermediaries in a Differentiated Duopoly with Product Innovation</i>. Vol. 98, CIE Working Paper Series, Paderborn University, 2016.","short":"J. Manegold, Stackelberg Competition among Intermediaries in a Differentiated Duopoly with Product Innovation, CIE Working Paper Series, Paderborn University, 2016."},"year":"2016","language":[{"iso":"eng"}],"status":"public","date_created":"2018-05-03T08:06:05Z","publisher":"CIE Working Paper Series, Paderborn University","date_updated":"2022-01-06T06:57:11Z","file_date_updated":"2018-10-31T09:16:36Z","_id":"2570","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"has_accepted_license":"1","abstract":[{"text":"On an intermediate goods market we consider vertical and horizontal product differentiation and analyze the impact of simultaneous competition for resources and the demand of customers on the market outcome. Asymmetries between intermediaries may arise due to distinct product qualities as well as by reasons of different production technologies. The intermediaries compete on the output market by choosing production quantities sequentially and for the supplies of a monopolistic input supplier on the input market. It turns out that there exist differences in product quality and productivities such that an intermediary being the Stackelberg leader has no incentive to procure inputs, whereas in the role of the Stackelberg follower will participate in the market. Moreover, we find that given an intermediary is more competitive, his equilibrium output quantity is higher when being the leader than when being the follower. Interestingly, if the intermediary is less competitive and goods are complements, there may exist asymmetries such that an intermediary being in the position of the Stackelberg follower offers higher output quantities in equilibrium than when being in the position of the Stackelberg leader.","lang":"eng"}],"title":"Stackelberg Competition among Intermediaries in a Differentiated Duopoly with Product Innovation","file":[{"relation":"main_file","date_updated":"2018-10-31T09:16:36Z","success":1,"creator":"stela","file_size":776029,"file_name":"WP - Stackelberg Competition among Intermediaries in a Differentiated Duopoly with Product Innovation.pdf","content_type":"application/pdf","file_id":"5145","access_level":"closed","date_created":"2018-10-31T09:16:36Z"}],"user_id":"65453","keyword":["Input Market","Product Quality","Quantity Competition","Stackelberg Competition","Product Innovation"],"type":"working_paper","ddc":["040"],"volume":98},{"_id":"3308","date_updated":"2022-01-06T06:59:10Z","date_created":"2018-06-22T11:46:37Z","publisher":"Universität Paderborn","type":"bachelorsthesis","year":"2016","language":[{"iso":"ger"}],"status":"public","citation":{"short":"R. Breuer, Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse, Universität Paderborn, 2016.","bibtex":"@book{Breuer_2016, title={Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse}, publisher={Universität Paderborn}, author={Breuer, Robin }, year={2016} }","mla":"Breuer, Robin. <i>Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse</i>. Universität Paderborn, 2016.","ieee":"R. Breuer, <i>Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse</i>. Universität Paderborn, 2016.","chicago":"Breuer, Robin . <i>Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse</i>. Universität Paderborn, 2016.","ama":"Breuer R. <i>Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse</i>. Universität Paderborn; 2016.","apa":"Breuer, R. (2016). <i>Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse</i>. Universität Paderborn."},"user_id":"477","department":[{"_id":"183"}],"title":"Monitoring in Franchise-Netzwerken: Eine ökonomische Analyse","author":[{"full_name":"Breuer, Robin ","first_name":"Robin ","last_name":"Breuer"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"supervisor":[{"last_name":"Frick","first_name":"Bernd","full_name":"Frick, Bernd"}]},{"date_created":"2018-06-22T12:01:15Z","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"type":"mastersthesis","year":"2016","status":"public","_id":"3311","date_updated":"2022-01-06T06:59:10Z","title":"Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden","author":[{"last_name":"Amedick","first_name":"Michaela","full_name":"Amedick, Michaela"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"supervisor":[{"first_name":"Bernd","full_name":"Frick, Bernd","last_name":"Frick"}],"citation":{"short":"M. Amedick, Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden, Universität Paderborn, 2016.","bibtex":"@book{Amedick_2016, title={Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden}, publisher={Universität Paderborn}, author={Amedick, Michaela}, year={2016} }","mla":"Amedick, Michaela. <i>Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden</i>. Universität Paderborn, 2016.","ieee":"M. Amedick, <i>Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden</i>. Universität Paderborn, 2016.","chicago":"Amedick, Michaela. <i>Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden</i>. Universität Paderborn, 2016.","ama":"Amedick M. <i>Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden</i>. Universität Paderborn; 2016.","apa":"Amedick, M. (2016). <i>Informationsasymmetrien auf dem Spendenmarkt und Möglichkeiten ihrer Reduktion: Eine Prinzipal-Agenten-Perspektive von Online Spenden</i>. Universität Paderborn."},"user_id":"477","department":[{"_id":"183"}]},{"user_id":"15504","project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"}],"doi":"10.4467/20838476si.16.006.6187","has_accepted_license":"1","title":"Pairwise versus Pointwise Ranking: A Case Study","file":[{"success":1,"date_updated":"2018-11-02T15:54:38Z","relation":"main_file","file_id":"5317","content_type":"application/pdf","access_level":"closed","date_created":"2018-11-02T15:54:38Z","creator":"ups","file_size":1002478,"file_name":"roz-6-Melnikov.pdf"}],"volume":25,"type":"journal_article","ddc":["000"],"publication":"Schedae Informaticae","department":[{"_id":"355"},{"_id":"183"}],"citation":{"short":"V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick,  Pritha  Gupta, Schedae Informaticae 25 (2016).","mla":"Melnikov, Vitalik, et al. “Pairwise versus Pointwise Ranking: A Case Study.” <i>Schedae Informaticae</i>, vol. 25, Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego, 2016, doi:<a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">10.4467/20838476si.16.006.6187</a>.","bibtex":"@article{Melnikov_Hüllermeier_Kaimann_Frick_Gupta_2016, title={Pairwise versus Pointwise Ranking: A Case Study}, volume={25}, DOI={<a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">10.4467/20838476si.16.006.6187</a>}, journal={Schedae Informaticae}, publisher={Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego}, author={Melnikov, Vitalik and Hüllermeier, Eyke and Kaimann, Daniel and Frick, Bernd  and Gupta,  Pritha }, year={2016} }","chicago":"Melnikov, Vitalik, Eyke Hüllermeier, Daniel Kaimann, Bernd  Frick, and  Pritha  Gupta. “Pairwise versus Pointwise Ranking: A Case Study.” <i>Schedae Informaticae</i> 25 (2016). <a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">https://doi.org/10.4467/20838476si.16.006.6187</a>.","ieee":"V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick, and  Pritha  Gupta, “Pairwise versus Pointwise Ranking: A Case Study,” <i>Schedae Informaticae</i>, vol. 25, 2016.","ama":"Melnikov V, Hüllermeier E, Kaimann D, Frick B, Gupta  Pritha . Pairwise versus Pointwise Ranking: A Case Study. <i>Schedae Informaticae</i>. 2016;25. doi:<a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">10.4467/20838476si.16.006.6187</a>","apa":"Melnikov, V., Hüllermeier, E., Kaimann, D., Frick, B., &#38; Gupta,  Pritha . (2016). Pairwise versus Pointwise Ranking: A Case Study. <i>Schedae Informaticae</i>, <i>25</i>. <a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">https://doi.org/10.4467/20838476si.16.006.6187</a>"},"publication_status":"published","intvolume":"        25","author":[{"last_name":"Melnikov","first_name":"Vitalik","full_name":"Melnikov, Vitalik"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"id":"18949","last_name":"Kaimann","first_name":"Daniel","full_name":"Kaimann, Daniel"},{"last_name":"Frick","first_name":"Bernd ","full_name":"Frick, Bernd "},{"last_name":"Gupta","full_name":"Gupta,  Pritha ","first_name":" Pritha "}],"date_updated":"2022-01-06T06:59:10Z","file_date_updated":"2018-11-02T15:54:38Z","_id":"3318","year":"2016","publication_identifier":{"issn":["2083-8476"]},"language":[{"iso":"eng"}],"status":"public","date_created":"2018-06-22T14:49:40Z","publisher":"Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego"},{"user_id":"477","file":[{"success":1,"date_updated":"2018-11-02T14:17:13Z","relation":"main_file","date_created":"2018-11-02T14:17:13Z","access_level":"closed","file_id":"5267","content_type":"application/pdf","file_name":"VerificationOfAUTOSARSoftwareA.pdf","file_size":2640695,"creator":"ups"}],"title":"Verification of AUTOSAR Software Architectures with Timed Automata","has_accepted_license":"1","doi":"10.1007/978-3-319-45943-1_13","project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"page":"189--204","ddc":["000"],"publication":"Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings","type":"conference","series_title":"Lecture Notes in Computer Science","citation":{"mla":"Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>.","bibtex":"@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>}, booktitle={Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}, author={Beringer, Steffen and Wehrheim, Heike}, editor={H. ter Beek, Maurice and Gnesi, Stefania and Knapp, AlexanderEditors}, year={2016}, pages={189--204}, collection={Lecture Notes in Computer Science} }","short":"S. Beringer, H. Wehrheim, in: M. H. ter Beek, S. Gnesi, A. Knapp (Eds.), Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.","apa":"Beringer, S., &#38; Wehrheim, H. (2016). Verification of AUTOSAR Software Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, &#38; A. Knapp (Eds.), <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i> (pp. 189--204). <a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">https://doi.org/10.1007/978-3-319-45943-1_13</a>","ama":"Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, eds. <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>. Lecture Notes in Computer Science. ; 2016:189--204. doi:<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>","chicago":"Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” In <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204. Lecture Notes in Computer Science, 2016. <a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">https://doi.org/10.1007/978-3-319-45943-1_13</a>.","ieee":"S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures with Timed Automata,” in <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, 2016, pp. 189--204."},"department":[{"_id":"77"}],"editor":[{"full_name":"H. ter Beek, Maurice","first_name":"Maurice","last_name":"H. ter Beek"},{"last_name":"Gnesi","first_name":"Stefania","full_name":"Gnesi, Stefania"},{"full_name":"Knapp, Alexander","first_name":"Alexander","last_name":"Knapp"}],"author":[{"last_name":"Beringer","full_name":"Beringer, Steffen","first_name":"Steffen"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"file_date_updated":"2018-11-02T14:17:13Z","_id":"3157","date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:39:35Z","status":"public","year":"2016","language":[{"iso":"eng"}]},{"_id":"210","date_updated":"2022-01-06T06:54:42Z","date_created":"2017-10-17T12:41:33Z","publisher":"Universität Paderborn","type":"mastersthesis","year":"2016","status":"public","citation":{"mla":"Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","bibtex":"@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität Paderborn}, author={Leder, Lennart}, year={2016} }","short":"L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016.","apa":"Leder, L. (2016). <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn.","ama":"Leder L. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn; 2016.","chicago":"Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","ieee":"L. Leder, <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016."},"user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"title":"Congestion Games with Mixed Objectives","author":[{"full_name":"Leder, Lennart","first_name":"Lennart","last_name":"Leder"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}]},{"author":[{"last_name":"Brangewitz","first_name":"Sonja","full_name":"Brangewitz, Sonja"},{"full_name":"Manegold, Jochen","first_name":"Jochen","last_name":"Manegold"}],"intvolume":"         6","citation":{"short":"S. Brangewitz, J. Manegold, Theoretical Economics Letters 6 (2016) 1341–1362.","bibtex":"@article{Brangewitz_Manegold_2016, title={Competition of Intermediaries in a Differentiated Duopoly}, volume={6}, DOI={<a href=\"https://doi.org/10.4236/tel.2016.66124\">10.4236/tel.2016.66124</a>}, number={6}, journal={Theoretical Economics Letters}, publisher={Scientific Research Publishing (SCIRP)}, author={Brangewitz, Sonja and Manegold, Jochen}, year={2016}, pages={1341–1362} }","mla":"Brangewitz, Sonja, and Jochen Manegold. “Competition of Intermediaries in a Differentiated Duopoly.” <i>Theoretical Economics Letters</i>, vol. 6, no. 6, Scientific Research Publishing (SCIRP), 2016, pp. 1341–62, doi:<a href=\"https://doi.org/10.4236/tel.2016.66124\">10.4236/tel.2016.66124</a>.","ieee":"S. Brangewitz and J. Manegold, “Competition of Intermediaries in a Differentiated Duopoly,” <i>Theoretical Economics Letters</i>, vol. 6, no. 6, pp. 1341–1362, 2016.","chicago":"Brangewitz, Sonja, and Jochen Manegold. “Competition of Intermediaries in a Differentiated Duopoly.” <i>Theoretical Economics Letters</i> 6, no. 6 (2016): 1341–62. <a href=\"https://doi.org/10.4236/tel.2016.66124\">https://doi.org/10.4236/tel.2016.66124</a>.","ama":"Brangewitz S, Manegold J. Competition of Intermediaries in a Differentiated Duopoly. <i>Theoretical Economics Letters</i>. 2016;6(6):1341-1362. doi:<a href=\"https://doi.org/10.4236/tel.2016.66124\">10.4236/tel.2016.66124</a>","apa":"Brangewitz, S., &#38; Manegold, J. (2016). Competition of Intermediaries in a Differentiated Duopoly. <i>Theoretical Economics Letters</i>, <i>6</i>(6), 1341–1362. <a href=\"https://doi.org/10.4236/tel.2016.66124\">https://doi.org/10.4236/tel.2016.66124</a>"},"publication_status":"published","department":[{"_id":"475"},{"_id":"205"}],"date_created":"2017-10-17T12:41:33Z","publisher":"Scientific Research Publishing (SCIRP)","language":[{"iso":"eng"}],"year":"2016","publication_identifier":{"unknown":["2162-2078","2162-2086"]},"status":"public","_id":"211","file_date_updated":"2018-03-21T10:42:53Z","date_updated":"2022-01-06T06:54:45Z","title":"Competition of Intermediaries in a Differentiated Duopoly","file":[{"date_updated":"2018-03-21T10:42:53Z","relation":"main_file","success":1,"file_size":597343,"file_name":"211-Brangewitz_and_Manegold__2016__TEL_2016122917254130.pdf","creator":"florida","date_created":"2018-03-21T10:42:53Z","file_id":"1520","content_type":"application/pdf","access_level":"closed"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"doi":"10.4236/tel.2016.66124","abstract":[{"lang":"eng","text":"On an intermediate goods market with asymmetric production technologies as well as vertical and horizontal product differentiation we analyze the influence of simultaneous competition for resources and customers. The intermediaries face either price or quantity competition on the output market and a monopolistic, strategically acting supplier on the input market. We find that there exist quality and productivity differences such that for quantity competition only one intermediary is willing to procure inputs from the input supplier, while for price competition both intermediaries are willing to purchase inputs. Moreover, the well-known welfare advantage of price competition can in general be no longer confirmed in our model with an endogenous input market and asymmetric intermediaries."}],"has_accepted_license":"1","user_id":"65453","ddc":["040"],"publication":"Theoretical Economics Letters","type":"journal_article","page":"1341-1362","volume":6,"issue":"6"},{"user_id":"477","citation":{"short":"J. Manegold, Competition in Markets with Intermediaries, Universität Paderborn, 2016.","bibtex":"@book{Manegold_2016, title={Competition in Markets with Intermediaries}, publisher={Universität Paderborn}, author={Manegold, Jochen}, year={2016} }","mla":"Manegold, Jochen. <i>Competition in Markets with Intermediaries</i>. Universität Paderborn, 2016.","ieee":"J. Manegold, <i>Competition in Markets with Intermediaries</i>. Universität Paderborn, 2016.","chicago":"Manegold, Jochen. <i>Competition in Markets with Intermediaries</i>. Universität Paderborn, 2016.","apa":"Manegold, J. (2016). <i>Competition in Markets with Intermediaries</i>. Universität Paderborn.","ama":"Manegold J. <i>Competition in Markets with Intermediaries</i>. Universität Paderborn; 2016."},"department":[{"_id":"19"},{"_id":"205"}],"author":[{"first_name":"Jochen","full_name":"Manegold, Jochen","last_name":"Manegold"}],"file":[{"access_level":"closed","content_type":"application/pdf","file_id":"1519","date_created":"2018-03-21T10:42:14Z","creator":"florida","file_size":1130436,"file_name":"212-Dissertation_-_Jochen_Manegold.pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T10:42:14Z"}],"title":"Competition in Markets with Intermediaries","supervisor":[{"id":"20801","last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"}],"has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"212","file_date_updated":"2018-03-21T10:42:14Z","date_updated":"2022-01-06T06:54:49Z","publisher":"Universität Paderborn","ddc":["040"],"date_created":"2017-10-17T12:41:33Z","status":"public","year":"2016","type":"dissertation","language":[{"iso":"eng"}]},{"title":"Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes","author":[{"last_name":"Porzenheim","full_name":"Porzenheim, Laurens","first_name":"Laurens"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","last_name":"Blömer","id":"23"}],"citation":{"apa":"Porzenheim, L. (2016). <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn.","ama":"Porzenheim L. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn; 2016.","ieee":"L. Porzenheim, <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn, 2016.","chicago":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016.","bibtex":"@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim, Laurens}, year={2016} }","mla":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016.","short":"L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes, Universität Paderborn, 2016."},"user_id":"477","department":[{"_id":"64"}],"date_created":"2017-10-17T12:41:33Z","publisher":"Universität Paderborn","year":"2016","type":"bachelorsthesis","status":"public","_id":"213","date_updated":"2022-01-06T06:54:53Z"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"title":"Commitment Schemes - Definitions, Variants, and Security","author":[{"last_name":"Bemmann","first_name":"Kai Sören","full_name":"Bemmann, Kai Sören"}],"department":[{"_id":"64"}],"citation":{"mla":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","bibtex":"@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants, and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören}, year={2016} }","short":"K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität Paderborn, 2016.","apa":"Bemmann, K. S. (2016). <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn.","ama":"Bemmann KS. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn; 2016.","chicago":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","ieee":"K. S. Bemmann, <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016."},"user_id":"477","year":"2016","type":"bachelorsthesis","status":"public","date_created":"2017-10-17T12:41:33Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:58Z","_id":"214"},{"date_created":"2017-10-17T12:41:33Z","status":"public","language":[{"iso":"eng"}],"year":"2016","_id":"215","file_date_updated":"2018-03-21T10:41:40Z","date_updated":"2022-01-06T06:55:02Z","author":[{"first_name":"Maximilian","full_name":"Drees, Maximilian","last_name":"Drees"},{"last_name":"Gmyr","first_name":"Robert","full_name":"Gmyr, Robert"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"citation":{"apa":"Drees, M., Gmyr, R., &#38; Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 417--427). <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>","ama":"Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2016:417--427. doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>","chicago":"Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 417--427, 2016. <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>.","ieee":"M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427.","mla":"Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427, doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>.","bibtex":"@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }","short":"M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427."},"department":[{"_id":"79"},{"_id":"63"}],"ddc":["040"],"publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","page":"417--427","file":[{"content_type":"application/pdf","access_level":"closed","file_id":"1518","date_created":"2018-03-21T10:41:40Z","creator":"florida","file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf","file_size":352996,"success":1,"relation":"main_file","date_updated":"2018-03-21T10:41:40Z"}],"title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","abstract":[{"lang":"eng","text":"We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems."}],"has_accepted_license":"1","doi":"10.1145/2935764.2935783","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"user_id":"14955"},{"date_updated":"2022-01-06T06:55:07Z","file_date_updated":"2018-03-21T10:40:27Z","_id":"216","status":"public","year":"2016","type":"conference","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul","date_created":"2017-10-17T12:41:34Z","department":[{"_id":"276"}],"user_id":"16205","citation":{"ieee":"T. von Rechenberg and D. Gutt, “Challenge Accepted! - The Impcat of Goal Achievement on Subsequent User Effort and Implications of a Goal’s Difficulty,” in <i>Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul</i>, Istanbul, Turkey, 2016.","chicago":"Rechenberg, Tobias von, and Dominik Gutt. “Challenge Accepted! - The Impcat of Goal Achievement on Subsequent User Effort and Implications of a Goal’s Difficulty.” In <i>Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul</i>, 2016.","apa":"von Rechenberg, T., &#38; Gutt, D. (2016). Challenge Accepted! - The Impcat of Goal Achievement on Subsequent User Effort and Implications of a Goal’s Difficulty. In <i>Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul</i>. Istanbul, Turkey.","ama":"von Rechenberg T, Gutt D. Challenge Accepted! - The Impcat of Goal Achievement on Subsequent User Effort and Implications of a Goal’s Difficulty. In: <i>Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul</i>. ; 2016.","short":"T. von Rechenberg, D. Gutt, in: Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul, 2016.","bibtex":"@inproceedings{von Rechenberg_Gutt_2016, title={Challenge Accepted! - The Impcat of Goal Achievement on Subsequent User Effort and Implications of a Goal’s Difficulty}, booktitle={Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul}, author={von Rechenberg, Tobias and Gutt, Dominik}, year={2016} }","mla":"von Rechenberg, Tobias, and Dominik Gutt. “Challenge Accepted! - The Impcat of Goal Achievement on Subsequent User Effort and Implications of a Goal’s Difficulty.” <i>Proceedings of the 24th Conference on Information Systems (ECIS), Istanbul</i>, 2016."},"has_accepted_license":"1","abstract":[{"text":"We empirically investigate the impact of successful goal achievement on future effort to attain the next goal in a recurring goal framework. We use data from a popular German Question & Answer community where goals are represented in the form of badges. In particular, our analysis of this data hinges on the fact, that in this Question & Answer community, badges in a hierarchical badge system are in-creasingly challenging to attain up to a certain badge. After this certain badge, the difficulty level sud-denly drops and remains constant throughout up to the last badge in the hierarchy. Our findings indi-cate that after successful badge achievement users increase their subsequent effort to attain the next badge, but only as long as badges represent a challenge to the user. According to our analysis, we identify self-learning to be the key driver of this behavior.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file":[{"success":1,"relation":"main_file","date_updated":"2018-03-21T10:40:27Z","access_level":"closed","file_id":"1517","content_type":"application/pdf","date_created":"2018-03-21T10:40:27Z","creator":"florida","file_size":565109,"file_name":"216-ECIS2016_Challenge_Accepted_2315_final.pdf"}],"author":[{"last_name":"von Rechenberg","full_name":"von Rechenberg, Tobias","first_name":"Tobias"},{"full_name":"Gutt, Dominik","first_name":"Dominik","id":"14368","last_name":"Gutt"}],"conference":{"location":"Istanbul, Turkey","name":"24th Conference on Information Systems (ECIS)"},"title":"Challenge Accepted! - The Impcat of Goal Achievement on Subsequent User Effort and Implications of a Goal's Difficulty"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"author":[{"last_name":"Heck","first_name":"Eduard","full_name":"Heck, Eduard"}],"title":"Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des Google Marketplace","user_id":"477","citation":{"short":"E. Heck, Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des Google Marketplace, Universität Paderborn, 2016.","bibtex":"@book{Heck_2016, title={Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des Google Marketplace}, publisher={Universität Paderborn}, author={Heck, Eduard}, year={2016} }","mla":"Heck, Eduard. <i>Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des Google Marketplace</i>. Universität Paderborn, 2016.","ieee":"E. Heck, <i>Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des Google Marketplace</i>. Universität Paderborn, 2016.","chicago":"Heck, Eduard. <i>Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des Google Marketplace</i>. Universität Paderborn, 2016.","apa":"Heck, E. (2016). <i>Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des Google Marketplace</i>. Universität Paderborn.","ama":"Heck E. <i>Ontologie-Erstellung mittels Text-Mining aus App-Marktplätzen am Beispiel des Google Marketplace</i>. Universität Paderborn; 2016."},"status":"public","language":[{"iso":"ger"}],"type":"bachelorsthesis","year":"2016","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:25Z","date_updated":"2022-01-06T06:53:07Z","_id":"173"},{"language":[{"iso":"ger"}],"year":"2016","type":"bachelorsthesis","status":"public","date_created":"2017-10-17T12:41:25Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:10Z","_id":"174","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"title":"Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen","author":[{"full_name":"Schwentker, Christoph","first_name":"Christoph","last_name":"Schwentker"}],"citation":{"short":"C. Schwentker, Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen, Universität Paderborn, 2016.","mla":"Schwentker, Christoph. <i>Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen</i>. Universität Paderborn, 2016.","bibtex":"@book{Schwentker_2016, title={Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen}, publisher={Universität Paderborn}, author={Schwentker, Christoph}, year={2016} }","chicago":"Schwentker, Christoph. <i>Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen</i>. Universität Paderborn, 2016.","ieee":"C. Schwentker, <i>Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen</i>. Universität Paderborn, 2016.","ama":"Schwentker C. <i>Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen</i>. Universität Paderborn; 2016.","apa":"Schwentker, C. (2016). <i>Ontologie-basierte Extraktion funktionaler Softwareanforderungen am Fallbeispiel mobiler Kommunikationsapplikationen</i>. Universität Paderborn."},"user_id":"477"},{"ddc":["040"],"publication":"Science of Computer Programming","type":"journal_article","page":"2--23","file":[{"file_size":630739,"file_name":"175-1-s2.0-S0167642316300028-main.pdf","creator":"florida","date_created":"2018-03-21T12:38:40Z","content_type":"application/pdf","access_level":"closed","file_id":"1536","relation":"main_file","date_updated":"2018-03-21T12:38:40Z","success":1}],"title":"On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs","doi":"10.1016/j.scico.2016.04.002","abstract":[{"lang":"eng","text":"Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning.In this paper, we propose a method for constructing service compositions based on pre-verified templates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Their meaning is defined by an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Templates are proven correct using a Hoare-style proof calculus, extended by a specific rule for service calls. Construction of service compositions amounts to instantiation of templates with domain-specific services. Correctness of an instantiation can then simply be checked by verifying that the domain ontology (a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template."}],"has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"user_id":"477","publisher":"Elsevier","date_created":"2017-10-17T12:41:26Z","status":"public","language":[{"iso":"eng"}],"year":"2016","file_date_updated":"2018-03-21T12:38:40Z","_id":"175","date_updated":"2022-01-06T06:53:13Z","author":[{"first_name":"Sven","full_name":"Walther, Sven","last_name":"Walther"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"citation":{"ama":"Walther S, Wehrheim H. On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. <i>Science of Computer Programming</i>. 2016:2--23. doi:<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>","apa":"Walther, S., &#38; Wehrheim, H. (2016). On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. <i>Science of Computer Programming</i>, 2--23. <a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">https://doi.org/10.1016/j.scico.2016.04.002</a>","ieee":"S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs,” <i>Science of Computer Programming</i>, pp. 2--23, 2016.","chicago":"Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” <i>Science of Computer Programming</i>, 2016, 2--23. <a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">https://doi.org/10.1016/j.scico.2016.04.002</a>.","bibtex":"@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs}, DOI={<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>}, journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther, Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }","mla":"Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” <i>Science of Computer Programming</i>, Elsevier, 2016, pp. 2--23, doi:<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>.","short":"S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23."},"department":[{"_id":"77"}]},{"ddc":["040"],"quality_controlled":"1","publication":"Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)","type":"conference","page":"1807-1816","file":[{"access_level":"closed","file_id":"1535","content_type":"application/pdf","date_created":"2018-03-21T12:33:48Z","creator":"florida","file_size":259495,"file_name":"176-D16-1186.pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T12:33:48Z"}],"title":"On- and Off-Topic Classification and Semantic Annotation of User-Generated Software Requirements","abstract":[{"lang":"eng","text":"Users prefer natural language software requirements because of their usability and accessibility. When they describe their wishes for software development, they often provide off-topic information. We therefore present an automated approach for identifying and semantically annotating the on-topic parts of the given descriptions. It is designed to support requirement engineers in the requirement elicitation process on detecting and analyzing requirements in user-generated content. Since no lexical resources with domain-specific information about requirements are available, we created a corpus of requirements written in controlled language by instructed users and uncontrolled language by uninstructed users. We annotated these requirements regarding predicate-argument structures, conditions, priorities, motivations and semantic roles and used this information to train classifiers for information extraction purposes. The approach achieves an accuracy of 92% for the on- and off-topic classification task and an F1-measure of 72% for the semantic annotation."}],"has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"user_id":"15504","oa":"1","main_file_link":[{"open_access":"1","url":"https://www.aclweb.org/anthology/D16-1186"}],"publisher":"Association for Computational Linguistics (ACL)","date_created":"2017-10-17T12:41:26Z","status":"public","year":"2016","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T12:33:48Z","_id":"176","date_updated":"2022-01-06T06:53:15Z","author":[{"last_name":"Dollmann","id":"27578","first_name":"Markus","full_name":"Dollmann, Markus"},{"id":"42496","last_name":"Geierhos","first_name":"Michaela","full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606"}],"conference":{"end_date":"2016-11-05","start_date":"2016-11-01","location":"Austin, TX, USA","name":"Conference on Empirical Methods in Natural Language Processing (EMNLP 2016)"},"place":"Austin, TX, USA","publication_status":"published","citation":{"short":"M. Dollmann, M. Geierhos, in: Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP), Association for Computational Linguistics (ACL), Austin, TX, USA, 2016, pp. 1807–1816.","bibtex":"@inproceedings{Dollmann_Geierhos_2016, place={Austin, TX, USA}, title={On- and Off-Topic Classification and Semantic Annotation of User-Generated Software Requirements}, booktitle={Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)}, publisher={Association for Computational Linguistics (ACL)}, author={Dollmann, Markus and Geierhos, Michaela}, year={2016}, pages={1807–1816} }","mla":"Dollmann, Markus, and Michaela Geierhos. “On- and Off-Topic Classification and Semantic Annotation of User-Generated Software Requirements.” <i>Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)</i>, Association for Computational Linguistics (ACL), 2016, pp. 1807–16.","ieee":"M. Dollmann and M. Geierhos, “On- and Off-Topic Classification and Semantic Annotation of User-Generated Software Requirements,” in <i>Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)</i>, Austin, TX, USA, 2016, pp. 1807–1816.","chicago":"Dollmann, Markus, and Michaela Geierhos. “On- and Off-Topic Classification and Semantic Annotation of User-Generated Software Requirements.” In <i>Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)</i>, 1807–16. Austin, TX, USA: Association for Computational Linguistics (ACL), 2016.","apa":"Dollmann, M., &#38; Geierhos, M. (2016). On- and Off-Topic Classification and Semantic Annotation of User-Generated Software Requirements. In <i>Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)</i> (pp. 1807–1816). Austin, TX, USA: Association for Computational Linguistics (ACL).","ama":"Dollmann M, Geierhos M. On- and Off-Topic Classification and Semantic Annotation of User-Generated Software Requirements. In: <i>Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing (EMNLP)</i>. Austin, TX, USA: Association for Computational Linguistics (ACL); 2016:1807-1816."},"department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}]},{"series_title":"LNCS","citation":{"bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={On the Parameterized Parallel Complexity and the Vertex Cover Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">10.1007/978-3-319-48749-6_35</a>}, booktitle={Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={477–488}, collection={LNCS} }","mla":"Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 477–88, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">10.1007/978-3-319-48749-6_35</a>.","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488.","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. On the Parameterized Parallel Complexity and the Vertex Cover Problem. In: <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:477-488. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">10.1007/978-3-319-48749-6_35</a>","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem. In <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 477–488). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">https://doi.org/10.1007/978-3-319-48749-6_35</a>","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 477–488.","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” In <i>Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 477–88. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_35\">https://doi.org/10.1007/978-3-319-48749-6_35</a>."},"department":[{"_id":"63"}],"author":[{"last_name":"Abu-Khzam","first_name":"Faisal N.","full_name":"Abu-Khzam, Faisal N."},{"full_name":"Li, Shouwei","first_name":"Shouwei","last_name":"Li"},{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian","id":"37612"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Podlipyan, Pavel","first_name":"Pavel","last_name":"Podlipyan"}],"_id":"177","file_date_updated":"2018-11-02T14:15:18Z","date_updated":"2022-01-06T06:53:17Z","date_created":"2017-10-17T12:41:26Z","year":"2016","language":[{"iso":"eng"}],"status":"public","user_id":"477","title":"On the Parameterized Parallel Complexity and the Vertex Cover Problem","file":[{"creator":"ups","file_size":293345,"file_name":"OnTheParameterizedParallelComp.pdf","file_id":"5266","content_type":"application/pdf","access_level":"closed","date_created":"2018-11-02T14:15:18Z","date_updated":"2018-11-02T14:15:18Z","relation":"main_file","success":1}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"abstract":[{"text":"Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should possess an efficient parallel algorithm not only from a theoretical standpoint but in practice as well. The primary distinction between FPPT and FPP is the parallel processor utilization, which is bounded by a polynomial function in the case of FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. We also note that a few P-complete problems fall into FPPT including the monotone circuit value problem (MCV) when the underlying graphs are bounded by a constant Euler genus.","lang":"eng"}],"has_accepted_license":"1","doi":"10.1007/978-3-319-48749-6_35","page":"477-488","publication":"Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)","ddc":["000"],"type":"conference"}]