[{"type":"journal_article","publication":"Information Systems Research","file":[{"file_id":"5473","file_name":"Crowd-Driven_Competitive_Intelligence_accept.pdf","access_level":"closed","file_size":640218,"date_created":"2018-11-12T09:55:20Z","creator":"d0mi","date_updated":"2018-11-12T09:55:20Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","user_id":"16205","department":[{"_id":"276"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"3936","language":[{"iso":"eng"}],"file_date_updated":"2018-11-12T09:55:20Z","ddc":["330"],"issue":"3","publication_status":"epub_ahead","has_accepted_license":"1","citation":{"short":"D. Gutt, P. Herrmann, M. Rahman, Information Systems Research 30 (2019) 980–994.","bibtex":"@article{Gutt_Herrmann_Rahman_2019, title={Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions}, volume={30}, number={3}, journal={Information Systems Research}, author={Gutt, Dominik and Herrmann, Philipp and Rahman, Mohammad}, year={2019}, pages={980–994} }","mla":"Gutt, Dominik, et al. “Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions.” <i>Information Systems Research</i>, vol. 30, no. 3, 2019, pp. 980–94.","apa":"Gutt, D., Herrmann, P., &#38; Rahman, M. (2019). Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions. <i>Information Systems Research</i>, <i>30</i>(3), 980–994.","ama":"Gutt D, Herrmann P, Rahman M. Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions. <i>Information Systems Research</i>. 2019;30(3):980-994.","chicago":"Gutt, Dominik, Philipp Herrmann, and Mohammad Rahman. “Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions.” <i>Information Systems Research</i> 30, no. 3 (2019): 980–94.","ieee":"D. Gutt, P. Herrmann, and M. Rahman, “Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions,” <i>Information Systems Research</i>, vol. 30, no. 3, pp. 980–994, 2019."},"page":"980-994","intvolume":"        30","year":"2019","date_created":"2018-08-20T09:45:31Z","author":[{"last_name":"Gutt","id":"14368","full_name":"Gutt, Dominik","first_name":"Dominik"},{"last_name":"Herrmann","full_name":"Herrmann, Philipp","first_name":"Philipp"},{"first_name":"Mohammad","full_name":"Rahman, Mohammad","last_name":"Rahman"}],"volume":30,"date_updated":"2022-01-06T06:59:57Z","title":"Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions"},{"year":"2019","date_created":"2018-11-12T09:38:16Z","title":" Multi-unit Bilateral Trade","publication":"Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)","file":[{"access_level":"closed","file_name":"1811.05130.pdf","file_id":"6018","file_size":315877,"creator":"feldi","date_created":"2018-12-06T13:57:51Z","date_updated":"2018-12-06T13:57:51Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"text":"We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single buyer and a single seller who holds a finite number k of identical items. The mechanism has to decide how many units of the item are transferred from the seller to the buyer and how much money is transferred from the buyer to the seller. We consider two classes of valuation functions for the buyer and seller: Valuations that are increasing in the number of units in possession, and the more specific class of valuations that are increasing and submodular. \r\nFurthermore, we present some approximation results about the performance of certain such mechanisms, in terms of social welfare: For increasing submodular valuation functions, we show the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e) approximation mechanism, matching the best known bounds for the single-item setting.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["000"],"publication_status":"published","has_accepted_license":"1","citation":{"ama":"Lazos P, Goldberg P, Skopalik A, Gerstgrasser M, de Keijzer B.  Multi-unit Bilateral Trade. In: <i>Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)</i>. ; 2019. doi:<a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">10.1609/aaai.v33i01.33011973</a>","chicago":"Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser, and Bart de Keijzer. “ Multi-Unit Bilateral Trade.” In <i>Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)</i>, 2019. <a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">https://doi.org/10.1609/aaai.v33i01.33011973</a>.","ieee":"P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, and B. de Keijzer, “ Multi-unit Bilateral Trade,” presented at the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA, 2019, doi: <a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">10.1609/aaai.v33i01.33011973</a>.","bibtex":"@inproceedings{Lazos_Goldberg_Skopalik_Gerstgrasser_de Keijzer_2019, title={ Multi-unit Bilateral Trade}, DOI={<a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">10.1609/aaai.v33i01.33011973</a>}, booktitle={Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)}, author={Lazos, Philip and Goldberg, Paul and Skopalik, Alexander and Gerstgrasser, Matthias and de Keijzer, Bart}, year={2019} }","mla":"Lazos, Philip, et al. “ Multi-Unit Bilateral Trade.” <i>Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)</i>, 2019, doi:<a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">10.1609/aaai.v33i01.33011973</a>.","short":"P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, B. de Keijzer, in: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019.","apa":"Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., &#38; de Keijzer, B. (2019).  Multi-unit Bilateral Trade. <i>Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)</i>. Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA. <a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">https://doi.org/10.1609/aaai.v33i01.33011973</a>"},"author":[{"last_name":"Lazos","full_name":"Lazos, Philip","first_name":"Philip"},{"last_name":"Goldberg","full_name":"Goldberg, Paul","first_name":"Paul"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"},{"last_name":"Gerstgrasser","full_name":"Gerstgrasser, Matthias","first_name":"Matthias"},{"last_name":"de Keijzer","full_name":"de Keijzer, Bart","first_name":"Bart"}],"date_updated":"2022-01-06T07:01:55Z","conference":{"name":"Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)","start_date":"2019-01-27","end_date":"2019-02-01","location":"Honolulu, Hawaii, USA"},"doi":"10.1609/aaai.v33i01.33011973","type":"conference","status":"public","user_id":"15415","department":[{"_id":"541"},{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5471","file_date_updated":"2018-12-06T13:57:51Z"},{"title":"Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung","author":[{"full_name":"Seutter, Janina","last_name":"Seutter","first_name":"Janina"}],"supervisor":[{"first_name":"Dennis","last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis"}],"date_created":"2019-01-11T13:10:16Z","date_updated":"2022-01-06T07:03:13Z","citation":{"chicago":"Seutter, Janina. <i>Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung</i>. Universität Paderborn, 2019.","ieee":"J. Seutter, <i>Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung</i>. Universität Paderborn, 2019.","ama":"Seutter J. <i>Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung</i>. Universität Paderborn; 2019.","bibtex":"@book{Seutter_2019, place={Universität Paderborn}, title={Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung}, author={Seutter, Janina}, year={2019} }","mla":"Seutter, Janina. <i>Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung</i>. 2019.","short":"J. Seutter, Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung, Universität Paderborn, 2019.","apa":"Seutter, J. (2019). <i>Bewertung von Maschinen-generierten Geschäftsmodell-Ideen: Eine experimentelle Untersuchung</i>. Universität Paderborn."},"place":"Universität Paderborn","year":"2019","language":[{"iso":"ger"}],"user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"6628","status":"public","type":"mastersthesis"},{"language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"6856","user_id":"16205","department":[{"_id":"276"}],"status":"public","type":"conference","publication":"Wirtschaftsinformatik Proceedings 2019","title":"Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods","conference":{"name":"Wirtschaftsinformatik","location":"Siegen, Germany"},"date_updated":"2022-01-06T07:03:22Z","date_created":"2019-01-17T14:39:49Z","author":[{"last_name":"Müller","full_name":"Müller, Michelle","first_name":"Michelle"},{"first_name":"Dominik","last_name":"Gutt","full_name":"Gutt, Dominik","id":"14368"}],"year":"2019","citation":{"short":"M. Müller, D. Gutt, in: Wirtschaftsinformatik Proceedings 2019, 2019.","bibtex":"@inproceedings{Müller_Gutt_2019, title={Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods}, booktitle={Wirtschaftsinformatik Proceedings 2019}, author={Müller, Michelle and Gutt, Dominik}, year={2019} }","mla":"Müller, Michelle, and Dominik Gutt. “Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods.” <i>Wirtschaftsinformatik Proceedings 2019</i>, 2019.","apa":"Müller, M., &#38; Gutt, D. (2019). Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods. In <i>Wirtschaftsinformatik Proceedings 2019</i>. Siegen, Germany.","ama":"Müller M, Gutt D. Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods. In: <i>Wirtschaftsinformatik Proceedings 2019</i>. ; 2019.","chicago":"Müller, Michelle, and Dominik Gutt. “Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods.” In <i>Wirtschaftsinformatik Proceedings 2019</i>, 2019.","ieee":"M. Müller and D. Gutt, “Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods,” in <i>Wirtschaftsinformatik Proceedings 2019</i>, Siegen, Germany, 2019."}},{"conference":{"location":"Siegen, Germany","name":"Wirtschaftsinformatik"},"title":"A Semi-Automated Approach for Generating Online Review Templates, ","author":[{"first_name":"Martin","full_name":"Poniatowski, Martin","id":"32441","last_name":"Poniatowski"},{"full_name":"Neumann, Jürgen","id":"32456","last_name":"Neumann","first_name":"Jürgen"},{"last_name":"Görzen","id":"47700","full_name":"Görzen, Thomas","first_name":"Thomas"},{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"}],"date_created":"2019-01-17T14:46:50Z","date_updated":"2022-01-06T07:03:22Z","citation":{"ieee":"M. Poniatowski, J. Neumann, T. Görzen, and D. Kundisch, “A Semi-Automated Approach for Generating Online Review Templates, ,” in <i>Wirtschaftsinformatik Proceedings 2019</i>, Siegen, Germany, 2019.","chicago":"Poniatowski, Martin, Jürgen Neumann, Thomas Görzen, and Dennis Kundisch. “A Semi-Automated Approach for Generating Online Review Templates, .” In <i>Wirtschaftsinformatik Proceedings 2019</i>, 2019.","ama":"Poniatowski M, Neumann J, Görzen T, Kundisch D. A Semi-Automated Approach for Generating Online Review Templates, . In: <i>Wirtschaftsinformatik Proceedings 2019</i>. ; 2019.","apa":"Poniatowski, M., Neumann, J., Görzen, T., &#38; Kundisch, D. (2019). A Semi-Automated Approach for Generating Online Review Templates, . In <i>Wirtschaftsinformatik Proceedings 2019</i>. Siegen, Germany.","bibtex":"@inproceedings{Poniatowski_Neumann_Görzen_Kundisch_2019, title={A Semi-Automated Approach for Generating Online Review Templates, }, booktitle={Wirtschaftsinformatik Proceedings 2019}, author={Poniatowski, Martin and Neumann, Jürgen and Görzen, Thomas and Kundisch, Dennis}, year={2019} }","short":"M. Poniatowski, J. Neumann, T. Görzen, D. Kundisch, in: Wirtschaftsinformatik Proceedings 2019, 2019.","mla":"Poniatowski, Martin, et al. “A Semi-Automated Approach for Generating Online Review Templates, .” <i>Wirtschaftsinformatik Proceedings 2019</i>, 2019."},"year":"2019","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"276"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"6857","status":"public","type":"conference","publication":"Wirtschaftsinformatik Proceedings 2019"},{"language":[{"iso":"eng"}],"ddc":["000"],"file":[{"date_updated":"2019-01-26T16:09:08Z","date_created":"2019-01-26T16:09:08Z","creator":"thgoette","file_size":638020,"access_level":"closed","file_id":"7007","file_name":"Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes joining and leaving the network. We assume an adversary that may churn a\r\nconstant fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds. In particular, the adversary has an almost up-to-date information of\r\nthe network topology as it can observe an only slightly outdated topology that\r\nis at least $2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction that new nodes can only join the network via nodes that have taken\r\npart in the network for at least one round.\r\n  Our contributions are as follows: First, we show that it is impossible to\r\nmaintain a connected topology if adversary has up-to-date information about the\r\nnodes' connections. Further, we show that our restriction concerning the join\r\nis also necessary. As our main result present an algorithm that constructs a\r\nnew overlay- completely independent of all previous overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only $\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which will be maintained by the\r\nalgorithm. However, our approaches can be transferred to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval."}],"publication":"Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS '19)","title":"Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary","date_created":"2019-01-24T18:53:11Z","publisher":"IEEE","year":"2019","file_date_updated":"2019-01-26T16:09:08Z","user_id":"34727","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"6976","status":"public","type":"conference","conference":{"end_date":"24.05.19","location":"Rio de Janeiro, Brazil","name":"2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS '19)","start_date":"20.05.19"},"author":[{"last_name":"Götte","id":"34727","full_name":"Götte, Thorsten","first_name":"Thorsten"},{"first_name":"Vipin Ravindran","full_name":"Vijayalakshmi, Vipin Ravindran","last_name":"Vijayalakshmi"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_updated":"2022-01-06T07:03:25Z","citation":{"ieee":"T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary,” in <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>, Rio de Janeiro, Brazil.","chicago":"Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” In <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>. IEEE, n.d.","ama":"Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In: <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>. IEEE.","apa":"Götte, T., Vijayalakshmi, V. R., &#38; Scheideler, C. (n.d.). Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>. Rio de Janeiro, Brazil: IEEE.","bibtex":"@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE}, author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian} }","mla":"Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” <i>Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>, IEEE.","short":"T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE, n.d."},"publication_status":"accepted","has_accepted_license":"1"},{"publication":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2019-08-26T09:21:27Z","date_updated":"2019-08-26T09:21:27Z","access_level":"closed","file_name":"LIPIcs-ICALP-2019-150.pdf","file_id":"12955","file_size":537649}],"abstract":[{"lang":"eng","text":"We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio."}],"language":[{"iso":"eng"}],"ddc":["004"],"keyword":["Graphs transformations","NP-hardness","approximation algorithms"],"year":"2019","date_created":"2019-07-08T17:19:01Z","publisher":"Dagstuhl Publishing","title":"On the Complexity of Local Graph Transformations","type":"conference","status":"public","user_id":"477","series_title":"LIPIcs","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"10586","file_date_updated":"2019-08-26T09:21:27Z","publication_status":"published","has_accepted_license":"1","citation":{"apa":"Scheideler, C., &#38; Setzer, A. (2019). On the Complexity of Local Graph Transformations. In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i> (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>","bibtex":"@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>}, booktitle={Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs} }","short":"C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.","mla":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>.","chicago":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>.","ieee":"C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.","ama":"Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>"},"intvolume":"       132","page":"150:1--150:14","author":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Alexander","full_name":"Setzer, Alexander","id":"11108","last_name":"Setzer"}],"volume":132,"date_updated":"2022-01-06T06:50:45Z","doi":"10.4230/LIPICS.ICALP.2019.150","conference":{"location":"Patras, Greece","end_date":"2019-07-12","start_date":"2019-07-09","name":"ICALP 2019"}},{"status":"public","publication":"Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)","type":"conference","language":[{"iso":"eng"}],"_id":"12870","external_id":{"arxiv":["1907.09834"]},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"}],"user_id":"22704","year":"2019","page":"120 - 137","citation":{"mla":"Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, Springer, 2019, pp. 120–37, doi:<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>.","bibtex":"@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing Multiple Mobile Resources}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>}, booktitle={Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2019}, pages={120–137} }","short":"B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–137.","apa":"Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i> (pp. 120–137). Springer. <a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">https://doi.org/10.1007/978-3-030-39479-0_9</a>","ieee":"B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” in <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2019, pp. 120–137.","chicago":"Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” In <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, 120–37. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">https://doi.org/10.1007/978-3-030-39479-0_9</a>.","ama":"Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. In: <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>. Springer; 2019:120-137. doi:<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>"},"publication_status":"published","title":"Managing Multiple Mobile Resources","doi":"10.1007/978-3-030-39479-0_9","publisher":"Springer","date_updated":"2022-01-06T06:51:20Z","date_created":"2019-07-22T09:00:05Z","author":[{"first_name":"Björn","full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord"},{"first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241"},{"first_name":"Manuel","full_name":"Malatyali, Manuel","last_name":"Malatyali"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}]},{"publication_status":"published","place":"Halifax, Canada","year":"2019","citation":{"chicago":"Razzaghi Kouchaksaraei, Hadi, and Holger Karl. “Quantitative Analysis of Dynamically Provisioned Heterogeneous Network Services.” In <i>15th International Conference on Network and Service Management (CNSM)</i>. Halifax, Canada, 2019.","ieee":"H. Razzaghi Kouchaksaraei and H. Karl, “Quantitative Analysis of Dynamically Provisioned Heterogeneous Network Services,” in <i>15th International Conference on Network and Service Management (CNSM)</i>, Halifax, Canada, 2019.","ama":"Razzaghi Kouchaksaraei H, Karl H. Quantitative Analysis of Dynamically Provisioned Heterogeneous Network Services. In: <i>15th International Conference on Network and Service Management (CNSM)</i>. Halifax, Canada; 2019.","mla":"Razzaghi Kouchaksaraei, Hadi, and Holger Karl. “Quantitative Analysis of Dynamically Provisioned Heterogeneous Network Services.” <i>15th International Conference on Network and Service Management (CNSM)</i>, 2019.","bibtex":"@inproceedings{Razzaghi Kouchaksaraei_Karl_2019, place={Halifax, Canada}, title={Quantitative Analysis of Dynamically Provisioned Heterogeneous Network Services}, booktitle={15th International Conference on Network and Service Management (CNSM)}, author={Razzaghi Kouchaksaraei, Hadi and Karl, Holger}, year={2019} }","short":"H. Razzaghi Kouchaksaraei, H. Karl, in: 15th International Conference on Network and Service Management (CNSM), Halifax, Canada, 2019.","apa":"Razzaghi Kouchaksaraei, H., &#38; Karl, H. (2019). Quantitative Analysis of Dynamically Provisioned Heterogeneous Network Services. In <i>15th International Conference on Network and Service Management (CNSM)</i>. Halifax, Canada."},"date_updated":"2022-01-06T06:51:24Z","date_created":"2019-08-12T08:12:30Z","author":[{"first_name":"Hadi","last_name":"Razzaghi Kouchaksaraei","full_name":"Razzaghi Kouchaksaraei, Hadi","id":"60845"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"title":"Quantitative Analysis of Dynamically Provisioned Heterogeneous Network Services","conference":{"start_date":"2019-10-21","name":"15th International Conference on Network and Service Management","location":"Halifax, Canada","end_date":"2019-10-25"},"type":"conference","publication":"15th International Conference on Network and Service Management (CNSM)","status":"public","project":[{"_id":"23","name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources","grant_number":"762057"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"12912","user_id":"60845","department":[{"_id":"34"}],"language":[{"iso":"eng"}]},{"has_accepted_license":"1","citation":{"ama":"Heindorf S. <i>Vandalism Detection in Crowdsourced Knowledge Bases</i>. Universität Paderborn; 2019.","chicago":"Heindorf, Stefan. <i>Vandalism Detection in Crowdsourced Knowledge Bases</i>. Universität Paderborn, 2019.","ieee":"S. Heindorf, <i>Vandalism Detection in Crowdsourced Knowledge Bases</i>. Universität Paderborn, 2019.","apa":"Heindorf, S. (2019). <i>Vandalism Detection in Crowdsourced Knowledge Bases</i>. Universität Paderborn.","bibtex":"@book{Heindorf_2019, title={Vandalism Detection in Crowdsourced Knowledge Bases}, publisher={Universität Paderborn}, author={Heindorf, Stefan}, year={2019} }","mla":"Heindorf, Stefan. <i>Vandalism Detection in Crowdsourced Knowledge Bases</i>. Universität Paderborn, 2019.","short":"S. Heindorf, Vandalism Detection in Crowdsourced Knowledge Bases, Universität Paderborn, 2019."},"year":"2019","date_created":"2019-12-17T06:15:38Z","supervisor":[{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"author":[{"full_name":"Heindorf, Stefan","id":"11871","orcid":"0000-0002-4525-6865","last_name":"Heindorf","first_name":"Stefan"}],"date_updated":"2022-01-06T06:52:20Z","publisher":"Universität Paderborn","title":"Vandalism Detection in Crowdsourced Knowledge Bases","type":"dissertation","status":"public","file":[{"file_size":1740910,"file_id":"15603","access_level":"closed","file_name":"Dissertation_Stefan_Heindorf.pdf","date_updated":"2020-01-16T12:09:52Z","date_created":"2020-01-16T12:09:52Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"department":[{"_id":"66"}],"user_id":"477","_id":"15333","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"language":[{"iso":"eng"}],"file_date_updated":"2020-01-16T12:09:52Z","ddc":["040"]},{"status":"public","publication":"IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN)","type":"conference","language":[{"iso":"eng"}],"_id":"15369","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28"}],"department":[{"_id":"75"}],"user_id":"13271","year":"2019","place":"Helsinki","citation":{"apa":"Müller, M., Behnke, D., Bök, P.-B., Peuster, M., Schneider, S. B., &#38; Karl, H. (2019). 5G as Key Technology for Networked Factories: Application of Vertical-specific Network Services for Enabling Flexible Smart Manufacturing. In <i>IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN)</i>. Helsinki: IEEE.","mla":"Müller, Marcel, et al. “5G as Key Technology for Networked Factories: Application of Vertical-Specific Network Services for Enabling Flexible Smart Manufacturing.” <i>IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN)</i>, IEEE, 2019.","short":"M. Müller, D. Behnke, P.-B. Bök, M. Peuster, S.B. Schneider, H. Karl, in: IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN), IEEE, Helsinki, 2019.","bibtex":"@inproceedings{Müller_Behnke_Bök_Peuster_Schneider_Karl_2019, place={Helsinki}, title={5G as Key Technology for Networked Factories: Application of Vertical-specific Network Services for Enabling Flexible Smart Manufacturing}, booktitle={IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN)}, publisher={IEEE}, author={Müller, Marcel and Behnke, Daniel and Bök, Patrick-Benjamin and Peuster, Manuel and Schneider, Stefan Balthasar and Karl, Holger}, year={2019} }","ama":"Müller M, Behnke D, Bök P-B, Peuster M, Schneider SB, Karl H. 5G as Key Technology for Networked Factories: Application of Vertical-specific Network Services for Enabling Flexible Smart Manufacturing. In: <i>IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN)</i>. Helsinki: IEEE; 2019.","chicago":"Müller, Marcel, Daniel Behnke, Patrick-Benjamin Bök, Manuel Peuster, Stefan Balthasar Schneider, and Holger Karl. “5G as Key Technology for Networked Factories: Application of Vertical-Specific Network Services for Enabling Flexible Smart Manufacturing.” In <i>IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN)</i>. Helsinki: IEEE, 2019.","ieee":"M. Müller, D. Behnke, P.-B. Bök, M. Peuster, S. B. Schneider, and H. Karl, “5G as Key Technology for Networked Factories: Application of Vertical-specific Network Services for Enabling Flexible Smart Manufacturing,” in <i>IEEE 17th International Conference on Industrial Informatics (IEEE-INDIN)</i>, 2019."},"title":"5G as Key Technology for Networked Factories: Application of Vertical-specific Network Services for Enabling Flexible Smart Manufacturing","publisher":"IEEE","date_updated":"2022-01-06T06:52:21Z","author":[{"first_name":"Marcel","full_name":"Müller, Marcel","last_name":"Müller"},{"first_name":"Daniel","last_name":"Behnke","full_name":"Behnke, Daniel"},{"last_name":"Bök","full_name":"Bök, Patrick-Benjamin","first_name":"Patrick-Benjamin"},{"last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271","first_name":"Manuel"},{"first_name":"Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2019-12-18T07:27:24Z"},{"type":"conference","status":"public","_id":"15371","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"}],"department":[{"_id":"75"}],"user_id":"13271","file_date_updated":"2019-12-18T08:10:23Z","has_accepted_license":"1","place":"Halifax","citation":{"ama":"Peuster M, Schneider SB, Karl H. The Softwarised Network Data Zoo. In: <i>IEEE/IFIP 15th International Conference on Network and Service Management (CNSM)</i>. Halifax: IEEE/IFIP; 2019.","chicago":"Peuster, Manuel, Stefan Balthasar Schneider, and Holger Karl. “The Softwarised Network Data Zoo.” In <i>IEEE/IFIP 15th International Conference on Network and Service Management (CNSM)</i>. Halifax: IEEE/IFIP, 2019.","ieee":"M. Peuster, S. B. Schneider, and H. Karl, “The Softwarised Network Data Zoo,” in <i>IEEE/IFIP 15th International Conference on Network and Service Management (CNSM)</i>, 2019.","short":"M. Peuster, S.B. Schneider, H. Karl, in: IEEE/IFIP 15th International Conference on Network and Service Management (CNSM), IEEE/IFIP, Halifax, 2019.","mla":"Peuster, Manuel, et al. “The Softwarised Network Data Zoo.” <i>IEEE/IFIP 15th International Conference on Network and Service Management (CNSM)</i>, IEEE/IFIP, 2019.","bibtex":"@inproceedings{Peuster_Schneider_Karl_2019, place={Halifax}, title={The Softwarised Network Data Zoo}, booktitle={IEEE/IFIP 15th International Conference on Network and Service Management (CNSM)}, publisher={IEEE/IFIP}, author={Peuster, Manuel and Schneider, Stefan Balthasar and Karl, Holger}, year={2019} }","apa":"Peuster, M., Schneider, S. B., &#38; Karl, H. (2019). The Softwarised Network Data Zoo. In <i>IEEE/IFIP 15th International Conference on Network and Service Management (CNSM)</i>. Halifax: IEEE/IFIP."},"oa":"1","date_updated":"2022-01-06T06:52:21Z","author":[{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"last_name":"Schneider","orcid":"0000-0001-8210-4011","id":"35343","full_name":"Schneider, Stefan Balthasar","first_name":"Stefan Balthasar"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"main_file_link":[{"url":"http://dl.ifip.org/db/conf/cnsm/cnsm2019/1570555677.pdf","open_access":"1"}],"publication":"IEEE/IFIP 15th International Conference on Network and Service Management (CNSM)","abstract":[{"lang":"eng","text":"More and more management and orchestration approaches for (software) networks are based on machine learning paradigms and solutions. These approaches depend not only on their program code to operate properly, but also require enough input data to train their internal models. However, such training data is barely available for the software networking domain and most presented solutions rely on their own, sometimes not even published, data sets. This makes it hard, or even infeasible, to reproduce and compare many of the existing solutions. As a result, it ultimately slows down the adoption of machine learning approaches in softwarised networks. To this end, we introduce the \"softwarised network data zoo\" (SNDZoo), an open collection of software networking data sets aiming to streamline and ease machine learning research in the software networking domain. We present a general methodology to collect, archive, and publish those data sets for use by other researches and, as an example, eight initial data sets, focusing on the performance of virtualised network functions.\r\n"}],"file":[{"date_updated":"2019-12-18T08:10:23Z","creator":"peuster","date_created":"2019-12-18T08:10:23Z","file_size":515208,"file_id":"15377","access_level":"open_access","file_name":"main_for_ris.pdf","content_type":"application/pdf","relation":"main_file"}],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2019","publisher":"IEEE/IFIP","date_created":"2019-12-18T07:30:45Z","title":"The Softwarised Network Data Zoo"},{"author":[{"last_name":"Moro","full_name":"Moro, Daniele","first_name":"Daniele"},{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"},{"last_name":"Capone","full_name":"Capone, Antonio","first_name":"Antonio"}],"date_updated":"2022-01-06T06:52:22Z","oa":"1","has_accepted_license":"1","citation":{"apa":"Moro, D., Peuster, M., Karl, H., &#38; Capone, A. (2019). FOP4: Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios. In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>. Dallas: IEEE.","bibtex":"@inproceedings{Moro_Peuster_Karl_Capone_2019, place={Dallas}, title={FOP4: Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios}, booktitle={IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)}, publisher={IEEE}, author={Moro, Daniele and Peuster, Manuel and Karl, Holger and Capone, Antonio}, year={2019} }","short":"D. Moro, M. Peuster, H. Karl, A. Capone, in: IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), IEEE, Dallas, 2019.","mla":"Moro, Daniele, et al. “FOP4: Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios.” <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>, IEEE, 2019.","ama":"Moro D, Peuster M, Karl H, Capone A. FOP4: Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios. In: <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>. Dallas: IEEE; 2019.","chicago":"Moro, Daniele, Manuel Peuster, Holger Karl, and Antonio Capone. “FOP4: Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios.” In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>. Dallas: IEEE, 2019.","ieee":"D. Moro, M. Peuster, H. Karl, and A. Capone, “FOP4: Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios,” in <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>, 2019."},"place":"Dallas","department":[{"_id":"75"}],"user_id":"13271","_id":"15373","project":[{"grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"file_date_updated":"2019-12-18T08:11:37Z","type":"conference","status":"public","date_created":"2019-12-18T07:39:28Z","publisher":"IEEE","title":"FOP4: Function Offloading Prototyping in Heterogeneous and Programmable Network Scenarios","year":"2019","language":[{"iso":"eng"}],"ddc":["000"],"publication":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2019-12-18T08:11:37Z","date_created":"2019-12-18T08:11:37Z","creator":"peuster","file_size":657216,"file_name":"main_for_ris.pdf","file_id":"15378","access_level":"open_access"}],"abstract":[{"lang":"eng","text":"Offloading packet processing tasks to programmable switches and/or to programmable network interfaces, so called “SmartNICs”, is one of the key concepts to prepare softwarized networks for the high traffic demands of the future. However, implementing network functions that make use of those offload- ing technologies is still challenging and usually requires the availability of specialized hardware. It becomes even harder if heterogeneous services, making use of different offloading and network virtualization technologies, should be developed.\r\nIn this paper, we introduce FOP4 (Function Offloading Pro- totyping with P4), a novel prototyping platform that allows to prototype heterogeneous software network scenarios, including container-based, P4-switch-based, and SmartNIC-based network functions. The presented work substantially extends our existing Containernet platform with the means to prototype offloading scenarios. Besides presenting the platform’s system design, we evaluate its scalability and show that it can run scenarios with more than 64 P4 switch or SmartNIC nodes on a single laptop. Finally, we presented a case study in which we use the presented platform to prototype an extended in-band network telemetry use case."}]},{"title":"Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios","author":[{"full_name":"Moro, Daniele","last_name":"Moro","first_name":"Daniele"},{"full_name":"Peuster, Manuel","id":"13271","last_name":"Peuster","first_name":"Manuel"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"},{"last_name":"Capone","full_name":"Capone, Antonio","first_name":"Antonio"}],"date_created":"2019-12-18T07:41:21Z","oa":"1","publisher":"IEEE","date_updated":"2022-01-06T06:52:22Z","citation":{"ama":"Moro D, Peuster M, Karl H, Capone A. Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios. In: <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>. Dallas: IEEE; 2019.","chicago":"Moro, Daniele, Manuel Peuster, Holger Karl, and Antonio Capone. “Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios.” In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>. Dallas: IEEE, 2019.","ieee":"D. Moro, M. Peuster, H. Karl, and A. Capone, “Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios,” in <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>, 2019.","apa":"Moro, D., Peuster, M., Karl, H., &#38; Capone, A. (2019). Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios. In <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>. Dallas: IEEE.","bibtex":"@inproceedings{Moro_Peuster_Karl_Capone_2019, place={Dallas}, title={Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios}, booktitle={IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)}, publisher={IEEE}, author={Moro, Daniele and Peuster, Manuel and Karl, Holger and Capone, Antonio}, year={2019} }","mla":"Moro, Daniele, et al. “Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios.” <i>IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)</i>, IEEE, 2019.","short":"D. Moro, M. Peuster, H. Karl, A. Capone, in: IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN), IEEE, Dallas, 2019."},"place":"Dallas","year":"2019","has_accepted_license":"1","file_date_updated":"2019-12-18T08:12:28Z","language":[{"iso":"eng"}],"ddc":["000"],"department":[{"_id":"75"}],"user_id":"13271","_id":"15374","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"status":"public","file":[{"relation":"main_file","content_type":"application/pdf","file_size":370456,"file_name":"main_for_ris.pdf","file_id":"15379","access_level":"open_access","date_updated":"2019-12-18T08:12:28Z","creator":"peuster","date_created":"2019-12-18T08:12:28Z"}],"abstract":[{"text":"Emulation platforms supporting Virtual Network Functions (VNFs) allow developers to rapidly prototype network services. None of the available platforms, however, supports experimenting with programmable data planes to enable VNF offloading. In this demonstration, we show FOP4, a flexible platform that provides support for Docker-based VNFs, and VNF offloading, by means of P4-enabled switches. The platform provides interfaces to program the P4 devices and to deploy network functions. We demonstrate FOP4 with two complex example scenarios, demonstrating how developers can exploit data plane programmability to implement network functions.","lang":"eng"}],"publication":"IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","type":"conference"},{"date_created":"2020-01-22T09:07:36Z","author":[{"first_name":"John","full_name":"Augustine, John","last_name":"Augustine"},{"full_name":"Hinnenthal, Kristian","id":"32229","last_name":"Hinnenthal","first_name":"Kristian"},{"first_name":"Fabian","full_name":"Kuhn, Fabian","last_name":"Kuhn"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Philipp","full_name":"Schneider, Philipp","last_name":"Schneider"}],"date_updated":"2022-01-06T06:52:30Z","doi":"10.1137/1.9781611975994.78","title":"Shortest Paths in a Hybrid Network Model","publication_identifier":{"isbn":["9781611975994"]},"publication_status":"published","page":"1280-1299","citation":{"ama":"Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths in a Hybrid Network Model. In: <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Philadelphia, PA; 2019:1280-1299. doi:<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>","chicago":"Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1280–99. Philadelphia, PA, 2019. <a href=\"https://doi.org/10.1137/1.9781611975994.78\">https://doi.org/10.1137/1.9781611975994.78</a>.","ieee":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2019, pp. 1280–1299.","apa":"Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., &#38; Schneider, P. (2019). Shortest Paths in a Hybrid Network Model. In <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1280–1299). Philadelphia, PA. <a href=\"https://doi.org/10.1137/1.9781611975994.78\">https://doi.org/10.1137/1.9781611975994.78</a>","bibtex":"@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2019, place={Philadelphia, PA}, title={Shortest Paths in a Hybrid Network Model}, DOI={<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>}, booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp}, year={2019}, pages={1280–1299} }","short":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, 2019, pp. 1280–1299.","mla":"Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2019, pp. 1280–99, doi:<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>."},"year":"2019","place":"Philadelphia, PA","user_id":"32229","_id":"15627","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms","type":"conference","status":"public"},{"keyword":["Program Analysis","Android App Analysis","Taint Analysis","App Merging","Benchmark"],"ddc":["004"],"language":[{"iso":"eng"}],"publication":"2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)","abstract":[{"text":"In the field of software analysis a trade-off between scalability and accuracy always exists. In this respect, Android app analysis is no exception, in particular, analyzing large or many apps can be challenging. Dealing with many small apps is a typical challenge when facing micro-benchmarks such as DROIDBENCH or ICC-BENCH. These particular benchmarks are not only used for the evaluation of novel tools but also in continuous integration pipelines of existing mature tools to maintain and guarantee a certain quality-level. Considering this latter usage it becomes very important to be able to achieve benchmark results as fast as possible. Hence, benchmarks have to be optimized for this purpose. One approach to do so is app merging. We implemented the Android Merge Tool (AMT) following this approach and show that its novel aspects can be used to produce scaled up and accurate benchmarks. For such benchmarks Android app analysis tools do not suffer from the scalability-accuracy trade-off anymore. We show this throughout detailed experiments on DROIDBENCH employing three different analysis tools (AMANDROID, ICCTA, FLOWDROID). Benchmark execution times are largely reduced without losing benchmark accuracy. Moreover, we argue why AMT is an advantageous successor of the state-of-the-art app merging tool (APKCOMBINER) in analysis lift-up scenarios.","lang":"eng"}],"file":[{"date_created":"2020-02-06T17:09:45Z","creator":"fpauck","date_updated":"2020-02-06T17:09:45Z","access_level":"closed","file_name":"AMT_final.pdf","file_id":"15839","file_size":644517,"content_type":"application/pdf","relation":"main_file"}],"date_created":"2020-02-06T17:06:51Z","title":"Android App Merging for Benchmark Speed-Up and Analysis Lift-Up","year":"2019","_id":"15838","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"department":[{"_id":"77"}],"user_id":"477","file_date_updated":"2020-02-06T17:09:45Z","type":"conference","status":"public","date_updated":"2022-01-06T06:52:38Z","author":[{"first_name":"Felix","full_name":"Pauck, Felix","id":"22398","last_name":"Pauck"},{"last_name":"Zhang","full_name":"Zhang, Shikun","first_name":"Shikun"}],"doi":"10.1109/asew.2019.00019","has_accepted_license":"1","publication_identifier":{"isbn":["9781728141367"]},"publication_status":"published","citation":{"apa":"Pauck, F., &#38; Zhang, S. (2019). Android App Merging for Benchmark Speed-Up and Analysis Lift-Up. In <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>. <a href=\"https://doi.org/10.1109/asew.2019.00019\">https://doi.org/10.1109/asew.2019.00019</a>","bibtex":"@inproceedings{Pauck_Zhang_2019, title={Android App Merging for Benchmark Speed-Up and Analysis Lift-Up}, DOI={<a href=\"https://doi.org/10.1109/asew.2019.00019\">10.1109/asew.2019.00019</a>}, booktitle={2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)}, author={Pauck, Felix and Zhang, Shikun}, year={2019} }","mla":"Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up.” <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>, 2019, doi:<a href=\"https://doi.org/10.1109/asew.2019.00019\">10.1109/asew.2019.00019</a>.","short":"F. Pauck, S. Zhang, in: 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019.","chicago":"Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up.” In <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>, 2019. <a href=\"https://doi.org/10.1109/asew.2019.00019\">https://doi.org/10.1109/asew.2019.00019</a>.","ieee":"F. Pauck and S. Zhang, “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up,” in <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>, 2019.","ama":"Pauck F, Zhang S. Android App Merging for Benchmark Speed-Up and Analysis Lift-Up. In: <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>. ; 2019. doi:<a href=\"https://doi.org/10.1109/asew.2019.00019\">10.1109/asew.2019.00019</a>"}},{"language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"477","_id":"15920","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901","_id":"1"}],"status":"public","abstract":[{"lang":"eng","text":"Secure hardware design is the most important aspect to be considered in addition to functional correctness. Achieving hardware security in today’s globalized Integrated Cir- cuit(IC) supply chain is a challenging task. One solution that is widely considered to help achieve secure hardware designs is Information Flow Tracking(IFT). It provides an ap- proach to verify that the systems adhere to security properties either by static verification during design phase or dynamic checking during runtime.\r\nProof-Carrying Hardware(PCH) is an approach to verify a functional design prior to using it in hardware. It is a two-party verification approach, where the target party, the consumer requests new functionalities with pre-defined properties to the producer. In response, the producer designs the IP (Intellectual Property) cores with the requested functionalities that adhere to the consumer-defined properties. The producer provides the IP cores and a proof certificate combined into a proof-carrying bitstream to the consumer to verify it. If the verification is successful, the consumer can use the IP cores in his hardware. In essence, the consumer can only run verified IP cores. Correctly applied, PCH techniques can help consumers to defend against many unintentional modifications and malicious alterations of the modules they receive. There are numerous published examples of how to use PCH to detect any change in the functionality of a circuit, i.e., pairing a PCH approach with functional equivalence checking for combinational or sequential circuits. For non-functional properties, since opening new covert channels to leak secret information from secure circuits is a viable attack vector for hardware trojans, i.e., intentionally added malicious circuitry, IFT technique is employed to make sure that secret/untrusted information never reaches any unclassified/trusted outputs.\r\nThis master thesis aims to explore the possibility of adapting Information Flow Tracking into a Proof-Carrying Hardware scenario. It aims to create a method that combines Infor- mation Flow Tracking(IFT) with a PCH approach at bitstream level enabling consumers to validate the trustworthiness of a module’s information flow without the computational costs of a complete flow analysis."}],"type":"mastersthesis","title":"A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking","supervisor":[{"first_name":"Tobias","last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"},{"last_name":"Hellebrand","orcid":"0000-0002-3717-3939","full_name":"Hellebrand, Sybille","id":"209","first_name":"Sybille"}],"author":[{"first_name":"Monica","last_name":"Keerthipati","full_name":"Keerthipati, Monica"}],"date_created":"2020-02-17T12:03:40Z","date_updated":"2022-01-06T06:52:41Z","publisher":"Universität Paderborn","citation":{"apa":"Keerthipati, M. (2019). <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn.","short":"M. Keerthipati, A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking, Universität Paderborn, 2019.","bibtex":"@book{Keerthipati_2019, title={A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking}, publisher={Universität Paderborn}, author={Keerthipati, Monica}, year={2019} }","mla":"Keerthipati, Monica. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019.","ama":"Keerthipati M. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn; 2019.","ieee":"M. Keerthipati, <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019.","chicago":"Keerthipati, Monica. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019."},"year":"2019"},{"doi":"10.1145/3323165","title":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019","date_created":"2019-11-06T10:43:41Z","date_updated":"2022-01-06T06:52:07Z","publisher":"ACM","citation":{"ama":"Scheideler C, Berenbrink P, eds. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>","chicago":"Scheideler, Christian, and Petra Berenbrink, eds. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3323165\">https://doi.org/10.1145/3323165</a>.","ieee":"C. Scheideler and P. Berenbrink, Eds., <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019.","apa":"Scheideler, C., &#38; Berenbrink, P. (Eds.). (2019). <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM. <a href=\"https://doi.org/10.1145/3323165\">https://doi.org/10.1145/3323165</a>","mla":"Scheideler, Christian, and Petra Berenbrink, editors. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>.","bibtex":"@book{Scheideler_Berenbrink_2019, title={The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019}, DOI={<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>}, publisher={ACM}, year={2019} }","short":"C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019, ACM, 2019."},"year":"2019","publication_identifier":{"isbn":["978-1-4503-6184-2"]},"language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"14829","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","editor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"}],"type":"conference_editor"},{"date_created":"2019-11-06T10:54:58Z","author":[{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"first_name":"Jonas","last_name":"Lefevre","full_name":"Lefevre, Jonas"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"volume":63,"date_updated":"2022-01-06T06:52:07Z","doi":"10.1007/s00224-017-9823-4","title":"Self-Stabilizing Metric Graphs","issue":"2","citation":{"chicago":"Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” <i>Theory Comput. Syst.</i> 63, no. 2 (2019): 177–99. <a href=\"https://doi.org/10.1007/s00224-017-9823-4\">https://doi.org/10.1007/s00224-017-9823-4</a>.","ieee":"R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,” <i>Theory Comput. Syst.</i>, vol. 63, no. 2, pp. 177–199, 2019.","ama":"Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. <i>Theory Comput Syst</i>. 2019;63(2):177-199. doi:<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>","apa":"Gmyr, R., Lefevre, J., &#38; Scheideler, C. (2019). Self-Stabilizing Metric Graphs. <i>Theory Comput. Syst.</i>, <i>63</i>(2), 177–199. <a href=\"https://doi.org/10.1007/s00224-017-9823-4\">https://doi.org/10.1007/s00224-017-9823-4</a>","bibtex":"@article{Gmyr_Lefevre_Scheideler_2019, title={Self-Stabilizing Metric Graphs}, volume={63}, DOI={<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>}, number={2}, journal={Theory Comput. Syst.}, author={Gmyr, Robert and Lefevre, Jonas and Scheideler, Christian}, year={2019}, pages={177–199} }","mla":"Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” <i>Theory Comput. Syst.</i>, vol. 63, no. 2, 2019, pp. 177–99, doi:<a href=\"https://doi.org/10.1007/s00224-017-9823-4\">10.1007/s00224-017-9823-4</a>.","short":"R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199."},"intvolume":"        63","page":"177-199","year":"2019","user_id":"15504","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"14830","language":[{"iso":"eng"}],"type":"journal_article","publication":"Theory Comput. Syst.","status":"public"},{"title":"Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:08Z","author":[{"id":"30332","full_name":"Vaz, Gavin Francis","last_name":"Vaz","first_name":"Gavin Francis"}],"date_created":"2019-11-07T14:13:54Z","supervisor":[{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"}],"year":"2019","citation":{"ama":"Vaz GF. <i>Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems</i>. Universität Paderborn; 2019.","ieee":"G. F. Vaz, <i>Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems</i>. Universität Paderborn, 2019.","chicago":"Vaz, Gavin Francis. <i>Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems</i>. Universität Paderborn, 2019.","short":"G.F. Vaz, Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems, Universität Paderborn, 2019.","bibtex":"@book{Vaz_2019, title={Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems}, publisher={Universität Paderborn}, author={Vaz, Gavin Francis}, year={2019} }","mla":"Vaz, Gavin Francis. <i>Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems</i>. Universität Paderborn, 2019.","apa":"Vaz, G. F. (2019). <i>Using Just-in-Time Code Generation to Transparently Accelerate Applications in Heterogeneous Systems</i>. Universität Paderborn."},"has_accepted_license":"1","ddc":["040"],"file_date_updated":"2019-11-07T14:13:14Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C2","_id":"14"}],"_id":"14849","user_id":"477","department":[{"_id":"518"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"14850","file_name":"PhDThesis_GavinVaz_2019-07-11.pdf","access_level":"closed","file_size":1462659,"date_created":"2019-11-07T14:13:14Z","creator":"florida","date_updated":"2019-11-07T14:13:14Z"}],"status":"public","type":"dissertation"}]