[{"department":[{"_id":"75"}],"type":"conference","date_created":"2017-11-27T10:22:25Z","project":[{"call_identifier":"FP7-ICT-2011-C","grant_number":"318115","_id":"22","name":"Connectivity management for eneRgy Optimised Wireless Dense works"}],"ec_funded":"1","citation":{"bibtex":"@inproceedings{Dräxler_Dreimann_Karl_2014, title={Anticipatory power cycling of mobile network equipment for high demand multimedia traffic}, DOI={<a href=\"https://doi.org/10.1109/OnlineGreenCom.2014.7114415\">10.1109/OnlineGreenCom.2014.7114415</a>}, booktitle={IEEE Online Conference on Green Communications, OnlineGreenComm 2014, November 12-14, 2014}, author={Dräxler, Martin and Dreimann, Philipp and Karl, Holger}, year={2014}, pages={1--7} }","ama":"Dräxler M, Dreimann P, Karl H. Anticipatory power cycling of mobile network equipment for high demand multimedia traffic. In: <i>IEEE Online Conference on Green Communications, OnlineGreenComm 2014, November 12-14, 2014</i>. ; 2014:1--7. doi:<a href=\"https://doi.org/10.1109/OnlineGreenCom.2014.7114415\">10.1109/OnlineGreenCom.2014.7114415</a>","mla":"Dräxler, Martin, et al. “Anticipatory Power Cycling of Mobile Network Equipment for High Demand Multimedia Traffic.” <i>IEEE Online Conference on Green Communications, OnlineGreenComm 2014, November 12-14, 2014</i>, 2014, pp. 1--7, doi:<a href=\"https://doi.org/10.1109/OnlineGreenCom.2014.7114415\">10.1109/OnlineGreenCom.2014.7114415</a>.","chicago":"Dräxler, Martin, Philipp Dreimann, and Holger Karl. “Anticipatory Power Cycling of Mobile Network Equipment for High Demand Multimedia Traffic.” In <i>IEEE Online Conference on Green Communications, OnlineGreenComm 2014, November 12-14, 2014</i>, 1--7, 2014. <a href=\"https://doi.org/10.1109/OnlineGreenCom.2014.7114415\">https://doi.org/10.1109/OnlineGreenCom.2014.7114415</a>.","short":"M. Dräxler, P. Dreimann, H. Karl, in: IEEE Online Conference on Green Communications, OnlineGreenComm 2014, November 12-14, 2014, 2014, pp. 1--7.","ieee":"M. Dräxler, P. Dreimann, and H. Karl, “Anticipatory power cycling of mobile network equipment for high demand multimedia traffic,” in <i>IEEE Online Conference on Green Communications, OnlineGreenComm 2014, November 12-14, 2014</i>, 2014, pp. 1--7.","apa":"Dräxler, M., Dreimann, P., &#38; Karl, H. (2014). Anticipatory power cycling of mobile network equipment for high demand multimedia traffic. In <i>IEEE Online Conference on Green Communications, OnlineGreenComm 2014, November 12-14, 2014</i> (pp. 1--7). <a href=\"https://doi.org/10.1109/OnlineGreenCom.2014.7114415\">https://doi.org/10.1109/OnlineGreenCom.2014.7114415</a>"},"publication":"IEEE Online Conference on Green Communications, OnlineGreenComm 2014, November 12-14, 2014","doi":"10.1109/OnlineGreenCom.2014.7114415","user_id":"15572","_id":"759","page":"1--7","date_updated":"2022-01-06T07:03:40Z","author":[{"first_name":"Martin","last_name":"Dräxler","full_name":"Dräxler, Martin"},{"last_name":"Dreimann","first_name":"Philipp","full_name":"Dreimann, Philipp"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"status":"public","year":"2014","title":"Anticipatory power cycling of mobile network equipment for high demand multimedia traffic"},{"date_created":"2017-11-27T10:22:25Z","type":"conference","department":[{"_id":"75"}],"publication":"25th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014","citation":{"chicago":"Auroux, Sebastien, and Holger Karl. “Flow Processing-Aware Controller Placement in Wireless DenseNets.” In <i>25th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014</i>, 1294--1299, 2014. <a href=\"https://doi.org/10.1109/PIMRC.2014.7136368\">https://doi.org/10.1109/PIMRC.2014.7136368</a>.","short":"S. Auroux, H. Karl, in: 25th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014, 2014, pp. 1294--1299.","ieee":"S. Auroux and H. Karl, “Flow processing-aware controller placement in wireless DenseNets,” in <i>25th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014</i>, 2014, pp. 1294--1299.","apa":"Auroux, S., &#38; Karl, H. (2014). Flow processing-aware controller placement in wireless DenseNets. In <i>25th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014</i> (pp. 1294--1299). <a href=\"https://doi.org/10.1109/PIMRC.2014.7136368\">https://doi.org/10.1109/PIMRC.2014.7136368</a>","bibtex":"@inproceedings{Auroux_Karl_2014, title={Flow processing-aware controller placement in wireless DenseNets}, DOI={<a href=\"https://doi.org/10.1109/PIMRC.2014.7136368\">10.1109/PIMRC.2014.7136368</a>}, booktitle={25th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014}, author={Auroux, Sebastien and Karl, Holger}, year={2014}, pages={1294--1299} }","ama":"Auroux S, Karl H. Flow processing-aware controller placement in wireless DenseNets. In: <i>25th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014</i>. ; 2014:1294--1299. doi:<a href=\"https://doi.org/10.1109/PIMRC.2014.7136368\">10.1109/PIMRC.2014.7136368</a>","mla":"Auroux, Sebastien, and Holger Karl. “Flow Processing-Aware Controller Placement in Wireless DenseNets.” <i>25th IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communication, {PIMRC} 2014, Washington DC, USA, September 2-5, 2014</i>, 2014, pp. 1294--1299, doi:<a href=\"https://doi.org/10.1109/PIMRC.2014.7136368\">10.1109/PIMRC.2014.7136368</a>."},"ec_funded":"1","project":[{"_id":"22","grant_number":"318115","name":"Connectivity management for eneRgy Optimised Wireless Dense works","call_identifier":"FP7-ICT-2011-C"}],"page":"1294--1299","_id":"760","user_id":"15572","doi":"10.1109/PIMRC.2014.7136368","title":"Flow processing-aware controller placement in wireless DenseNets","status":"public","year":"2014","author":[{"full_name":"Auroux, Sebastien","first_name":"Sebastien","last_name":"Auroux"},{"last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger","id":"126"}],"date_updated":"2022-01-06T07:03:40Z"},{"type":"conference","department":[{"_id":"75"}],"file":[{"file_id":"5249","content_type":"application/pdf","relation":"main_file","date_updated":"2018-11-02T13:32:48Z","file_name":"p115-schwabe.pdf","access_level":"closed","file_size":1349578,"date_created":"2018-11-02T13:32:48Z","creator":"ups"}],"date_created":"2017-11-27T10:22:25Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A2","_id":"6"}],"publication":"Proceedings of the third workshop on Hot topics in software defined networking, HotSDN '14, Chicago, Illinois, USA, August 22, 2014","file_date_updated":"2018-11-02T13:32:48Z","citation":{"ama":"Schwabe A, Karl H. Using MAC addresses as efficient routing labels in data centers. In: <i>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>. ; 2014:115--120. doi:<a href=\"https://doi.org/10.1145/2620728.2620730\">10.1145/2620728.2620730</a>","bibtex":"@inproceedings{Schwabe_Karl_2014, title={Using MAC addresses as efficient routing labels in data centers}, DOI={<a href=\"https://doi.org/10.1145/2620728.2620730\">10.1145/2620728.2620730</a>}, booktitle={Proceedings of the third workshop on Hot topics in software defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014}, author={Schwabe, Arne and Karl, Holger}, year={2014}, pages={115--120} }","mla":"Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing Labels in Data Centers.” <i>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>, 2014, pp. 115--120, doi:<a href=\"https://doi.org/10.1145/2620728.2620730\">10.1145/2620728.2620730</a>.","chicago":"Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing Labels in Data Centers.” In <i>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>, 115--120, 2014. <a href=\"https://doi.org/10.1145/2620728.2620730\">https://doi.org/10.1145/2620728.2620730</a>.","short":"A. Schwabe, H. Karl, in: Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014, 2014, pp. 115--120.","apa":"Schwabe, A., &#38; Karl, H. (2014). Using MAC addresses as efficient routing labels in data centers. In <i>Proceedings of the third workshop on Hot topics in software defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i> (pp. 115--120). <a href=\"https://doi.org/10.1145/2620728.2620730\">https://doi.org/10.1145/2620728.2620730</a>","ieee":"A. Schwabe and H. Karl, “Using MAC addresses as efficient routing labels in data centers,” in <i>Proceedings of the third workshop on Hot topics in software defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>, 2014, pp. 115--120."},"ddc":["004"],"doi":"10.1145/2620728.2620730","user_id":"477","page":"115--120","_id":"762","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:41Z","has_accepted_license":"1","title":"Using MAC addresses as efficient routing labels in data centers","status":"public","year":"2014","author":[{"first_name":"Arne","last_name":"Schwabe","full_name":"Schwabe, Arne"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"}]},{"publication":"22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014","citation":{"ama":"Blanckenstein J, Karl H. Energy-efficient clock synchronization using wake-up receivers. In: <i>22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014</i>. ; 2014:408--413. doi:<a href=\"https://doi.org/10.1109/SOFTCOM.2014.7039090\">10.1109/SOFTCOM.2014.7039090</a>","bibtex":"@inproceedings{Blanckenstein_Karl_2014, title={Energy-efficient clock synchronization using wake-up receivers}, DOI={<a href=\"https://doi.org/10.1109/SOFTCOM.2014.7039090\">10.1109/SOFTCOM.2014.7039090</a>}, booktitle={22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014}, author={Blanckenstein, Johannes and Karl, Holger}, year={2014}, pages={408--413} }","mla":"Blanckenstein, Johannes, and Holger Karl. “Energy-Efficient Clock Synchronization Using Wake-up Receivers.” <i>22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014</i>, 2014, pp. 408--413, doi:<a href=\"https://doi.org/10.1109/SOFTCOM.2014.7039090\">10.1109/SOFTCOM.2014.7039090</a>.","chicago":"Blanckenstein, Johannes, and Holger Karl. “Energy-Efficient Clock Synchronization Using Wake-up Receivers.” In <i>22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014</i>, 408--413, 2014. <a href=\"https://doi.org/10.1109/SOFTCOM.2014.7039090\">https://doi.org/10.1109/SOFTCOM.2014.7039090</a>.","short":"J. Blanckenstein, H. Karl, in: 22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014, 2014, pp. 408--413.","apa":"Blanckenstein, J., &#38; Karl, H. (2014). Energy-efficient clock synchronization using wake-up receivers. In <i>22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014</i> (pp. 408--413). <a href=\"https://doi.org/10.1109/SOFTCOM.2014.7039090\">https://doi.org/10.1109/SOFTCOM.2014.7039090</a>","ieee":"J. Blanckenstein and H. Karl, “Energy-efficient clock synchronization using wake-up receivers,” in <i>22nd International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2014, Split, Croatia, September 17-19, 2014</i>, 2014, pp. 408--413."},"type":"conference","department":[{"_id":"75"}],"date_created":"2017-11-27T10:22:25Z","date_updated":"2022-01-06T07:03:41Z","title":"Energy-efficient clock synchronization using wake-up receivers","status":"public","year":"2014","author":[{"full_name":"Blanckenstein, Johannes","first_name":"Johannes","last_name":"Blanckenstein"},{"full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl","id":"126"}],"doi":"10.1109/SOFTCOM.2014.7039090","user_id":"15572","page":"408--413","_id":"763"},{"user_id":"15572","doi":"10.1109/WiMOB.2014.6962195","_id":"765","page":"359--364","date_updated":"2022-01-06T07:03:43Z","author":[{"first_name":"Frederic","last_name":"Beister","full_name":"Beister, Frederic"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"}],"title":"Predicting mobile video inter-download times with Hidden Markov Models","status":"public","year":"2014","department":[{"_id":"75"}],"type":"conference","date_created":"2017-11-27T10:22:25Z","citation":{"ieee":"F. Beister and H. Karl, “Predicting mobile video inter-download times with Hidden Markov Models,” in <i>IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus, October 8-10, 2014</i>, 2014, pp. 359--364.","apa":"Beister, F., &#38; Karl, H. (2014). Predicting mobile video inter-download times with Hidden Markov Models. In <i>IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus, October 8-10, 2014</i> (pp. 359--364). <a href=\"https://doi.org/10.1109/WiMOB.2014.6962195\">https://doi.org/10.1109/WiMOB.2014.6962195</a>","chicago":"Beister, Frederic, and Holger Karl. “Predicting Mobile Video Inter-Download Times with Hidden Markov Models.” In <i>IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus, October 8-10, 2014</i>, 359--364, 2014. <a href=\"https://doi.org/10.1109/WiMOB.2014.6962195\">https://doi.org/10.1109/WiMOB.2014.6962195</a>.","short":"F. Beister, H. Karl, in: IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus, October 8-10, 2014, 2014, pp. 359--364.","mla":"Beister, Frederic, and Holger Karl. “Predicting Mobile Video Inter-Download Times with Hidden Markov Models.” <i>IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus, October 8-10, 2014</i>, 2014, pp. 359--364, doi:<a href=\"https://doi.org/10.1109/WiMOB.2014.6962195\">10.1109/WiMOB.2014.6962195</a>.","bibtex":"@inproceedings{Beister_Karl_2014, title={Predicting mobile video inter-download times with Hidden Markov Models}, DOI={<a href=\"https://doi.org/10.1109/WiMOB.2014.6962195\">10.1109/WiMOB.2014.6962195</a>}, booktitle={IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus, October 8-10, 2014}, author={Beister, Frederic and Karl, Holger}, year={2014}, pages={359--364} }","ama":"Beister F, Karl H. Predicting mobile video inter-download times with Hidden Markov Models. In: <i>IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus, October 8-10, 2014</i>. ; 2014:359--364. doi:<a href=\"https://doi.org/10.1109/WiMOB.2014.6962195\">10.1109/WiMOB.2014.6962195</a>"},"publication":"IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2014, Larnaca, Cyprus, October 8-10, 2014"},{"date_updated":"2022-01-06T07:03:43Z","year":"2014","status":"public","title":"Specifying and Placing Chains of Virtual Network Functions","author":[{"full_name":"Mehraghdam, Sevil","last_name":"Mehraghdam","first_name":"Sevil"},{"first_name":"Matthias","last_name":"Keller","full_name":"Keller, Matthias"},{"full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl","id":"126"}],"user_id":"15572","_id":"766","publication":"CoRR","citation":{"apa":"Mehraghdam, S., Keller, M., &#38; Karl, H. (2014). Specifying and Placing Chains of Virtual Network Functions. <i>CoRR</i>.","ieee":"S. Mehraghdam, M. Keller, and H. Karl, “Specifying and Placing Chains of Virtual Network Functions,” <i>CoRR</i>. 2014.","chicago":"Mehraghdam, Sevil, Matthias Keller, and Holger Karl. “Specifying and Placing Chains of Virtual Network Functions.” <i>CoRR</i>, 2014.","short":"S. Mehraghdam, M. Keller, H. Karl, CoRR (2014).","mla":"Mehraghdam, Sevil, et al. “Specifying and Placing Chains of Virtual Network Functions.” <i>CoRR</i>, 2014.","ama":"Mehraghdam S, Keller M, Karl H. Specifying and Placing Chains of Virtual Network Functions. <i>CoRR</i>. 2014.","bibtex":"@article{Mehraghdam_Keller_Karl_2014, title={Specifying and Placing Chains of Virtual Network Functions}, journal={CoRR}, author={Mehraghdam, Sevil and Keller, Matthias and Karl, Holger}, year={2014} }"},"type":"preprint","department":[{"_id":"75"}],"date_created":"2017-11-27T10:22:25Z"},{"department":[{"_id":"75"}],"type":"preprint","date_created":"2017-11-27T10:22:25Z","citation":{"ieee":"P. Wette and H. Karl, “DCT<sup>2</sup>Gen: A Versatile TCP Traffic Generator for Data Centers,” <i>CoRR</i>. 2014.","apa":"Wette, P., &#38; Karl, H. (2014). DCT<sup>2</sup>Gen: A Versatile TCP Traffic Generator for Data Centers. <i>CoRR</i>.","chicago":"Wette, Philip, and Holger Karl. “DCT<sup>2</sup>Gen: A Versatile TCP Traffic Generator for Data Centers.” <i>CoRR</i>, 2014.","short":"P. Wette, H. Karl, CoRR (2014).","mla":"Wette, Philip, and Holger Karl. “DCT<sup>2</sup>Gen: A Versatile TCP Traffic Generator for Data Centers.” <i>CoRR</i>, 2014.","bibtex":"@article{Wette_Karl_2014, title={DCT<sup>2</sup>Gen: A Versatile TCP Traffic Generator for Data Centers}, journal={CoRR}, author={Wette, Philip and Karl, Holger}, year={2014} }","ama":"Wette P, Karl H. DCT<sup>2</sup>Gen: A Versatile TCP Traffic Generator for Data Centers. <i>CoRR</i>. 2014."},"publication":"CoRR","user_id":"15572","_id":"767","date_updated":"2022-01-06T07:03:43Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl","id":"126"}],"title":"DCT²Gen: A Versatile TCP Traffic Generator for Data Centers","status":"public","year":"2014"},{"date_updated":"2022-01-06T07:03:43Z","author":[{"full_name":"Schwabe, Arne","first_name":"Arne","last_name":"Schwabe"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"title":"Adding Geographical Embedding to AS Topology Generation","status":"public","year":"2014","user_id":"15572","_id":"768","citation":{"ieee":"A. Schwabe and H. Karl, “Adding Geographical Embedding to AS Topology Generation,” <i>CoRR</i>. 2014.","apa":"Schwabe, A., &#38; Karl, H. (2014). Adding Geographical Embedding to AS Topology Generation. <i>CoRR</i>.","chicago":"Schwabe, Arne, and Holger Karl. “Adding Geographical Embedding to AS Topology Generation.” <i>CoRR</i>, 2014.","short":"A. Schwabe, H. Karl, CoRR (2014).","mla":"Schwabe, Arne, and Holger Karl. “Adding Geographical Embedding to AS Topology Generation.” <i>CoRR</i>, 2014.","bibtex":"@article{Schwabe_Karl_2014, title={Adding Geographical Embedding to AS Topology Generation}, journal={CoRR}, author={Schwabe, Arne and Karl, Holger}, year={2014} }","ama":"Schwabe A, Karl H. Adding Geographical Embedding to AS Topology Generation. <i>CoRR</i>. 2014."},"publication":"CoRR","department":[{"_id":"75"}],"type":"preprint","date_created":"2017-11-27T10:22:26Z"},{"type":"mastersthesis","department":[{"_id":"66"}],"date_created":"2019-04-08T07:37:33Z","extern":"1","citation":{"mla":"Jovanovikj, Ivan. <i>Detection and Resolution of Data-Flow Differences in Business Process Models</i>. 2014.","bibtex":"@book{Jovanovikj_2014, title={Detection and Resolution of Data-Flow Differences in Business Process Models}, author={Jovanovikj, Ivan}, year={2014} }","ama":"Jovanovikj I. <i>Detection and Resolution of Data-Flow Differences in Business Process Models</i>.; 2014.","ieee":"I. Jovanovikj, <i>Detection and Resolution of Data-Flow Differences in Business Process Models</i>. 2014.","apa":"Jovanovikj, I. (2014). <i>Detection and Resolution of Data-Flow Differences in Business Process Models</i>.","short":"I. Jovanovikj, Detection and Resolution of Data-Flow Differences in Business Process Models, 2014.","chicago":"Jovanovikj, Ivan. <i>Detection and Resolution of Data-Flow Differences in Business Process Models</i>, 2014."},"supervisor":[{"full_name":"Gerth, Christian","first_name":"Christian","last_name":"Gerth"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"}],"user_id":"39187","language":[{"iso":"eng"}],"_id":"8842","date_updated":"2022-01-06T07:04:03Z","title":"Detection and Resolution of Data-Flow Differences in Business Process Models","status":"public","year":"2014","author":[{"full_name":"Jovanovikj, Ivan","first_name":"Ivan","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X","id":"39187"}]},{"abstract":[{"text":"A fundamental problem for peer-to-peer systems is to maintain connectivity while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer system are excluded from the overlay network without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state initially. Surprisingly, the problem is not formally studied yet for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) ) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation if necessary. We show that there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous message passing model. To allow a solution, we introduce an oracle called NIDEC and show that it is sufficient even for the asynchronous message passing model by proposing an algorithm that can solve the FDP using NIDEC. We also show that a solution to the FSP does not require an oracle.","lang":"eng"}],"publication":"Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems","type":"conference","department":[{"_id":"79"}],"file":[{"creator":"florida","date_created":"2018-03-20T07:00:28Z","relation":"main_file","date_updated":"2018-03-20T07:00:28Z","file_name":"393-departures.pdf","access_level":"closed","file_size":287539,"file_id":"1384","content_type":"application/pdf","success":1}],"date_created":"2017-10-17T12:42:08Z","date_updated":"2022-01-06T06:59:56Z","title":"On Stabilizing Departures in Overlay Networks","year":"2014","author":[{"full_name":"Foreback, Dianne","first_name":"Dianne","last_name":"Foreback"},{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"last_name":"Nesterenko","first_name":"Mikhail","full_name":"Nesterenko, Mikhail"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319"}],"doi":"10.1007/978-3-319-11764-5_4","series_title":"LNCS","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-20T07:00:28Z","citation":{"bibtex":"@inproceedings{Foreback_Koutsopoulos_Nesterenko_Scheideler_Strothmann_2014, series={LNCS}, title={On Stabilizing Departures in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">10.1007/978-3-319-11764-5_4</a>}, booktitle={Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems}, author={Foreback, Dianne and Koutsopoulos, Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim Frederik}, year={2014}, pages={48--62}, collection={LNCS} }","ama":"Foreback D, Koutsopoulos A, Nesterenko M, Scheideler C, Strothmann TF. On Stabilizing Departures in Overlay Networks. In: <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>. LNCS. ; 2014:48--62. doi:<a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">10.1007/978-3-319-11764-5_4</a>","mla":"Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 2014, pp. 48--62, doi:<a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">10.1007/978-3-319-11764-5_4</a>.","chicago":"Foreback, Dianne, Andreas Koutsopoulos, Mikhail Nesterenko, Christian Scheideler, and Thim Frederik Strothmann. “On Stabilizing Departures in Overlay Networks.” In <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 48--62. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">https://doi.org/10.1007/978-3-319-11764-5_4</a>.","short":"D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, T.F. Strothmann, in: Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62.","ieee":"D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. F. Strothmann, “On Stabilizing Departures in Overlay Networks,” in <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 2014, pp. 48--62.","apa":"Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., &#38; Strothmann, T. F. (2014). On Stabilizing Departures in Overlay Networks. In <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i> (pp. 48--62). <a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">https://doi.org/10.1007/978-3-319-11764-5_4</a>"},"has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"page":"48--62","_id":"393"},{"department":[{"_id":"66"}],"type":"conference","date_created":"2017-10-17T12:42:08Z","file":[{"creator":"florida","date_created":"2018-03-20T06:59:55Z","date_updated":"2018-03-20T06:59:55Z","relation":"main_file","file_size":1107805,"access_level":"closed","file_name":"394-SGHE14.pdf","success":1,"content_type":"application/pdf","file_id":"1383"}],"abstract":[{"text":"Service Oriented Architectures (SOAs) enable the reuse and substitution of software services to develop highly flexible software systems. To benefit from the growing plethora of available services, sophisticated service discovery approaches are needed that bring service requests and offers together. Such approaches rely on rich service descriptions, which specify also the behavior of provided/requested services, e.g., by pre- and postconditions of operations. As a base for the specification a data schema is used, which specifies the used data types and their relations. However, data schemas are typically heterogeneous wrt. their structure and terminology, since they are created individually in their diverse application contexts. As a consequence the behavioral models that are typed over the heterogeneous data schemas, cannot be compared directly. In this paper, we present an holistic approach to normalize rich service description models to enable behavior-aware service discovery. The approach consists of a matching algorithm that helps to resolve structural and terminological heterogeneity in data schemas by exploiting domain-specific background ontologies. The resulting data schema mappings are represented in terms of Query View Transformation (QVT) relations that even reflect complex n:m correspondences. By executing the transformation, behavioral models are automatically normalized, which is a prerequisite for a behavior-aware operation matching.","lang":"eng"}],"publication":"Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)","doi":"10.1007/978-3-319-09195-2_12","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:58Z","author":[{"id":"13235","full_name":"Schwichtenberg, Simon","first_name":"Simon","last_name":"Schwichtenberg"},{"last_name":"Gerth","first_name":"Christian","full_name":"Gerth, Christian"},{"full_name":"Huma, Zille","first_name":"Zille","last_name":"Huma"},{"id":"107","last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor"}],"title":"Normalizing Heterogeneous Service Description Models with Generated QVT Transformations","year":"2014","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"bibtex":"@inproceedings{Schwichtenberg_Gerth_Huma_Engels_2014, series={LNCS}, title={Normalizing Heterogeneous Service Description Models with Generated QVT Transformations}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-09195-2_12\">10.1007/978-3-319-09195-2_12</a>}, booktitle={Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)}, author={Schwichtenberg, Simon and Gerth, Christian and Huma, Zille and Engels, Gregor}, year={2014}, pages={180–195}, collection={LNCS} }","ama":"Schwichtenberg S, Gerth C, Huma Z, Engels G. Normalizing Heterogeneous Service Description Models with Generated QVT Transformations. In: <i>Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)</i>. LNCS. ; 2014:180-195. doi:<a href=\"https://doi.org/10.1007/978-3-319-09195-2_12\">10.1007/978-3-319-09195-2_12</a>","mla":"Schwichtenberg, Simon, et al. “Normalizing Heterogeneous Service Description Models with Generated QVT Transformations.” <i>Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)</i>, 2014, pp. 180–95, doi:<a href=\"https://doi.org/10.1007/978-3-319-09195-2_12\">10.1007/978-3-319-09195-2_12</a>.","chicago":"Schwichtenberg, Simon, Christian Gerth, Zille Huma, and Gregor Engels. “Normalizing Heterogeneous Service Description Models with Generated QVT Transformations.” In <i>Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)</i>, 180–95. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-09195-2_12\">https://doi.org/10.1007/978-3-319-09195-2_12</a>.","short":"S. Schwichtenberg, C. Gerth, Z. Huma, G. Engels, in: Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA), 2014, pp. 180–195.","ieee":"S. Schwichtenberg, C. Gerth, Z. Huma, and G. Engels, “Normalizing Heterogeneous Service Description Models with Generated QVT Transformations,” in <i>Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)</i>, 2014, pp. 180–195.","apa":"Schwichtenberg, S., Gerth, C., Huma, Z., &#38; Engels, G. (2014). Normalizing Heterogeneous Service Description Models with Generated QVT Transformations. In <i>Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)</i> (pp. 180–195). <a href=\"https://doi.org/10.1007/978-3-319-09195-2_12\">https://doi.org/10.1007/978-3-319-09195-2_12</a>"},"file_date_updated":"2018-03-20T06:59:55Z","user_id":"477","ddc":["040"],"_id":"394","page":"180-195","has_accepted_license":"1","status":"public"},{"has_accepted_license":"1","status":"public","user_id":"15415","ddc":["040"],"page":"435-440","_id":"395","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-20T06:59:20Z","citation":{"apa":"Abshoff, S., Cord-Landwehr, A., Jung, D., &#38; Skopalik, A. (2014). Multilevel Network Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 435–440). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">https://doi.org/10.1007/978-3-319-13129-0_36</a>","ieee":"S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 435–440.","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Multilevel Network Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 435–40. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">https://doi.org/10.1007/978-3-319-13129-0_36</a>.","short":"S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–440.","mla":"Abshoff, Sebastian, et al. “Multilevel Network Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 435–40, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>.","ama":"Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:435-440. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS}, title={Multilevel Network Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}, year={2014}, pages={435–440}, collection={LNCS} }"},"date_updated":"2022-01-06T06:59:59Z","title":"Multilevel Network Games","year":"2014","author":[{"first_name":"Sebastian","last_name":"Abshoff","full_name":"Abshoff, Sebastian"},{"full_name":"Cord-Landwehr, Andreas","first_name":"Andreas","last_name":"Cord-Landwehr"},{"last_name":"Jung","first_name":"Daniel","full_name":"Jung, Daniel","id":"37827"},{"full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander","id":"40384"}],"doi":"10.1007/978-3-319-13129-0_36","series_title":"LNCS","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We consider a multilevel network game, where nodes can improvetheir communication costs by connecting to a high-speed network.The n nodes are connected by a static network and each node can decideindividually to become a gateway to the high-speed network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game) ormaximum (MAX-game) of communication distances from v to all othernodes plus a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication distance is 0, and gateways also improve othernodes’ distances by behaving as shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1)) the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game, weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1. Given a graph with girth of at least 4α, equilibria always exist.Concerning the dynamics, both games are not potential games. For theSUM-game, we even show that it is not weakly acyclic."}],"publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","type":"conference","department":[{"_id":"63"},{"_id":"541"}],"file":[{"creator":"florida","date_created":"2018-03-20T06:59:20Z","access_level":"closed","file_size":161479,"file_name":"395-WINE2014ACJS.pdf","date_updated":"2018-03-20T06:59:20Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1382"}],"date_created":"2017-10-17T12:42:09Z"},{"citation":{"ama":"Scheideler C, Eikel M, Setzer A. Minimum Linear Arrangement of Series-Parallel Graphs. In: <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>. LNCS. ; 2014:168--180.","bibtex":"@inproceedings{Scheideler_Eikel_Setzer_2014, series={LNCS}, title={Minimum Linear Arrangement of Series-Parallel Graphs}, booktitle={Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)}, author={Scheideler, Christian and Eikel, Martina and Setzer, Alexander}, year={2014}, pages={168--180}, collection={LNCS} }","mla":"Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel Graphs.” <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2014, pp. 168--180.","short":"C. Scheideler, M. Eikel, A. Setzer, in: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.","chicago":"Scheideler, Christian, Martina Eikel, and Alexander Setzer. “Minimum Linear Arrangement of Series-Parallel Graphs.” In <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>, 168--180. LNCS, 2014.","apa":"Scheideler, C., Eikel, M., &#38; Setzer, A. (2014). Minimum Linear Arrangement of Series-Parallel Graphs. In <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i> (pp. 168--180).","ieee":"C. Scheideler, M. Eikel, and A. Setzer, “Minimum Linear Arrangement of Series-Parallel Graphs,” in <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2014, pp. 168--180."},"file_date_updated":"2018-03-20T06:58:44Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"397","page":"168--180","ddc":["040"],"user_id":"15504","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:09Z","file":[{"content_type":"application/pdf","success":1,"file_id":"1381","date_updated":"2018-03-20T06:58:44Z","relation":"main_file","file_size":365818,"access_level":"closed","file_name":"397-WAOA14_01.pdf","date_created":"2018-03-20T06:58:44Z","creator":"florida"}],"department":[{"_id":"79"}],"type":"conference","publication":"Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)","abstract":[{"text":"We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach allows for an effective parallelization. Note that a suitable decomposition can also be computed in time $O(|E|\\log{|E|})$ (or even $O(\\log{|E|}\\log^*{|E|})$ on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation ratio, we use a sophisticated charging method that uses techniques similar to amortized analysis in advanced data structures. On general graphs, the minimum linear arrangement problem is known to be NP-hard. To the best of our knowledge, the minimum linear arrangement problem on series-parallel graphs has not been studied before.","lang":"eng"}],"series_title":"LNCS","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Eikel, Martina","last_name":"Eikel","first_name":"Martina"},{"first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108"}],"title":"Minimum Linear Arrangement of Series-Parallel Graphs","year":"2014","date_updated":"2022-01-06T07:00:02Z"},{"abstract":[{"text":"Ensuring memory access security is a challenge for reconfigurable systems with multiple cores. Previous work introduced access monitors attached to the memory subsystem to ensure that the cores adhere to pre-defined protocols when accessing memory. In this paper, we combine access monitors with a formal runtime verification technique known as proof-carrying hardware to guarantee memory security. We extend previous work on proof-carrying hardware by covering sequential circuits and demonstrate our approach with a prototype leveraging ReconOS/Zynq with an embedded ZUMA virtual FPGA overlay. Experiments show the feasibility of the approach and the capabilities of the prototype, which constitutes the first realization of proof-carrying hardware on real FPGAs. The area overheads for the virtual FPGA are measured as 2x-10x, depending on the resource type. The delay overhead is substantial with almost 100x, but this is an extremely pessimistic estimate that will be lowered once accurate timing analysis for FPGA overlays become available. Finally, reconfiguration time for the virtual FPGA is about one order of magnitude lower than for the native Zynq fabric.","lang":"eng"}],"publication":"Proceedings of the International Conference on Field-Programmable Technology (FPT)","department":[{"_id":"78"}],"type":"conference","date_created":"2017-10-17T12:42:09Z","file":[{"file_name":"399-wiersema14_fpt_IEEE_approved.pdf","file_size":404328,"access_level":"closed","relation":"main_file","date_updated":"2018-03-20T06:57:44Z","file_id":"1380","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-20T06:57:44Z"}],"date_updated":"2022-01-06T07:00:05Z","author":[{"id":"3118","full_name":"Wiersema, Tobias","first_name":"Tobias","last_name":"Wiersema"},{"full_name":"Drzevitzky, Stephanie","last_name":"Drzevitzky","first_name":"Stephanie"},{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"}],"title":"Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring","year":"2014","doi":"10.1109/FPT.2014.7082771","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"ama":"Wiersema T, Drzevitzky S, Platzner M. Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring. In: <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>. ; 2014:167-174. doi:<a href=\"https://doi.org/10.1109/FPT.2014.7082771\">10.1109/FPT.2014.7082771</a>","bibtex":"@inproceedings{Wiersema_Drzevitzky_Platzner_2014, title={Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring}, DOI={<a href=\"https://doi.org/10.1109/FPT.2014.7082771\">10.1109/FPT.2014.7082771</a>}, booktitle={Proceedings of the International Conference on Field-Programmable Technology (FPT)}, author={Wiersema, Tobias and Drzevitzky, Stephanie and Platzner, Marco}, year={2014}, pages={167–174} }","mla":"Wiersema, Tobias, et al. “Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring.” <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, 2014, pp. 167–74, doi:<a href=\"https://doi.org/10.1109/FPT.2014.7082771\">10.1109/FPT.2014.7082771</a>.","chicago":"Wiersema, Tobias, Stephanie Drzevitzky, and Marco Platzner. “Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring.” In <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, 167–74, 2014. <a href=\"https://doi.org/10.1109/FPT.2014.7082771\">https://doi.org/10.1109/FPT.2014.7082771</a>.","short":"T. Wiersema, S. Drzevitzky, M. Platzner, in: Proceedings of the International Conference on Field-Programmable Technology (FPT), 2014, pp. 167–174.","apa":"Wiersema, T., Drzevitzky, S., &#38; Platzner, M. (2014). Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring. In <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i> (pp. 167–174). <a href=\"https://doi.org/10.1109/FPT.2014.7082771\">https://doi.org/10.1109/FPT.2014.7082771</a>","ieee":"T. Wiersema, S. Drzevitzky, and M. Platzner, “Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring,” in <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, 2014, pp. 167–174."},"file_date_updated":"2018-03-20T06:57:44Z","has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"_id":"399","page":"167-174"},{"file":[{"success":1,"content_type":"application/pdf","file_id":"1367","date_updated":"2018-03-16T11:38:13Z","relation":"main_file","file_size":396656,"access_level":"closed","file_name":"401-WAS4FI2014.pdf","date_created":"2018-03-16T11:38:13Z","creator":"florida"}],"date_created":"2017-10-17T12:42:10Z","type":"conference","department":[{"_id":"66"},{"_id":"76"}],"publication":"Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet","abstract":[{"lang":"eng","text":"Service matching approaches determine to what extent a provided service matches a requester's requirements. This process is based on service specifications describing functional (e.g., signatures) as well as non-functional properties (e.g., privacy policies). However, we cannot expect service specifications to be complete as providers do not want to share all details of their services' implementation. Moreover, creating complete specifications requires much effort. In this paper, we propose a novel service matching approach taking into account a service's signatures and privacy policies. In particular, our approach applies fuzzy matching techniques that are able to deal with incomplete service specifications. As a benefit, decision-making based on matching results is improved and service matching becomes better applicable in practice."}],"series_title":"Communications in Computer and Information Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-14886-1_2","year":"2014","title":"Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching","author":[{"full_name":"Platenius, Marie Christin","last_name":"Platenius","first_name":"Marie Christin"},{"full_name":"Arifulina, Svetlana","first_name":"Svetlana","last_name":"Arifulina"},{"full_name":"Petrlic, Ronald","last_name":"Petrlic","first_name":"Ronald"},{"full_name":"Schäfer, Wilhelm","first_name":"Wilhelm","last_name":"Schäfer"}],"date_updated":"2022-01-06T07:00:07Z","file_date_updated":"2018-03-16T11:38:13Z","citation":{"apa":"Platenius, M. C., Arifulina, S., Petrlic, R., &#38; Schäfer, W. (2014). Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching. In <i>Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet</i> (pp. 6–17). <a href=\"https://doi.org/10.1007/978-3-319-14886-1_2\">https://doi.org/10.1007/978-3-319-14886-1_2</a>","ieee":"M. C. Platenius, S. Arifulina, R. Petrlic, and W. Schäfer, “Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching,” in <i>Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet</i>, 2014, pp. 6–17.","chicago":"Platenius, Marie Christin, Svetlana Arifulina, Ronald Petrlic, and Wilhelm Schäfer. “Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching.” In <i>Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet</i>, 6–17. Communications in Computer and Information Science, 2014. <a href=\"https://doi.org/10.1007/978-3-319-14886-1_2\">https://doi.org/10.1007/978-3-319-14886-1_2</a>.","short":"M.C. Platenius, S. Arifulina, R. Petrlic, W. Schäfer, in: Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet, 2014, pp. 6–17.","mla":"Platenius, Marie Christin, et al. “Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching.” <i>Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet</i>, 2014, pp. 6–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-14886-1_2\">10.1007/978-3-319-14886-1_2</a>.","ama":"Platenius MC, Arifulina S, Petrlic R, Schäfer W. Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching. In: <i>Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet</i>. Communications in Computer and Information Science. ; 2014:6-17. doi:<a href=\"https://doi.org/10.1007/978-3-319-14886-1_2\">10.1007/978-3-319-14886-1_2</a>","bibtex":"@inproceedings{Platenius_Arifulina_Petrlic_Schäfer_2014, series={Communications in Computer and Information Science}, title={Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14886-1_2\">10.1007/978-3-319-14886-1_2</a>}, booktitle={Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet}, author={Platenius, Marie Christin and Arifulina, Svetlana and Petrlic, Ronald and Schäfer, Wilhelm}, year={2014}, pages={6–17}, collection={Communications in Computer and Information Science} }"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"page":"6-17","_id":"401","ddc":["040"],"user_id":"477","status":"public","has_accepted_license":"1"},{"page":"543-550","_id":"402","user_id":"477","ddc":["040"],"editor":[{"full_name":"Franch, Xavier","first_name":"Xavier","last_name":"Franch"},{"first_name":"AdityaK.","last_name":"Ghose","full_name":"Ghose, AdityaK."},{"full_name":"Lewis, GraceA.","last_name":"Lewis","first_name":"GraceA."},{"last_name":"Bhiri","first_name":"Sami","full_name":"Bhiri, Sami"}],"status":"public","has_accepted_license":"1","file_date_updated":"2018-03-16T11:38:59Z","citation":{"apa":"Arifulina, S., Platenius, M. C., Gerth, C., Becker, S., Engels, G., &#38; Schäfer, W. (2014). Market-optimized Service Specification and Matching. In X. Franch, A. Ghose, G. Lewis, &#38; S. Bhiri (Eds.), <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)</i> (pp. 543–550). <a href=\"https://doi.org/10.1007/978-3-662-45391-9_47\">https://doi.org/10.1007/978-3-662-45391-9_47</a>","ieee":"S. Arifulina, M. C. Platenius, C. Gerth, S. Becker, G. Engels, and W. Schäfer, “Market-optimized Service Specification and Matching,” in <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)</i>, 2014, pp. 543–550.","short":"S. Arifulina, M.C. Platenius, C. Gerth, S. Becker, G. Engels, W. Schäfer, in: X. Franch, A. Ghose, G. Lewis, S. Bhiri (Eds.), Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014), 2014, pp. 543–550.","chicago":"Arifulina, Svetlana, Marie Christin Platenius, Christian Gerth, Steffen Becker, Gregor Engels, and Wilhelm Schäfer. “Market-Optimized Service Specification and Matching.” In <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)</i>, edited by Xavier Franch, AdityaK. Ghose, GraceA. Lewis, and Sami Bhiri, 543–50. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-662-45391-9_47\">https://doi.org/10.1007/978-3-662-45391-9_47</a>.","mla":"Arifulina, Svetlana, et al. “Market-Optimized Service Specification and Matching.” <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)</i>, edited by Xavier Franch et al., 2014, pp. 543–50, doi:<a href=\"https://doi.org/10.1007/978-3-662-45391-9_47\">10.1007/978-3-662-45391-9_47</a>.","ama":"Arifulina S, Platenius MC, Gerth C, Becker S, Engels G, Schäfer W. Market-optimized Service Specification and Matching. In: Franch X, Ghose A, Lewis G, Bhiri S, eds. <i>Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)</i>. LNCS. ; 2014:543-550. doi:<a href=\"https://doi.org/10.1007/978-3-662-45391-9_47\">10.1007/978-3-662-45391-9_47</a>","bibtex":"@inproceedings{Arifulina_Platenius_Gerth_Becker_Engels_Schäfer_2014, series={LNCS}, title={Market-optimized Service Specification and Matching}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-45391-9_47\">10.1007/978-3-662-45391-9_47</a>}, booktitle={Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)}, author={Arifulina, Svetlana and Platenius, Marie Christin and Gerth, Christian and Becker, Steffen and Engels, Gregor and Schäfer, Wilhelm}, editor={Franch, Xavier and Ghose, AdityaK. and Lewis, GraceA. and Bhiri, SamiEditors}, year={2014}, pages={543–550}, collection={LNCS} }"},"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-662-45391-9_47","title":"Market-optimized Service Specification and Matching","year":"2014","author":[{"full_name":"Arifulina, Svetlana","last_name":"Arifulina","first_name":"Svetlana"},{"full_name":"Platenius, Marie Christin","first_name":"Marie Christin","last_name":"Platenius"},{"last_name":"Gerth","first_name":"Christian","full_name":"Gerth, Christian"},{"last_name":"Becker","first_name":"Steffen","full_name":"Becker, Steffen"},{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"},{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"}],"date_updated":"2022-01-06T07:00:07Z","file":[{"relation":"main_file","date_updated":"2018-03-16T11:38:59Z","file_name":"402-ICSOC2014.pdf","access_level":"closed","file_size":377432,"file_id":"1368","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-16T11:38:59Z"}],"date_created":"2017-10-17T12:42:10Z","type":"conference","department":[{"_id":"66"},{"_id":"76"}],"publication":"Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)","abstract":[{"text":"Various approaches in service engineering are based on servicemarkets where brokers use service matching in order to performservice discovery. For matching, a broker translates the specifications ofproviders' services and requesters' requirements into her own specificationlanguage, in order to check their compliance using a matcher. Thebroker's success depends on the configuration of her language and itsmatcher because they in uence important properties like the effort forproviders and requesters to create suitable specifications as well as accuracyand runtime of matching. However, neither existing service specification languages, nor existing matching approaches are optimized insuch way. Our approach automatically provides brokers with an optimalconfiguration of a language and its matcher to improve her success ina given market with respect to her strategy. The approach is based onformalized configuration properties and a predefined set of configurationrules.","lang":"eng"}]},{"_id":"408","page":"307-322","editor":[{"full_name":"Albert, Elvira","last_name":"Albert","first_name":"Elvira"},{"last_name":"Sekerinski","first_name":"Emil","full_name":"Sekerinski, Emil"}],"ddc":["040"],"user_id":"477","status":"public","has_accepted_license":"1","citation":{"ama":"Jakobs M-C, Platzner M, Wiersema T, Wehrheim H. Integrating Software and Hardware Verification. In: Albert E, Sekerinski E, eds. <i>Proceedings of the 11th International Conference on Integrated Formal Methods (IFM)</i>. LNCS. ; 2014:307-322. doi:<a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">10.1007/978-3-319-10181-1_19</a>","bibtex":"@inproceedings{Jakobs_Platzner_Wiersema_Wehrheim_2014, series={LNCS}, title={Integrating Software and Hardware Verification}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">10.1007/978-3-319-10181-1_19</a>}, booktitle={Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)}, author={Jakobs, Marie-Christine and Platzner, Marco and Wiersema, Tobias and Wehrheim, Heike}, editor={Albert, Elvira and Sekerinski, EmilEditors}, year={2014}, pages={307–322}, collection={LNCS} }","mla":"Jakobs, Marie-Christine, et al. “Integrating Software and Hardware Verification.” <i>Proceedings of the 11th International Conference on Integrated Formal Methods (IFM)</i>, edited by Elvira Albert and Emil Sekerinski, 2014, pp. 307–22, doi:<a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">10.1007/978-3-319-10181-1_19</a>.","short":"M.-C. Jakobs, M. Platzner, T. Wiersema, H. Wehrheim, in: E. Albert, E. Sekerinski (Eds.), Proceedings of the 11th International Conference on Integrated Formal Methods (IFM), 2014, pp. 307–322.","chicago":"Jakobs, Marie-Christine, Marco Platzner, Tobias Wiersema, and Heike Wehrheim. “Integrating Software and Hardware Verification.” In <i>Proceedings of the 11th International Conference on Integrated Formal Methods (IFM)</i>, edited by Elvira Albert and Emil Sekerinski, 307–22. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">https://doi.org/10.1007/978-3-319-10181-1_19</a>.","apa":"Jakobs, M.-C., Platzner, M., Wiersema, T., &#38; Wehrheim, H. (2014). Integrating Software and Hardware Verification. In E. Albert &#38; E. Sekerinski (Eds.), <i>Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)</i> (pp. 307–322). <a href=\"https://doi.org/10.1007/978-3-319-10181-1_19\">https://doi.org/10.1007/978-3-319-10181-1_19</a>","ieee":"M.-C. Jakobs, M. Platzner, T. Wiersema, and H. Wehrheim, “Integrating Software and Hardware Verification,” in <i>Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)</i>, 2014, pp. 307–322."},"file_date_updated":"2018-03-16T11:35:28Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-10181-1_19","author":[{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"},{"last_name":"Wiersema","first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"year":"2014","title":"Integrating Software and Hardware Verification","date_updated":"2022-01-06T07:00:14Z","date_created":"2017-10-17T12:42:11Z","file":[{"date_created":"2018-03-16T11:35:28Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"1364","file_size":561325,"access_level":"closed","file_name":"408-jakobs14_ifm.pdf","date_updated":"2018-03-16T11:35:28Z","relation":"main_file"}],"department":[{"_id":"77"},{"_id":"78"}],"type":"conference","publication":"Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)","abstract":[{"lang":"eng","text":"Verification of hardware and software usually proceeds separately, software analysis relying on the correctness of processors executing instructions. This assumption is valid as long as the software runs on standard CPUs that have been extensively validated and are in wide use. However, for processors exploiting custom instruction set extensions to meet performance and energy constraints the validation might be less extensive, challenging the correctness assumption.In this paper we present an approach for integrating software analyses with hardware verification, specifically targeting custom instruction set extensions. We propose three different techniques for deriving the properties to be proven for the hardware implementation of a custom instruction in order to support software analyses. The techniques are designed to explore the trade-off between generality and efficiency and span from proving functional equivalence over checking the rules of a particular analysis domain to verifying actual pre and post conditions resulting from program analysis. We demonstrate and compare the three techniques on example programs with custom instructions, using stateof-the-art software and hardware verification techniques."}]},{"series_title":"LNCS","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-09970-5_19","year":"2014","title":"Integrating Service Matchers into a Service Market Architecture","author":[{"last_name":"Platenius","first_name":"Marie Christin","full_name":"Platenius, Marie Christin"},{"full_name":"Becker, Steffen","first_name":"Steffen","last_name":"Becker"},{"last_name":"Schäfer","first_name":"Wilhelm","full_name":"Schäfer, Wilhelm"}],"date_updated":"2022-01-06T07:00:15Z","file":[{"date_created":"2018-03-16T11:34:58Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"1363","date_updated":"2018-03-16T11:34:58Z","relation":"main_file","access_level":"closed","file_size":395884,"file_name":"409-ecsa14.pdf"}],"date_created":"2017-10-17T12:42:11Z","type":"conference","department":[{"_id":"76"}],"publication":"Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)","abstract":[{"lang":"eng","text":"Service markets provide software components in the formof services. In order to enable a service discovery that satisfies servicerequesters and providers best, markets need automatic service matching:approaches for comparing whether a provided service satisfies a servicerequest. Current markets, e.g., app markets, are limited to basic keywordbasedsearch although many better suitable matching approaches aredescribed in literature. However, necessary architectural decisions forthe integration of matchers have a huge impact on quality propertieslike performance or security.Architectural decisions wrt. servicematchers have rarely been discussed,yet, and systematic approaches for their integration into service marketsare missing. In this paper, we present a systematic integration approachincluding the definition of requirements and a discussion on architecturaltactics. As a benefit, the decision-making process of integrating servicematchers is supported and the overall market success can be improved."}],"page":"210-217","_id":"409","ddc":["040"],"user_id":"477","editor":[{"last_name":"Avgeriou","first_name":"Paris","full_name":"Avgeriou, Paris"},{"last_name":"Zdun","first_name":"Uwe","full_name":"Zdun, Uwe"}],"status":"public","has_accepted_license":"1","file_date_updated":"2018-03-16T11:34:58Z","citation":{"mla":"Platenius, Marie Christin, et al. “Integrating Service Matchers into a Service Market Architecture.” <i>Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)</i>, edited by Paris Avgeriou and Uwe Zdun, 2014, pp. 210–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-09970-5_19\">10.1007/978-3-319-09970-5_19</a>.","apa":"Platenius, M. C., Becker, S., &#38; Schäfer, W. (2014). Integrating Service Matchers into a Service Market Architecture. In P. Avgeriou &#38; U. Zdun (Eds.), <i>Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)</i> (pp. 210–217). <a href=\"https://doi.org/10.1007/978-3-319-09970-5_19\">https://doi.org/10.1007/978-3-319-09970-5_19</a>","ieee":"M. C. Platenius, S. Becker, and W. Schäfer, “Integrating Service Matchers into a Service Market Architecture,” in <i>Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)</i>, 2014, pp. 210–217.","chicago":"Platenius, Marie Christin, Steffen Becker, and Wilhelm Schäfer. “Integrating Service Matchers into a Service Market Architecture.” In <i>Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)</i>, edited by Paris Avgeriou and Uwe Zdun, 210–17. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-09970-5_19\">https://doi.org/10.1007/978-3-319-09970-5_19</a>.","ama":"Platenius MC, Becker S, Schäfer W. Integrating Service Matchers into a Service Market Architecture. In: Avgeriou P, Zdun U, eds. <i>Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)</i>. LNCS. ; 2014:210-217. doi:<a href=\"https://doi.org/10.1007/978-3-319-09970-5_19\">10.1007/978-3-319-09970-5_19</a>","short":"M.C. Platenius, S. Becker, W. Schäfer, in: P. Avgeriou, U. Zdun (Eds.), Proceedings of the 8th European Conference on Software Architecture (ECSA 2014), 2014, pp. 210–217.","bibtex":"@inproceedings{Platenius_Becker_Schäfer_2014, series={LNCS}, title={Integrating Service Matchers into a Service Market Architecture}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-09970-5_19\">10.1007/978-3-319-09970-5_19</a>}, booktitle={Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)}, author={Platenius, Marie Christin and Becker, Steffen and Schäfer, Wilhelm}, editor={Avgeriou, Paris and Zdun, UweEditors}, year={2014}, pages={210–217}, collection={LNCS} }"},"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"date_updated":"2022-01-06T07:00:20Z","has_accepted_license":"1","status":"public","year":"2014","title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths","author":[{"id":"14052","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias","last_name":"Feldotto"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"}],"doi":"10.1109/P2P.2014.6934300","ddc":["040"],"user_id":"14052","page":"1-10","_id":"412","abstract":[{"text":"In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"publication":"Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)","file_date_updated":"2018-03-16T11:34:00Z","citation":{"apa":"Feldotto, M., Scheideler, C., &#38; Graffi, K. (2014). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i> (pp. 1–10). <a href=\"https://doi.org/10.1109/P2P.2014.6934300\">https://doi.org/10.1109/P2P.2014.6934300</a>","ieee":"M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths,” in <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 2014, pp. 1–10.","chicago":"Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 1–10, 2014. <a href=\"https://doi.org/10.1109/P2P.2014.6934300\">https://doi.org/10.1109/P2P.2014.6934300</a>.","short":"M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.","mla":"Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 2014, pp. 1–10, doi:<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>.","ama":"Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In: <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>. ; 2014:1-10. doi:<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>","bibtex":"@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>}, booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi, Kalman}, year={2014}, pages={1–10} }"},"type":"conference","department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"external_id":{"arxiv":["1408.0395"]},"file":[{"file_id":"1361","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-16T11:34:00Z","file_name":"412-FSG2014P2P.pdf","file_size":472321,"access_level":"closed","date_created":"2018-03-16T11:34:00Z","creator":"florida"}],"date_created":"2017-10-17T12:42:12Z"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"citation":{"short":"J. Jochheim, Hiding Software Components Using Functional Encryption, Universität Paderborn, 2014.","chicago":"Jochheim, Janek. <i>Hiding Software Components Using Functional Encryption</i>. Universität Paderborn, 2014.","ieee":"J. Jochheim, <i>Hiding software components using functional encryption</i>. Universität Paderborn, 2014.","apa":"Jochheim, J. (2014). <i>Hiding software components using functional encryption</i>. Universität Paderborn.","bibtex":"@book{Jochheim_2014, title={Hiding software components using functional encryption}, publisher={Universität Paderborn}, author={Jochheim, Janek}, year={2014} }","ama":"Jochheim J. <i>Hiding Software Components Using Functional Encryption</i>. Universität Paderborn; 2014.","mla":"Jochheim, Janek. <i>Hiding Software Components Using Functional Encryption</i>. Universität Paderborn, 2014."},"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"department":[{"_id":"64"}],"type":"mastersthesis","date_created":"2017-10-17T12:42:12Z","date_updated":"2022-01-06T07:00:23Z","author":[{"first_name":"Janek","last_name":"Jochheim","full_name":"Jochheim, Janek"}],"title":"Hiding software components using functional encryption","year":"2014","status":"public","user_id":"25078","publisher":"Universität Paderborn","_id":"414"}]