[{"type":"conference","department":[{"_id":"63"},{"_id":"238"}],"file":[{"file_id":"5536","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-11-13T13:15:19Z","file_name":"LIPIcs-FUN-2018-22.pdf","access_level":"closed","file_size":554298,"date_created":"2018-11-13T13:15:19Z","creator":"feldi"}],"date_created":"2018-05-24T08:41:48Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"file_date_updated":"2018-11-13T13:15:19Z","publication":"Ninth International Conference on Fun with Algorithms (FUN)","citation":{"short":"H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International Conference on Fun with Algorithms (FUN), 2018.","chicago":"Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” In <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>.","apa":"Hamann, H., Markarian, C., Meyer auf der Heide, F., &#38; Wahby, M. (2018). Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. <a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>","ieee":"H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets,” in <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018.","ama":"Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In: <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. ; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>","bibtex":"@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>}, booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa}, year={2018} }","mla":"Hamann, Heiko, et al. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>."},"user_id":"15415","doi":"10.4230/LIPIcs.FUN.2018.22","ddc":["000"],"language":[{"iso":"eng"}],"_id":"2850","date_updated":"2022-01-06T06:58:07Z","has_accepted_license":"1","year":"2018","status":"public","title":"Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets","author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"full_name":"Markarian, Christine","first_name":"Christine","last_name":"Markarian","id":"37612"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Wahby","first_name":"Mostafa","full_name":"Wahby, Mostafa"}]},{"citation":{"bibtex":"@inproceedings{Mohr_Lettmann_Hüllermeier_Wever_2018, title={Programmatic Task Network Planning}, booktitle={Proceedings of the 1st ICAPS Workshop on Hierarchical Planning}, publisher={AAAI}, author={Mohr, Felix and Lettmann, Theodor and Hüllermeier, Eyke and Wever, Marcel Dominik}, year={2018}, pages={31–39} }","ama":"Mohr F, Lettmann T, Hüllermeier E, Wever MD. Programmatic Task Network Planning. In: <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>. AAAI; 2018:31-39.","mla":"Mohr, Felix, et al. “Programmatic Task Network Planning.” <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, AAAI, 2018, pp. 31–39.","short":"F. Mohr, T. Lettmann, E. Hüllermeier, M.D. Wever, in: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39.","chicago":"Mohr, Felix, Theodor Lettmann, Eyke Hüllermeier, and Marcel Dominik Wever. “Programmatic Task Network Planning.” In <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, 31–39. AAAI, 2018.","ieee":"F. Mohr, T. Lettmann, E. Hüllermeier, and M. D. Wever, “Programmatic Task Network Planning,” in <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, Delft, Netherlands, 2018, pp. 31–39.","apa":"Mohr, F., Lettmann, T., Hüllermeier, E., &#38; Wever, M. D. (2018). Programmatic Task Network Planning. In <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i> (pp. 31–39). Delft, Netherlands: AAAI."},"file_date_updated":"2018-11-06T15:18:26Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"oa":"1","conference":{"end_date":"2018-06-29","start_date":"2018-06-24","name":"28th International Conference on Automated Planning and Scheduling","location":"Delft, Netherlands"},"status":"public","has_accepted_license":"1","_id":"2857","publisher":"AAAI","page":"31-39","ddc":["000"],"user_id":"315","publication":"Proceedings of the 1st ICAPS Workshop on Hierarchical Planning","date_created":"2018-05-24T09:00:20Z","file":[{"date_created":"2018-11-06T15:18:26Z","creator":"wever","content_type":"application/pdf","success":1,"file_id":"5384","date_updated":"2018-11-06T15:18:26Z","relation":"main_file","file_size":349958,"access_level":"closed","file_name":"Mohr18ProgrammaticPlanning.pdf"}],"department":[{"_id":"355"}],"type":"conference","author":[{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"id":"315","last_name":"Lettmann","first_name":"Theodor","orcid":"0000-0001-5859-2457","full_name":"Lettmann, Theodor"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"},{"orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","id":"33176"}],"title":"Programmatic Task Network Planning","year":"2018","date_updated":"2022-01-06T06:58:08Z","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/Mohr18ProgrammaticPlanning.pdf"}]},{"publication":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings","type":"conference","department":[{"_id":"7"},{"_id":"64"}],"file":[{"relation":"main_file","date_updated":"2018-11-02T13:45:40Z","file_name":"PracticalAnonymousAndPubliclyL.pdf","file_size":3371773,"access_level":"closed","file_id":"5253","success":1,"content_type":"application/pdf","creator":"ups","date_created":"2018-11-02T13:45:40Z"}],"date_created":"2018-05-24T11:14:02Z","publication_status":"published","date_updated":"2022-01-06T06:58:12Z","year":"2018","title":"Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems","publication_identifier":{"isbn":["9783319769523","9783319769530"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"full_name":"Eidens, Fabian","first_name":"Fabian","last_name":"Eidens","id":"25078"},{"full_name":"Juhnke, Jakob","last_name":"Juhnke","first_name":"Jakob","id":"48090"}],"doi":"10.1007/978-3-319-76953-0_25","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/029"}],"language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"file_date_updated":"2018-11-02T13:45:40Z","citation":{"short":"J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, Cham, 2018, pp. 470–490.","chicago":"Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, 470–90. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>.","ieee":"J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems,” in <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, San Francisco, CA, USA, 2018, pp. 470–490.","apa":"Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i> (pp. 470–490). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>","bibtex":"@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>}, booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing}, author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490} }","ama":"Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>. Cham: Springer International Publishing; 2018:470-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>","mla":"Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, Springer International Publishing, 2018, pp. 470–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>."},"oa":"1","place":"Cham","has_accepted_license":"1","status":"public","conference":{"end_date":"2018-04-20","location":"San Francisco, CA, USA","start_date":"2018-04-16","name":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018"},"user_id":"477","ddc":["004"],"page":"470-490","_id":"2862","publisher":"Springer International Publishing"},{"user_id":"66937","volume":64,"page":"2614-2620","language":[{"iso":"eng"}],"_id":"24150","publisher":"IEEE","date_updated":"2022-01-06T06:56:08Z","intvolume":"        64","status":"public","year":"2018","title":"Stability of stochastic approximations with “controlled markov” noise and temporal difference learning","author":[{"full_name":"Ramaswamy, Arunselvan","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan","id":"66937"},{"full_name":"Bhatnagar, Shalabh","first_name":"Shalabh","last_name":"Bhatnagar"}],"type":"journal_article","department":[{"_id":"355"}],"date_created":"2021-09-10T10:17:54Z","issue":"6","publication":"IEEE Transactions on Automatic Control","citation":{"mla":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Stability of Stochastic Approximations with ‘Controlled Markov’ Noise and Temporal Difference Learning.” <i>IEEE Transactions on Automatic Control</i>, vol. 64, no. 6, IEEE, 2018, pp. 2614–20.","bibtex":"@article{Ramaswamy_Bhatnagar_2018, title={Stability of stochastic approximations with “controlled markov” noise and temporal difference learning}, volume={64}, number={6}, journal={IEEE Transactions on Automatic Control}, publisher={IEEE}, author={Ramaswamy, Arunselvan and Bhatnagar, Shalabh}, year={2018}, pages={2614–2620} }","ama":"Ramaswamy A, Bhatnagar S. Stability of stochastic approximations with “controlled markov” noise and temporal difference learning. <i>IEEE Transactions on Automatic Control</i>. 2018;64(6):2614-2620.","ieee":"A. Ramaswamy and S. Bhatnagar, “Stability of stochastic approximations with ‘controlled markov’ noise and temporal difference learning,” <i>IEEE Transactions on Automatic Control</i>, vol. 64, no. 6, pp. 2614–2620, 2018.","apa":"Ramaswamy, A., &#38; Bhatnagar, S. (2018). Stability of stochastic approximations with “controlled markov” noise and temporal difference learning. <i>IEEE Transactions on Automatic Control</i>, <i>64</i>(6), 2614–2620.","chicago":"Ramaswamy, Arunselvan, and Shalabh Bhatnagar. “Stability of Stochastic Approximations with ‘Controlled Markov’ Noise and Temporal Difference Learning.” <i>IEEE Transactions on Automatic Control</i> 64, no. 6 (2018): 2614–20.","short":"A. Ramaswamy, S. Bhatnagar, IEEE Transactions on Automatic Control 64 (2018) 2614–2620."}},{"author":[{"first_name":"Burak","last_name":"Demirel","full_name":"Demirel, Burak"},{"full_name":"Ramaswamy, Arunselvan","first_name":"Arunselvan","orcid":"https://orcid.org/ 0000-0001-7547-8111","last_name":"Ramaswamy","id":"66937"},{"first_name":"Daniel E","last_name":"Quevedo","full_name":"Quevedo, Daniel E"},{"full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl"}],"status":"public","year":"2018","title":"Deepcas: A deep reinforcement learning algorithm for control-aware scheduling","intvolume":"         2","date_updated":"2022-01-06T06:56:08Z","_id":"24151","publisher":"IEEE","language":[{"iso":"eng"}],"page":"737-742","volume":2,"user_id":"66937","citation":{"apa":"Demirel, B., Ramaswamy, A., Quevedo, D. E., &#38; Karl, H. (2018). Deepcas: A deep reinforcement learning algorithm for control-aware scheduling. <i>IEEE Control Systems Letters</i>, <i>2</i>(4), 737–742.","ieee":"B. Demirel, A. Ramaswamy, D. E. Quevedo, and H. Karl, “Deepcas: A deep reinforcement learning algorithm for control-aware scheduling,” <i>IEEE Control Systems Letters</i>, vol. 2, no. 4, pp. 737–742, 2018.","short":"B. Demirel, A. Ramaswamy, D.E. Quevedo, H. Karl, IEEE Control Systems Letters 2 (2018) 737–742.","chicago":"Demirel, Burak, Arunselvan Ramaswamy, Daniel E Quevedo, and Holger Karl. “Deepcas: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” <i>IEEE Control Systems Letters</i> 2, no. 4 (2018): 737–42.","mla":"Demirel, Burak, et al. “Deepcas: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” <i>IEEE Control Systems Letters</i>, vol. 2, no. 4, IEEE, 2018, pp. 737–42.","ama":"Demirel B, Ramaswamy A, Quevedo DE, Karl H. Deepcas: A deep reinforcement learning algorithm for control-aware scheduling. <i>IEEE Control Systems Letters</i>. 2018;2(4):737-742.","bibtex":"@article{Demirel_Ramaswamy_Quevedo_Karl_2018, title={Deepcas: A deep reinforcement learning algorithm for control-aware scheduling}, volume={2}, number={4}, journal={IEEE Control Systems Letters}, publisher={IEEE}, author={Demirel, Burak and Ramaswamy, Arunselvan and Quevedo, Daniel E and Karl, Holger}, year={2018}, pages={737–742} }"},"publication":"IEEE Control Systems Letters","issue":"4","date_created":"2021-09-10T10:19:07Z","department":[{"_id":"355"}],"type":"journal_article"},{"language":[{"iso":"eng"}],"_id":"24396","doi":"10.1007/978-3-319-94667-2_18","user_id":"15415","publication_identifier":{"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Markarian, Christine","first_name":"Christine","last_name":"Markarian"}],"title":"An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest","year":"2018","status":"public","date_updated":"2022-01-06T06:56:19Z","publication_status":"published","place":"Cham","date_created":"2021-09-14T12:23:29Z","department":[{"_id":"63"}],"type":"conference","citation":{"apa":"Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>. <a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">https://doi.org/10.1007/978-3-319-94667-2_18</a>","mla":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>.","ieee":"C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest,” 2018, doi: <a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>.","chicago":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” In <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>. Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">https://doi.org/10.1007/978-3-319-94667-2_18</a>.","ama":"Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. In: <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>","short":"C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA), Cham, 2018.","bibtex":"@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>}, booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian, Christine}, year={2018} }"},"publication":"International Workshop on Combinatorial Algorithms (IWOCA)","abstract":[{"text":"We study the Online Prize-collecting Node-weighted Steiner Forest problem (OPC-NWSF) in which we are given an undirected graph \\(G=(V, E)\\) with \\(|V| = n\\) and node-weight function \\(w: V \\rightarrow \\mathcal {R}^+\\). A sequence of k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF asks to construct a subgraph H such that each pair \\(\\{s, t\\}\\) is either connected (there is a path between s and t in H) or its associated penalty is paid. The goal is to minimize the weight of H and the total penalties paid. The current best result for OPC-NWSF is a randomized \\(\\mathcal {O}(\\log ^4 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing a randomized \\(\\mathcal {O}(\\log n \\log k)\\)-competitive algorithm for OPC-NWSF, which is optimal up to constant factor since OPC-NWSF has a randomized lower bound of \\(\\varOmega (\\log ^2 n)\\) due to Korman [11]. Moreover, our result also implies an improvement for two special cases of OPC-NWSF, the Online Prize-collecting Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently best known results for OPC-NWST and ONWSF are a randomized \\(\\mathcal {O}(\\log ^3 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized \\(\\mathcal {O}(\\log n \\log ^2 k)\\)-competitive algorithm due to Hajiaghayi et al. (FOCS 2013), respectively.","lang":"eng"}]},{"publication":"SCC","type":"conference","department":[{"_id":"355"}],"file":[{"file_id":"5383","content_type":"application/pdf","success":1,"file_name":"08456422.pdf","access_level":"closed","file_size":356132,"relation":"main_file","date_updated":"2018-11-06T15:15:38Z","date_created":"2018-11-06T15:15:38Z","creator":"wever"}],"date_created":"2018-04-23T11:40:20Z","date_updated":"2022-01-06T06:56:32Z","year":"2018","title":"On-The-Fly Service Construction with Prototypes","author":[{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","full_name":"Wever, Marcel Dominik","id":"33176"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"}],"doi":"10.1109/SCC.2018.00036","main_file_link":[{"open_access":"1","url":"https://ieeexplore.ieee.org/abstract/document/8456422"}],"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"file_date_updated":"2018-11-06T15:15:38Z","citation":{"chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “On-The-Fly Service Construction with Prototypes.” In <i>SCC</i>. San Francisco, CA, USA: IEEE Computer Society, 2018. <a href=\"https://doi.org/10.1109/SCC.2018.00036\">https://doi.org/10.1109/SCC.2018.00036</a>.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, in: SCC, IEEE Computer Society, San Francisco, CA, USA, 2018.","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “On-The-Fly Service Construction with Prototypes,” in <i>SCC</i>, San Francisco, CA, USA, 2018.","apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (2018). On-The-Fly Service Construction with Prototypes. In <i>SCC</i>. San Francisco, CA, USA: IEEE Computer Society. <a href=\"https://doi.org/10.1109/SCC.2018.00036\">https://doi.org/10.1109/SCC.2018.00036</a>","bibtex":"@inproceedings{Mohr_Wever_Hüllermeier_2018, place={San Francisco, CA, USA}, title={On-The-Fly Service Construction with Prototypes}, DOI={<a href=\"https://doi.org/10.1109/SCC.2018.00036\">10.1109/SCC.2018.00036</a>}, booktitle={SCC}, publisher={IEEE Computer Society}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018} }","ama":"Mohr F, Wever MD, Hüllermeier E. On-The-Fly Service Construction with Prototypes. In: <i>SCC</i>. San Francisco, CA, USA: IEEE Computer Society; 2018. doi:<a href=\"https://doi.org/10.1109/SCC.2018.00036\">10.1109/SCC.2018.00036</a>","mla":"Mohr, Felix, et al. “On-The-Fly Service Construction with Prototypes.” <i>SCC</i>, IEEE Computer Society, 2018, doi:<a href=\"https://doi.org/10.1109/SCC.2018.00036\">10.1109/SCC.2018.00036</a>."},"oa":"1","place":"San Francisco, CA, USA","has_accepted_license":"1","status":"public","conference":{"location":"San Francisco, CA, USA","start_date":"2018-07-02","name":"IEEE International Conference on Services Computing, SCC 2018","end_date":"2018-07-07"},"ddc":["000"],"user_id":"49109","_id":"2471","publisher":"IEEE Computer Society"},{"department":[{"_id":"75"}],"type":"conference","date_created":"2018-04-24T08:04:28Z","file":[{"date_created":"2018-04-24T08:04:02Z","creator":"tabu","file_id":"2473","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-04-24T08:04:02Z","file_name":"p2262-auroux.pdf","access_level":"closed","file_size":371352}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"citation":{"ieee":"S. Auroux and H. Karl, “Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks,” 2018.","apa":"Auroux, S., &#38; Karl, H. (2018). Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks. Proc. of IEEE Wireless Communications and Networking Conference (WCNC). <a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\">https://doi.org/ 10.1109/WCNC.2018.8377335</a>","chicago":"Auroux, Sébastien, and Holger Karl. “Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks.” Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018. <a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\">https://doi.org/ 10.1109/WCNC.2018.8377335</a>.","short":"S. Auroux, H. Karl, in: Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018.","mla":"Auroux, Sébastien, and Holger Karl. <i>Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks</i>. Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018, doi:<a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\"> 10.1109/WCNC.2018.8377335</a>.","bibtex":"@inproceedings{Auroux_Karl_2018, title={Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks}, DOI={<a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\"> 10.1109/WCNC.2018.8377335</a>}, publisher={Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}, author={Auroux, Sébastien and Karl, Holger}, year={2018} }","ama":"Auroux S, Karl H. Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks. In: Proc. of IEEE Wireless Communications and Networking Conference (WCNC); 2018. doi:<a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\"> 10.1109/WCNC.2018.8377335</a>"},"file_date_updated":"2018-04-24T08:04:02Z","ddc":["000"],"doi":" 10.1109/WCNC.2018.8377335","user_id":"126","publisher":"Proc. of IEEE Wireless Communications and Networking Conference (WCNC)","_id":"2472","has_accepted_license":"1","date_updated":"2022-01-06T06:56:33Z","author":[{"full_name":"Auroux, Sébastien","first_name":"Sébastien","last_name":"Auroux"},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger","id":"126"}],"status":"public","title":"Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks","year":"2018"},{"date_created":"2021-10-18T18:17:23Z","place":"Amsterdam, Netherlands","type":"conference","department":[{"_id":"71"}],"publication":"Proceedings of EdMedia: World Conference on Educational Media and Technology.","citation":{"apa":"Winkelnkemper, F., &#38; Keil, R. (2018). MediaThing – A Learning Scenario Targeting on Research Skills. In T. Bastiaens,  J  Van Braak, &#38;  M Brown (Eds.), <i>Proceedings of EdMedia: World Conference on Educational Media and Technology.</i> (pp. 2397–2406).","ieee":"F. Winkelnkemper and R. Keil, “MediaThing – A Learning Scenario Targeting on Research Skills,” in <i>Proceedings of EdMedia: World Conference on Educational Media and Technology.</i>, 2018, pp. 2397–2406.","chicago":"Winkelnkemper, Felix, and Reinhard Keil. “MediaThing – A Learning Scenario Targeting on Research Skills.” In <i>Proceedings of EdMedia: World Conference on Educational Media and Technology.</i>, edited by T  Bastiaens,  J  Van Braak, and  M Brown, 2397–2406. Amsterdam, Netherlands, 2018.","short":"F. Winkelnkemper, R. Keil, in: T. Bastiaens,  J  Van Braak,  M Brown (Eds.), Proceedings of EdMedia: World Conference on Educational Media and Technology., Amsterdam, Netherlands, 2018, pp. 2397–2406.","mla":"Winkelnkemper, Felix, and Reinhard Keil. “MediaThing – A Learning Scenario Targeting on Research Skills.” <i>Proceedings of EdMedia: World Conference on Educational Media and Technology.</i>, edited by T  Bastiaens et al., 2018, pp. 2397–406.","ama":"Winkelnkemper F, Keil R. MediaThing – A Learning Scenario Targeting on Research Skills. In: Bastiaens T,  Van Braak  J, Brown  M, eds. <i>Proceedings of EdMedia: World Conference on Educational Media and Technology.</i> ; 2018:2397-2406.","bibtex":"@inproceedings{Winkelnkemper_Keil_2018, place={Amsterdam, Netherlands}, title={MediaThing – A Learning Scenario Targeting on Research Skills}, booktitle={Proceedings of EdMedia: World Conference on Educational Media and Technology.}, author={Winkelnkemper, Felix and Keil, Reinhard}, editor={Bastiaens, T  and  Van Braak,  J and Brown,  M}, year={2018}, pages={2397–2406} }"},"page":"2397-2406","language":[{"iso":"eng"}],"_id":"26421","user_id":"71124","editor":[{"full_name":"Bastiaens, T ","last_name":"Bastiaens","first_name":"T "},{"full_name":" Van Braak,  J","last_name":" Van Braak","first_name":" J"},{"last_name":"Brown","first_name":" M","full_name":"Brown,  M"}],"title":"MediaThing – A Learning Scenario Targeting on Research Skills","year":"2018","status":"public","author":[{"full_name":"Winkelnkemper, Felix","first_name":"Felix","last_name":"Winkelnkemper","id":"3117"},{"first_name":"Reinhard","last_name":"Keil","full_name":"Keil, Reinhard"}],"publication_status":"published","date_updated":"2022-01-06T06:57:20Z"},{"date_created":"2021-10-18T18:23:28Z","place":"Berlin, Bosten","department":[{"_id":"71"}],"type":"conference","citation":{"ieee":"E.-M. Seng, R. Keil, and G. Oevel, “studiolo communis,” 2018, pp. 1–5.","mla":"Seng, E. M., et al. <i>Studiolo Communis</i>. Edited by E.-M Seng et al., De Gruyter, 2018, pp. 1–5.","apa":"Seng, E.-M., Keil, R., &#38; Oevel, G. (2018). <i>studiolo communis</i> (E.-M. Seng, R. Keil, &#38; G.  Oevel, Eds.; pp. 1–5). De Gruyter.","bibtex":"@inproceedings{Seng_Keil_Oevel_2018, place={Berlin, Bosten}, title={studiolo communis}, publisher={De Gruyter}, author={Seng, E.-M and Keil, Reinhard and Oevel, Gudrun}, editor={Seng, E.-M and Keil, Reinhard and  Oevel, G}, year={2018}, pages={1–5} }","chicago":"Seng, E.-M, Reinhard Keil, and Gudrun Oevel. “Studiolo Communis.” edited by E.-M Seng, Reinhard Keil, and G  Oevel, 1–5. Berlin, Bosten: De Gruyter, 2018.","ama":"Seng E-M, Keil R, Oevel G. studiolo communis. In: Seng E-M, Keil R,  Oevel G, eds. De Gruyter; 2018:1-5.","short":"E.-M. Seng, R. Keil, G. Oevel, in: E.-M. Seng, R. Keil, G.  Oevel (Eds.), De Gruyter, Berlin, Bosten, 2018, pp. 1–5."},"publisher":"De Gruyter","_id":"26422","language":[{"iso":"eng"}],"page":"1-5","editor":[{"full_name":"Seng, E.-M","last_name":"Seng","first_name":"E.-M"},{"first_name":"Reinhard","last_name":"Keil","full_name":"Keil, Reinhard"},{"full_name":" Oevel, G","first_name":"G","last_name":" Oevel"}],"alternative_title":["STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities"],"user_id":"71124","author":[{"last_name":"Seng","first_name":"E.-M","full_name":"Seng, E.-M"},{"full_name":"Keil, Reinhard","last_name":"Keil","first_name":"Reinhard"},{"full_name":"Oevel, Gudrun","first_name":"Gudrun","orcid":"https://orcid.org/0000-0002-6396-9535","last_name":"Oevel","id":"14924"}],"status":"public","year":"2018","title":"studiolo communis","publication_status":"published","date_updated":"2022-01-06T06:57:20Z"},{"user_id":"71124","editor":[{"full_name":"Seng, E.-M","last_name":"Seng","first_name":"E.-M"},{"full_name":" Keil, Reinhard","first_name":"Reinhard","last_name":" Keil"},{"last_name":"Oevel","first_name":"G","full_name":"Oevel, G"}],"alternative_title":["STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities"],"_id":"26423","language":[{"iso":"eng"}],"publisher":"De Gruyter","publication_status":"published","date_updated":"2022-01-06T06:57:20Z","title":"Unterst{\\\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\\\"u}r die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\\\"u}tzung des Forschungsdiskurses in den Kulturwissenschaften","status":"public","year":"2018","author":[{"first_name":"Reinhard","last_name":"Keil","full_name":"Keil, Reinhard"}],"type":"conference","department":[{"_id":"71"}],"date_created":"2021-10-18T18:26:49Z","place":"Berlin, Bosten","citation":{"apa":"Keil, R. (2018). <i>Unterst{\\\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\\\"u}r die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\\\"u}tzung des Forschungsdiskurses in den Kulturwissenschaften</i> (E.-M. Seng, R.  Keil, &#38; G. Oevel, Eds.). De Gruyter.","ieee":"R. Keil, “Unterst{\\\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\\\"u}r die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\\\"u}tzung des Forschungsdiskurses in den Kulturwissenschaften,” 2018.","short":"R. Keil, in: E.-M. Seng, R.  Keil, G. Oevel (Eds.), De Gruyter, Berlin, Bosten, 2018.","chicago":"Keil, Reinhard. “Unterst{\\\"u}tzung Kontingenter Wissensarbeit. Ein Rahmenwerk F{\\\"u}r Die Entwicklung Digitaler Arbeitsumgebungen Zur Unterst{\\\"u}tzung Des Forschungsdiskurses in Den Kulturwissenschaften.” edited by E.-M Seng, Reinhard  Keil, and G Oevel. Berlin, Bosten: De Gruyter, 2018.","mla":"Keil, Reinhard. <i>Unterst{\\\"u}tzung Kontingenter Wissensarbeit. Ein Rahmenwerk F{\\\"u}r Die Entwicklung Digitaler Arbeitsumgebungen Zur Unterst{\\\"u}tzung Des Forschungsdiskurses in Den Kulturwissenschaften</i>. Edited by E.-M Seng et al., De Gruyter, 2018.","ama":"Keil R. Unterst{\\\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\\\"u}r die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\\\"u}tzung des Forschungsdiskurses in den Kulturwissenschaften. In: Seng E-M,  Keil R, Oevel G, eds. De Gruyter; 2018.","bibtex":"@inproceedings{Keil_2018, place={Berlin, Bosten}, title={Unterst{\\\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\\\"u}r die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\\\"u}tzung des Forschungsdiskurses in den Kulturwissenschaften}, publisher={De Gruyter}, author={Keil, Reinhard}, editor={Seng, E.-M and  Keil, Reinhard and Oevel, G}, year={2018} }"}},{"department":[{"_id":"71"}],"type":"book","place":"Berlin, Bosten","date_created":"2021-10-18T18:32:41Z","citation":{"mla":"Seng,  E.-M, et al. <i>STUDIOLO. Kooperative Forschungsumgebungen in Den EHumanities</i>. De Gruyter, 2018.","ama":"Seng  E.-M, Keil R, Oevel G. <i>STUDIOLO. Kooperative Forschungsumgebungen in Den EHumanities</i>. De Gruyter; 2018.","bibtex":"@book{Seng_Keil_Oevel_2018, place={Berlin, Bosten}, title={STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities}, publisher={De Gruyter}, author={Seng,  E.-M and Keil, Reinhard and Oevel, Gudrun}, year={2018} }","apa":"Seng,  E.-M, Keil, R., &#38; Oevel, G. (2018). <i>STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities</i>. De Gruyter.","ieee":"E.-M Seng, R. Keil, and G. Oevel, <i>STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities</i>. Berlin, Bosten: De Gruyter, 2018.","chicago":"Seng,  E.-M, Reinhard Keil, and Gudrun Oevel. <i>STUDIOLO. Kooperative Forschungsumgebungen in Den EHumanities</i>. Berlin, Bosten: De Gruyter, 2018.","short":"E.-M Seng, R. Keil, G. Oevel, STUDIOLO. Kooperative Forschungsumgebungen in Den EHumanities, De Gruyter, Berlin, Bosten, 2018."},"user_id":"71124","_id":"26424","language":[{"iso":"eng"}],"publisher":"De Gruyter","date_updated":"2022-01-06T06:57:20Z","publication_status":"published","author":[{"first_name":" E.-M","last_name":"Seng","full_name":"Seng,  E.-M"},{"first_name":"Reinhard","last_name":"Keil","full_name":"Keil, Reinhard"},{"full_name":"Oevel, Gudrun","orcid":"https://orcid.org/0000-0002-6396-9535","first_name":"Gudrun","last_name":"Oevel","id":"14924"}],"status":"public","title":"STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities","year":"2018"},{"place":"Paderborn","date_created":"2021-10-18T18:37:32Z","department":[{"_id":"71"}],"type":"conference","citation":{"ieee":"H. Selke, “Data science in schools from the perspective of contextual informatics,” 2018, pp. 107–109.","apa":"Selke, H. (2018). <i>Data science in schools from the perspective of contextual informatics</i> (R. Biehler,  L Budde, D. Frischemeier, B. Heinemann, S. Podworny, C. Schulte, &#38; T. Wassong, Eds.; pp. 107–109). Universit{\\\"a}tsbibliothek Paderborn.","chicago":"Selke, Harald. “Data Science in Schools from the Perspective of Contextual Informatics.” edited by R Biehler,  L Budde, D Frischemeier, B Heinemann, S Podworny, Carsten Schulte, and T Wassong, 107–9. Paderborn: Universit{\\\"a}tsbibliothek Paderborn, 2018.","short":"H. Selke, in: R. Biehler,  L Budde, D. Frischemeier, B. Heinemann, S. Podworny, C. Schulte, T. Wassong (Eds.), Universit{\\\"a}tsbibliothek Paderborn, Paderborn, 2018, pp. 107–109.","mla":"Selke, Harald. <i>Data Science in Schools from the Perspective of Contextual Informatics</i>. Edited by R Biehler et al., Universit{\\\"a}tsbibliothek Paderborn, 2018, pp. 107–09.","bibtex":"@inproceedings{Selke_2018, place={Paderborn}, title={Data science in schools from the perspective of contextual informatics}, publisher={Universit{\\\"a}tsbibliothek Paderborn}, author={Selke, Harald}, editor={Biehler, R and Budde,  L and Frischemeier, D and Heinemann, B and Podworny, S and Schulte, Carsten and Wassong, T}, year={2018}, pages={107–109} }","ama":"Selke H. Data science in schools from the perspective of contextual informatics. In: Biehler R, Budde  L, Frischemeier D, et al., eds. Universit{\\\"a}tsbibliothek Paderborn; 2018:107-109."},"_id":"26425","language":[{"iso":"eng"}],"publisher":"Universit{\\\"a}tsbibliothek Paderborn","page":"107-109","editor":[{"full_name":"Biehler, R","last_name":"Biehler","first_name":"R"},{"full_name":"Budde,  L","first_name":" L","last_name":"Budde"},{"full_name":"Frischemeier, D","last_name":"Frischemeier","first_name":"D"},{"full_name":"Heinemann, B","last_name":"Heinemann","first_name":"B"},{"full_name":"Podworny, S","last_name":"Podworny","first_name":"S"},{"full_name":"Schulte, Carsten","first_name":"Carsten","last_name":"Schulte"},{"full_name":"Wassong, T","first_name":"T","last_name":"Wassong"}],"alternative_title":["Paderborn Symposium on Data Science Education at School Level 2017: The Collected Extended Abstracts"],"user_id":"71124","author":[{"last_name":"Selke","first_name":"Harald","full_name":"Selke, Harald","id":"497"}],"title":"Data science in schools from the perspective of contextual informatics","status":"public","year":"2018","date_updated":"2022-01-06T06:57:20Z","publication_status":"published"},{"_id":"2685","page":"314-338","volume":2,"user_id":"477","ddc":["000"],"status":"public","has_accepted_license":"1","citation":{"mla":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, 2018, pp. 314–38, doi:<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>.","bibtex":"@article{Blömer_Kohn_2018, title={Voronoi Cells of Lattices with Respect to Arbitrary Norms}, volume={2}, DOI={<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>}, number={2}, journal={SIAM Journal on Applied Algebra and Geometry.}, author={Blömer, Johannes and Kohn, Kathlén}, year={2018}, pages={314–338} }","ama":"Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry</i>. 2018;2(2):314-338. doi:<a href=\"https://doi.org/10.1137/17M1132045\">10.1137/17M1132045</a>","ieee":"J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary Norms,” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, pp. 314–338, 2018.","apa":"Blömer, J., &#38; Kohn, K. (2018). Voronoi Cells of Lattices with Respect to Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry.</i>, <i>2</i>(2), 314–338. <a href=\"https://doi.org/10.1137/17M1132045\">https://doi.org/10.1137/17M1132045</a>","short":"J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018) 314–338.","chicago":"Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i> 2, no. 2 (2018): 314–38. <a href=\"https://doi.org/10.1137/17M1132045\">https://doi.org/10.1137/17M1132045</a>."},"file_date_updated":"2018-11-02T15:22:55Z","project":[{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}],"language":[{"iso":"eng"}],"doi":"10.1137/17M1132045","author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"full_name":"Kohn, Kathlén","first_name":"Kathlén","last_name":"Kohn"}],"publication_identifier":{"eissn":["2470-6566"]},"title":"Voronoi Cells of Lattices with Respect to Arbitrary Norms","year":"2018","intvolume":"         2","publication_status":"epub_ahead","date_updated":"2022-01-06T06:57:29Z","date_created":"2018-05-08T09:18:54Z","file":[{"success":1,"content_type":"application/pdf","file_id":"5300","access_level":"closed","file_size":1131048,"file_name":"17m1132045.pdf","date_updated":"2018-11-02T15:22:55Z","relation":"main_file","date_created":"2018-11-02T15:22:55Z","creator":"ups"}],"department":[{"_id":"7"},{"_id":"64"}],"type":"journal_article","issue":"2","publication":"SIAM Journal on Applied Algebra and Geometry."},{"type":"conference","department":[{"_id":"75"}],"file":[{"date_created":"2018-06-13T10:47:57Z","creator":"tabu","success":1,"content_type":"application/pdf","file_id":"3218","access_level":"closed","file_size":354166,"file_name":"1803.02998.pdf","date_updated":"2018-06-13T10:47:57Z","relation":"main_file"}],"date_created":"2018-06-13T10:26:23Z","project":[{"name":"Netzgewahre Regelung & regelungsgewahre Netze","_id":"24"}],"file_date_updated":"2018-06-13T10:47:57Z","citation":{"ama":"Demirel B, Ramaswamy A, Quevedo D, Karl H. DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling. In: ; 2018. doi:<a href=\"https://doi.org/10.1109/LCSYS.2018.2847721\">10.1109/LCSYS.2018.2847721</a>","bibtex":"@inproceedings{Demirel_Ramaswamy_Quevedo_Karl_2018, title={DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling}, DOI={<a href=\"https://doi.org/10.1109/LCSYS.2018.2847721\">10.1109/LCSYS.2018.2847721</a>}, author={Demirel, Burak and Ramaswamy, Arunselvan and Quevedo, Daniel and Karl, Holger}, year={2018} }","mla":"Demirel, Burak, et al. <i>DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling</i>. 2018, doi:<a href=\"https://doi.org/10.1109/LCSYS.2018.2847721\">10.1109/LCSYS.2018.2847721</a>.","short":"B. Demirel, A. Ramaswamy, D. Quevedo, H. Karl, in: 2018.","chicago":"Demirel, Burak, Arunselvan Ramaswamy, Daniel Quevedo, and Holger Karl. “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling,” 2018. <a href=\"https://doi.org/10.1109/LCSYS.2018.2847721\">https://doi.org/10.1109/LCSYS.2018.2847721</a>.","apa":"Demirel, B., Ramaswamy, A., Quevedo, D., &#38; Karl, H. (2018). DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling. <a href=\"https://doi.org/10.1109/LCSYS.2018.2847721\">https://doi.org/10.1109/LCSYS.2018.2847721</a>","ieee":"B. Demirel, A. Ramaswamy, D. Quevedo, and H. Karl, “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling,” 2018."},"user_id":"126","doi":"10.1109/LCSYS.2018.2847721","ddc":["000"],"main_file_link":[{"url":"https://arxiv.org/pdf/1803.02998.pdf"}],"_id":"3217","date_updated":"2022-01-06T06:59:05Z","has_accepted_license":"1","year":"2018","title":"DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling","status":"public","author":[{"last_name":"Demirel","first_name":"Burak","full_name":"Demirel, Burak"},{"full_name":"Ramaswamy, Arunselvan","first_name":"Arunselvan","last_name":"Ramaswamy"},{"full_name":"Quevedo, Daniel","last_name":"Quevedo","first_name":"Daniel"},{"full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl","id":"126"}]},{"doi":"10.1145/3230833.3234517","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/835"}],"date_updated":"2022-01-06T06:59:07Z","publication_status":"accepted","author":[{"full_name":"Bemmann, Kai","first_name":"Kai","last_name":"Bemmann"},{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"id":"27207","full_name":"Bobolz, Jan","first_name":"Jan","last_name":"Bobolz"},{"full_name":"Bröcher, Henrik","last_name":"Bröcher","first_name":"Henrik","id":"41047"},{"id":"44071","last_name":"Diemert","first_name":"Denis Pascal","full_name":"Diemert, Denis Pascal"},{"full_name":"Eidens, Fabian","last_name":"Eidens","first_name":"Fabian","id":"25078"},{"full_name":"Eilers, Lukas","last_name":"Eilers","first_name":"Lukas"},{"last_name":"Haltermann","first_name":"Jan Frederik","full_name":"Haltermann, Jan Frederik","id":"44413"},{"id":"48090","full_name":"Juhnke, Jakob","last_name":"Juhnke","first_name":"Jakob"},{"full_name":"Otour, Burhan","first_name":"Burhan","last_name":"Otour"},{"id":"47434","last_name":"Porzenheim","first_name":"Laurens Alexander","full_name":"Porzenheim, Laurens Alexander"},{"first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon"},{"full_name":"Schilling, Erik","first_name":"Erik","last_name":"Schilling"},{"id":"32312","full_name":"Schlichtig, Michael","first_name":"Michael","last_name":"Schlichtig"},{"first_name":"Marcel","last_name":"Stienemeier","full_name":"Stienemeier, Marcel"}],"publication_identifier":{"isbn":["978-1-4503-6448-5"]},"title":"Fully-Featured Anonymous Credentials with Reputation System","year":"2018","department":[{"_id":"64"}],"type":"conference","date_created":"2018-06-14T11:19:29Z","file":[{"file_name":"react_acs.pdf","file_size":920843,"access_level":"closed","relation":"main_file","date_updated":"2018-11-08T10:17:39Z","file_id":"5428","content_type":"application/pdf","creator":"feidens","date_created":"2018-11-08T10:17:39Z"}],"abstract":[{"text":"We present CLARC (Cryptographic Library for Anonymous Reputation and Credentials), an anonymous credentials system (ACS) combined with an anonymous reputation system.\r\n\r\nUsing CLARC, users can receive attribute-based credentials from issuers. They can efficiently prove that their credentials satisfy complex (access) policies in a privacy-preserving way. This implements anonymous access control with complex policies.\r\n\r\nFurthermore, CLARC is the first ACS that is combined with an anonymous reputation system where users can anonymously rate services. A user who gets access to a service via a credential, also anonymously receives a review token to rate the service. If a user creates more than a single rating, this can be detected by anyone, preventing users from spamming ratings to sway public opinion.\r\n\r\nTo evaluate feasibility of our construction, we present an open-source prototype implementation.","lang":"eng"}],"related_material":{"link":[{"url":"https://github.com/upbcuk","relation":"software"}]},"publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES '18","ddc":["000"],"user_id":"25078","publisher":"ACM","_id":"3265","has_accepted_license":"1","conference":{"name":"ARES 2018 - SECPID","start_date":"2018-08-27","location":"Hamburg, Germany","end_date":"2018-08-30"},"status":"public","oa":"1","place":"New York, NY, USA","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"KogniHome - die mitdenkende Wohnung","_id":"44"}],"quality_controlled":"1","citation":{"bibtex":"@inproceedings{Bemmann_Blömer_Bobolz_Bröcher_Diemert_Eidens_Eilers_Haltermann_Juhnke_Otour_et al., place={New York, NY, USA}, title={Fully-Featured Anonymous Credentials with Reputation System}, DOI={<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18}, publisher={ACM}, author={Bemmann, Kai and Blömer, Johannes and Bobolz, Jan and Bröcher, Henrik and Diemert, Denis Pascal and Eidens, Fabian and Eilers, Lukas and Haltermann, Jan Frederik and Juhnke, Jakob and Otour, Burhan and et al.} }","ama":"Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials with Reputation System. In: <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>","mla":"Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.” <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, ACM, doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>.","short":"K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L. Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling, M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA, n.d.","chicago":"Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials with Reputation System.” In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM, n.d. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>.","ieee":"K. Bemmann <i>et al.</i>, “Fully-Featured Anonymous Credentials with Reputation System,” in <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, Hamburg, Germany.","apa":"Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens, F., … Stienemeier, M. (n.d.). Fully-Featured Anonymous Credentials with Reputation System. In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>"},"file_date_updated":"2018-11-08T10:17:39Z"},{"date_updated":"2022-01-06T06:59:10Z","author":[{"full_name":"Rautenberg, Kai","last_name":"Rautenberg","first_name":"Kai"}],"year":"2018","title":"Korrektheitsbeweise für Muster von Servicekompositionen","status":"public","user_id":"477","_id":"3320","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"supervisor":[{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"citation":{"bibtex":"@book{Rautenberg_2018, title={Korrektheitsbeweise für Muster von Servicekompositionen}, publisher={Universität Paderborn}, author={Rautenberg, Kai}, year={2018} }","ama":"Rautenberg K. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn; 2018.","mla":"Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","short":"K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen, Universität Paderborn, 2018.","chicago":"Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","ieee":"K. Rautenberg, <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","apa":"Rautenberg, K. (2018). <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn."},"department":[{"_id":"7"},{"_id":"77"}],"type":"bachelorsthesis","date_created":"2018-06-25T07:53:32Z"},{"oa":"1","place":"Montreal","project":[{"name":"5G Development and validation platform for global industry-specific network services and Apps","grant_number":"761493","_id":"28"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"file_date_updated":"2018-07-05T11:12:29Z","citation":{"ama":"Peuster M, Küttner H, Karl H.  Let the state follow its flows: An SDN-based flow handover protocol to support state migration. In: <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">10.1109/NETSOFT.2018.8460007</a>","bibtex":"@inproceedings{Peuster_Küttner_Karl, place={Montreal}, title={ Let the state follow its flows: An SDN-based flow handover protocol to support state migration}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">10.1109/NETSOFT.2018.8460007</a>}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, author={Peuster, Manuel and Küttner, Hannes and Karl, Holger} }","mla":"Peuster, Manuel, et al. “ Let the State Follow Its Flows: An SDN-Based Flow Handover Protocol to Support State Migration.” <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">10.1109/NETSOFT.2018.8460007</a>.","short":"M. Peuster, H. Küttner, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal, n.d.","chicago":"Peuster, Manuel, Hannes Küttner, and Holger Karl. “ Let the State Follow Its Flows: An SDN-Based Flow Handover Protocol to Support State Migration.” In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal, n.d. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">https://doi.org/10.1109/NETSOFT.2018.8460007</a>.","apa":"Peuster, M., Küttner, H., &#38; Karl, H. (n.d.).  Let the state follow its flows: An SDN-based flow handover protocol to support state migration. In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8460007\">https://doi.org/10.1109/NETSOFT.2018.8460007</a>","ieee":"M. Peuster, H. Küttner, and H. Karl, “ Let the state follow its flows: An SDN-based flow handover protocol to support state migration,” in <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, Montreal."},"user_id":"13271","ddc":["000"],"_id":"3345","urn":"33458","has_accepted_license":"1","status":"public","conference":{"start_date":"2018-06-25","name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","location":"Montreal","end_date":"2018-06-29"},"type":"conference","department":[{"_id":"75"}],"file":[{"date_updated":"2018-07-05T11:12:29Z","relation":"main_file","file_size":901561,"access_level":"open_access","file_name":"main_ris.pdf","content_type":"application/pdf","file_id":"3428","creator":"peuster","date_created":"2018-07-05T11:11:37Z"}],"date_created":"2018-06-25T12:21:49Z","abstract":[{"lang":"eng","text":"Dynamically steering flows through virtualized net- work function instances is a key enabler for elastic, on-demand deployments of virtualized network functions. This becomes par- ticular challenging when stateful functions are involved, necessi- tating state management. The problem with existing solutions is that they typically embrace state migration and flow rerouting jointly, imposing a huge set of requirements on the on-boarded VNFs, e.g., solution-specific state management interfaces.\r\nIn this paper, we introduce the seamless handover proto- col (SHarP). It provides an easy-to-use, loss-less, and order- preserving flow rerouting mechanism that is not fixed to a single state management approach. This allows VNF vendors to implement or use the state management solution of their choice. SHarP supports these solutions with additional information when flows are migrated. Further, we show how SHarP significantly reduces the buffer usage at a central (SDN) controller, which is a typical bottleneck in existing solutions. Our experiments show that SHarP uses a constant amount of controller buffer, irrespective of the time taken to migrate the VNF state."}],"publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","doi":"10.1109/NETSOFT.2018.8460007","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8460007/"}],"language":[{"iso":"eng"}],"publication_status":"accepted","date_updated":"2022-01-06T06:59:11Z","title":" Let the state follow its flows: An SDN-based flow handover protocol to support state migration","year":"2018","author":[{"id":"13271","last_name":"Peuster","first_name":"Manuel","full_name":"Peuster, Manuel"},{"last_name":"Küttner","first_name":"Hannes","full_name":"Küttner, Hannes"},{"last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger","id":"126"}]},{"file":[{"file_id":"3429","content_type":"application/pdf","relation":"main_file","date_updated":"2018-07-05T11:12:55Z","file_name":"main_ris.pdf","access_level":"open_access","file_size":449513,"date_created":"2018-07-05T11:12:55Z","creator":"peuster"}],"date_created":"2018-06-25T12:24:19Z","type":"conference","department":[{"_id":"75"}],"publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","abstract":[{"lang":"eng","text":"Developing a virtualized network service does not only involve the\r\n  implementation and configuration of the network functions it is\r\n  composed of but also its integration and test with management\r\n  solutions that will control the service in its production\r\n  environment. These integration tasks require testbeds that offer the\r\n  needed network function virtualization infrastructure~(NFVI), like OpenStack, introducing a\r\n  lot of management and maintenance overheads. Such testbed setups\r\n  become even more complicated when the multi\r\n  point-of-presence~(PoP) case, with multiple infrastructure\r\n  installations, is considered.\r\n\r\n  In this demo, we showcase an emulation platform that executes\r\n  containerized network services in user-defined multi-PoP\r\n  topologies. The platform does not only allow network service developers to\r\n  locally test their services but also to connect real-world\r\n  management and orchestration solutions to the emulated PoPs. During our\r\n  interactive demonstration we focus on the integration between\r\n  the emulated infrastructure and state-of-the-art orchestration\r\n  solutions like SONATA or OSM."}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8459905/"}],"language":[{"iso":"eng"}],"doi":"10.1109/NETSOFT.2018.8459905","title":"Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains","year":"2018","author":[{"first_name":"Manuel","last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271"},{"full_name":"Kampmeyer, Johannes ","first_name":"Johannes ","last_name":"Kampmeyer"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"publication_status":"accepted","date_updated":"2022-01-06T06:59:11Z","place":"Montreal","oa":"1","file_date_updated":"2018-07-05T11:12:55Z","citation":{"apa":"Peuster, M., Kampmeyer, J., &#38; Karl, H. (n.d.). Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains. In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">https://doi.org/10.1109/NETSOFT.2018.8459905</a>","ieee":"M. Peuster, J. Kampmeyer, and H. Karl, “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains,” in <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, Montreal.","short":"M. Peuster, J. Kampmeyer, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), Montreal, n.d.","chicago":"Peuster, Manuel, Johannes  Kampmeyer, and Holger Karl. “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains.” In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal, n.d. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">https://doi.org/10.1109/NETSOFT.2018.8459905</a>.","mla":"Peuster, Manuel, et al. “Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains.” <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">10.1109/NETSOFT.2018.8459905</a>.","ama":"Peuster M, Kampmeyer J, Karl H. Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains. In: <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. Montreal. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">10.1109/NETSOFT.2018.8459905</a>","bibtex":"@inproceedings{Peuster_Kampmeyer_Karl, place={Montreal}, title={Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2018.8459905\">10.1109/NETSOFT.2018.8459905</a>}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, author={Peuster, Manuel and Kampmeyer, Johannes  and Karl, Holger} }"},"project":[{"name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28","grant_number":"761493"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"urn":"33467","_id":"3346","user_id":"13271","ddc":["000"],"status":"public","conference":{"start_date":"2018-06-25","name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","location":"Montreal","end_date":"2018-06-29"},"has_accepted_license":"1"},{"date_updated":"2022-01-06T06:59:12Z","publication_status":"accepted","author":[{"id":"13271","first_name":"Manuel","last_name":"Peuster","full_name":"Peuster, Manuel"},{"first_name":"Michael","last_name":"Marchetti","full_name":"Marchetti, Michael"},{"full_name":"Garcia de Blas, Gerado","first_name":"Gerado","last_name":"Garcia de Blas"},{"id":"126","full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl"}],"title":"Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments","year":"2018","doi":"10.1109/EuCNC.2018.8442701","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8442701/"}],"abstract":[{"text":"Management and orchestration~(MANO) systems are the key components of future large-scale NFV environments. They will manage resources of hundreds or even thousands of NFV infrastructure installations, so called points of presence~(PoP). Such scenarios need to be automatically tested during the development phase of a MANO system. This task becomes very challenging because large-scale NFV testbeds are hard to maintain, too expensive, or simply not available.\r\n\r\nIn this paper, we present a multi-PoP NFV infrastructure emulation platform that enables automated, large-scale testing of MANO stacks. We show that our platform can easily emulate hundreds of PoPs on a single physical machine and reduces the setup time of a test PoP by a factor of 232x compared to a DevStack-based test PoP installation. Further, we present a case study in which we test ETSI's Open Source MANO~(OSM) against our proposed system  to gain insights about OSM's behaviour in large-scale NFV deployments.","lang":"eng"}],"publication":"European Conference on Networks and Communications (EuCNC)","department":[{"_id":"75"}],"type":"conference","date_created":"2018-06-25T12:27:59Z","file":[{"file_size":713495,"access_level":"open_access","file_name":"main_ris.pdf","date_updated":"2018-07-05T11:13:29Z","relation":"main_file","content_type":"application/pdf","file_id":"3430","creator":"peuster","date_created":"2018-07-05T11:13:29Z"}],"has_accepted_license":"1","conference":{"name":"European Conference on Networks and Communications (EuCNC)","location":"Ljubljana"},"status":"public","ddc":["000"],"user_id":"13271","urn":"33477","_id":"3347","project":[{"_id":"28","grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"citation":{"ama":"Peuster M, Marchetti M, Garcia de Blas G, Karl H. Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments. In: <i>European Conference on Networks and Communications (EuCNC)</i>. Ljubljana. doi:<a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">10.1109/EuCNC.2018.8442701</a>","short":"M. Peuster, M. Marchetti, G. Garcia de Blas, H. Karl, in: European Conference on Networks and Communications (EuCNC), Ljubljana, n.d.","chicago":"Peuster, Manuel, Michael Marchetti, Gerado Garcia de Blas, and Holger Karl. “Emulation-Based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments.” In <i>European Conference on Networks and Communications (EuCNC)</i>. Ljubljana, n.d. <a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">https://doi.org/10.1109/EuCNC.2018.8442701</a>.","bibtex":"@inproceedings{Peuster_Marchetti_Garcia de Blas_Karl, place={Ljubljana}, title={Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments}, DOI={<a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">10.1109/EuCNC.2018.8442701</a>}, booktitle={European Conference on Networks and Communications (EuCNC)}, author={Peuster, Manuel and Marchetti, Michael and Garcia de Blas, Gerado and Karl, Holger} }","mla":"Peuster, Manuel, et al. “Emulation-Based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments.” <i>European Conference on Networks and Communications (EuCNC)</i>, doi:<a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">10.1109/EuCNC.2018.8442701</a>.","apa":"Peuster, M., Marchetti, M., Garcia de Blas, G., &#38; Karl, H. (n.d.). Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments. In <i>European Conference on Networks and Communications (EuCNC)</i>. Ljubljana. <a href=\"https://doi.org/10.1109/EuCNC.2018.8442701\">https://doi.org/10.1109/EuCNC.2018.8442701</a>","ieee":"M. Peuster, M. Marchetti, G. Garcia de Blas, and H. Karl, “Emulation-based Smoke Testing of NFV Orchestrators in Large Multi-PoP Environments,” in <i>European Conference on Networks and Communications (EuCNC)</i>, Ljubljana."},"file_date_updated":"2018-07-05T11:13:29Z","oa":"1","place":"Ljubljana"}]