--- _id: '3874' citation: ama: Scheideler C, Fineman JT, eds. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM; 2018. apa: 'Scheideler, C., & Fineman, J. T. (Eds.). (2018). Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. Vienna, Austria: ACM.' bibtex: '@book{Scheideler_Fineman_2018, title={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures}, publisher={ACM}, year={2018} }' chicago: Scheideler, Christian, and Jeremy T. Fineman, eds. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018. ieee: C. Scheideler and J. T. Fineman, Eds., Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018. mla: Scheideler, Christian, and Jeremy T. Fineman, editors. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018. short: C. Scheideler, J.T. Fineman, eds., Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, ACM, 2018. conference: location: Vienna, Austria date_created: 2018-08-10T10:03:47Z date_updated: 2022-01-06T06:59:47Z department: - _id: '79' editor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Jeremy T. full_name: Fineman, Jeremy T. last_name: Fineman publication_identifier: isbn: - 978-1-4503-5799-9 publisher: ACM status: public title: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures type: conference_editor user_id: '15504' year: '2018' ... --- _id: '2965' author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Nils full_name: Löken, Nils id: '13703' last_name: Löken citation: ama: 'Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018. New York, NY, USA: ACM; :25:1--25:10. doi:10.1145/3230833.3230853' apa: 'Blömer, J., & Löken, N. (n.d.). Cloud Architectures for Searchable Encryption. In Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018 (pp. 25:1--25:10). New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3230853' bibtex: '@inproceedings{Blömer_Löken, place={New York, NY, USA}, title={Cloud Architectures for Searchable Encryption}, DOI={10.1145/3230833.3230853}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018}, publisher={ACM}, author={Blömer, Johannes and Löken, Nils}, pages={25:1--25:10} }' chicago: 'Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” In Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, 25:1--25:10. New York, NY, USA: ACM, n.d. https://doi.org/10.1145/3230833.3230853.' ieee: J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, Hamburg, Germany, pp. 25:1--25:10. mla: Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, pp. 25:1--25:10, doi:10.1145/3230833.3230853. short: 'J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10.' conference: location: Hamburg, Germany name: ARES 2018 date_created: 2018-06-04T11:33:15Z date_updated: 2022-01-06T06:58:49Z ddc: - '000' department: - _id: '64' - _id: '568' doi: 10.1145/3230833.3230853 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:39:46Z date_updated: 2018-11-02T14:39:46Z file_id: '5278' file_name: a25-Blomer.pdf file_size: 769807 relation: main_file success: 1 file_date_updated: 2018-11-02T14:39:46Z has_accepted_license: '1' language: - iso: eng page: 25:1--25:10 place: New York, NY, USA project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 publication: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018 publication_identifier: isbn: - 978-1-4503-6448-5 publication_status: accepted publisher: ACM quality_controlled: '1' status: public title: Cloud Architectures for Searchable Encryption type: conference user_id: '13703' year: '2018' ... --- _id: '3105' author: - first_name: David full_name: Derler, David last_name: Derler - first_name: Tibor full_name: Jager, Tibor id: '64669' last_name: Jager - first_name: Daniel full_name: Slamanig, Daniel last_name: Slamanig - first_name: Christoph full_name: Striecks, Christoph last_name: Striecks citation: ama: 'Derler D, Jager T, Slamanig D, Striecks C. Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange. In: Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III. ; 2018:425--455. doi:10.1007/978-3-319-78372-7_14' apa: Derler, D., Jager, T., Slamanig, D., & Striecks, C. (2018). Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange. In Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III (pp. 425--455). https://doi.org/10.1007/978-3-319-78372-7_14 bibtex: '@inproceedings{Derler_Jager_Slamanig_Striecks_2018, title={Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange}, DOI={10.1007/978-3-319-78372-7_14}, booktitle={Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III}, author={Derler, David and Jager, Tibor and Slamanig, Daniel and Striecks, Christoph}, year={2018}, pages={425--455} }' chicago: Derler, David, Tibor Jager, Daniel Slamanig, and Christoph Striecks. “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange.” In Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III, 425--455, 2018. https://doi.org/10.1007/978-3-319-78372-7_14. ieee: D. Derler, T. Jager, D. Slamanig, and C. Striecks, “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange,” in Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III, 2018, pp. 425--455. mla: Derler, David, et al. “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange.” Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III, 2018, pp. 425--455, doi:10.1007/978-3-319-78372-7_14. short: 'D. Derler, T. Jager, D. Slamanig, C. Striecks, in: Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III, 2018, pp. 425--455.' date_created: 2018-06-07T08:47:17Z date_updated: 2022-01-06T06:58:56Z ddc: - '006' department: - _id: '558' doi: 10.1007/978-3-319-78372-7_14 file: - access_level: closed content_type: application/pdf creator: abirke date_created: 2018-11-08T13:25:52Z date_updated: 2018-11-08T13:25:52Z file_id: '5453' file_name: 2018-199.pdf file_size: 533731 relation: main_file success: 1 file_date_updated: 2018-11-08T13:25:52Z has_accepted_license: '1' language: - iso: eng main_file_link: - url: https://eprint.iacr.org/2018/199.pdf page: 425--455 publication: Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III status: public title: Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange type: conference user_id: '38235' year: '2018' ... --- _id: '3152' abstract: - lang: eng text: To adapt to continuously changing workloads in networks, components of the running network services may need to be replicated (scaling the network service) and allocated to physical resources (placement) dynamically, also necessitating dynamic re-routing of flows between service components. In this paper, we propose JASPER, a fully automated approach to jointly optimizing scaling, placement, and routing for complex network services, consisting of multiple (virtualized) components. JASPER handles multiple network services that share the same substrate network; services can be dynamically added or removed and dynamic workload changes are handled. Our approach lets service designers specify their services on a high level of abstraction using service templates. JASPER automatically makes scaling, placement and routing decisions, enabling quick reaction to changes. We formalize the problem, analyze its complexity, and develop two algorithms to solve it. Extensive empirical results show the applicability and effectiveness of the proposed approach. article_type: original author: - first_name: Sevil full_name: Dräxler, Sevil id: '31764' last_name: Dräxler - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Zoltan Adam full_name: Mann, Zoltan Adam last_name: Mann citation: ama: 'Dräxler S, Karl H, Mann ZA. JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services. IEEE Transactions on Network and Service Management. 2018. doi:10.1109/TNSM.2018.2846572' apa: 'Dräxler, S., Karl, H., & Mann, Z. A. (2018). JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services. IEEE Transactions on Network and Service Management. https://doi.org/10.1109/TNSM.2018.2846572' bibtex: '@article{Dräxler_Karl_Mann_2018, title={JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services}, DOI={10.1109/TNSM.2018.2846572}, journal={IEEE Transactions on Network and Service Management}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}, year={2018} }' chicago: 'Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services.” IEEE Transactions on Network and Service Management, 2018. https://doi.org/10.1109/TNSM.2018.2846572.' ieee: 'S. Dräxler, H. Karl, and Z. A. Mann, “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services,” IEEE Transactions on Network and Service Management, 2018.' mla: 'Dräxler, Sevil, et al. “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services.” IEEE Transactions on Network and Service Management, IEEE, 2018, doi:10.1109/TNSM.2018.2846572.' short: S. Dräxler, H. Karl, Z.A. Mann, IEEE Transactions on Network and Service Management (2018). date_created: 2018-06-11T06:55:05Z date_updated: 2022-01-06T06:59:00Z ddc: - '000' department: - _id: '75' doi: 10.1109/TNSM.2018.2846572 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:25:49Z date_updated: 2018-11-02T15:25:49Z file_id: '5302' file_name: 08382313.pdf file_size: 1767054 relation: main_file success: 1 - access_level: open_access content_type: application/pdf creator: sevilmeh date_created: 2019-01-21T16:12:36Z date_updated: 2019-01-21T16:12:36Z file_id: '6950' file_name: TNSM2846572_RIS.pdf file_size: 2878350 relation: main_file file_date_updated: 2019-01-21T16:12:36Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.10839 oa: '1' project: - _id: '23' grant_number: '762057' name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 publication: IEEE Transactions on Network and Service Management publisher: IEEE status: public title: 'JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services' type: journal_article urn: '31522' user_id: '31764' year: '2018' ... --- _id: '3153' author: - first_name: Simon full_name: Doherty, Simon last_name: Doherty - first_name: John full_name: Derrick, John last_name: Derrick - first_name: Brijesh full_name: Dongol, Brijesh last_name: Dongol - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Doherty S, Derrick J, Dongol B, Wehrheim H. Causal Linearizability: Compositionality for Partially Ordered Executions. CoRR. 2018.' apa: 'Doherty, S., Derrick, J., Dongol, B., & Wehrheim, H. (2018). Causal Linearizability: Compositionality for Partially Ordered Executions. CoRR.' bibtex: '@article{Doherty_Derrick_Dongol_Wehrheim_2018, title={Causal Linearizability: Compositionality for Partially Ordered Executions}, journal={CoRR}, author={Doherty, Simon and Derrick, John and Dongol, Brijesh and Wehrheim, Heike}, year={2018} }' chicago: 'Doherty, Simon, John Derrick, Brijesh Dongol, and Heike Wehrheim. “Causal Linearizability: Compositionality for Partially Ordered Executions.” CoRR, 2018.' ieee: 'S. Doherty, J. Derrick, B. Dongol, and H. Wehrheim, “Causal Linearizability: Compositionality for Partially Ordered Executions,” CoRR, 2018.' mla: 'Doherty, Simon, et al. “Causal Linearizability: Compositionality for Partially Ordered Executions.” CoRR, 2018.' short: S. Doherty, J. Derrick, B. Dongol, H. Wehrheim, CoRR (2018). date_created: 2018-06-13T07:26:35Z date_updated: 2022-01-06T06:59:00Z department: - _id: '77' publication: CoRR status: public title: 'Causal Linearizability: Compositionality for Partially Ordered Executions' type: journal_article user_id: '29719' year: '2018' ... --- _id: '2711' abstract: - lang: eng text: "In recent years, researchers have developed a number of tools to conduct\r\ntaint analysis of Android applications. While all the respective papers aim at\r\nproviding a thorough empirical evaluation, comparability is hindered by varying\r\nor unclear evaluation targets. Sometimes, the apps used for evaluation are not\r\nprecisely described. In other cases, authors use an established benchmark but\r\ncover it only partially. In yet other cases, the evaluations differ in terms of\r\nthe data leaks searched for, or lack a ground truth to compare against. All\r\nthose limitations make it impossible to truly compare the tools based on those\r\npublished evaluations.\r\n We thus present ReproDroid, a framework allowing the accurate comparison of\r\nAndroid taint analysis tools. ReproDroid supports researchers in inferring the\r\nground truth for data leaks in apps, in automatically applying tools to\r\nbenchmarks, and in evaluating the obtained results. We use ReproDroid to\r\ncomparatively evaluate on equal grounds the six prominent taint analysis tools\r\nAmandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results are\r\nlargely positive although four tools violate some promises concerning features\r\nand accuracy. Finally, we contribute to the area of unbiased benchmarking with\r\na new and improved version of the open test suite DroidBench." author: - first_name: Felix full_name: Pauck, Felix id: '22398' last_name: Pauck - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: Pauck F, Bodden E, Wehrheim H. Do Android Taint Analysis Tools Keep their Promises? arXiv:180402903. 2018. apa: Pauck, F., Bodden, E., & Wehrheim, H. (2018). Do Android Taint Analysis Tools Keep their Promises? ArXiv:1804.02903. bibtex: '@article{Pauck_Bodden_Wehrheim_2018, title={Do Android Taint Analysis Tools Keep their Promises?}, journal={arXiv:1804.02903}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }' chicago: Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” ArXiv:1804.02903, 2018. ieee: F. Pauck, E. Bodden, and H. Wehrheim, “Do Android Taint Analysis Tools Keep their Promises?,” arXiv:1804.02903. 2018. mla: Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” ArXiv:1804.02903, 2018. short: F. Pauck, E. Bodden, H. Wehrheim, ArXiv:1804.02903 (2018). date_created: 2018-05-09T08:27:11Z date_updated: 2022-01-06T06:57:35Z ddc: - '000' department: - _id: '77' - _id: '76' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-11-21T10:49:23Z date_updated: 2018-11-21T10:49:23Z file_id: '5781' file_name: Do Android Taint Analysis Tools Keep their Promises.pdf file_size: 1045861 relation: main_file success: 1 file_date_updated: 2018-11-21T10:49:23Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 publication: arXiv:1804.02903 status: public title: Do Android Taint Analysis Tools Keep their Promises? type: preprint user_id: '477' year: '2018' ... --- _id: '1138' author: - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr citation: ama: Gmyr R. Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-265 apa: Gmyr, R. (2018). Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-265 bibtex: '@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and Programmable Matter}, DOI={10.17619/UNIPB/1-265}, publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }' chicago: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-265. ieee: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn, 2018. mla: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-265. short: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter, Universität Paderborn, 2018. date_created: 2018-01-31T06:04:03Z date_updated: 2022-01-06T06:51:00Z department: - _id: '79' doi: 10.17619/UNIPB/1-265 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subproject C1 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C - _id: '5' name: SFB 901 - Subproject A1 publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Distributed Algorithms for Overlay Networks and Programmable Matter type: dissertation user_id: '477' year: '2018' ... --- _id: '1163' abstract: - lang: eng text: "In this paper we present two major results:\r\nFirst, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.\r\n" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00114' apa: 'Feldmann, M., Kolb, C., Scheideler, C., & Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE. https://doi.org/10.1109/IPDPS.2018.00114' bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={10.1109/IPDPS.2018.00114}, booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }' chicago: Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00114. ieee: M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018. mla: Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114. short: 'M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.' conference: end_date: 2018-5-24 location: Vancouver name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS) start_date: 2018-5-22 date_created: 2018-02-01T13:56:01Z date_updated: 2022-01-06T06:51:05Z ddc: - '040' department: - _id: '79' - _id: '66' doi: 10.1109/IPDPS.2018.00114 external_id: arxiv: - '1710.08128' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2018-10-31T13:25:37Z date_updated: 2018-10-31T13:25:37Z file_id: '5211' file_name: 08425258.pdf file_size: 239559 relation: main_file success: 1 file_date_updated: 2018-10-31T13:25:37Z has_accepted_license: '1' keyword: - Topological Self-stabilization - Supervised Overlay - Publish-Subscribe System language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS) publisher: IEEE status: public title: Self-Stabilizing Supervised Publish-Subscribe Systems type: conference user_id: '11319' year: '2018' ... --- _id: '1164' abstract: - lang: eng text: "We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.\r\nOperations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests." author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00113' apa: 'Feldmann, M., Scheideler, C., & Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE. https://doi.org/10.1109/IPDPS.2018.00113' bibtex: '@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable and Sequentially Consistent Distributed Queue}, DOI={10.1109/IPDPS.2018.00113}, booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}, year={2018} }' chicago: 'Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00113.' ieee: 'M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.' mla: 'Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.' short: 'M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.' conference: end_date: 2018-5-24 location: Vancouver name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS) start_date: 2018-5-22 date_created: 2018-02-01T14:00:36Z date_updated: 2022-01-06T06:51:05Z ddc: - '040' department: - _id: '79' doi: 10.1109/IPDPS.2018.00113 external_id: arxiv: - '1802.07504' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2018-10-31T13:29:26Z date_updated: 2018-10-31T13:29:26Z file_id: '5212' file_name: 08425257.pdf file_size: 218420 relation: main_file success: 1 file_date_updated: 2018-10-31T13:29:26Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS) publisher: IEEE status: public title: 'Skueue: A Scalable and Sequentially Consistent Distributed Queue' type: conference user_id: '23538' year: '2018' ... --- _id: '1165' author: - first_name: Linus Matthias full_name: Witschen, Linus Matthias id: '49051' last_name: Witschen - first_name: Tobias full_name: Wiersema, Tobias id: '3118' last_name: Wiersema - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner citation: ama: Witschen LM, Wiersema T, Platzner M. Making the Case for Proof-carrying Approximate Circuits. 4th Workshop On Approximate Computing (WAPCO 2018). 2018. apa: Witschen, L. M., Wiersema, T., & Platzner, M. (2018). Making the Case for Proof-carrying Approximate Circuits. 4th Workshop On Approximate Computing (WAPCO 2018). bibtex: '@article{Witschen_Wiersema_Platzner_2018, title={Making the Case for Proof-carrying Approximate Circuits}, journal={4th Workshop On Approximate Computing (WAPCO 2018)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}, year={2018} }' chicago: Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Making the Case for Proof-Carrying Approximate Circuits.” 4th Workshop On Approximate Computing (WAPCO 2018), 2018. ieee: L. M. Witschen, T. Wiersema, and M. Platzner, “Making the Case for Proof-carrying Approximate Circuits,” 4th Workshop On Approximate Computing (WAPCO 2018). 2018. mla: Witschen, Linus Matthias, et al. “Making the Case for Proof-Carrying Approximate Circuits.” 4th Workshop On Approximate Computing (WAPCO 2018), 2018. short: L.M. Witschen, T. Wiersema, M. Platzner, 4th Workshop On Approximate Computing (WAPCO 2018) (2018). date_created: 2018-02-01T14:24:54Z date_updated: 2022-01-06T06:51:06Z ddc: - '000' department: - _id: '7' - _id: '34' - _id: '78' file: - access_level: closed content_type: application/pdf creator: tobias82 date_created: 2018-11-26T08:00:53Z date_updated: 2018-11-26T08:00:53Z file_id: '5821' file_name: WitschenWP2018[1].pdf file_size: 287224 relation: main_file success: 1 file_date_updated: 2018-11-26T08:00:53Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '12' name: SFB 901 - Subproject B4 - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: 4th Workshop On Approximate Computing (WAPCO 2018) status: public title: Making the Case for Proof-carrying Approximate Circuits type: preprint user_id: '49051' year: '2018' ... --- _id: '2109' abstract: - lang: eng text: In multinomial classification, reduction techniques are commonly used to decompose the original learning problem into several simpler problems. For example, by recursively bisecting the original set of classes, so-called nested dichotomies define a set of binary classification problems that are organized in the structure of a binary tree. In contrast to the existing one-shot heuristics for constructing nested dichotomies and motivated by recent work on algorithm configuration, we propose a genetic algorithm for optimizing the structure of such dichotomies. A key component of this approach is the proposed genetic representation that facilitates the application of standard genetic operators, while still supporting the exchange of partial solutions under recombination. We evaluate the approach in an extensive experimental study, showing that it yields classifiers with superior generalization performance. author: - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Wever MD, Mohr F, Hüllermeier E. Ensembles of Evolved Nested Dichotomies for Classification. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018. Kyoto, Japan: ACM; 2018. doi:10.1145/3205455.3205562' apa: 'Wever, M. D., Mohr, F., & Hüllermeier, E. (2018). Ensembles of Evolved Nested Dichotomies for Classification. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018. Kyoto, Japan: ACM. https://doi.org/10.1145/3205455.3205562' bibtex: '@inproceedings{Wever_Mohr_Hüllermeier_2018, place={Kyoto, Japan}, title={Ensembles of Evolved Nested Dichotomies for Classification}, DOI={10.1145/3205455.3205562}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018}, publisher={ACM}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }' chicago: 'Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Ensembles of Evolved Nested Dichotomies for Classification.” In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018. Kyoto, Japan: ACM, 2018. https://doi.org/10.1145/3205455.3205562.' ieee: M. D. Wever, F. Mohr, and E. Hüllermeier, “Ensembles of Evolved Nested Dichotomies for Classification,” in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, Kyoto, Japan, 2018. mla: Wever, Marcel Dominik, et al. “Ensembles of Evolved Nested Dichotomies for Classification.” Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, ACM, 2018, doi:10.1145/3205455.3205562. short: 'M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, ACM, Kyoto, Japan, 2018.' conference: end_date: 2018-07-19 location: Kyoto, Japan name: GECCO 2018 start_date: 2018-07-15 date_created: 2018-03-31T13:51:23Z date_updated: 2022-01-06T06:54:45Z ddc: - '000' department: - _id: '355' doi: 10.1145/3205455.3205562 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:33:54Z date_updated: 2018-11-02T14:33:54Z file_id: '5275' file_name: p561-wever.pdf file_size: 875404 relation: main_file success: 1 file_date_updated: 2018-11-02T14:33:54Z has_accepted_license: '1' keyword: - Classification - Hierarchical Decomposition - Indirect Encoding language: - iso: eng main_file_link: - open_access: '1' url: https://dl.acm.org/citation.cfm?doid=3205455.3205562 oa: '1' place: Kyoto, Japan project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '10' name: SFB 901 - Subproject B2 - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018 publication_status: published publisher: ACM status: public title: Ensembles of Evolved Nested Dichotomies for Classification type: conference user_id: '33176' year: '2018' ... --- _id: '17345' author: - first_name: Romina full_name: Spalazzese, Romina last_name: Spalazzese - first_name: Marie C. full_name: Platenius, Marie C. last_name: Platenius - first_name: Steffen full_name: Becker, Steffen last_name: Becker - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Spalazzese R, Platenius MC, Becker S, Engels G. IoT-ASAP 2018: Message from the Chairs. In: 2018 IEEE International Conference on Software Architecture Companion (ICSA-C). ; 2018. doi:10.1109/icsa-c.2018.00009' apa: 'Spalazzese, R., Platenius, M. C., Becker, S., & Engels, G. (2018). IoT-ASAP 2018: Message from the Chairs. In 2018 IEEE International Conference on Software Architecture Companion (ICSA-C). https://doi.org/10.1109/icsa-c.2018.00009' bibtex: '@inproceedings{Spalazzese_Platenius_Becker_Engels_2018, title={IoT-ASAP 2018: Message from the Chairs}, DOI={10.1109/icsa-c.2018.00009}, booktitle={2018 IEEE International Conference on Software Architecture Companion (ICSA-C)}, author={Spalazzese, Romina and Platenius, Marie C. and Becker, Steffen and Engels, Gregor}, year={2018} }' chicago: 'Spalazzese, Romina, Marie C. Platenius, Steffen Becker, and Gregor Engels. “IoT-ASAP 2018: Message from the Chairs.” In 2018 IEEE International Conference on Software Architecture Companion (ICSA-C), 2018. https://doi.org/10.1109/icsa-c.2018.00009.' ieee: 'R. Spalazzese, M. C. Platenius, S. Becker, and G. Engels, “IoT-ASAP 2018: Message from the Chairs,” in 2018 IEEE International Conference on Software Architecture Companion (ICSA-C), 2018.' mla: 'Spalazzese, Romina, et al. “IoT-ASAP 2018: Message from the Chairs.” 2018 IEEE International Conference on Software Architecture Companion (ICSA-C), 2018, doi:10.1109/icsa-c.2018.00009.' short: 'R. Spalazzese, M.C. Platenius, S. Becker, G. Engels, in: 2018 IEEE International Conference on Software Architecture Companion (ICSA-C), 2018.' date_created: 2020-06-26T11:22:36Z date_updated: 2022-01-06T06:53:08Z department: - _id: '66' doi: 10.1109/icsa-c.2018.00009 language: - iso: eng publication: 2018 IEEE International Conference on Software Architecture Companion (ICSA-C) publication_identifier: isbn: - '9781538665855' publication_status: published status: public title: 'IoT-ASAP 2018: Message from the Chairs' type: conference user_id: '57458' year: '2018' ... --- _id: '17651' abstract: - lang: eng text: 'Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within {\$}{\$}2 {\backslash}sqrt{\{} 2{\backslash}left| E {\backslash}right| {\}}{\$}{\$}and {\$}{\$}2 {\backslash}sqrt{\{}2 ({\backslash}left| E {\backslash}right| + {\backslash}left| {\backslash}text {\{}undesirable flows{\}} {\backslash}right| ){\}}{\$}{\$}, respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming.' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Stojan full_name: Trajanovski, Stojan last_name: Trajanovski - first_name: Paola full_name: Grosso, Paola last_name: Grosso - first_name: Cees full_name: de Laat, Cees last_name: de Laat citation: ama: 'Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. Combinatorial Optimization and Applications. Cham: Springer International Publishing; 2018:217-232.' apa: 'Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2018). Removing Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, & A. Zelikovsky (Eds.), Combinatorial Optimization and Applications (pp. 217–232). Cham: Springer International Publishing.' bibtex: '@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2018, place={Cham}, title={Removing Undesirable Flows by Edge Deletion}, booktitle={Combinatorial Optimization and Applications}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, editor={Kim, Donghyun and Uma, R. N. and Zelikovsky, AlexanderEditors}, year={2018}, pages={217–232} }' chicago: 'Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing Undesirable Flows by Edge Deletion.” In Combinatorial Optimization and Applications, edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer International Publishing, 2018.' ieee: G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable Flows by Edge Deletion,” in Combinatorial Optimization and Applications, 2018, pp. 217–232. mla: Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” Combinatorial Optimization and Applications, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32. short: 'G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: D. Kim, R.N. Uma, A. Zelikovsky (Eds.), Combinatorial Optimization and Applications, Springer International Publishing, Cham, 2018, pp. 217–232.' date_created: 2020-08-06T15:19:36Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' editor: - first_name: Donghyun full_name: Kim, Donghyun last_name: Kim - first_name: R. N. full_name: Uma, R. N. last_name: Uma - first_name: Alexander full_name: Zelikovsky, Alexander last_name: Zelikovsky extern: '1' keyword: - flow - Red-Blue Set Cover - Positive-Negative Partial Set Cover - approximation - tree - MAX SNP-hard - root - leaf - dynamic programming - FPT language: - iso: eng page: 217-232 place: Cham publication: Combinatorial Optimization and Applications publication_identifier: isbn: - 978-3-030-04651-4 publisher: Springer International Publishing status: public title: Removing Undesirable Flows by Edge Deletion type: conference user_id: '83983' year: '2018' ... --- _id: '17666' abstract: - lang: eng text: 'Software Defined Networks (SDN) and Network Function Virtualisation (NFV) provide the basis for autonomous response and mitigation against attacks on networked computer infrastructures. We propose a new framework that uses SDNs and NFV to achieve this goal: Secure Autonomous Response Network (SARNET). In a SARNET, an agent running a control loop constantly assesses the security state of the network by means of observables. The agent reacts to and resolves security problems, while learning from its previous decisions. Two main metrics govern the decision process in a SARNET: impact and efficiency; these metrics can be used to compare and evaluate countermeasures and are the building blocks for self-learning SARNETs that exhibit autonomous response. In this paper we present the software implementation of the SARNET framework, evaluate it in a real-life network and discuss the tradeoffs between parameters used by the SARNET agent and the efficiency of its actions.' author: - first_name: R. full_name: Koning, R. last_name: Koning - first_name: B. full_name: de Graaff, B. last_name: de Graaff - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: R. full_name: Meijer, R. last_name: Meijer - first_name: C. full_name: de Laat, C. last_name: de Laat - first_name: P. full_name: Grosso, P. last_name: Grosso citation: ama: Koning R, de Graaff B, Polevoy G, Meijer R, de Laat C, Grosso P. Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems. 2018. doi:https://doi.org/10.1016/j.future.2018.08.011 apa: Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., & Grosso, P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems. https://doi.org/10.1016/j.future.2018.08.011 bibtex: '@article{Koning_de Graaff_Polevoy_Meijer_de Laat_Grosso_2018, title={Measuring the efficiency of SDN mitigations against attacks on computer infrastructures}, DOI={https://doi.org/10.1016/j.future.2018.08.011}, journal={Future Generation Computer Systems}, author={Koning, R. and de Graaff, B. and Polevoy, Gleb and Meijer, R. and de Laat, C. and Grosso, P.}, year={2018} }' chicago: Koning, R., B. de Graaff, Gleb Polevoy, R. Meijer, C. de Laat, and P. Grosso. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” Future Generation Computer Systems, 2018. https://doi.org/10.1016/j.future.2018.08.011. ieee: R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, and P. Grosso, “Measuring the efficiency of SDN mitigations against attacks on computer infrastructures,” Future Generation Computer Systems, 2018. mla: Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” Future Generation Computer Systems, 2018, doi:https://doi.org/10.1016/j.future.2018.08.011. short: R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, P. Grosso, Future Generation Computer Systems (2018). date_created: 2020-08-06T15:23:11Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: https://doi.org/10.1016/j.future.2018.08.011 extern: '1' keyword: - Software defined networks - Network function virtualization - Cyber attacks - Cyber security - Defense efficiency - Overlay networks language: - iso: eng publication: Future Generation Computer Systems publication_identifier: issn: - 0167-739X status: public title: Measuring the efficiency of SDN mitigations against attacks on computer infrastructures type: journal_article user_id: '83983' year: '2018' ... --- _id: '17713' author: - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: Wever MD, Mohr F, Hüllermeier E. Automated Multi-Label Classification based on ML-Plan. Published online 2018. apa: Wever, M. D., Mohr, F., & Hüllermeier, E. (2018). Automated Multi-Label Classification based on ML-Plan. Arxiv. bibtex: '@article{Wever_Mohr_Hüllermeier_2018, title={Automated Multi-Label Classification based on ML-Plan}, publisher={Arxiv}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }' chicago: Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Automated Multi-Label Classification Based on ML-Plan.” Arxiv, 2018. ieee: M. D. Wever, F. Mohr, and E. Hüllermeier, “Automated Multi-Label Classification based on ML-Plan.” Arxiv, 2018. mla: Wever, Marcel Dominik, et al. Automated Multi-Label Classification Based on ML-Plan. Arxiv, 2018. short: M.D. Wever, F. Mohr, E. Hüllermeier, (2018). date_created: 2020-08-07T11:38:10Z date_updated: 2022-01-06T06:53:17Z department: - _id: '34' - _id: '355' - _id: '26' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/pdf/1811.04060.pdf oa: '1' project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '10' name: SFB 901 - Subproject B2 - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publisher: Arxiv status: public title: Automated Multi-Label Classification based on ML-Plan type: preprint user_id: '5786' year: '2018' ... --- _id: '17714' author: - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: Marcel Dominik full_name: Wever, Marcel Dominik id: '33176' last_name: Wever orcid: ' https://orcid.org/0000-0001-9782-6818' - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: Mohr F, Wever MD, Hüllermeier E. Automated machine learning service composition. Published online 2018. apa: Mohr, F., Wever, M. D., & Hüllermeier, E. (2018). Automated machine learning service composition. bibtex: '@article{Mohr_Wever_Hüllermeier_2018, title={Automated machine learning service composition}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018} }' chicago: Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Automated Machine Learning Service Composition,” 2018. ieee: F. Mohr, M. D. Wever, and E. Hüllermeier, “Automated machine learning service composition.” 2018. mla: Mohr, Felix, et al. Automated Machine Learning Service Composition. 2018. short: F. Mohr, M.D. Wever, E. Hüllermeier, (2018). date_created: 2020-08-07T11:40:13Z date_updated: 2022-01-06T06:53:17Z department: - _id: '34' - _id: '355' - _id: '26' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/pdf/1809.00486.pdf oa: '1' project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '10' name: SFB 901 - Subproject B2 - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing status: public title: Automated machine learning service composition type: preprint user_id: '5786' year: '2018' ... --- _id: '1910' abstract: - lang: eng text: 'Today, model-driven approaches are a cornerstone in modern software development. The Eclipse Modeling Framework (EMF) is highly adopted in practice and generates Java code from platform-independent models with embedded Object Constraint Language (OCL) expressions. However, applications that target multiple platforms like Android, iOS, Windows, web browsers usually need to be implemented in different programming languages. Feature-complete Ecore and OCL runtime APIs are not available for all these platforms, such that their functionality has to be re-implemented. In this paper, we present CrossEcore: A multi-platform enabled modeling framework that generates C#, Swift, TypeScript, and JavaScript code from Ecore models with embedded OCL. An OCL compiler translates OCL expressions into expressions of the target language. The Ecore and OCL API can be consistently used across platforms, which facilitates application portability. CrossEcore is also extendible and can be easily adopted for new programming languages.' author: - first_name: Simon full_name: Schwichtenberg, Simon id: '13235' last_name: Schwichtenberg - first_name: Ivan full_name: Jovanovikj, Ivan id: '39187' last_name: Jovanovikj orcid: https://orcid.org/0000-0002-1838-794X - first_name: Christian full_name: Gerth, Christian last_name: Gerth - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Schwichtenberg S, Jovanovikj I, Gerth C, Engels G. Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms. In: Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume.' apa: 'Schwichtenberg, S., Jovanovikj, I., Gerth, C., & Engels, G. (n.d.). Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms. In Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume. Gothenburg, Sweden.' bibtex: '@inproceedings{Schwichtenberg_Jovanovikj_Gerth_Engels, title={Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms}, booktitle={Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume}, author={Schwichtenberg, Simon and Jovanovikj, Ivan and Gerth, Christian and Engels, Gregor} }' chicago: 'Schwichtenberg, Simon, Ivan Jovanovikj, Christian Gerth, and Gregor Engels. “Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms.” In Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume, n.d.' ieee: 'S. Schwichtenberg, I. Jovanovikj, C. Gerth, and G. Engels, “Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms,” in Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume, Gothenburg, Sweden.' mla: 'Schwichtenberg, Simon, et al. “Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms.” Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume.' short: 'S. Schwichtenberg, I. Jovanovikj, C. Gerth, G. Engels, in: Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume, n.d.' conference: end_date: 2018-06-03 location: Gothenburg, Sweden start_date: 2018-05-27 date_created: 2018-03-28T08:28:24Z date_updated: 2022-01-06T06:53:58Z department: - _id: '66' language: - iso: eng publication: Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume publication_status: accepted status: public title: 'Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms' type: conference user_id: '13235' year: '2018' ... --- _id: '20530' author: - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: Lisa full_name: Nguyen Quang Do, Lisa last_name: Nguyen Quang Do citation: ama: 'Bodden E, Nguyen Quang Do L. Explainable Static Analysis. In: Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\"{a}}rz 2018, Ulm, Germany. {LNI}. ; 2018:205-208.' apa: Bodden, E., & Nguyen Quang Do, L. (2018). Explainable Static Analysis. Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\"{a}}rz 2018, Ulm, Germany., 205–208. bibtex: '@inproceedings{Bodden_Nguyen Quang Do_2018, series={{LNI}}, title={Explainable Static Analysis}, booktitle={Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\"{a}}rz 2018, Ulm, Germany.}, author={Bodden, Eric and Nguyen Quang Do, Lisa}, year={2018}, pages={205–208}, collection={{LNI}} }' chicago: Bodden, Eric, and Lisa Nguyen Quang Do. “Explainable Static Analysis.” In Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\"{a}}rz 2018, Ulm, Germany., 205–8. {LNI}, 2018. ieee: E. Bodden and L. Nguyen Quang Do, “Explainable Static Analysis,” in Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\"{a}}rz 2018, Ulm, Germany., 2018, pp. 205–208. mla: Bodden, Eric, and Lisa Nguyen Quang Do. “Explainable Static Analysis.” Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\"{a}}rz 2018, Ulm, Germany., 2018, pp. 205–08. short: 'E. Bodden, L. Nguyen Quang Do, in: Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\"{a}}rz 2018, Ulm, Germany., 2018, pp. 205–208.' date_created: 2020-11-27T10:24:21Z date_updated: 2022-01-06T06:54:29Z department: - _id: '76' language: - iso: eng main_file_link: - url: https://dl.gi.de/20.500.12116/16348 page: 205-208 publication: Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\"{a}}rz 2018, Ulm, Germany. publication_identifier: isbn: - 978-3-88579-673-2 series_title: '{LNI}' status: public title: Explainable Static Analysis type: conference user_id: '5786' year: '2018' ... --- _id: '20543' author: - first_name: Lisa full_name: Nguyen Quang Do, Lisa last_name: Nguyen Quang Do - first_name: Stefan full_name: Krüger, Stefan last_name: Krüger - first_name: Patrick full_name: Hill, Patrick last_name: Hill - first_name: Karim full_name: Ali, Karim last_name: Ali - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 citation: ama: Nguyen Quang Do L, Krüger S, Hill P, Ali K, Bodden E. Debugging Static Analysis. IEEE Transactions on Software Engineering. Published online 2018:1-1. doi:10.1109/TSE.2018.2868349 apa: Nguyen Quang Do, L., Krüger, S., Hill, P., Ali, K., & Bodden, E. (2018). Debugging Static Analysis. IEEE Transactions on Software Engineering, 1–1. https://doi.org/10.1109/TSE.2018.2868349 bibtex: '@article{Nguyen Quang Do_Krüger_Hill_Ali_Bodden_2018, title={Debugging Static Analysis}, DOI={10.1109/TSE.2018.2868349}, journal={IEEE Transactions on Software Engineering}, author={Nguyen Quang Do, Lisa and Krüger, Stefan and Hill, Patrick and Ali, Karim and Bodden, Eric}, year={2018}, pages={1–1} }' chicago: Nguyen Quang Do, Lisa, Stefan Krüger, Patrick Hill, Karim Ali, and Eric Bodden. “Debugging Static Analysis.” IEEE Transactions on Software Engineering, 2018, 1–1. https://doi.org/10.1109/TSE.2018.2868349. ieee: 'L. Nguyen Quang Do, S. Krüger, P. Hill, K. Ali, and E. Bodden, “Debugging Static Analysis,” IEEE Transactions on Software Engineering, pp. 1–1, 2018, doi: 10.1109/TSE.2018.2868349.' mla: Nguyen Quang Do, Lisa, et al. “Debugging Static Analysis.” IEEE Transactions on Software Engineering, 2018, pp. 1–1, doi:10.1109/TSE.2018.2868349. short: L. Nguyen Quang Do, S. Krüger, P. Hill, K. Ali, E. Bodden, IEEE Transactions on Software Engineering (2018) 1–1. date_created: 2020-11-30T09:32:12Z date_updated: 2022-01-06T06:54:29Z department: - _id: '76' doi: 10.1109/TSE.2018.2868349 keyword: - Debugging - Static analysis - Tools - Computer bugs - Standards - Writing - Encoding - Testing and Debugging - Program analysis - Development tools - Integrated environments - Graphical environments - Usability testing language: - iso: eng main_file_link: - url: http://www.bodden.de/pubs/tse18debugging.pdf page: 1-1 publication: IEEE Transactions on Software Engineering publication_identifier: issn: - 2326-3881 status: public title: Debugging Static Analysis type: journal_article user_id: '5786' year: '2018' ... --- _id: '20544' citation: ama: Tichy M, Bodden E, Kuhrmann M, Wagner S, Steghöfer J-P, eds. Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany. Vol {P-279}. Gesellschaft für Informatik; 2018. apa: 'Tichy, M., Bodden, E., Kuhrmann, M., Wagner, S., & Steghöfer, J.-P. (Eds.). (2018). Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany: Vol. {P-279}. Gesellschaft für Informatik.' bibtex: '@book{Tichy_Bodden_Kuhrmann_Wagner_Steghöfer_2018, series={{LNI}}, title={Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany}, volume={{P-279}}, publisher={Gesellschaft für Informatik}, year={2018}, collection={{LNI}} }' chicago: Tichy, Matthias, Eric Bodden, Marco Kuhrmann, Stefan Wagner, and Jan-Philipp Steghöfer, eds. Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany. Vol. {P-279}. {LNI}. Gesellschaft für Informatik, 2018. ieee: M. Tichy, E. Bodden, M. Kuhrmann, S. Wagner, and J.-P. Steghöfer, Eds., Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany, vol. {P-279}. Gesellschaft für Informatik, 2018. mla: Tichy, Matthias, et al., editors. Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany. Gesellschaft für Informatik, 2018. short: M. Tichy, E. Bodden, M. Kuhrmann, S. Wagner, J.-P. Steghöfer, eds., Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany, Gesellschaft für Informatik, 2018. date_created: 2020-11-30T09:32:58Z date_updated: 2022-01-06T06:54:29Z department: - _id: '76' editor: - first_name: Matthias full_name: Tichy, Matthias last_name: Tichy - first_name: Eric full_name: Bodden, Eric id: '59256' last_name: Bodden orcid: 0000-0003-3470-3647 - first_name: Marco full_name: Kuhrmann, Marco last_name: Kuhrmann - first_name: Stefan full_name: Wagner, Stefan last_name: Wagner - first_name: Jan-Philipp full_name: Steghöfer, Jan-Philipp last_name: Steghöfer language: - iso: eng publication_identifier: isbn: - 978-3-88579-673-2 publisher: Gesellschaft für Informatik series_title: '{LNI}' status: public title: Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany type: conference_editor user_id: '5786' volume: '{P-279}' year: '2018' ...