[{"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"18030","user_id":"477","department":[{"_id":"79"}],"status":"public","type":"bachelorsthesis","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten","date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"date_created":"2020-08-18T08:44:22Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"year":"2018","citation":{"mla":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","short":"N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","bibtex":"@book{N._2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={N., N.}, year={2018} }","apa":"N., N. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn.","ama":"N. N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018.","ieee":"N. N., <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn, 2018.","chicago":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018."}},{"department":[{"_id":"79"}],"user_id":"477","_id":"18033","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"last_name":"Wulfes","full_name":"Wulfes, Robin","first_name":"Robin"}],"date_created":"2020-08-18T08:46:50Z","date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","title":"Load-Balanced Routing in Hybriden Kommunikationsnetzwerken","citation":{"ama":"Wulfes R. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn; 2018.","ieee":"R. Wulfes, <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","chicago":"Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","apa":"Wulfes, R. (2018). <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn.","short":"R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität Paderborn, 2018.","bibtex":"@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken}, publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }","mla":"Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018."},"year":"2018"},{"language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"_id":"2320","user_id":"16205","status":"public","type":"mastersthesis","title":"Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM","date_updated":"2022-01-06T06:55:47Z","author":[{"last_name":"Funke","full_name":"Funke, Lars Christian","first_name":"Lars Christian"}],"date_created":"2018-04-12T12:47:45Z","supervisor":[{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"}],"year":"2018","place":"Universität Paderborn","citation":{"chicago":"Funke, Lars Christian. <i>Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM</i>. Universität Paderborn, 2018.","ieee":"L. C. Funke, <i>Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM</i>. Universität Paderborn, 2018.","ama":"Funke LC. <i>Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM</i>. Universität Paderborn; 2018.","apa":"Funke, L. C. (2018). <i>Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM</i>. Universität Paderborn.","short":"L.C. Funke, Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM, Universität Paderborn, 2018.","bibtex":"@book{Funke_2018, place={Universität Paderborn}, title={Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM}, author={Funke, Lars Christian}, year={2018} }","mla":"Funke, Lars Christian. <i>Eignungsbewertung eines Enterprise Architecture Frameworks für das IT-Alignment zwischen Unternehmensstrategie und IT-Landschaft am Beispiel der Arvato SCM</i>. 2018."}},{"doi":"10.1007/978-3-319-91947-8_53","conference":{"name":"23rd International Conference on Natural Language and Information Systems","start_date":"2018-06-13","end_date":"2018-06-18","location":"Paris, France"},"date_updated":"2022-01-06T06:55:47Z","author":[{"last_name":"Bäumer","id":"38837","full_name":"Bäumer, Frederik Simon","first_name":"Frederik Simon"},{"first_name":"Michaela","last_name":"Geierhos","orcid":"0000-0002-8180-5606","id":"42496","full_name":"Geierhos, Michaela"}],"volume":10859,"place":"Cham, Switzerland","citation":{"short":"F.S. Bäumer, M. Geierhos, in: M. Silberztein, F. Atigui, E. Kornyshova, E. Métais, F. Meziane (Eds.), Proceedings of the 23rd International Conference on Natural Language and Information Systems, Springer, Cham, Switzerland, 2018, pp. 509–513.","mla":"Bäumer, Frederik Simon, and Michaela Geierhos. “How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges.” <i>Proceedings of the 23rd International Conference on Natural Language and Information Systems</i>, edited by Max  Silberztein et al., vol. 10859, Springer, 2018, pp. 509–13, doi:<a href=\"https://doi.org/10.1007/978-3-319-91947-8_53\">10.1007/978-3-319-91947-8_53</a>.","bibtex":"@inbook{Bäumer_Geierhos_2018, place={Cham, Switzerland}, series={Lecture Notes in Computer Science}, title={How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges}, volume={10859}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-91947-8_53\">10.1007/978-3-319-91947-8_53</a>}, booktitle={Proceedings of the 23rd International Conference on Natural Language and Information Systems}, publisher={Springer}, author={Bäumer, Frederik Simon and Geierhos, Michaela}, editor={Silberztein, Max  and Atigui, Faten  and Kornyshova, Elena  and Métais, Elisabeth  and Meziane, Farid Editors}, year={2018}, pages={509–513}, collection={Lecture Notes in Computer Science} }","apa":"Bäumer, F. S., &#38; Geierhos, M. (2018). How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges. In M. Silberztein, F. Atigui, E. Kornyshova, E. Métais, &#38; F. Meziane (Eds.), <i>Proceedings of the 23rd International Conference on Natural Language and Information Systems</i> (Vol. 10859, pp. 509–513). Cham, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-91947-8_53\">https://doi.org/10.1007/978-3-319-91947-8_53</a>","ama":"Bäumer FS, Geierhos M. How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges. In: Silberztein M, Atigui F, Kornyshova E, Métais E, Meziane F, eds. <i>Proceedings of the 23rd International Conference on Natural Language and Information Systems</i>. Vol 10859. Lecture Notes in Computer Science. Cham, Switzerland: Springer; 2018:509-513. doi:<a href=\"https://doi.org/10.1007/978-3-319-91947-8_53\">10.1007/978-3-319-91947-8_53</a>","ieee":"F. S. Bäumer and M. Geierhos, “How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges,” in <i>Proceedings of the 23rd International Conference on Natural Language and Information Systems</i>, vol. 10859, M. Silberztein, F. Atigui, E. Kornyshova, E. Métais, and F. Meziane, Eds. Cham, Switzerland: Springer, 2018, pp. 509–513.","chicago":"Bäumer, Frederik Simon, and Michaela Geierhos. “How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges.” In <i>Proceedings of the 23rd International Conference on Natural Language and Information Systems</i>, edited by Max  Silberztein, Faten  Atigui, Elena  Kornyshova, Elisabeth  Métais, and Farid  Meziane, 10859:509–13. Lecture Notes in Computer Science. Cham, Switzerland: Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-91947-8_53\">https://doi.org/10.1007/978-3-319-91947-8_53</a>."},"page":"509-513","intvolume":"     10859","publication_status":"published","publication_identifier":{"isbn":["978-3-319-91946-1"]},"has_accepted_license":"1","file_date_updated":"2018-11-02T16:12:26Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"_id":"2322","user_id":"477","series_title":"Lecture Notes in Computer Science","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"editor":[{"last_name":"Silberztein","full_name":"Silberztein, Max ","first_name":"Max "},{"last_name":"Atigui","full_name":"Atigui, Faten ","first_name":"Faten "},{"last_name":"Kornyshova","full_name":"Kornyshova, Elena ","first_name":"Elena "},{"first_name":"Elisabeth ","full_name":"Métais, Elisabeth ","last_name":"Métais"},{"full_name":"Meziane, Farid ","last_name":"Meziane","first_name":"Farid "}],"status":"public","type":"book_chapter","title":"How to Deal with Inaccurate Service Descriptions in On-The-Fly Computing: Open Challenges","publisher":"Springer","date_created":"2018-04-13T08:54:56Z","year":"2018","quality_controlled":"1","ddc":["000"],"keyword":["Requirements Extraction","Temporal Reordering of Software Functions","Inaccuracy Compensation"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The vision of On-The-Fly Computing is an automatic composition\r\nof existing software services. Based on natural language software\r\ndescriptions, end users will receive compositions tailored to their needs.\r\nFor this reason, the quality of the initial software service description\r\nstrongly determines whether a software composition really meets the expectations\r\nof end users. In this paper, we expose open NLP challenges\r\nneeded to be faced for service composition in On-The-Fly Computing."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T16:12:26Z","date_updated":"2018-11-02T16:12:26Z","file_id":"5326","access_level":"closed","file_name":"Bäumer-Geierhos2018_Chapter_HowToDealWithInaccurateService.pdf","file_size":327508}],"publication":"Proceedings of the 23rd International Conference on Natural Language and Information Systems"},{"publication":"International Journal of Advanced Science and Technology","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T15:16:29Z","creator":"ups","date_updated":"2018-11-02T15:16:29Z","access_level":"closed","file_name":"12.pdf","file_id":"5297","file_size":586968}],"abstract":[{"lang":"eng","text":"A user generally writes software requirements in ambiguous and incomplete form by using natural language; therefore, a software developer may have difficulty in clearly understanding what the meanings are. To solve this problem with automation, we propose a classifier for semantic annotation with manually pre-defined semantic categories. To improve our classifier, we carefully designed syntactic features extracted by constituency and dependency parsers. Even with a small dataset and a large number of classes, our proposed classifier records an accuracy of 0.75, which outperforms the previous model, REaCT."}],"language":[{"iso":"eng"}],"ddc":["000"],"keyword":["Software Engineering","Natural Language Processing","Semantic Annotation","Machine Learning","Feature Engineering","Syntactic Structure"],"quality_controlled":"1","year":"2018","date_created":"2018-04-13T09:19:22Z","publisher":"SERSC Australia","title":"Improving Classifiers for Semantic Annotation of Software Requirements with Elaborate Syntactic Structure","type":"journal_article","status":"public","user_id":"477","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"_id":"2331","file_date_updated":"2018-11-02T15:16:29Z","article_type":"original","publication_status":"published","publication_identifier":{"eissn":["2207-6360"],"issn":["2005-4238"]},"has_accepted_license":"1","citation":{"mla":"Kim, Yeongsu, et al. “Improving Classifiers for Semantic Annotation of Software Requirements with Elaborate Syntactic Structure.” <i>International Journal of Advanced Science and Technology</i>, vol. 112, SERSC Australia, 2018, pp. 123–36, doi:<a href=\"https://doi.org/10.14257/ijast.2018.112.12\">10.14257/ijast.2018.112.12</a>.","bibtex":"@article{Kim_Lee_Dollmann_Geierhos_2018, title={Improving Classifiers for Semantic Annotation of Software Requirements with Elaborate Syntactic Structure}, volume={112}, DOI={<a href=\"https://doi.org/10.14257/ijast.2018.112.12\">10.14257/ijast.2018.112.12</a>}, journal={International Journal of Advanced Science and Technology}, publisher={SERSC Australia}, author={Kim, Yeongsu  and Lee, Seungwoo and Dollmann, Markus and Geierhos, Michaela}, year={2018}, pages={123–136} }","short":"Y. Kim, S. Lee, M. Dollmann, M. Geierhos, International Journal of Advanced Science and Technology 112 (2018) 123–136.","apa":"Kim, Y., Lee, S., Dollmann, M., &#38; Geierhos, M. (2018). Improving Classifiers for Semantic Annotation of Software Requirements with Elaborate Syntactic Structure. <i>International Journal of Advanced Science and Technology</i>, <i>112</i>, 123–136. <a href=\"https://doi.org/10.14257/ijast.2018.112.12\">https://doi.org/10.14257/ijast.2018.112.12</a>","ama":"Kim Y, Lee S, Dollmann M, Geierhos M. Improving Classifiers for Semantic Annotation of Software Requirements with Elaborate Syntactic Structure. <i>International Journal of Advanced Science and Technology</i>. 2018;112:123-136. doi:<a href=\"https://doi.org/10.14257/ijast.2018.112.12\">10.14257/ijast.2018.112.12</a>","chicago":"Kim, Yeongsu , Seungwoo Lee, Markus Dollmann, and Michaela Geierhos. “Improving Classifiers for Semantic Annotation of Software Requirements with Elaborate Syntactic Structure.” <i>International Journal of Advanced Science and Technology</i> 112 (2018): 123–36. <a href=\"https://doi.org/10.14257/ijast.2018.112.12\">https://doi.org/10.14257/ijast.2018.112.12</a>.","ieee":"Y. Kim, S. Lee, M. Dollmann, and M. Geierhos, “Improving Classifiers for Semantic Annotation of Software Requirements with Elaborate Syntactic Structure,” <i>International Journal of Advanced Science and Technology</i>, vol. 112, pp. 123–136, 2018."},"page":"123-136","intvolume":"       112","author":[{"full_name":"Kim, Yeongsu ","last_name":"Kim","first_name":"Yeongsu "},{"first_name":"Seungwoo","last_name":"Lee","full_name":"Lee, Seungwoo"},{"full_name":"Dollmann, Markus","id":"27578","last_name":"Dollmann","first_name":"Markus"},{"first_name":"Michaela","full_name":"Geierhos, Michaela","id":"42496","last_name":"Geierhos","orcid":"0000-0002-8180-5606"}],"volume":112,"date_updated":"2022-01-06T06:55:49Z","doi":"10.14257/ijast.2018.112.12"},{"year":"2018","citation":{"bibtex":"@book{Aykanat_2018, title={Sharing Economy - Chancen und Risiken aus ökonomischer Sicht}, publisher={Universität Paderborn}, author={Aykanat, Cengiz}, year={2018} }","mla":"Aykanat, Cengiz. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht</i>. Universität Paderborn, 2018.","short":"C. Aykanat, Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht, Universität Paderborn, 2018.","apa":"Aykanat, C. (2018). <i>Sharing Economy - Chancen und Risiken aus ökonomischer Sicht</i>. Universität Paderborn.","ieee":"C. Aykanat, <i>Sharing Economy - Chancen und Risiken aus ökonomischer Sicht</i>. Universität Paderborn, 2018.","chicago":"Aykanat, Cengiz. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht</i>. Universität Paderborn, 2018.","ama":"Aykanat C. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht</i>. Universität Paderborn; 2018."},"title":"Sharing Economy - Chancen und Risiken aus ökonomischer Sicht","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:50Z","supervisor":[{"id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_created":"2019-02-22T09:40:39Z","author":[{"full_name":"Aykanat, Cengiz","last_name":"Aykanat","first_name":"Cengiz"}],"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"8074","user_id":"477","department":[{"_id":"280"}]},{"title":"Heterogeneity in Contests, Sources and Implicants","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:50Z","date_created":"2019-02-22T09:47:28Z","author":[{"last_name":"Suvorina","full_name":"Suvorina, Tatiana","first_name":"Tatiana"}],"supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp"}],"year":"2018","citation":{"ama":"Suvorina T. <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn; 2018.","ieee":"T. Suvorina, <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn, 2018.","chicago":"Suvorina, Tatiana. <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn, 2018.","bibtex":"@book{Suvorina_2018, title={Heterogeneity in Contests, Sources and Implicants}, publisher={Universität Paderborn}, author={Suvorina, Tatiana}, year={2018} }","mla":"Suvorina, Tatiana. <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn, 2018.","short":"T. Suvorina, Heterogeneity in Contests, Sources and Implicants, Universität Paderborn, 2018.","apa":"Suvorina, T. (2018). <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn."},"language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"8075","user_id":"477","department":[{"_id":"280"}],"status":"public","type":"mastersthesis"},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:35Z","author":[{"first_name":"Helena","id":"52640","full_name":"Graf, Helena","last_name":"Graf"}],"supervisor":[{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"}],"date_created":"2018-11-15T08:06:41Z","title":"Ranking of Classification Algorithms in AutoML","year":"2018","citation":{"mla":"Graf, Helena. <i>Ranking of Classification Algorithms in AutoML</i>. Universität Paderborn, 2018.","bibtex":"@book{Graf_2018, title={Ranking of Classification Algorithms in AutoML}, publisher={Universität Paderborn}, author={Graf, Helena}, year={2018} }","short":"H. Graf, Ranking of Classification Algorithms in AutoML, Universität Paderborn, 2018.","apa":"Graf, H. (2018). <i>Ranking of Classification Algorithms in AutoML</i>. Universität Paderborn.","ama":"Graf H. <i>Ranking of Classification Algorithms in AutoML</i>. Universität Paderborn; 2018.","ieee":"H. Graf, <i>Ranking of Classification Algorithms in AutoML</i>. Universität Paderborn, 2018.","chicago":"Graf, Helena. <i>Ranking of Classification Algorithms in AutoML</i>. Universität Paderborn, 2018."},"_id":"5693","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"department":[{"_id":"355"}],"user_id":"33176","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"department":[{"_id":"183"}],"user_id":"477","_id":"5772","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"file_date_updated":"2018-11-21T09:46:42Z","language":[{"iso":"eng"}],"ddc":["330"],"publication":"Journal of Wine Economics","type":"journal_article","status":"public","file":[{"file_size":291759,"file_id":"5773","file_name":"fanasch_frick_jwe_2018.pdf","access_level":"closed","date_updated":"2018-11-21T09:46:42Z","creator":"bhoyer","date_created":"2018-11-21T09:46:42Z","relation":"main_file","content_type":"application/pdf"}],"date_created":"2018-11-21T09:45:21Z","author":[{"full_name":"Fanasch, Patrizia","last_name":"Fanasch","first_name":"Patrizia"},{"first_name":"Bernd","full_name":"Frick, Bernd","last_name":"Frick"}],"date_updated":"2022-01-06T07:02:40Z","publisher":"Cambridge University Press (CUP)","doi":"10.1017/jwe.2018.28","title":"What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance","publication_identifier":{"issn":["1931-4361","1931-437X"]},"has_accepted_license":"1","publication_status":"epub_ahead","page":"1-27","citation":{"ieee":"P. Fanasch and B. Frick, “What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance,” <i>Journal of Wine Economics</i>, pp. 1–27, 2018.","chicago":"Fanasch, Patrizia, and Bernd Frick. “What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance.” <i>Journal of Wine Economics</i>, 2018, 1–27. <a href=\"https://doi.org/10.1017/jwe.2018.28\">https://doi.org/10.1017/jwe.2018.28</a>.","ama":"Fanasch P, Frick B. What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance. <i>Journal of Wine Economics</i>. 2018:1-27. doi:<a href=\"https://doi.org/10.1017/jwe.2018.28\">10.1017/jwe.2018.28</a>","bibtex":"@article{Fanasch_Frick_2018, title={What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance}, DOI={<a href=\"https://doi.org/10.1017/jwe.2018.28\">10.1017/jwe.2018.28</a>}, journal={Journal of Wine Economics}, publisher={Cambridge University Press (CUP)}, author={Fanasch, Patrizia and Frick, Bernd}, year={2018}, pages={1–27} }","mla":"Fanasch, Patrizia, and Bernd Frick. “What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance.” <i>Journal of Wine Economics</i>, Cambridge University Press (CUP), 2018, pp. 1–27, doi:<a href=\"https://doi.org/10.1017/jwe.2018.28\">10.1017/jwe.2018.28</a>.","short":"P. Fanasch, B. Frick, Journal of Wine Economics (2018) 1–27.","apa":"Fanasch, P., &#38; Frick, B. (2018). What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance. <i>Journal of Wine Economics</i>, 1–27. <a href=\"https://doi.org/10.1017/jwe.2018.28\">https://doi.org/10.1017/jwe.2018.28</a>"},"year":"2018"},{"language":[{"iso":"eng"}],"ddc":["000"],"publication":"Theoretical Aspects of Computing – ICTAC 2018","file":[{"file_size":518016,"file_id":"5837","access_level":"closed","file_name":"Töws-Wehrheim2018_Chapter_InformationFlowCertificates.pdf","date_updated":"2018-11-26T15:11:32Z","date_created":"2018-11-26T15:11:32Z","creator":"mtoews","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Information flow analysis investigates the flow of data in applications, checking in particular for flows from private sources to public sinks. Flow- and path-sensitive analyses are, however, often too costly to be performed every time a security-critical application is run. In this paper, we propose a variant of proof carrying code for information flow security. To this end, we develop information flow (IF) certificates which get attached to programs as well as a method for IF certificate validation. We prove soundness of our technique, i.e., show it to be tamper-free. The technique is implemented within the program analysis tool CPAchecker. Our experiments confirm that the use of certificates pays off for costly analysis runs.","lang":"eng"}],"date_created":"2018-11-21T09:51:37Z","publisher":"Springer International Publishing","title":"Information Flow Certificates","year":"2018","department":[{"_id":"77"}],"user_id":"477","_id":"5774","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"file_date_updated":"2018-11-26T15:11:32Z","type":"conference","status":"public","author":[{"last_name":"Töws","full_name":"Töws, Manuel","id":"11315","first_name":"Manuel"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_updated":"2022-01-06T07:02:40Z","doi":"10.1007/978-3-030-02508-3_23","publication_identifier":{"isbn":["9783030025076","9783030025083"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","publication_status":"published","page":"435-454","citation":{"apa":"Töws, M., &#38; Wehrheim, H. (2018). Information Flow Certificates. In <i>Theoretical Aspects of Computing – ICTAC 2018</i> (pp. 435–454). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">https://doi.org/10.1007/978-3-030-02508-3_23</a>","bibtex":"@inproceedings{Töws_Wehrheim_2018, place={Cham}, title={Information Flow Certificates}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">10.1007/978-3-030-02508-3_23</a>}, booktitle={Theoretical Aspects of Computing – ICTAC 2018}, publisher={Springer International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2018}, pages={435–454} }","short":"M. Töws, H. Wehrheim, in: Theoretical Aspects of Computing – ICTAC 2018, Springer International Publishing, Cham, 2018, pp. 435–454.","mla":"Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” <i>Theoretical Aspects of Computing – ICTAC 2018</i>, Springer International Publishing, 2018, pp. 435–54, doi:<a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">10.1007/978-3-030-02508-3_23</a>.","chicago":"Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” In <i>Theoretical Aspects of Computing – ICTAC 2018</i>, 435–54. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">https://doi.org/10.1007/978-3-030-02508-3_23</a>.","ieee":"M. Töws and H. Wehrheim, “Information Flow Certificates,” in <i>Theoretical Aspects of Computing – ICTAC 2018</i>, 2018, pp. 435–454.","ama":"Töws M, Wehrheim H. Information Flow Certificates. In: <i>Theoretical Aspects of Computing – ICTAC 2018</i>. Cham: Springer International Publishing; 2018:435-454. doi:<a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">10.1007/978-3-030-02508-3_23</a>"},"place":"Cham"},{"title":"Provably Anonymous Communication Based on Trusted Execution Environments","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"id":"27207","full_name":"Bobolz, Jan","last_name":"Bobolz","first_name":"Jan"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Alexander","last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander"}],"date_created":"2018-11-25T08:08:40Z","date_updated":"2022-01-06T07:02:43Z","citation":{"apa":"Blömer, J., Bobolz, J., Scheideler, C., &#38; Setzer, A. (n.d.). <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>.","short":"J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.","bibtex":"@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz, Jan and Scheideler, Christian and Setzer, Alexander} }","mla":"Blömer, Johannes, et al. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>.","chicago":"Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>, n.d.","ieee":"J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>. .","ama":"Blömer J, Bobolz J, Scheideler C, Setzer A. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>."},"year":"2018","publication_status":"draft","has_accepted_license":"1","file_date_updated":"2018-12-31T09:55:30Z","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"27207","department":[{"_id":"7"},{"_id":"64"},{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"5820","file":[{"access_level":"closed","file_name":"draft-2018.pdf","file_id":"6435","file_size":470968,"creator":"jbobolz","date_created":"2018-12-31T09:55:30Z","date_updated":"2018-12-31T09:55:30Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"text":"In this paper, we investigate the use of trusted execution environments (TEEs, such as Intel's SGX) for an anonymous communication infrastructure over untrusted networks.\r\nFor this, we present the general idea of exploiting trusted execution environments for the purpose of anonymous communication, including a continuous-time security framework that models strong anonymity guarantees in the presence of an adversary that observes all network traffic and can adaptively corrupt a constant fraction of participating nodes.\r\nIn our framework, a participating node can generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms, allowing both senders and receivers of messages to remain anonymous. We introduce a concrete construction, which shows viability of our TEE-based approach to anonymous communication. The construction draws from techniques from cryptography and overlay networks. \r\nOur techniques are very general and can be used as a basis for future constructions with similar goals.","lang":"eng"}],"type":"working_paper"},{"year":"2018","citation":{"ama":"Scheibl M. <i>Learning about Learning Curves from Dataset Properties</i>. Universität Paderborn; 2018.","ieee":"M. Scheibl, <i>Learning about learning curves from dataset properties</i>. Universität Paderborn, 2018.","chicago":"Scheibl, Manuel. <i>Learning about Learning Curves from Dataset Properties</i>. Universität Paderborn, 2018.","mla":"Scheibl, Manuel. <i>Learning about Learning Curves from Dataset Properties</i>. Universität Paderborn, 2018.","bibtex":"@book{Scheibl_2018, title={Learning about learning curves from dataset properties}, publisher={Universität Paderborn}, author={Scheibl, Manuel}, year={2018} }","short":"M. Scheibl, Learning about Learning Curves from Dataset Properties, Universität Paderborn, 2018.","apa":"Scheibl, M. (2018). <i>Learning about learning curves from dataset properties</i>. Universität Paderborn."},"title":"Learning about learning curves from dataset properties","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:47Z","author":[{"last_name":"Scheibl","full_name":"Scheibl, Manuel","first_name":"Manuel"}],"supervisor":[{"first_name":"Eyke","id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"}],"date_created":"2018-11-28T10:29:53Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"_id":"5936","user_id":"477","department":[{"_id":"355"}]},{"year":"2018","citation":{"ama":"Koch A. <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn; 2018.","ieee":"A. Koch, <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn, 2018.","chicago":"Koch, Alexander. <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn, 2018.","apa":"Koch, A. (2018). <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn.","bibtex":"@book{Koch_2018, title={Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung}, publisher={Universität Paderborn}, author={Koch, Alexander}, year={2018} }","mla":"Koch, Alexander. <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn, 2018.","short":"A. Koch, Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung, Universität Paderborn, 2018."},"title":"Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung","date_updated":"2022-01-06T07:02:48Z","publisher":"Universität Paderborn","date_created":"2018-11-28T12:07:30Z","author":[{"last_name":"Koch","full_name":"Koch, Alexander","first_name":"Alexander"}],"supervisor":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"5967","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"205"}],"user_id":"65453"},{"alternative_title":["Special Issue of SIROCCO 2015"],"file_date_updated":"2019-01-11T10:20:16Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"5984","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"journal_article","doi":"10.1016/j.tcs.2018.11.004","date_updated":"2022-01-06T07:02:49Z","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"volume":751,"citation":{"chicago":"Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i> 751 (2018): 1. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">https://doi.org/10.1016/j.tcs.2018.11.004</a>.","ieee":"C. Scheideler, “Preface,” <i>Theor. Comput. Sci.</i>, vol. 751, p. 1, 2018.","ama":"Scheideler C. Preface. <i>Theor Comput Sci</i>. 2018;751:1. doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>","short":"C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.","bibtex":"@article{Scheideler_2018, title={Preface}, volume={751}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>}, journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1} }","mla":"Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i>, vol. 751, 2018, p. 1, doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>.","apa":"Scheideler, C. (2018). Preface. <i>Theor. Comput. Sci.</i>, <i>751</i>, 1. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">https://doi.org/10.1016/j.tcs.2018.11.004</a>"},"intvolume":"       751","page":"1","has_accepted_license":"1","ddc":["040"],"language":[{"iso":"eng"}],"file":[{"creator":"florida","date_created":"2019-01-11T10:20:16Z","date_updated":"2019-01-11T10:20:16Z","access_level":"closed","file_name":"Preface.pdf","file_id":"6620","file_size":112676,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Theor. Comput. Sci.","title":"Preface","date_created":"2018-11-30T08:08:23Z","year":"2018"},{"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2018-12-12T15:12:02Z","creator":"ups","date_updated":"2018-12-12T15:12:02Z","file_id":"6194","access_level":"closed","file_name":"p1-scheideler.pdf","file_size":1420210}],"publication":"Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018","type":"conference","ddc":["004"],"file_date_updated":"2018-12-12T15:12:02Z","language":[{"iso":"eng"}],"_id":"5985","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"79"}],"user_id":"477","year":"2018","page":"1-2","citation":{"chicago":"Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” In <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018</i>, 1–2, 2018. <a href=\"https://doi.org/10.1145/3229774.3229781\">https://doi.org/10.1145/3229774.3229781</a>.","ieee":"C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,” in <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018</i>, 2018, pp. 1–2.","ama":"Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing. In: <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018</i>. ; 2018:1-2. doi:<a href=\"https://doi.org/10.1145/3229774.3229781\">10.1145/3229774.3229781</a>","apa":"Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure Fog Computing. In <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018</i> (pp. 1–2). <a href=\"https://doi.org/10.1145/3229774.3229781\">https://doi.org/10.1145/3229774.3229781</a>","bibtex":"@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for Robust and Secure Fog Computing}, DOI={<a href=\"https://doi.org/10.1145/3229774.3229781\">10.1145/3229774.3229781</a>}, booktitle={Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018}, author={Scheideler, Christian}, year={2018}, pages={1–2} }","mla":"Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018</i>, 2018, pp. 1–2, doi:<a href=\"https://doi.org/10.1145/3229774.3229781\">10.1145/3229774.3229781</a>.","short":"C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2."},"has_accepted_license":"1","title":"Relays: Towards a Link Layer for Robust and Secure Fog Computing","doi":"10.1145/3229774.3229781","date_updated":"2022-01-06T07:02:49Z","date_created":"2018-11-30T08:11:27Z","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}]},{"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-12-06T12:05:37Z","date_created":"2018-12-06T12:05:37Z","creator":"peuster","file_size":961004,"file_id":"6017","access_level":"open_access","file_name":"main_copy_for_ris.pdf"}],"publication":"IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)","type":"conference","ddc":["000"],"file_date_updated":"2018-12-06T12:05:37Z","language":[{"iso":"eng"}],"_id":"6016","project":[{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"15","name":"SFB 901 - Subproject C3"}],"department":[{"_id":"75"}],"user_id":"13271","place":"Rome","year":"2018","citation":{"chicago":"Peuster, Manuel, and Holger Karl. “Understand Your Chains and Keep Your Deadlines: Introducing Time-Constrained Profiling for NFV.” In <i>IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)</i>. Rome: IEEE/IFIP, n.d.","ieee":"M. Peuster and H. Karl, “Understand your chains and keep your deadlines: Introducing time-constrained profiling for NFV,” in <i>IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)</i>, Rome.","ama":"Peuster M, Karl H. Understand your chains and keep your deadlines: Introducing time-constrained profiling for NFV. In: <i>IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)</i>. Rome: IEEE/IFIP.","apa":"Peuster, M., &#38; Karl, H. (n.d.). Understand your chains and keep your deadlines: Introducing time-constrained profiling for NFV. In <i>IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)</i>. Rome: IEEE/IFIP.","short":"M. Peuster, H. Karl, in: IEEE/IFIP 14th International Conference on Network and Service Management (CNSM), IEEE/IFIP, Rome, n.d.","bibtex":"@inproceedings{Peuster_Karl, place={Rome}, title={Understand your chains and keep your deadlines: Introducing time-constrained profiling for NFV}, booktitle={IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)}, publisher={IEEE/IFIP}, author={Peuster, Manuel and Karl, Holger} }","mla":"Peuster, Manuel, and Holger Karl. “Understand Your Chains and Keep Your Deadlines: Introducing Time-Constrained Profiling for NFV.” <i>IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)</i>, IEEE/IFIP."},"has_accepted_license":"1","publication_status":"accepted","title":"Understand your chains and keep your deadlines: Introducing time-constrained profiling for NFV","conference":{"location":"Rome","end_date":"2018-11-09","start_date":"2018-11-05","name":"IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)"},"main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8584974"}],"oa":"1","date_updated":"2022-01-06T07:02:50Z","publisher":"IEEE/IFIP","date_created":"2018-12-06T12:06:14Z","author":[{"last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271","first_name":"Manuel"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}]},{"citation":{"mla":"Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.” <i>Journal of Scheduling</i>, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:<a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>.","short":"E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.","bibtex":"@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018, title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={<a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>}, number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus, Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018}, pages={77–92} }","apa":"Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., Sgall, J., &#38; Suess, T. (2018). Scheduling Shared Continuous Resources on Many-Cores. <i>Journal of Scheduling</i>, <i>21</i>(1), 77–92. <a href=\"https://doi.org/10.1007/s10951-017-0518-0\">https://doi.org/10.1007/s10951-017-0518-0</a>","ama":"Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources on Many-Cores. <i>Journal of Scheduling</i>. 2018;21(1):77-92. doi:<a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>","ieee":"E. Althaus <i>et al.</i>, “Scheduling Shared Continuous Resources on Many-Cores,” <i>Journal of Scheduling</i>, vol. 21, no. 1, pp. 77–92, 2018, doi: <a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>.","chicago":"Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.” <i>Journal of Scheduling</i> 21, no. 1 (2018): 77–92. <a href=\"https://doi.org/10.1007/s10951-017-0518-0\">https://doi.org/10.1007/s10951-017-0518-0</a>."},"intvolume":"        21","page":"77-92","has_accepted_license":"1","doi":"10.1007/s10951-017-0518-0","author":[{"full_name":"Althaus, Ernst","last_name":"Althaus","first_name":"Ernst"},{"first_name":"Andre","last_name":"Brinkmann","full_name":"Brinkmann, Andre"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Nagel, Lars","last_name":"Nagel","first_name":"Lars"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"},{"full_name":"Sgall, Jiri","last_name":"Sgall","first_name":"Jiri"},{"first_name":"Tim","full_name":"Suess, Tim","last_name":"Suess"}],"volume":21,"date_updated":"2022-01-06T07:03:00Z","status":"public","type":"journal_article","file_date_updated":"2018-03-21T13:16:59Z","user_id":"15415","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"63","year":"2018","issue":"1","title":"Scheduling Shared Continuous Resources on Many-Cores","date_created":"2017-10-17T12:41:03Z","publisher":"Springer","file":[{"file_size":466808,"file_id":"1577","access_level":"closed","file_name":"63-main_05.pdf","date_updated":"2018-03-21T13:16:59Z","creator":"florida","date_created":"2018-03-21T13:16:59Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Journal of Scheduling","language":[{"iso":"eng"}],"ddc":["040"]},{"type":"book_chapter","status":"public","department":[{"_id":"355"}],"user_id":"49109","_id":"6423","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"file_date_updated":"2019-01-11T11:03:50Z","has_accepted_license":"1","publication_identifier":{"isbn":["9783030017705","9783030017712"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"161-175","citation":{"bibtex":"@inbook{Schäfer_Hüllermeier_2018, place={Cham}, title={Preference-Based Reinforcement Learning Using Dyad Ranking}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-01771-2_11\">10.1007/978-3-030-01771-2_11</a>}, booktitle={Discovery Science}, publisher={Springer International Publishing}, author={Schäfer, Dirk and Hüllermeier, Eyke}, year={2018}, pages={161–175} }","short":"D. Schäfer, E. Hüllermeier, in: Discovery Science, Springer International Publishing, Cham, 2018, pp. 161–175.","mla":"Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning Using Dyad Ranking.” <i>Discovery Science</i>, Springer International Publishing, 2018, pp. 161–75, doi:<a href=\"https://doi.org/10.1007/978-3-030-01771-2_11\">10.1007/978-3-030-01771-2_11</a>.","apa":"Schäfer, D., &#38; Hüllermeier, E. (2018). Preference-Based Reinforcement Learning Using Dyad Ranking. In <i>Discovery Science</i> (pp. 161–175). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-01771-2_11\">https://doi.org/10.1007/978-3-030-01771-2_11</a>","ieee":"D. Schäfer and E. Hüllermeier, “Preference-Based Reinforcement Learning Using Dyad Ranking,” in <i>Discovery Science</i>, Cham: Springer International Publishing, 2018, pp. 161–175.","chicago":"Schäfer, Dirk, and Eyke Hüllermeier. “Preference-Based Reinforcement Learning Using Dyad Ranking.” In <i>Discovery Science</i>, 161–75. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-030-01771-2_11\">https://doi.org/10.1007/978-3-030-01771-2_11</a>.","ama":"Schäfer D, Hüllermeier E. Preference-Based Reinforcement Learning Using Dyad Ranking. In: <i>Discovery Science</i>. Cham: Springer International Publishing; 2018:161-175. doi:<a href=\"https://doi.org/10.1007/978-3-030-01771-2_11\">10.1007/978-3-030-01771-2_11</a>"},"place":"Cham","author":[{"first_name":"Dirk","last_name":"Schäfer","full_name":"Schäfer, Dirk"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129","first_name":"Eyke"}],"date_updated":"2022-01-06T07:03:04Z","doi":"10.1007/978-3-030-01771-2_11","publication":"Discovery Science","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-01-11T11:03:50Z","date_created":"2019-01-11T11:03:50Z","creator":"ups","file_size":458972,"file_name":"Schäfer-Hüllermeier2018_Chapter_Preference-BasedReinforcementL.pdf","access_level":"closed","file_id":"6623"}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2018","date_created":"2018-12-20T15:52:03Z","publisher":"Springer International Publishing","title":"Preference-Based Reinforcement Learning Using Dyad Ranking"},{"year":"2018","publisher":"Springer, Cham","date_created":"2018-09-17T13:12:18Z","title":"A Self-Stabilizing Hashed Patricia Trie","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","abstract":[{"lang":"eng","text":"While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.\r\nConsidering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.\r\nIn this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys."}],"file":[{"file_size":500005,"file_name":"ASelf-stabilizingHashedPatrici.pdf","access_level":"closed","file_id":"5277","date_updated":"2018-11-02T14:38:37Z","creator":"ups","date_created":"2018-11-02T14:38:37Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"external_id":{"arxiv":["1809.04923"]},"ddc":["000"],"keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"language":[{"iso":"eng"}],"has_accepted_license":"1","citation":{"chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>.","ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Tokyo, 2018, vol. 11201.","ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann, Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors}, year={2018}, collection={Lecture Notes of Computer Science} }","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>.","short":"T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.","apa":"Knollmann, T., &#38; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &#38; P. Kuznetsov (Eds.), <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201). Tokyo: Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>"},"intvolume":"     11201","date_updated":"2022-01-06T07:01:02Z","author":[{"full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"volume":11201,"conference":{"end_date":"2018-11-07","location":"Tokyo","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","start_date":"2018-11-04"},"doi":"10.1007/978-3-030-03232-6_1","type":"conference","editor":[{"last_name":"Izumi","full_name":"Izumi, Taisuke","first_name":"Taisuke"},{"last_name":"Kuznetsov","full_name":"Kuznetsov, Petr","first_name":"Petr"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"4411","user_id":"39241","series_title":"Lecture Notes of Computer Science","department":[{"_id":"63"},{"_id":"79"}],"file_date_updated":"2018-11-02T14:38:37Z"},{"language":[{"iso":"eng"}],"file_date_updated":"2018-11-12T10:36:41Z","ddc":["330"],"user_id":"477","department":[{"_id":"276"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"4520","file":[{"access_level":"closed","file_name":"WP_TRP.pdf","file_id":"5490","file_size":694342,"date_created":"2018-11-12T10:36:41Z","creator":"d0mi","date_updated":"2018-11-12T10:36:41Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"conference_abstract","publication":"Workshop on IS Design and Economic Behavior (ISDEB)","conference":{"name":"Workshop on IS Design and Economic Behavior (ISDEB)","location":"Lüneburg, Germany"},"title":"The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior","author":[{"first_name":"Jürgen","last_name":"Neumann","id":"32456","full_name":"Neumann, Jürgen"},{"last_name":"Gutt","full_name":"Gutt, Dominik","id":"14368","first_name":"Dominik"},{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"date_created":"2018-09-19T14:41:49Z","date_updated":"2022-01-06T07:01:08Z","citation":{"ieee":"J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior,” in <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>, Lüneburg, Germany, 2018.","chicago":"Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior.” In <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>, 2018.","ama":"Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior. In: <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>. ; 2018.","apa":"Neumann, J., Gutt, D., &#38; Kundisch, D. (2018). The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior. In <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>. Lüneburg, Germany.","mla":"Neumann, Jürgen, et al. “The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior.” <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>, 2018.","short":"J. Neumann, D. Gutt, D. Kundisch, in: Workshop on IS Design and Economic Behavior (ISDEB), 2018.","bibtex":"@inproceedings{Neumann_Gutt_Kundisch_2018, title={The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior}, booktitle={Workshop on IS Design and Economic Behavior (ISDEB)}, author={Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}, year={2018} }"},"year":"2018","has_accepted_license":"1"}]