[{"volume":639,"page":"549-558","publication":"Proceedings of the 22nd International Conference on Information and Software Technologies (ICIST)","quality_controlled":"1","ddc":["040"],"type":"conference","user_id":"477","keyword":["Natural language requirements clarification","Syntactically incomplete requirements","Compensatory user stories"],"file":[{"relation":"main_file","date_updated":"2018-03-21T12:49:38Z","success":1,"creator":"florida","file_size":860232,"file_name":"158-06390044.pdf","file_id":"1548","content_type":"application/pdf","access_level":"closed","date_created":"2018-03-21T12:49:38Z"}],"title":"Running out of Words: How Similar User Stories Can Help to Elaborate Individual Natural Language Requirement Descriptions","doi":"10.1007/978-3-319-46254-7_44","has_accepted_license":"1","abstract":[{"text":"While requirements focus on how the user interacts with the system, user stories concentrate on the purpose of software features. But in practice, functional requirements are also described in user stories. For this reason, requirements clarification is needed, especially when they are written in natural language and do not stick to any templates (e.g., \"as an X, I want Y so that Z ...\"). However, there is a lot of implicit knowledge that is not expressed in words. As a result, natural language requirements descriptions may suffer from incompleteness. Existing approaches try to formalize natural language or focus only on entirely missing and not on deficient requirements. In this paper, we therefore present an approach to detect knowledge gaps in user-generated software requirements for interactive requirement clarification: We provide tailored suggestions to the users in order to get more precise descriptions. For this purpose, we identify not fully instantiated predicate argument structures in requirements written in natural language and use context information to realize what was meant by the user.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"_id":"158","file_date_updated":"2018-03-21T12:49:38Z","date_updated":"2022-01-06T06:52:34Z","publisher":"Springer","date_created":"2017-10-17T12:41:22Z","status":"public","year":"2016","publication_identifier":{"eisbn":["978-3-319-46254-7"],"isbn":["978-3-319-46253-0"]},"language":[{"iso":"eng"}],"publication_status":"published","series_title":"Communications in Computer and Information Science","citation":{"short":"F.S. Bäumer, M. Geierhos, in: G. Dregvaite, R. Damasevicius (Eds.), Proceedings of the 22nd International Conference on Information and Software Technologies (ICIST), Springer, Cham, Switzerland, 2016, pp. 549–558.","bibtex":"@inproceedings{Bäumer_Geierhos_2016, place={Cham, Switzerland}, series={Communications in Computer and Information Science}, title={Running out of Words: How Similar User Stories Can Help to Elaborate Individual Natural Language Requirement Descriptions}, volume={639}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-46254-7_44\">10.1007/978-3-319-46254-7_44</a>}, booktitle={Proceedings of the 22nd International Conference on Information and Software Technologies (ICIST)}, publisher={Springer}, author={Bäumer, Frederik Simon and Geierhos, Michaela}, editor={Dregvaite, Giedre  and Damasevicius, Robertas Editors}, year={2016}, pages={549–558}, collection={Communications in Computer and Information Science} }","mla":"Bäumer, Frederik Simon, and Michaela Geierhos. “Running out of Words: How Similar User Stories Can Help to Elaborate Individual Natural Language Requirement Descriptions.” <i>Proceedings of the 22nd International Conference on Information and Software Technologies (ICIST)</i>, edited by Giedre  Dregvaite and Robertas  Damasevicius, vol. 639, Springer, 2016, pp. 549–58, doi:<a href=\"https://doi.org/10.1007/978-3-319-46254-7_44\">10.1007/978-3-319-46254-7_44</a>.","ieee":"F. S. Bäumer and M. Geierhos, “Running out of Words: How Similar User Stories Can Help to Elaborate Individual Natural Language Requirement Descriptions,” in <i>Proceedings of the 22nd International Conference on Information and Software Technologies (ICIST)</i>, Druskininkai, Lithuania, 2016, vol. 639, pp. 549–558.","chicago":"Bäumer, Frederik Simon, and Michaela Geierhos. “Running out of Words: How Similar User Stories Can Help to Elaborate Individual Natural Language Requirement Descriptions.” In <i>Proceedings of the 22nd International Conference on Information and Software Technologies (ICIST)</i>, edited by Giedre  Dregvaite and Robertas  Damasevicius, 639:549–58. Communications in Computer and Information Science. Cham, Switzerland: Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-46254-7_44\">https://doi.org/10.1007/978-3-319-46254-7_44</a>.","ama":"Bäumer FS, Geierhos M. Running out of Words: How Similar User Stories Can Help to Elaborate Individual Natural Language Requirement Descriptions. In: Dregvaite G, Damasevicius R, eds. <i>Proceedings of the 22nd International Conference on Information and Software Technologies (ICIST)</i>. Vol 639. Communications in Computer and Information Science. Cham, Switzerland: Springer; 2016:549-558. doi:<a href=\"https://doi.org/10.1007/978-3-319-46254-7_44\">10.1007/978-3-319-46254-7_44</a>","apa":"Bäumer, F. S., &#38; Geierhos, M. (2016). Running out of Words: How Similar User Stories Can Help to Elaborate Individual Natural Language Requirement Descriptions. In G. Dregvaite &#38; R. Damasevicius (Eds.), <i>Proceedings of the 22nd International Conference on Information and Software Technologies (ICIST)</i> (Vol. 639, pp. 549–558). Cham, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-46254-7_44\">https://doi.org/10.1007/978-3-319-46254-7_44</a>"},"department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"author":[{"id":"38837","last_name":"Bäumer","full_name":"Bäumer, Frederik Simon","first_name":"Frederik Simon"},{"orcid":"0000-0002-8180-5606","last_name":"Geierhos","id":"42496","full_name":"Geierhos, Michaela","first_name":"Michaela"}],"editor":[{"first_name":"Giedre ","full_name":"Dregvaite, Giedre ","last_name":"Dregvaite"},{"last_name":"Damasevicius","first_name":"Robertas ","full_name":"Damasevicius, Robertas "}],"conference":{"start_date":"2016-10-13","location":"Druskininkai, Lithuania","name":"22nd International Conference on Information and Software Technologies (ICIST 2016)","end_date":"2016-10-15"},"intvolume":"       639","place":"Cham, Switzerland"},{"author":[{"last_name":"Harks","full_name":"Harks, Tobias","first_name":"Tobias"},{"last_name":"Höfer","first_name":"Martin","full_name":"Höfer, Martin"},{"last_name":"Schewior","full_name":"Schewior, Kevin","first_name":"Kevin"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"department":[{"_id":"63"},{"_id":"541"}],"citation":{"bibtex":"@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With Progressive Filling}, DOI={<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>}, number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016}, pages={2553–2562} }","mla":"Harks, Tobias, et al. “Routing Games With Progressive Filling.” <i>IEEE/ACM Transactions on Networking</i>, no. 4, IEEE, 2016, pp. 2553–62, doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>.","short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562.","apa":"Harks, T., Höfer, M., Schewior, K., &#38; Skopalik, A. (2016). Routing Games With Progressive Filling. <i>IEEE/ACM Transactions on Networking</i>, (4), 2553–2562. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>","ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling. <i>IEEE/ACM Transactions on Networking</i>. 2016;(4):2553-2562. doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>","ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” <i>IEEE/ACM Transactions on Networking</i>, no. 4, pp. 2553–2562, 2016.","chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.” <i>IEEE/ACM Transactions on Networking</i>, no. 4 (2016): 2553–62. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>."},"year":"2016","language":[{"iso":"eng"}],"status":"public","date_created":"2017-10-17T12:41:23Z","publisher":"IEEE","date_updated":"2022-01-06T06:52:40Z","file_date_updated":"2018-03-21T12:48:02Z","_id":"159","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"doi":"10.1109/TNET.2015.2468571","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived."}],"title":"Routing Games With Progressive Filling","file":[{"success":1,"relation":"main_file","date_updated":"2018-03-21T12:48:02Z","file_id":"1547","content_type":"application/pdf","access_level":"closed","date_created":"2018-03-21T12:48:02Z","creator":"florida","file_size":1655309,"file_name":"159-Harks-Hoefer-Schewior-Skopalik2016.pdf"}],"user_id":"477","type":"journal_article","ddc":["040"],"publication":"IEEE/ACM Transactions on Networking","issue":"4","page":"2553 - 2562"},{"type":"mastersthesis","year":"2016","status":"public","date_created":"2017-10-17T12:41:20Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:03Z","_id":"146","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"}],"title":"Symmetric Anonymous Credentials with Protocols for Relations on Attributes","author":[{"last_name":"Hamm","full_name":"Hamm, Julian","first_name":"Julian"}],"department":[{"_id":"64"}],"citation":{"bibtex":"@book{Hamm_2016, title={Symmetric Anonymous Credentials with Protocols for Relations on Attributes}, publisher={Universität Paderborn}, author={Hamm, Julian}, year={2016} }","mla":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","short":"J. Hamm, Symmetric Anonymous Credentials with Protocols for Relations on Attributes, Universität Paderborn, 2016.","ama":"Hamm J. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn; 2016.","apa":"Hamm, J. (2016). <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn.","ieee":"J. Hamm, <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","chicago":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016."},"user_id":"477"},{"main_file_link":[{"url":"http://aisel.aisnet.org/icis2016/DigitalInnovation/Presentations/5/"}],"user_id":"16205","file":[{"success":1,"date_updated":"2018-12-03T15:29:08Z","relation":"main_file","file_id":"5991","content_type":"application/pdf","access_level":"closed","date_created":"2018-12-03T15:29:08Z","creator":"abursig","file_name":"Supporting Business Model Idea Generation Through Machine-generat.pdf","file_size":1626458}],"title":"Supporting Business Model Idea Generation Through Machine-generated Ideas: A Design Theory","has_accepted_license":"1","abstract":[{"text":"Successful business model innovation is impossible without innovative business model ideas. When generating such ideas, humans make use of two properties of the human cognitive system: First, their ability to build up knowledge (i.e., raw material for new ideas), and second, their ability to flexibly recombine that knowledge. While these properties enable humans to generate innovative ideas, the amounts of knowledge and cognitive flexibility that humans can possess are limited, which in turn limits human idea generation capability. With business model idea generators, a new class of information systems is proposed that can contribute to alleviating the limits that constrain human idea generation. The ideas that such idea generators produce can complement human business model ideas, thereby increase the probability for high-quality ideas, and eventually raise the odds of successful business model innovation. The contribution is a design theory that describes the architecture of the proposed idea generators.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"17","name":"SFB 901 - Subprojekt C5"},{"_id":"4","name":"SFB 901 - Project Area C"}],"publication":"Proceedings of the 37th International Conference on Information Systems (ICIS), Dublin, Ireland","ddc":["040"],"type":"conference","citation":{"ieee":"T. John, “Supporting Business Model Idea Generation Through Machine-generated Ideas: A Design Theory,” in <i>Proceedings of the 37th International Conference on Information Systems (ICIS), Dublin, Ireland</i>, Dublin, Ireland, 2016.","chicago":"John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated Ideas: A Design Theory.” In <i>Proceedings of the 37th International Conference on Information Systems (ICIS), Dublin, Ireland</i>, 2016.","apa":"John, T. (2016). Supporting Business Model Idea Generation Through Machine-generated Ideas: A Design Theory. In <i>Proceedings of the 37th International Conference on Information Systems (ICIS), Dublin, Ireland</i>. Dublin, Ireland.","ama":"John T. Supporting Business Model Idea Generation Through Machine-generated Ideas: A Design Theory. In: <i>Proceedings of the 37th International Conference on Information Systems (ICIS), Dublin, Ireland</i>. ; 2016.","short":"T. John, in: Proceedings of the 37th International Conference on Information Systems (ICIS), Dublin, Ireland, 2016.","bibtex":"@inproceedings{John_2016, title={Supporting Business Model Idea Generation Through Machine-generated Ideas: A Design Theory}, booktitle={Proceedings of the 37th International Conference on Information Systems (ICIS), Dublin, Ireland}, author={John, Thomas}, year={2016} }","mla":"John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated Ideas: A Design Theory.” <i>Proceedings of the 37th International Conference on Information Systems (ICIS), Dublin, Ireland</i>, 2016."},"department":[{"_id":"276"}],"author":[{"full_name":"John, Thomas","first_name":"Thomas","last_name":"John","id":"3952"}],"conference":{"name":"37th International Conference on Information Systems (ICIS)","location":"Dublin, Ireland"},"file_date_updated":"2018-12-03T15:29:08Z","_id":"148","date_updated":"2022-01-06T06:52:06Z","date_created":"2017-10-17T12:41:20Z","status":"public","language":[{"iso":"eng"}],"year":"2016"},{"author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"first_name":"Björn","full_name":"Feldkord, Björn","last_name":"Feldkord","id":"22704"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"citation":{"short":"M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.","mla":"Drees, Maximilian, et al. “Strategic Online Facility Location.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 593--607, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>.","bibtex":"@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic Online Facility Location}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS} }","chicago":"Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online Facility Location.” In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 593--607. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">https://doi.org/10.1007/978-3-319-48749-6_43</a>.","ieee":"M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 593--607.","apa":"Drees, M., Feldkord, B., &#38; Skopalik, A. (2016). Strategic Online Facility Location. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 593--607). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">https://doi.org/10.1007/978-3-319-48749-6_43</a>","ama":"Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:593--607. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>"},"series_title":"LNCS","department":[{"_id":"63"},{"_id":"541"}],"date_created":"2017-10-17T12:41:21Z","status":"public","language":[{"iso":"eng"}],"year":"2016","_id":"149","file_date_updated":"2018-03-21T12:55:43Z","date_updated":"2022-01-06T06:52:10Z","file":[{"date_created":"2018-03-21T12:55:43Z","file_id":"1553","content_type":"application/pdf","access_level":"closed","file_name":"149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf","file_size":236253,"creator":"florida","success":1,"relation":"main_file","date_updated":"2018-03-21T12:55:43Z"}],"title":"Strategic Online Facility Location","doi":"10.1007/978-3-319-48749-6_43","abstract":[{"lang":"eng","text":"In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α)."}],"has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"user_id":"477","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","ddc":["040"],"type":"conference","page":"593--607"},{"date_updated":"2022-01-06T06:52:13Z","_id":"150","file_date_updated":"2018-03-21T12:54:05Z","status":"public","year":"2016","type":"dissertation","publisher":"Universität Paderborn","ddc":["040"],"date_created":"2017-10-17T12:41:21Z","department":[{"_id":"66"}],"user_id":"477","citation":{"chicago":"Arifulina, Svetlana. <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn, 2016. <a href=\"https://doi.org/10.17619/UNIPB/1-13\">https://doi.org/10.17619/UNIPB/1-13</a>.","ieee":"S. Arifulina, <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn, 2016.","apa":"Arifulina, S. (2016). <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-13\">https://doi.org/10.17619/UNIPB/1-13</a>","ama":"Arifulina S. <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn; 2016. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-13\">10.17619/UNIPB/1-13</a>","short":"S. Arifulina, Solving Heterogeneity for a Successful Service Market, Universität Paderborn, 2016.","mla":"Arifulina, Svetlana. <i>Solving Heterogeneity for a Successful Service Market</i>. Universität Paderborn, 2016, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-13\">10.17619/UNIPB/1-13</a>.","bibtex":"@book{Arifulina_2016, title={Solving Heterogeneity for a Successful Service Market}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-13\">10.17619/UNIPB/1-13</a>}, publisher={Universität Paderborn}, author={Arifulina, Svetlana}, year={2016} }"},"supervisor":[{"first_name":"Gregor","full_name":"Engels, Gregor","last_name":"Engels","id":"107"}],"has_accepted_license":"1","doi":"10.17619/UNIPB/1-13","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file":[{"content_type":"application/pdf","access_level":"closed","file_id":"1552","date_created":"2018-03-21T12:54:05Z","creator":"florida","file_size":6340482,"file_name":"150-Dissertation_Svetlana_Arifulina.pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T12:54:05Z"}],"author":[{"last_name":"Arifulina","full_name":"Arifulina, Svetlana","first_name":"Svetlana"}],"title":"Solving Heterogeneity for a Successful Service Market"},{"year":"2016","type":"mastersthesis","language":[{"iso":"ger"}],"status":"public","date_created":"2017-10-17T12:41:21Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:15Z","_id":"151","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C5","_id":"17"},{"name":"SFB 901 - Project Area C","_id":"4"}],"title":"Software-gestützte Entwicklung von Geschäftsmodellideen: Theoretische Grundlagen und prototypische Implementierung","author":[{"first_name":"Jan","full_name":"Berhörster, Jan","last_name":"Berhörster"}],"citation":{"apa":"Berhörster, J. (2016). <i>Software-gestützte Entwicklung von Geschäftsmodellideen: Theoretische Grundlagen und prototypische Implementierung</i>. Universität Paderborn.","ama":"Berhörster J. <i>Software-gestützte Entwicklung von Geschäftsmodellideen: Theoretische Grundlagen und prototypische Implementierung</i>. Universität Paderborn; 2016.","ieee":"J. Berhörster, <i>Software-gestützte Entwicklung von Geschäftsmodellideen: Theoretische Grundlagen und prototypische Implementierung</i>. Universität Paderborn, 2016.","chicago":"Berhörster, Jan. <i>Software-gestützte Entwicklung von Geschäftsmodellideen: Theoretische Grundlagen und prototypische Implementierung</i>. Universität Paderborn, 2016.","bibtex":"@book{Berhörster_2016, title={Software-gestützte Entwicklung von Geschäftsmodellideen: Theoretische Grundlagen und prototypische Implementierung}, publisher={Universität Paderborn}, author={Berhörster, Jan}, year={2016} }","mla":"Berhörster, Jan. <i>Software-gestützte Entwicklung von Geschäftsmodellideen: Theoretische Grundlagen und prototypische Implementierung</i>. Universität Paderborn, 2016.","short":"J. Berhörster, Software-gestützte Entwicklung von Geschäftsmodellideen: Theoretische Grundlagen und prototypische Implementierung, Universität Paderborn, 2016."},"user_id":"16205"},{"date_updated":"2022-01-06T06:52:16Z","_id":"152","status":"public","type":"bachelorsthesis","year":"2016","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:21Z","department":[{"_id":"64"}],"user_id":"477","citation":{"ama":"Dallmeier F. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn; 2016.","apa":"Dallmeier, F. (2016). <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn.","chicago":"Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","ieee":"F. Dallmeier, <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","mla":"Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","bibtex":"@book{Dallmeier_2016, title={Short Randomizable Aggregatable Signatures: Constructions and Security Analysis}, publisher={Universität Paderborn}, author={Dallmeier, Fynn}, year={2016} }","short":"F. Dallmeier, Short Randomizable Aggregatable Signatures: Constructions and Security Analysis, Universität Paderborn, 2016."},"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"author":[{"full_name":"Dallmeier, Fynn","first_name":"Fynn","last_name":"Dallmeier"}],"title":"Short Randomizable Aggregatable Signatures: Constructions and Security Analysis"},{"_id":"160","file_date_updated":"2018-03-21T12:47:21Z","date_updated":"2022-01-06T06:52:42Z","date_created":"2017-10-17T12:41:23Z","status":"public","year":"2016","language":[{"iso":"eng"}],"citation":{"apa":"van Rooijen, L., &#38; Hamann, H. (2016). Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm. In <i>Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)</i> (pp. 3--9). <a href=\"https://doi.org/10.1109/REW.2016.015\">https://doi.org/10.1109/REW.2016.015</a>","ama":"van Rooijen L, Hamann H. Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm. In: <i>Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)</i>. ; 2016:3--9. doi:<a href=\"https://doi.org/10.1109/REW.2016.015\">10.1109/REW.2016.015</a>","ieee":"L. van Rooijen and H. Hamann, “Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm,” in <i>Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)</i>, 2016, pp. 3--9.","chicago":"Rooijen, Lorijn van, and Heiko Hamann. “Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm.” In <i>Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)</i>, 3--9, 2016. <a href=\"https://doi.org/10.1109/REW.2016.015\">https://doi.org/10.1109/REW.2016.015</a>.","bibtex":"@inproceedings{van Rooijen_Hamann_2016, title={Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm}, DOI={<a href=\"https://doi.org/10.1109/REW.2016.015\">10.1109/REW.2016.015</a>}, booktitle={Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)}, author={van Rooijen, Lorijn and Hamann, Heiko}, year={2016}, pages={3--9} }","mla":"van Rooijen, Lorijn, and Heiko Hamann. “Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm.” <i>Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)</i>, 2016, pp. 3--9, doi:<a href=\"https://doi.org/10.1109/REW.2016.015\">10.1109/REW.2016.015</a>.","short":"L. van Rooijen, H. Hamann, in: Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016), 2016, pp. 3--9."},"department":[{"_id":"66"}],"author":[{"first_name":"Lorijn","full_name":"van Rooijen, Lorijn","last_name":"van Rooijen","id":"58843"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"page":"3--9","publication":"Proceedings of 24th IEEE International Requirements Engineering Conference (RE 2016)","ddc":["040"],"type":"conference","user_id":"477","file":[{"file_name":"160-07815598.pdf","file_size":419026,"creator":"florida","date_created":"2018-03-21T12:47:21Z","access_level":"closed","content_type":"application/pdf","file_id":"1546","relation":"main_file","date_updated":"2018-03-21T12:47:21Z","success":1}],"title":"Requirements Specification-by-Example Using a Multi-Objective Evolutionary Algorithm","abstract":[{"text":"A task at the beginning of the software development process is the creation of a requirements specification. The requirements specification is usually created by a software engineering expert. We try to substitute this expert by a domain expert (the user) and formulate the problem of creating requirements specifications as a search-based software engineering problem. The domain expert provides only examples of event sequences that describe the behavior of the required software program. These examples are represented by simple sequence diagrams and are divided into two subsets: positive examples of required program behavior and negative examples of prohibited program behavior. The task is then to synthesize a generalized requirements specification that usefully describes the required software. We approach this problem by applying a genetic algorithm and evolve deterministic finite automata (DFAs). These DFAs take the sequence diagrams as input that should be either accepted (positive example) or rejected (negative example). The problem is neither to find the minimal nor the most general automaton. Instead, the user should be provided with several appropriate automata from which the user can select, or which help the user to refine the examples given initially. We present the context of our research (\"On-The-Fly Computing\"), present our approach, report results indicating its feasibility, and conclude with a discussion.","lang":"eng"}],"has_accepted_license":"1","doi":"10.1109/REW.2016.015","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}]},{"date_updated":"2022-01-06T06:52:43Z","file_date_updated":"2018-03-21T12:46:48Z","_id":"161","year":"2016","type":"dissertation","status":"public","ddc":["040"],"date_created":"2017-10-17T12:41:23Z","publisher":"Universität Paderborn","department":[{"_id":"27"},{"_id":"518"}],"citation":{"short":"T. Kenter, Reconfigurable Accelerators in the World of General-Purpose Computing, Universität Paderborn, 2016.","bibtex":"@book{Kenter_2016, title={Reconfigurable Accelerators in the World of General-Purpose Computing}, publisher={Universität Paderborn}, author={Kenter, Tobias}, year={2016} }","mla":"Kenter, Tobias. <i>Reconfigurable Accelerators in the World of General-Purpose Computing</i>. Universität Paderborn, 2016.","ieee":"T. Kenter, <i>Reconfigurable Accelerators in the World of General-Purpose Computing</i>. Universität Paderborn, 2016.","chicago":"Kenter, Tobias. <i>Reconfigurable Accelerators in the World of General-Purpose Computing</i>. Universität Paderborn, 2016.","apa":"Kenter, T. (2016). <i>Reconfigurable Accelerators in the World of General-Purpose Computing</i>. Universität Paderborn.","ama":"Kenter T. <i>Reconfigurable Accelerators in the World of General-Purpose Computing</i>. Universität Paderborn; 2016."},"user_id":"3145","project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"supervisor":[{"orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","first_name":"Christian","id":"16153","last_name":"Plessl"}],"has_accepted_license":"1","title":"Reconfigurable Accelerators in the World of General-Purpose Computing","file":[{"content_type":"application/pdf","file_id":"1545","access_level":"closed","date_created":"2018-03-21T12:46:48Z","creator":"florida","file_name":"161kenter16_diss_submission_print_16-08-26.pdf","file_size":5039555,"success":1,"relation":"main_file","date_updated":"2018-03-21T12:46:48Z"}],"author":[{"id":"3145","last_name":"Kenter","full_name":"Kenter, Tobias","first_name":"Tobias"}]},{"date_created":"2017-10-17T12:41:23Z","publisher":"Universität Paderborn","type":"mastersthesis","year":"2016","language":[{"iso":"eng"}],"status":"public","_id":"162","date_updated":"2022-01-06T06:52:45Z","title":"Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions","author":[{"first_name":"Guangli","full_name":"Zhang, Guangli","last_name":"Zhang"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"supervisor":[{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"citation":{"ieee":"G. Zhang, <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn, 2016.","chicago":"Zhang, Guangli. <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn, 2016.","ama":"Zhang G. <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn; 2016.","apa":"Zhang, G. (2016). <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn.","short":"G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions, Universität Paderborn, 2016.","bibtex":"@book{Zhang_2016, title={Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions}, publisher={Universität Paderborn}, author={Zhang, Guangli}, year={2016} }","mla":"Zhang, Guangli. <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn, 2016."},"user_id":"15504","department":[{"_id":"77"}]},{"year":"2016","type":"conference_editor","status":"public","date_created":"2017-10-17T12:41:23Z","publisher":"ACM","date_updated":"2022-01-06T06:52:48Z","_id":"163","project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"doi":"10.1145/2942358","title":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)","conference":{"end_date":"2016-07-08","start_date":"2016-07-04","location":"Paderborn, Germany","name":"MobiHoc"},"editor":[{"last_name":"Dressler","full_name":"Dressler, Falko","first_name":"Falko"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"department":[{"_id":"63"}],"citation":{"apa":"Dressler, F., &#38; Meyer auf der Heide, F. (Eds.). (2016). <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. Presented at the MobiHoc, Paderborn, Germany: ACM. <a href=\"https://doi.org/10.1145/2942358\">https://doi.org/10.1145/2942358</a>","ama":"Dressler F, Meyer auf der Heide F, eds. <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM; 2016. doi:<a href=\"https://doi.org/10.1145/2942358\">10.1145/2942358</a>","chicago":"Dressler, Falko, and Friedhelm Meyer auf der Heide, eds. <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM, 2016. <a href=\"https://doi.org/10.1145/2942358\">https://doi.org/10.1145/2942358</a>.","ieee":"F. Dressler and F. Meyer auf der Heide, Eds., <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM, 2016.","mla":"Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2942358\">10.1145/2942358</a>.","bibtex":"@book{Dressler_Meyer auf der Heide_2016, title={Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)}, DOI={<a href=\"https://doi.org/10.1145/2942358\">10.1145/2942358</a>}, publisher={ACM}, year={2016} }","short":"F. Dressler, F. Meyer auf der Heide, eds., Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), ACM, 2016."},"user_id":"15504"},{"_id":"164","date_updated":"2022-01-06T06:52:50Z","date_created":"2017-10-17T12:41:24Z","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"type":"mastersthesis","year":"2016","status":"public","citation":{"short":"M. Czech, Predicting Rankings of Software Verification Tools Using Kernels for Structured Data, Universität Paderborn, 2016.","mla":"Czech, Mike. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","bibtex":"@book{Czech_2016, title={Predicting Rankings of Software Verification Tools Using Kernels for Structured Data}, publisher={Universität Paderborn}, author={Czech, Mike}, year={2016} }","chicago":"Czech, Mike. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","ieee":"M. Czech, <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","apa":"Czech, M. (2016). <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn.","ama":"Czech M. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn; 2016."},"user_id":"15504","department":[{"_id":"77"}],"title":"Predicting Rankings of Software Verification Tools Using Kernels for Structured Data","author":[{"last_name":"Czech","first_name":"Mike","full_name":"Czech, Mike"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}]},{"_id":"139","file_date_updated":"2018-11-02T15:57:25Z","date_updated":"2022-01-06T06:51:46Z","date_created":"2017-10-17T12:41:18Z","publisher":"Springer","year":"2016","language":[{"iso":"eng"}],"status":"public","citation":{"bibtex":"@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards the price of leasing online}, DOI={<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216} }","mla":"Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” <i>Journal of Combinatorial Optimization</i>, no. 4, Springer, 2016, pp. 1197--1216, doi:<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>.","short":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk, Journal of Combinatorial Optimization (2016) 1197--1216.","apa":"Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., &#38; Pietrzyk, P. (2016). Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>, (4), 1197--1216. <a href=\"https://doi.org/10.1007/s10878-015-9915-5\">https://doi.org/10.1007/s10878-015-9915-5</a>","ama":"Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>. 2016;(4):1197--1216. doi:<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>","ieee":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk, “Towards the price of leasing online,” <i>Journal of Combinatorial Optimization</i>, no. 4, pp. 1197--1216, 2016.","chicago":"Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, and Peter  Pietrzyk. “Towards the Price of Leasing Online.” <i>Journal of Combinatorial Optimization</i>, no. 4 (2016): 1197--1216. <a href=\"https://doi.org/10.1007/s10878-015-9915-5\">https://doi.org/10.1007/s10878-015-9915-5</a>."},"department":[{"_id":"63"}],"author":[{"last_name":"Abshoff","first_name":"Sebastian","full_name":"Abshoff, Sebastian"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"full_name":"Markarian, Christine","first_name":"Christine","id":"37612","last_name":"Markarian"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Pietrzyk, Peter ","first_name":"Peter ","last_name":"Pietrzyk"}],"page":" 1197--1216","issue":"4","ddc":["000"],"publication":"Journal of Combinatorial Optimization","type":"journal_article","user_id":"477","title":"Towards the price of leasing online","file":[{"date_created":"2018-11-02T15:57:25Z","file_id":"5318","content_type":"application/pdf","access_level":"closed","file_name":"Abshoff-TowardsThePriceOfLeasingOnline.pdf","file_size":654903,"creator":"ups","success":1,"date_updated":"2018-11-02T15:57:25Z","relation":"main_file"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"abstract":[{"lang":"eng","text":"We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying goods. Instead, leasing is often a more flexible and lucrative business model. Research has realized this shift and recently initiated the theoretical study of leasing models (Anthony and Gupta in Proceedings of the integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27, 2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work and suggest a more systematic study of leasing aspects for a class of online optimization problems. We provide two major technical results. We introduce the leasing variant of online set multicover and give an O(log(mK)logn)-competitive algorithm (with n, m, and K being the number of elements, sets, and leases, respectively). Our results also imply improvements for the non-leasing variant of online set cover. Moreover, we extend results for the leasing variant of online facility location. Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive algorithm for this problem (with n and K being the number of clients and leases, respectively). We remove the dependency on n (and, thereby, on time). In general, this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax). For many natural problem instances, the bound improves to O(K2)."}],"has_accepted_license":"1","doi":"10.1007/s10878-015-9915-5"},{"user_id":"477","citation":{"short":"A. Jungmann, Towards On-The-Fly Image Processing, Universität Paderborn, 2016.","bibtex":"@book{Jungmann_2016, title={Towards On-The-Fly Image Processing}, publisher={Universität Paderborn}, author={Jungmann, Alexander}, year={2016} }","mla":"Jungmann, Alexander. <i>Towards On-The-Fly Image Processing</i>. Universität Paderborn, 2016.","ieee":"A. Jungmann, <i>Towards On-The-Fly Image Processing</i>. Universität Paderborn, 2016.","chicago":"Jungmann, Alexander. <i>Towards On-The-Fly Image Processing</i>. Universität Paderborn, 2016.","ama":"Jungmann A. <i>Towards On-The-Fly Image Processing</i>. Universität Paderborn; 2016.","apa":"Jungmann, A. (2016). <i>Towards On-The-Fly Image Processing</i>. Universität Paderborn."},"department":[{"_id":"70"}],"file":[{"success":1,"date_updated":"2018-03-21T13:00:24Z","relation":"main_file","file_id":"1559","content_type":"application/pdf","access_level":"closed","date_created":"2018-03-21T13:00:24Z","creator":"florida","file_name":"140-Dissertation-Alexander_Jungmann.pdf","file_size":8006614}],"author":[{"full_name":"Jungmann, Alexander","first_name":"Alexander","last_name":"Jungmann"}],"title":"Towards On-The-Fly Image Processing","supervisor":[{"last_name":"Rammig","full_name":"Rammig, Franz","first_name":"Franz"}],"has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"140","file_date_updated":"2018-03-21T13:00:24Z","date_updated":"2022-01-06T06:51:49Z","publisher":"Universität Paderborn","ddc":["040"],"date_created":"2017-10-17T12:41:18Z","status":"public","year":"2016","type":"dissertation"},{"publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:19Z","status":"public","type":"dissertation","year":"2016","_id":"141","date_updated":"2022-01-06T06:51:55Z","author":[{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"}],"title":"Towards Automated Service Composition Under Quality Constraints","doi":"10.17619/UNIPB/1-171","supervisor":[{"last_name":"Kleine Büning","full_name":"Kleine Büning, Hans","first_name":"Hans"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"user_id":"477","citation":{"ama":"Mohr F. <i>Towards Automated Service Composition Under Quality Constraints</i>. Universität Paderborn; 2016. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-171\">10.17619/UNIPB/1-171</a>","apa":"Mohr, F. (2016). <i>Towards Automated Service Composition Under Quality Constraints</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-171\">https://doi.org/10.17619/UNIPB/1-171</a>","ieee":"F. Mohr, <i>Towards Automated Service Composition Under Quality Constraints</i>. Universität Paderborn, 2016.","chicago":"Mohr, Felix. <i>Towards Automated Service Composition Under Quality Constraints</i>. Universität Paderborn, 2016. <a href=\"https://doi.org/10.17619/UNIPB/1-171\">https://doi.org/10.17619/UNIPB/1-171</a>.","bibtex":"@book{Mohr_2016, title={Towards Automated Service Composition Under Quality Constraints}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-171\">10.17619/UNIPB/1-171</a>}, publisher={Universität Paderborn}, author={Mohr, Felix}, year={2016} }","mla":"Mohr, Felix. <i>Towards Automated Service Composition Under Quality Constraints</i>. Universität Paderborn, 2016, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-171\">10.17619/UNIPB/1-171</a>.","short":"F. Mohr, Towards Automated Service Composition Under Quality Constraints, Universität Paderborn, 2016."},"department":[{"_id":"355"}]},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"abstract":[{"text":"For overlay networks, the ability to recover from a variety of problems like membership changes or faults is a key element to preserve their functionality. In recent years, various self-stabilizing overlay networks have been proposed that have the advantage of being able to recover from any illegal state. However, the vast majority of these networks cannot give any guarantees on its functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific identifier are answered successfully if a node with that identifier exists in the network. We investigate overlay networks that are not only self-stabilizing but that also ensure that monotonic searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. Monotonic searchability was recently introduced in OPODIS 2015, in which the authors provide a solution for a simple line topology.We present the first universal approach to maintain monotonic searchability that is applicable to a wide range of topologies. As the base for our approach, we introduce a set of primitives for manipulating overlay networks that allows us to maintain searchability and show how existing protocols can be transformed to use theses primitives.We complement this result with a generic search protocol that together with the use of our primitives guarantees monotonic searchability.As an additional feature, searching existing nodes with the generic search protocol is as fast as searching a node with any other fixed routing protocol once the topology has stabilized.","lang":"eng"}],"doi":"10.1007/978-3-662-53426-7_6","has_accepted_license":"1","title":"Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks","file":[{"access_level":"closed","content_type":"application/pdf","file_id":"1558","date_created":"2018-03-21T12:59:29Z","creator":"florida","file_name":"142-SchSetStrDISC16.pdf","file_size":209638,"success":1,"date_updated":"2018-03-21T12:59:29Z","relation":"main_file"}],"user_id":"477","type":"conference","publication":"Proceedings of the 30th International Symposium on Distributed Computing (DISC)","ddc":["040"],"page":"71--84","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"id":"11108","last_name":"Setzer","full_name":"Setzer, Alexander","first_name":"Alexander"},{"last_name":"Strothmann","id":"11319","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik"}],"department":[{"_id":"79"}],"citation":{"ama":"Scheideler C, Setzer A, Strothmann TF. Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In: <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2016:71--84. doi:<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>","apa":"Scheideler, C., Setzer, A., &#38; Strothmann, T. F. (2016). Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i> (pp. 71--84). <a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">https://doi.org/10.1007/978-3-662-53426-7_6</a>","ieee":"C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks,” in <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 2016, pp. 71--84.","chicago":"Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” In <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 71--84. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">https://doi.org/10.1007/978-3-662-53426-7_6</a>.","bibtex":"@inproceedings{Scheideler_Setzer_Strothmann_2016, series={LNCS}, title={Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>}, booktitle={Proceedings of the 30th International Symposium on Distributed Computing (DISC)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}, year={2016}, pages={71--84}, collection={LNCS} }","mla":"Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 2016, pp. 71--84, doi:<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>.","short":"C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84."},"series_title":"LNCS","language":[{"iso":"eng"}],"year":"2016","status":"public","date_created":"2017-10-17T12:41:19Z","date_updated":"2022-01-06T06:51:56Z","file_date_updated":"2018-03-21T12:59:29Z","_id":"142"},{"author":[{"full_name":"Abu-Khzam, Faisal N. ","first_name":"Faisal N. ","last_name":"Abu-Khzam"},{"first_name":"Shouwei","full_name":"Li, Shouwei","last_name":"Li"},{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian","id":"37612"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Pavel","full_name":"Podlipyan, Pavel","last_name":"Podlipyan"}],"department":[{"_id":"63"}],"series_title":"LNCS","citation":{"mla":"Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 2016, pp. 92–102, doi:<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>.","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is in NC}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>}, booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)}, author={Abu-Khzam, Faisal N.  and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102}, collection={LNCS} }","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i> (pp. 92–102). <a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">https://doi.org/10.1007/978-3-319-42634-1_8</a>","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone Circuit Value Problem with Bounded Genus Is in NC. In: <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>. LNCS. ; 2016:92-102. doi:<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>","chicago":"Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” In <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 92–102. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">https://doi.org/10.1007/978-3-319-42634-1_8</a>.","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 2016, pp. 92–102."},"status":"public","year":"2016","language":[{"iso":"eng"}],"date_created":"2017-10-17T12:41:19Z","date_updated":"2022-01-06T06:51:57Z","_id":"143","file_date_updated":"2018-11-02T14:20:45Z","has_accepted_license":"1","abstract":[{"text":"We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6].","lang":"eng"}],"doi":"10.1007/978-3-319-42634-1_8","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file":[{"creator":"ups","file_size":234587,"file_name":"TheMonotoneCircuitValueProblem.pdf","access_level":"closed","content_type":"application/pdf","file_id":"5269","date_created":"2018-11-02T14:20:45Z","date_updated":"2018-11-02T14:20:45Z","relation":"main_file","success":1}],"title":"The Monotone Circuit Value Problem with Bounded Genus Is in NC","user_id":"477","type":"conference","ddc":["000"],"publication":"Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)","page":"92-102"},{"intvolume":"       634","author":[{"last_name":"Monien","full_name":"Monien, Burkhard","first_name":"Burkhard"},{"last_name":"Mavronicolas","first_name":"Marios","full_name":"Mavronicolas, Marios"}],"citation":{"ama":"Monien B, Mavronicolas M. The complexity of equilibria for risk-modeling valuations. <i>Theoretical Computer Science</i>. 2016;634:67-96. doi:<a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">10.1016/j.tcs.2016.04.013</a>","apa":"Monien, B., &#38; Mavronicolas, M. (2016). The complexity of equilibria for risk-modeling valuations. <i>Theoretical Computer Science</i>, <i>634</i>, 67–96. <a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">https://doi.org/10.1016/j.tcs.2016.04.013</a>","chicago":"Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for Risk-Modeling Valuations.” <i>Theoretical Computer Science</i> 634 (2016): 67–96. <a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">https://doi.org/10.1016/j.tcs.2016.04.013</a>.","ieee":"B. Monien and M. Mavronicolas, “The complexity of equilibria for risk-modeling valuations,” <i>Theoretical Computer Science</i>, vol. 634, pp. 67–96, 2016.","mla":"Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for Risk-Modeling Valuations.” <i>Theoretical Computer Science</i>, vol. 634, Elsevier, 2016, pp. 67–96, doi:<a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">10.1016/j.tcs.2016.04.013</a>.","bibtex":"@article{Monien_Mavronicolas_2016, title={The complexity of equilibria for risk-modeling valuations}, volume={634}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">10.1016/j.tcs.2016.04.013</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Monien, Burkhard and Mavronicolas, Marios}, year={2016}, pages={67–96} }","short":"B. Monien, M. Mavronicolas, Theoretical Computer Science 634 (2016) 67–96."},"status":"public","year":"2016","language":[{"iso":"eng"}],"publisher":"Elsevier","date_created":"2017-10-17T12:41:20Z","date_updated":"2022-01-06T06:51:59Z","_id":"144","file_date_updated":"2018-03-21T12:58:42Z","has_accepted_license":"1","doi":"10.1016/j.tcs.2016.04.013","abstract":[{"text":"Following the direction pioneered by Fiat and Papadimitriou in their 2010 paper [12], we study the complexity of deciding the existence of mixed equilibria for minimization games where players use valuations other than expectation to evaluate their costs. We consider risk-averse players seeking to minimize the sum V=E+R of expectationE and a risk valuationR of their costs; R is non-negative and vanishes exactly when the cost incurred to a player is constant over all choices of strategies by the other players. In a V-equilibrium, no player could unilaterally reduce her cost.Say that V has the Weak-Equilibrium-for-Expectation property if all strategies supported in a player's best-response mixed strategy incur the same conditional expectation of her cost. We introduce E-strict concavity and observe that every E-strictly concave valuation has the Weak-Equilibrium-for-Expectation property. We focus on a broad class of valuations shown to have the Weak-Equilibrium-for-Expectation property, which we exploit to prove two main complexity results, the first of their kind, for the two simplest cases of the problem:• Two strategies: Deciding the existence of a V-equilibrium is strongly NP-hard for the restricted class of player-specific scheduling games on two ordered links [22], when choosing R as (1)Var (variance), or (2)SD (standard deviation), or (3) a concave linear sum of even moments of small order.• Two players: Deciding the existence of a V-equilibrium is strongly NP-hard when choosing R as (1)γ⋅Var, or (2)γ⋅SD, where γ>0 is the risk-coefficient, or choosing V as (3) a convex combination of E+γ⋅Var and the concave ν-valuationν−1(E(ν(⋅))), where ν(x)=xr, with r≥2. This is a concrete consequence of a general strong NP-hardness result that only needs the Weak-Equilibrium-for-Expectation property and a few additional properties for V; its proof involves a reduction with a single parameter, which can be chosen efficiently so that each valuation satisfies the additional properties.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file":[{"success":1,"relation":"main_file","date_updated":"2018-03-21T12:58:42Z","file_id":"1557","content_type":"application/pdf","access_level":"closed","date_created":"2018-03-21T12:58:42Z","creator":"florida","file_size":633599,"file_name":"144-Monien_Mavronicolas-TCS2016_01.pdf"}],"title":"The complexity of equilibria for risk-modeling valuations","user_id":"42447","type":"journal_article","ddc":["040"],"publication":"Theoretical Computer Science","volume":634,"page":"67-96"},{"department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"publication_status":"published","citation":{"bibtex":"@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM}, volume={28}, DOI={<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>}, number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016}, pages={1655–1677} }","mla":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” <i>Concurrency and Computation: Practice and Experience</i>, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>.","short":"M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience 28 (2016) 1655–1677.","apa":"Feldotto, M., &#38; Graffi, K. (2016). Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. <i>Concurrency and Computation: Practice and Experience</i>, <i>28</i>(5), 1655–1677. <a href=\"https://doi.org/10.1002/cpe.3716\">https://doi.org/10.1002/cpe.3716</a>","ama":"Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. <i>Concurrency and Computation: Practice and Experience</i>. 2016;28(5):1655-1677. doi:<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>","ieee":"M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” <i>Concurrency and Computation: Practice and Experience</i>, vol. 28, no. 5, pp. 1655–1677, 2016.","chicago":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” <i>Concurrency and Computation: Practice and Experience</i> 28, no. 5 (2016): 1655–77. <a href=\"https://doi.org/10.1002/cpe.3716\">https://doi.org/10.1002/cpe.3716</a>."},"intvolume":"        28","author":[{"orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052","first_name":"Matthias","full_name":"Feldotto, Matthias"},{"full_name":"Graffi, Kalman","first_name":"Kalman","last_name":"Graffi"}],"date_updated":"2022-01-06T06:52:00Z","_id":"145","file_date_updated":"2018-03-21T12:57:57Z","status":"public","year":"2016","publisher":"Wiley Online Library","date_created":"2017-10-17T12:41:20Z","user_id":"14052","doi":"10.1002/cpe.3716","has_accepted_license":"1","abstract":[{"text":"Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. ","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file":[{"creator":"florida","file_size":3121363,"file_name":"145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf","file_id":"1556","content_type":"application/pdf","access_level":"closed","date_created":"2018-03-21T12:57:57Z","relation":"main_file","date_updated":"2018-03-21T12:57:57Z","success":1}],"title":"Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM","issue":"5","volume":28,"page":"1655-1677","type":"journal_article","ddc":["040"],"publication":"Concurrency and Computation: Practice and Experience"}]